Title :
Sleep Scheduling and Gradient Query in Sensor Networks for Target Monitoring
Author :
Guo, Ying ; Guo, Zhongwen ; Hong, Feng ; Hong, Lu
Author_Institution :
Dept. of Comput. Sci. & Eng., Ocean Univ. of China, Qingdao, China
Abstract :
Duty cycling is an important method for energy constrained sensor networks to prolong its lifetime. Current researches on duty cycling are often based on such assumption that all the sensory coverage should be maintained while some nodes are sleeping. For the applications of target monitoring, however, it is not necessary anymore to keep the whole sensory coverage of the sensor networks. It only needs to make sure that such kinds of nodes are active which can perceive the activities of the monitored targets. This observation brings new challenges to the design of duty cycling for the sensor networks. This paper proposes the novel duty cycling design for the sensor networks of target monitoring, which includes two algorithms of the sleep scheduling algorithm and the gradient query algorithm based on sleep periods. Under the proposed design, most of the sensor nodes can be in sleep, while still keep the functions of target monitoring and target query in the sensor networks. The performance of our design has been evaluated through both theoretical analysis and simulations, which prove the functionality of the proposed design on the reduction of energy consumption.
Keywords :
object detection; scheduling; wireless sensor networks; duty cycling method; energy consumption; gradient query algorithm; sensor network; sleep scheduling; target monitoring; Algorithm design and analysis; Analytical models; Energy consumption; Monitoring; Parallel processing; Performance analysis; Processor scheduling; Scheduling algorithm; Sleep; Wireless sensor networks; energy saving; gradient query; sleep scheduling; target monitoring; wireless sensor networks;
Conference_Titel :
Network and Parallel Computing, 2009. NPC '09. Sixth IFIP International Conference on
Conference_Location :
Gold Coast, QLD
Print_ISBN :
978-1-4244-4990-3
Electronic_ISBN :
978-0-7695-3837-2
DOI :
10.1109/NPC.2009.33