DocumentCode :
1627047
Title :
Sweep Coverage Mechanism for Wireless Sensor Networks with Approximate Patrol Times
Author :
Chu, Hung-Chi ; Wang, Wei-Kai ; Lai, Yong-Hsun
Author_Institution :
Dept. of Inf. & Commun. Eng., Chaoyang Univ. of Technol., Taichung, Taiwan
fYear :
2010
Firstpage :
82
Lastpage :
87
Abstract :
The coverage problem is a fundamental and important issue with regard to wireless sensor networks. To reduce the number of sensor nodes, mobile nodes can be used to mitigate the sweep coverage problem. In this paper, a sweep coverage mechanism is proposed to keep the patrol times of mobile nodes approximate to one another. In simulation, various moving speeds and waiting times of mobile nodes are considered. Simulation results attest to the feasibility of the proposed method.
Keywords :
mobile radio; wireless sensor networks; approximate patrol times; mobile nodes; sweep coverage mechanism; wireless sensor networks; Approximation algorithms; Fires; Flashover; Mobile communication; Monitoring; Sensors; Wireless sensor networks; sweep coverage; wireless sensor network;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Ubiquitous Intelligence & Computing and 7th International Conference on Autonomic & Trusted Computing (UIC/ATC), 2010 7th International Conference on
Conference_Location :
Xian, Shaanxi
Print_ISBN :
978-1-4244-9043-1
Electronic_ISBN :
978-0-7695-4272-0
Type :
conf
DOI :
10.1109/UIC-ATC.2010.60
Filename :
5667220
Link To Document :
بازگشت