Abstract
Broadcast is a fundamental operation in multi-hop wireless networks. Given a source node with a message to broadcast, the objective is to propagate the message to all nodes in an interference-free manner while incurring minimum latency. This problem, called Minimum-Latency Broadcast Scheduling (MLBS), has been studied extensively in wireless networks whereby nodes remain on all times and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled wireless networks, which unfortunately, remains NP-hard. In these networks, nodes do not wake up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast message at the same time, meaning multiple transmissions may be necessary. Moreover, most of these studies addressed the MLBS problem over the idealistic protocol interference model. Henceforth, this paper considers MLBS for duty-cycled wireless networks under the physical interference model and presents an approximation algorithm called hexagon-based broadcast algorithm (HBA), which has a constant ratio in terms of broadcast latency and transmission times. We have evaluated HBA in different network configurations, and the results show that the latencies achieved by our algorithm are much lower than existing schemes. In particular, HBA manages to half the broadcast latency achieved by the state-of-the-art tree-based algorithm.
Highlights
Wireless sensor networks (WSNs) consist of numerous nodes deployed in a field
We address a variant of the Minimum-Latency Broadcast Scheduling (MLBS) problem, which aims to find an efficient, interference-free schedule that yields the minimum broadcast latency
6 Evaluation we outline the research methodology used to evaluate the performance of hexagon-based broadcast algorithm (HBA)
Summary
Wireless sensor networks (WSNs) consist of numerous nodes deployed in a field. These nodes may be resource constrained in terms of battery lifetime, memory, and processor speed. The MLBS problem for multi-hop wireless networks has been proven to be NP-hard [5], and researchers have proposed many approximation algorithms; see [4-10] These algorithms, assume all nodes are always active and adopt highly theoretical disk graph models, in which the transmission and interference range is assumed to be a unit disk centered at each node. Tiwari et al [10] propose the first distributed algorithm for the MLBS problem under the protocol interference model Their distributed algorithm requires a node to exchange a significant number of control messages until all its neighbors receive the broadcast message, leading to an increase in energy consumption. To the best of our knowledge, HBA is the first distributed solution for the MLBS problem in duty-cycled networks under the physical interference model
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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
