Maintaining a long network lifetime with stringent energy constraints on tiny sensor nodes poses an extremely challenging task for wireless sensor networks. This paper provides a thorough analysis on a randomized algorithm that makes scheduling decisions without the help of geographic information. The analytical results precisely describe the relationship among achievable network coverage, energy saving, and node density. We also analyze the performance of the randomized algorithm with time asynchrony and propose a heuristic randomized scheduling scheme to improve the performance. © IFIP International Federation for Information Processing 2005.
CITATION STYLE
Liu, C., Wu, K., & King, V. (2005). Randomized coverage-preserving scheduling schemes for wireless sensor networks. In Lecture Notes in Computer Science (Vol. 3462, pp. 956–967). Springer Verlag. https://doi.org/10.1007/11422778_77
Mendeley helps you to discover research relevant for your work.