This Article 
 Bibliographic References 
 Add to: 
Optimal Block Design for Asynchronous Wake-Up Schedules and Its Applications in Multihop Wireless Networks
September 2006 (vol. 5 no. 9)
pp. 1228-1241
Rong Zheng, IEEE Computer Society
Lui Sha, IEEE
In this paper, we consider the problem of designing optimal asynchronous wake-up schedules to facilitate distributed power management and neighbor discovery in multihop wireless networks. We first formulate it as a block design problem and derive the fundamental trade-offs between wake-up latency and the average duty cycle of a node. After the theoretical foundation is laid, we then devise a neighbor discovery and schedule bookkeeping protocol that can operate on the optimal wake-up schedule derived. To demonstrate the usefulness of asynchronous wake-up, we investigate the efficiency of neighbor discovery and the application of on-demand power management, which overlays a desirable communication schedule over the wake-up schedule mandated by the asynchronous wake-up mechanism. Simulation studies demonstrate that the proposed asynchronous wake-up protocol has short discovery time which scales with the density of the network; it can accommodate various traffic characteristics and loads to achieve an energy savings that can be as high as 70 percent, while the packet delivery ratio is comparable to that without power management.

[1] I. Anderson, Combinatorial Designs and Tournaments, chapter 2. Oxford Univ. Press, 1998.
[2] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Proc. ACM/IEEE Seventh Int'l Conf. Mobile Computing and Networking (MOBICOM 2001), July 2001.
[3] B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter, “Deterministic Broadcasting in Unknown Radio Networks,” Proc. 11th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 861-870, 2000.
[4] B.S. Chlebus and D.R. Kowalski, “A Better Wake-Up in Radio Networks,” Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing, pp. 266-274, 2004.
[5] M. Chrobak, L. Gasieniec, and W. Rytter, “Fast Broadcasting and Gossiping in Radio Networks,” Proc. 41st Ann. Symp. Foundations of Computer Science, p. 575, 2000.
[6] G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems: Concepts and Design. Pearson Education, 2001.
[7] J. Elson, L. Girod, and D. Estrin, “Fine-Grained Network Time Synchronization Using Reference Broadcasts,” ACM SIGOPS Operating Systems Rev., vol. 36(SI), pp. 147-163, 2002.
[8] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” draft-ietf-manet-dsr-04.txt, 2001.
[9] F. Kuhn, T. Moscibroda, and R. Wattenhofer, “Initializing Newly Deployed Ad Hoc and Sensor Networks,” Proc. 10th Ann. Int'l Conf. Mobile Computing and Networking (MOBICOM), 2004.
[10] L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System,” Comm. ACM, vol. 21, no. 7, 1978.
[11] M. Maekawa, “A $\sqrt{N}$ Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, pp. 145-159, 1985.
[12] M.J. McGlynn and S.A. Borbash, “Birthday Protocols for Low Energy Deployment and Flexible Neighbor Discovery in Ad Hoc Wireless Networks,” Proc. Second ACM Int'l Symp. Mobile Ad Hoc Networking & Computing, pp. 137-145, 2001.
[13] M. Nosovic and T. Todd, “Low Power Rendezvous and RFID Wakeup for Embedded Wireless Networks,” Proc. Ann. IEEE Computer Comm. Workshop, 2000.
[14] C.E. Perkins and E.M. Royer, “Ad Hoc on Demand Distance Vector (AODV) Routing,” Internet draft, IETF MANET working group, July 2000.
[15] C. Schurgers, V. Tsiatsis, S. Ganeriwal, and M. Srivastava, “Topology Management for Sensor Networks: Exploiting Latency and Density,” Proc. Third ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, 2002.
[16] E. Shih, S.-H. Cho, N. Ickes, R. Min, A. Sinha, A. Wang, and A. Chandrakasan, “Physical Layer Driven Algorithm and Protocol Design for Energy-Efficient Wireless Sensor Networks,” Proc. Seventh Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MOBICOM), 2001.
[17] P.K. Sinha, Distributed Operating Systems, chapter 6. CS Press, 1996.
[18] Y.-C. Tseng, C.-S. Hsu, and T.-Y. Hsieh, “Power-Saving Protocols for IEEE 802.11-Based Multi-Hop Ad Hoc Networks,” Proc. 21st Ann. Joint Conf. IEEE Computer and Comm. Soc., 2002.
[19] UCB/LBNL/VINT, Network Simulator-ns (version 2). http://www-mash.cs.berkeley.eduns/, Jan. 2000.
[20] W. Ye, J. Heidemann, and D. Estrin, “An Energy-Efficient MAC Protocol for Wireless Sensor Networks,” Proc. 21st Ann. Joint Conf. IEEE Computer and Comm. Soc., 2002.
[21] R. Zheng, “Design, Analysis and Empirical Evaluation of Power Management in Multihop Wireless Networks,” PhD thesis, Technical Report UIUCDCS-R-2004-2381, May 2004.
[22] R. Zheng and R. Kravets, “On-Demand Power Management for Ad Hoc Network,” Proc. 22nd Ann. Joint Conf. IEEE Computer and Comm. Soc. (INFOCOM), 2003.

Index Terms:
Asynchronous wake-up, power management, block design, multihop wireless networks.
Rong Zheng, Jennifer C. Hou, Lui Sha, "Optimal Block Design for Asynchronous Wake-Up Schedules and Its Applications in Multihop Wireless Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 9, pp. 1228-1241, Sept. 2006, doi:10.1109/TMC.2006.134
Usage of this product signifies your acceptance of the Terms of Use.