Distributed low‐latency broadcast scheduling for multi‐channel duty‐cycled wireless IoT networks

Abstract

SummaryData broadcast is a fundamental communication pattern in wireless IoT networks, in which the messages are disseminated from a source node to the entire network. The problem of minimum latency broadcast scheduling (MLBS) which is aimed to generate a quick and conflict‐free broadcast schedule has not been extensively explored in duty‐cycled networks. The existing works either work in a centralized scheme or rely on a fixed tree for broadcasting. Additionally, they all employ a strict premise that each node can only utilize one channel for both transmitting and receiving messages. Thus, to address the issues mentioned above, we examine the first distributed broadcasting algorithm in multi‐channel duty‐cycled wireless IoT networks, without relying on a predetermined tree. First, the MLBS problem in such networks is defined and proved to be NP‐hard. Then, in order to avoid transmission conflicts between different links locally, two efficient data structures are designed to help compute the earliest time and channel of receiving messages without conflicts. Based on the above data structures, we introduce an efficient distributed broadcasting algorithm, which can generate a latency‐sensitive broadcast tree while calculating a collision‐free broadcast schedule, simultaneously. Finally, the theoretical analysis and simulations demonstrate the efficiency of the proposed algorithm.