A performance comparison study of a coverage-preserving node scheduling scheme and its enhancement in sensor networks

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In large wireless sensor networks composed of large numbers of lowpowered 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.

Cite

CITATION STYLE

APA

Wang, Q., Qian, H., Ji, P., Xie, Y., & Yang, S. (2015). A performance comparison study of a coverage-preserving node scheduling scheme and its enhancement in sensor networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 153, pp. 3–9). Springer Verlag. https://doi.org/10.1007/978-3-319-23802-9_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free