The Community for Technology Leaders
IEEE International Performance Computing and Communications Conference (2011)
Orlando, FL, USA
Nov. 17, 2011 to Nov. 19, 2011
ISBN: 978-1-4673-0010-0
pp: 1-6
Yueming Duan , Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
Shouling Ji , Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
Zhipeng Cai , Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
ABSTRACT
Network wide broadcast is a fundamental and widely-used operation in multi-hop wireless networks. Through one-to-all broadcast, a source node disseminates a message to all the other nodes in the network. In duty-cycle scenarios, the nodes alternate between active and sleep states, which results in the increasing of broadcast latency. In this paper, we investigate the Minimum Latency Broadcast Scheduling problem in Duty-Cycle (MLBSDC problem) multi-hop wireless networks. Our goal is to provide a generalized framework for the MLBSDC problem. We mathematically remodel this problem and propose a vector iteration algorithm, in which a greedy strategy is employed. We also conduct extensive simulations to show the efficiency of the broadcast schedule returned by our algorithm under various network configurations. Compared with the results of the current best algorithm, our greedy algorithm achieves significant improvement both in broadcast latency and the total number of transmissions.
INDEX TERMS
CITATION
Yueming Duan, Shouling Ji, Zhipeng Cai, "Generalized broadcast scheduling in duty-cycle multi-hop wireless networks", IEEE International Performance Computing and Communications Conference, vol. 00, no. , pp. 1-6, 2011, doi:10.1109/PCCC.2011.6108080
157 ms
(Ver 3.3 (11022016))