A framework for optimization of operational latency in wireless networks

Network-wide broadcast has been extensively studied. In this paper, we introduce the problem of all-to- one-hop broadcast. Specifically, we are interested in the required time slots within which all nodes can receive unit-size messages from all one-hop neighbors and aim to minimize the broadcast latency. To this end, we decompose the optimal broadcast latency problem into two methodical sub-problems and present a scheduling method. To complete collision-free transmission in minimum time slots a graph-coloring scheme is used, and to reduce the overall waiting latency a linear arrangement scheme is used. Simulation studies show that the novel one-hop broadcast scheduling method can reduce the latency from 4% to 19% depending on the network size and density.