The Community for Technology Leaders
Green Image
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.
Asynchronous wake-up, power management, block design, multihop wireless networks.

L. Sha, J. C. Hou and R. Zheng, "Optimal Block Design for Asynchronous Wake-Up Schedules and Its Applications in Multihop Wireless Networks," in IEEE Transactions on Mobile Computing, vol. 5, no. , pp. 1228-1241, 2006.
87 ms
(Ver 3.3 (11022016))