Novel Reconfigurable Randomized Broadcast Algorithm for Channel-Aware Wireless Networks

Abstract — In this paper, we study the channel-aware minimum-latency broadcast scheduling problem using the probabilistic model. We establish an explicit relationship between the tolerated transmission-failure probability and the latency of the corresponding broadcast schedule. Such a tolerated transmissionfailure probability is calculated in the strict sense that the failure to receive the message at any single node will lead to the entire broadcast failure and only if all nodes have successfully received the message, do we consider it a successful broadcast. We design a novel reconfigurable broadcast scheduling algorithm such that the latency is evaluated under such a strict definition of failure. Our derived latency bound associated with this new randomized algorithm is substantial to guarantee the low broadcast latency for the complete broadcasting success thereby. Index Terms — Wireless networks, scheduling, randomized algorithm. I