DocumentCode
415371
Title
Grid-based approach for working node selection in wireless sensor networks
Author
Chen, Haining ; Wu, Hongyi ; Tzeng, Nian-Feng
Author_Institution
Center for Adv. Comput. Studies, University of Louisiana, Lafayette, LA, USA
Volume
6
fYear
2004
fDate
20-24 June 2004
Firstpage
3673
Abstract
In this paper, we propose a grid-based working node (WN) selection approach for wireless sensor networks. Due to coverage redundancy, it is highly desirable to identify a minimum subset of sensors in a wireless sensor network to serve as WNs, while the remaining sensors are deactivated to save power and reduce potential interference. The basic idea of our solution approach is to represent the coverage of the sensors by a number of sample points, i.e., the intersection points of the established grid. A simple approximation algorithm and a linear programming method are employed to select as few sensors as possible to cover all sample points. In order to reduce the computational time, clusters are formed and WN selection is performed within each cluster. The performance of the proposed WN selection schemes is quantified and the tradeoff among accuracy, communication overhead and computational time is evaluated via analyses and simulations.
Keywords
computational complexity; linear programming; network topology; wireless sensor networks; approximation algorithm; cluster; communication overhead; computational time; coverage redundancy; grid-based working node; linear programming; potential interference; wireless sensor network; Approximation algorithms; Clustering algorithms; Computer networks; Grid computing; Intelligent networks; Linear programming; Monitoring; Sensor phenomena and characterization; Sensor systems; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2004 IEEE International Conference on
Print_ISBN
0-7803-8533-0
Type
conf
DOI
10.1109/ICC.2004.1313228
Filename
1313228
Link To Document