DocumentCode :
1839230
Title :
A Deployment Algorithm to Achieve both Connectivity and Coverage in Grid Sensor Networks
Author :
Wu, Diwen ; Xie, Dongqing ; Wang, Lupeng
Author_Institution :
Sch. of Comput. & Commun., HuNan Univ., Changsha
fYear :
2008
fDate :
18-21 Nov. 2008
Firstpage :
522
Lastpage :
526
Abstract :
In this paper, we propose an algorithm to achieve both connectivity and coverage for multiple target points in grid sensor networks. First we deal with the local targets block, then we use the least sensors to make all the sensors connected. This algorithm has the O(n) running time complexity and its result is proved closed to the optimal result.
Keywords :
computational complexity; grid computing; wireless sensor networks; deployment algorithm; grid sensor networks; multiple target points; running time complexity; wireless network; Computer networks; Electronic mail; Grid computing; Heuristic algorithms; Intelligent sensors; Linear programming; Military communication; Tin; Wireless communication; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
Conference_Location :
Hunan
Print_ISBN :
978-0-7695-3398-8
Electronic_ISBN :
978-0-7695-3398-8
Type :
conf
DOI :
10.1109/ICYCS.2008.120
Filename :
4709027
Link To Document :
بازگشت