DocumentCode
3441677
Title
Algorithm for Wireless Sensor Nodes Placement Problem
Author
Li, Wei
Author_Institution
Sch. of Sci., Hangzhou Dianzi Univ., Hangzhou
fYear
2008
fDate
12-14 Oct. 2008
Firstpage
1
Lastpage
3
Abstract
This paper discusses placement of sensor nodes in wireless sensor networks. Since the large number sampling points in sensing range of the sensor, the traditional methods, such as greedy algorithm or linear programming model, do not work well. Thus, we create a new method, the grid-based algorithm. First we determine the number of the selected sensor nodes based on the probability theory. Then an effective selection algorithm is established. Numerical examples is given to show the efficacy of the propose algorithm.
Keywords
greedy algorithms; linear programming; probability; wireless sensor networks; greedy algorithm; linear programming model; probability theory; wireless sensor nodes placement problem; Communication system security; Greedy algorithms; Linear programming; Mathematics; Monitoring; Network topology; Sampling methods; Sensor fusion; Sensor systems; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
Conference_Location
Dalian
Print_ISBN
978-1-4244-2107-7
Electronic_ISBN
978-1-4244-2108-4
Type
conf
DOI
10.1109/WiCom.2008.911
Filename
4678819
Link To Document