Randomized coverage-preserving scheduling schemes for wireless sensor networks

Chong Liu, Kui Wu, Valerie King

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

16 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)956-967
JournalLecture Notes in Computer Science
Volume3462
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event4th International IFIP-TC6 Networking Conference: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, NETWORKING 2005 - Waterloo, Ont., Canada
Duration: 2 May 20056 May 2005

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Fingerprint

Dive into the research topics of 'Randomized coverage-preserving scheduling schemes for wireless sensor networks'. Together they form a unique fingerprint.

Cite this