Approximation Algorithms for Data Broadcast in Wireless Networks
Cited 8 times inCited 5 times in
- Approximation Algorithms for Data Broadcast in Wireless Networks
- Gandhi, Rajiv; Kim, Yoo-Ah; Lee, Seungjoon; Ryu, Jiho; Wan, Peng-Jun
- Issue Date
- IEEE COMPUTER SOC
- IEEE TRANSACTIONS ON MOBILE COMPUTING, v.11, no.7, pp.1237 - 1248
- 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 nontrivial 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 percent performance improvement over existing schemes.
- Appears in Collections:
- ETC_Journal Papers
- Files in This Item:
- There are no files associated with this item.
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.