Research Article
A Performance Comparison Study of a Coverage-Preserving Node Scheduling Scheme and Its Enhancement in Sensor Networks
244 downloads
@INPROCEEDINGS{10.1007/978-3-319-23802-9_1, author={Qun Wang and Huanyan Qian and Peiyu Ji and Yu Xie and Shuhui Yang}, title={A Performance Comparison Study of a Coverage-Preserving Node Scheduling Scheme and Its Enhancement in Sensor Networks}, proceedings={International Conference on Security and Privacy in Communication Networks. 10th International ICST Conference, SecureComm 2014, Beijing, China, September 24-26, 2014, Revised Selected Papers, Part II}, proceedings_a={SECURECOMM}, year={2015}, month={12}, keywords={Coverage Node scheduling Sponsored area Wireless sensor networks}, doi={10.1007/978-3-319-23802-9_1} }- Qun Wang
Huanyan Qian
Peiyu Ji
Yu Xie
Shuhui Yang
Year: 2015
A Performance Comparison Study of a Coverage-Preserving Node Scheduling Scheme and Its Enhancement in Sensor Networks
SECURECOMM
Springer
DOI: 10.1007/978-3-319-23802-9_1
Abstract
In large wireless sensor networks composed of large numbers of low-powered unreliable sensors, one of the most important issues is saving and balancing the energy consumption of sensors to prolong the life time of the network while maintaining the full sensing coverage. In this paper, we analyze an efficient node scheduling scheme which uses the coverage-based off-duty eligibility rule and backoff-based self-scheduling scheme to perform the job. We give some enhancement to this node scheduling scheme, reducing its overhead without losing much of the capability. In simulation, we make the performance comparison from several aspects of the original coverage-based node scheduling scheme and our enhancement version.
Copyright © 2014–2024 ICST
