Generalized broadcast scheduling in duty-cycle multi-hop wireless networks

Authors:
Yueming Duan;Shouling Ji;Zhipeng Cai
Affiliations:
Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA;Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA;Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
Venue:
PCCC '11 Proceedings of the 30th IEEE International Performance Computing and Communications Conference
Year:
2011

Citing 0
Cited 1

On minimizing the broadcast redundancy in duty-cycled wireless sensor networks

Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication

Quantified Score

Hi-index	0.00

Visualization

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.