DocumentCode :
141737
Title :
A Matching Algorithm with Low Message Overhead for Sensor Relocation Problem
Author :
Chien-Fu Cheng ; Chih-We Huang ; Meng-Shiuan Pan
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Tamkang Univ., Taipei, Taiwan
fYear :
2014
fDate :
24-27 Aug. 2014
Firstpage :
305
Lastpage :
309
Abstract :
The Sensor Relocation (SR) problem is an important issue in Wireless Sensor Networks (WSNs). For WSNs with an ongoing surveillance task, it is necessary to follow a strict response time requirement when relocating redundant sensors to the requesting places. In this study, we revisit the SR problem in mobile WSNs. The proposed algorithm can find the redundant sensor nearest to the requesting place with low message overhead. The performance evaluation done in this research has confirmed its superior performances.
Keywords :
wireless sensor networks; low message overhead; matching algorithm; mobile WSN; sensor relocation problem; surveillance task; wireless sensor networks; Mobile communication; Mobile computing; Relays; Robot sensing systems; Schedules; Time factors; Wireless sensor networks; mobile sensor; mobile wireless sensor networks; response time; sensor failure; sensor relocation problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Dependable, Autonomic and Secure Computing (DASC), 2014 IEEE 12th International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-1-4799-5078-2
Type :
conf
DOI :
10.1109/DASC.2014.61
Filename :
6945706
Link To Document :
بازگشت