Paper Info
Title
Dynamic Sensing Scheduling To Prolong Network Lifetime Under Practical Requirements
Abstract
We propose a unique Dynamic Sensing Scheduling (DSS) scheme to prolong the lifetime of a sensor network. Different from most existing works, we study the sensor network lifetime under two practical requirements: sensing coverage and network connectivity. A sensor node is considered critical if its depletion of energy would cause either a violation of the sensing coverage requirement (specified by the application) or a disconnection of the routing tree. The key idea of DSS is to adjust the sensing duties of sensor nodes according to their nodal lifetime as well as their criticality. Under this design principle, DSS schedules more sensing duties to non-critical nodes (even at the cost of losing them more quickly) so that critical nodes may stay alive for a longer period of time, thus extending the network lifetime. DSS adjusts the sensing duties between neighboring nodes only, and is a distributed and lightweight solution. Simulation results show that DSS performs well under various network setups, close to a theoretical upper bound.
Year
DOI
Venue
2016
10.1109/ICC.2016.7511530
2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)
Field
DocType
ISSN
Sensor node,Key distribution in wireless sensor networks,Scheduling (computing),Upper and lower bounds,Computer science,Computer network,Real-time computing,Schedule,Mobile wireless sensor network,Dynamic priority scheduling,Wireless sensor network,Distributed computing
Conference
1550-3607
Citations 
PageRank 
References 
0
0.34
16
Authors
4
Name
Order
Citations
PageRank
Peng, Yang1205.48
Zi Li235519.59
Wensheng Zhang39818.14
Daji Qiao41305142.62