Distributed Stable Global Broadcasting for SINR-Based Multi-Channel Wireless Multi-Hop Networks

Recently, the problem of Stable Global Broadcasting (SGB) with continuous packet injections at a source node has attracted considerable attention and much work has been carried out. However, existing SGB algorithms are all centralized and under the graph-based interference model. How to achieve efficient distributed SGB under the more realistic Signal-to-Interference-plus-Noise-Ratio (SINR) interference model is still an open issue. In this paper, we focus on the design of distributed SGB algorithms for multi-channel wireless multi-hop networks under the SINR model. We first present an efficient Backbone-based Multi-channel Concurrent Scheduling (BMCS) strategy and prove an upper bound of $1/2$ packets/slot for the broadcast capacity (i.e., the maximum supportable packet injection rate for all possible SGB algorithms). By iterating the BMCS strategy in different ways, we present two distributed SGB algorithms, one for deterministic packet injection model corresponding to the broadcast capacity (called SGB-DPI) and another for stochastic packet injection model (called SGB-SPI). We prove that: 1) both SGB-DPI and SGB-SPI meet the queue stability and latency stability constraints for providing stable global broadcasting services, and 2) SGB-DPI is throughput-optimal. We evaluate the performance of our proposed algorithms through simulations. The simulation results validate our theoretical analysis and also show that even under the stochastic packet injection model, SGB-DPI has a comparable and even better throughput performance than SGB-SPI.