Abstract

Multi-source global broadcast is a fundamental problem in multi-hop wireless networks. The Static Multi-source Global Broadcast problem (SMGB), which considers static packet injection at all source nodes, has been extensively studied in recent years. However, packets are more likely to be continuously injected over time in realistic multi-hop wireless networks. In this paper, we focus on studying the Dynamic Multi-source Global Broadcast problem (DMGB), in which packets are continuously injected to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k\geq 2$ </tex-math></inline-formula> ) source nodes in the network according to a widely-used dynamic packet injection model and the objective is to disseminate each injected packet across the whole network quickly. We solve this DMGB problem under the Signal-to-Interference-plus-Noise-Ratio (SINR) interference model. Specifically, we first present a distributed randomized algorithm for solving the SMGB problem. We then iterate this SMGB algorithm repeatedly to construct a distributed DMGB algorithm. We prove the proposed DMGB algorithm is stable, i.e., the expected number of packets in each node’s message queue is bounded at any time and further the expected global broadcast latency for each injected packet is bounded. Simulation results validate the effectiveness of the proposed DMGB algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call