Approximation Algorithms for Data Broadcast in Wireless Networks

Abstract

Abstract-Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it non-trivial to design a minimum-latency broadcast algorithm, which is known to be NP-complete. We present a simple 12-approximation algorithm for the one-to-all broadcast problem that improves all previously known guarantees for this problem. We then consider the all-to-all broadcast problem where each node sends its own message to all other nodes. For the all-to-all broadcast problem, we present two algorithms with approximation ratios of 20 and 34, improving the best result available in the literature. Finally, we report experimental evaluation of our algorithms. Our studies indicate that our algorithms perform much better in practice than the worst-case guarantees provided in the theoretical analysis and achieve up to 37% performance improvement over existing schemes.

Reliable Adaptive Replication Routing for Wireless Sensor Networks

“…They focuses on the trade-offs between reliability (percentage of nodes that receive each message), latency, and the message overhead of the protocol. Gandhi et al, [11] present a simple 12-approximation algorithm for the one-to-all broadcast problem. They present two algorithms with approximation ratios of 20 and 34, obtaining excellent results.…”

Secure Data Storage Over Distributed Nodes in Network Through Broadcast Techniques

“…The current state of the art of wireless networks is captured in [1], where solutions are discussed with various broadcasting schemes. Gandhi et al [1] introduces two algorithms for broadcasting in wireless network such as ONE to ALL and ALL to ALL data broadcast. The main objective is to compute a schedule in which the latency is minimized.…”

Approximation Algorithms for Data Broadcast in Wireless Networks

“…The number of transmissions in our algorithm is at most 21 times those in an optimal solution. For complete proofs, we refer to the full version [18].…”