Asynchronous random sleeping for sensor networks
Publication in refereed journal


Times Cited
Web of Science25WOS source URL (as at 08/08/2020) Click here for the latest count
Altmetrics Information
.

Other information
AbstractSleeping scheduling is a common energy-conservation solution for sensor networks. For application whereby coordination of sleeping among sensors is not possible or inconvenient, random sleeping is the only option. In this article, we study the asynchronous random sleeping(ARS) scheme whereby sensors (i) do not need to synchronize with each other, and (ii) do not need to coordinate their sleeping schedules. The stationary coverage probability and the expected coverage periods for ARS are derived. For surveillance application, we derive in addition the detection probability and detection delay distribution. The correctness of our results is validated through extensive simulations. We compare ARS with other synchronous and asynchronous sleeping scheduling algorithms and show that ARS offers better performance in terms of detection delay in the lower duty-cycle regime. We also conduct simulations to demonstrate that our results can be a good approximation for clock drifting case.
All Author(s) ListHua CQ, Yum TSP
Journal nameACM Transactions on Sensor Networks
Year2007
Month8
Day1
Volume Number3
Issue Number3
PublisherASSOC COMPUTING MACHINERY
ISSN1550-4859
LanguagesEnglish-United Kingdom
Keywordsalgorithms; energy conservation; event detection; k-coverage; performance; random sleeping; sensor network; theory
Web of Science Subject CategoriesComputer Science; Computer Science, Information Systems; COMPUTER SCIENCE, INFORMATION SYSTEMS; Telecommunications; TELECOMMUNICATIONS

Last updated on 2020-09-08 at 05:50