article

Asynchronous random sleeping for sensor networks

Authors:

Tak-Shing Peter YumAuthors Info & Claims

ACM Transactions on Sensor Networks (TOSN), Volume 3, Issue 3

Pages 15 - es

https://doi.org/10.1145/1267060.1267063

Published: 01 August 2007 Publication History

Abstract

Sleeping 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.

References

[1]

Aspnes, J., Goldenberg, D., and Yang, Y. R. 2004. On the computational complexity of sensor network localization. In Proceedings of the First International Workshop on Algorithmic Aspects of Wireless Sensor Networks.

[2]

Cao, Q., Abdelzaher, T., He, T., and Stankovic, J. 2005a. Towards optimal sleep scheduling in sensor networks for rare-event detection. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks. IEEE Press, Los Alomitos, CA, 4.

Digital Library

[3]

Cao, Q., Yan, T., Stankovic, J., and Abdelzaher, T. 2005b. Analysis of target detection performance for wireless sensor networks. In International Conference on Distributed Computing in Sensor Networks (DCOSS).

Digital Library

[4]

Crossbow. 2004. Power management and batteries. Available online at http://www.xbow.com/Support/appnotes.htm.

[5]

Deng, J., Han, Y. S., Heinzelman, W. B., and Varshney, P. K. 2005. Balanced-energy sleep scheduling scheme for high density cluster-based sensor networks. Elsevier Comput. Commun. J. (Special Issue on ASWN '04) 28, 14 (Sept.), 1631--1642.

Digital Library

[6]

Elson, J., Girod, L., and Estrin, D. 2002. Fine-grained network time synchronization using reference broadcasts. SIGOPS Oper. Syst. Rev. 36, SI, 147--163.

Digital Library

[7]

Gui, C. and Mohapatra, P. 2004. Power conservation and quality of surveillance in target tracking sensor networks. In Proceedings of the 10th Annual International Conference on Mobile Computing and Networking. (Philadelphia, PA). 129--143.

Digital Library

[8]

He, T., Krishnamurthy, S., Stankovic, J. A., Abdelzaher, T., Luo, L., Stoleru, R., Yan, T., Gu, L., Hui, J., and Krogh, B. 2004. Energy-efficient surveillance system using wireless sensor networks. In Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services (Boston, MA). ACM Press, New York, NY, 270--283.

Digital Library

[9]

Hsin, C.-f. and Liu, M. 2004. Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms. In Proceedings of IPSN'04 (Berkeley, CA). 433--442.

Digital Library

[10]

Kumar, S., Lai, T. H., and Balogh, J. 2004. On k-coverage in a mostly sleeping sensor network. In Proceedings of MobiCom'04 (Philadelphia, PA). 144--158.

Digital Library

[11]

Li, X.-Y., Wan, P.-J., and Frieder, O. 2003. Coverage in wireless ad hoc sensor networks. IEEE Trans. Comput. 52, 6, 753--763.

Digital Library

[12]

Liu, B. and Towsley, D. 2004. A study of the coverage of large-scale sensor networks. In Proceedings of MASS '04.

[13]

Mathai, A. 1999. An Introduction to Geometrical Probability: Distributional Aspects with Applications. Gordon and Breach, Amsterdam, The Netherlands.

[14]

Moscibroda, T. and Wattenhofer, R. 2005. Maximizing the lifetime of dominating sets. In Proceedings of the 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN).

[15]

Paruchuri, V., Basavaraju, S., Durresi, A., Kannan, R., and Iyengar, S. 2004. Random asynchronous wakeup protocol for sensor networks. In Proceedings of the First International Conference on Broadband Networks. 710--717.

Digital Library

[16]

Ross, S. M. 1996. Stochastic Processes. Wiley, New York, NY.

[17]

Shakkottai, S., Srikant, R., and Shroff, N. 2003. Unreliable sensor grids: Coverage, connectivity and diameter. In Proceedings of Infocom'03. Vol. 2. 1073--1083.

[18]

Tian, D. and Georganas, N. D. 2002. A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA'02, Atlanta, GA). 32--41.

Digital Library

[19]

Wang, L. and Xiao, Y. Oct. 2005. Energy saving mechanisms in sensor networks. In Proceedings of IEEE Broadnets 2005.

[20]

Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., and Gill, C. 2003. Integrated coverage and connectivity configuration in wireless sensor networks. In Proceedings of the 1st International Conference on Embedded Networked Sensor Systems. (Los Angeles, CA) ACM Press, New York, NY, 28--39.

Digital Library

[21]

Yan, T., He, T., and Stankovic, J. A. 2003. Differentiated surveillance for sensor networks. In Proceedings of the 1st International Conference on Embedded Networked Sensor Systems. (Los Angeles, CA). ACM Press, New York, NY, 51--62.

Digital Library

[22]

Zhang, H. and Hou, J. 2004a. Maintaining sensing coverage and connectivity in large sensor networks. In Proceedings of the NSF International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad HocWireless, and Peer-to-Peer Networks. Invited paper.

[23]

Zhang, H. and Hou, J. 2004b. On deriving the upper bound of α-lifetime for large sensor networks. In Proceedings of MobiHoc'04 (Roppongi Hills, Tokyo, Japan). 121--132.

Digital Library

[24]

Zheng, R., Hou, J. C., and Sha, L. 2003. Asynchronous wakeup for ad hoc networks. In Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing. (Annapolis, MD). ACM Press, New York, NY, 35--45.

Digital Library

Cited By

Duan YLuo YLi WPace PFortino G(2018)Software Defined Wireless Sensor Networks: A Review2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design ((CSCWD))10.1109/CSCWD.2018.8465223(826-831)Online publication date: May-2018
https://doi.org/10.1109/CSCWD.2018.8465223
Duc TLe DZalyubovskiy VKim DChoo H(2016)Towards broadcast redundancy minimization in duty‐cycled wireless sensor networksInternational Journal of Communication Systems10.1002/dac.310830:6Online publication date: 11-Feb-2016
https://doi.org/10.1002/dac.3108
Zhao DChin K(2015)A distributed broadcast algorithm for duty-cycled networks with physical interference modelEURASIP Journal on Wireless Communications and Networking10.1186/s13638-015-0295-42015:1Online publication date: 28-Mar-2015
https://doi.org/10.1186/s13638-015-0295-4
Show More Cited By

Index Terms

Asynchronous random sleeping for sensor networks
1. Mathematics of computing
  1. Discrete mathematics
2. Networks
  1. Network protocols
    1. Application layer protocols

Recommendations

Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network

Wireless sensor networks have attracted a lot of attention recently. Such environments may consist of many inexpensive nodes, each capable of collecting, storing, and processing environmental information, and communicating with neighboring nodes through ...
Extending k-Coverage Lifetime of Wireless Sensor Networks Using Mobile Sensor Nodes
WIMOB '09: Proceedings of the 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications

One of the important issues in wireless sensor network (WSN) is to k-cover the target sensing field and to extend its lifetime. We propose a method to k-cover the field and maximize the WSN lifetime by moving mobile sensor nodes to appropriate positions ...
Analysis of random sleep scheme for wireless sensor networks

Energy conserving design is the research focus to prolong the lifetime of wireless sensor networks. A simple and effective way to save energy is to place sensor nodes in sleep mode periodically. However, sleep mode corresponds to low power consumption ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Sensor Networks

ACM Transactions on Sensor Networks Volume 3, Issue 3

August 2007

161 pages

ISSN:1550-4859

EISSN:1550-4867

DOI:10.1145/1267060

Issue’s Table of Contents

Copyright © 2007 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 01 August 2007

Published in TOSN Volume 3, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
957
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Duan YLuo YLi WPace PFortino G(2018)Software Defined Wireless Sensor Networks: A Review2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design ((CSCWD))10.1109/CSCWD.2018.8465223(826-831)Online publication date: May-2018
https://doi.org/10.1109/CSCWD.2018.8465223
Duc TLe DZalyubovskiy VKim DChoo H(2016)Towards broadcast redundancy minimization in duty‐cycled wireless sensor networksInternational Journal of Communication Systems10.1002/dac.310830:6Online publication date: 11-Feb-2016
https://doi.org/10.1002/dac.3108
Zhao DChin K(2015)A distributed broadcast algorithm for duty-cycled networks with physical interference modelEURASIP Journal on Wireless Communications and Networking10.1186/s13638-015-0295-42015:1Online publication date: 28-Mar-2015
https://doi.org/10.1186/s13638-015-0295-4
Jiao XXiao WGe BChen Y(2015)On minimum-latency broadcast in multichannel duty-cycled wireless sensor networksInternational Journal of Distributed Sensor Networks10.1155/2015/9134512015(17-17)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1155/2015/913451
Bagci HKorpeoglu IYazici A(2015)A Distributed Fault-Tolerant Topology Control Algorithm for Heterogeneous Wireless Sensor NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2014.231614226:4(914-923)Online publication date: 1-Apr-2015
https://doi.org/10.1109/TPDS.2014.2316142
Jiao XXiao WGe BChen Y(2015)Minimum-Latency Broadcast in Multi-channel Duty-Cycled Wireless Sensor NetworksAdvances in Wireless Sensor Networks10.1007/978-3-662-46981-1_44(456-466)Online publication date: 16-May-2015
https://doi.org/10.1007/978-3-662-46981-1_44
Alam KKamruzzaman JKarmakar GMurshed M(2014)Dynamic adjustment of sensing range for event coverage in wireless sensor networksJournal of Network and Computer Applications10.1016/j.jnca.2014.07.02546:C(139-153)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1016/j.jnca.2014.07.025
Zhao DChin KRaad R(2014)Approximation algorithms for broadcasting in duty cycled wireless sensor networksWireless Networks10.1007/s11276-014-0732-z20:8(2219-2236)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1007/s11276-014-0732-z
Mastorakis GMavromoustakis CBourdena APallis ESismanidis GStratakis DPapadakis SMavromoustakis CPallis EMastorakis G(2014)Energy-Efficient Routing in Cognitive Radio NetworksResource Management in Mobile Computing Environments10.1007/978-3-319-06704-9_14(323-340)Online publication date: 2014
https://doi.org/10.1007/978-3-319-06704-9_14
Park PErgen SFischione CSangiovanni-Vincentelli A(2013)Duty-cycle optimization for IEEE 802.15.4 wireless sensor networksACM Transactions on Sensor Networks10.1145/252997910:1(1-32)Online publication date: 6-Dec-2013
https://dl.acm.org/doi/10.1145/2529979
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents