Nested block designs: Flexible and efficient schedule-based asynchronous duty cycling

Computer Networks

Volumn 57, Issue 17, 2013, Pages 3316-3326

  Carrano, Ricardo C ^a   Passos, Diego ^a   Magalhães, Luiz C S ^a   Albuquerque, Célio V N ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Asynchronous duty cycling; Energy conservation; Nested block designs; Wireless sensor networks

Indexed keywords

APPLICATION SCENARIO; ASYNCHRONOUS DUTY-CYCLING; BLOCK DESIGNS; COMPLEX COMPUTATION; DELIVERY PROBABILITIES; DUTY-CYCLING; RADIO INTERFACE; SYNCHRONIZATION PROTOCOLS;

ENERGY CONSERVATION; INTERNET; WIRELESS SENSOR NETWORKS;

SENSOR NODES;

EID: 84887078579     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2013.07.020     Document Type: Article

References (18)

1. G. Anastasi, M. Conti, M. Di Francesco, and A. Passarella Energy conservation in wireless sensor networks: a survey Ad Hoc Networks 7 2009 537 568
2. A. Bachir, M. Dohler, T. Watteyne, and K. Leung MAC essentials for wireless sensor networks IEEE Communications Surveys and Tutorials 12 2 2010 222 248
3. R. Carrano, D. Passos, L. Magalhaes, and C. Albuquerque Survey and taxonomy of duty cycling mechanisms in wireless sensor networks Communications Surveys Tutorials, IEEE 2 99 2013 1 14
4. C.J. Colbourn, and J.H. Dinitz Handbook of Combinatorial Designs (Discrete Mathematics and Its Applications) second ed. 2006 Chapman & Hall/CRC
5. J.R. Jiang, Y.C. Tseng, C.S. Hsu, and T.H. Lai Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks Mobile Networks and Applications 10 2005 169 181
6. P. Dutta, D. Culler, Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications, in: Proceedings of the 6th ACM Conference on Embedded Network Sensor Systems (SenSys '08), ACM, New York, NY, USA, 2008, pp. 71-84.
7. R. Carrano, D. Passos, L. Magalhaes, C. Albuquerque, Neighbor discovery time in schedule-based asynchronous duty cycling, in: IFIP Wireless Days 2012 (WD'12), 2012.
8. R. Carrano, D. Passos, L. Magalhaes, C. Albuquerque, Neighbor Discovery Time for Asynchronous Schedule-based Mechanisms, Universidade Federal Fluminense, Tech. Rep., 2012. < http://www.midiacom.uff.br/techreports/ ndtmodels.pdf >.
9. Y.C. Tseng, C.S. Hsu, T.Y. Hsieh, Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks, in: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), vol. 1, 2002, pp. 200-209.
10. C. Ding, D. Pei, and A. Salomaa Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography 1996 World Scientific Publishing Co., Inc. River Edge, NJ, USA
11. R. Zheng, J.C. Hou, L. Sha, Asynchronous wakeup for ad hoc networks, in: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc '03), ACM, New York, NY, USA, 2003, pp. 35-45.
12. F. Yates Incomplete randomized blocks Annals of Eugenics 7 2 1936 121 140
13. J. Link, C. Wollgarten, S. Schupp, K. Wehrle, Perfect difference sets for neighbor discovery, in: Proceedings of the 3rd Extreme Conference of Communication (ExtremeCom 2011), September 2011.
14. E.W. Dijkstra Solution of a problem in concurrent programming control ACM Communications 8 9 1965 569
15. M. Maekawa A N algorithm for mutual exclusion in decentralized systems ACM Transactions, Computer Systems 3 1985 145 159
16. D.Gordon, La Jolla Cyclic Difference Set Repository, February 2012. < http://www.ccrwest.org/diffsets.html >.
17. Memsic Corporation, MEMSIC, February 2012. < http://www.memsic.com/ >.
18. R. Gentleman, R. Ihaka, The R project for Statistical Computing, February 2012. < http://www.r-project.org/ >.