Subscribe

Issue No.07 - July (2012 vol.11)

pp: 1237-1248

Rajiv Gandhi , Rutgers University-Camden, Camden

Yoo-Ah Kim , University of Connecticut, Storrs

Seungjoon Lee , AT&T Labs, Florham Park

Jiho Ryu , Seoul National University, Seoul

Peng-Jun Wan , Illinois Institute of Technology, Chicago

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.162

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 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.

INDEX TERMS

Ad hoc networking, approximation algorithms, broadcast algorithms, wireless scheduling.

CITATION

Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu, Peng-Jun Wan, "Approximation Algorithms for Data Broadcast in Wireless Networks",

*IEEE Transactions on Mobile Computing*, vol.11, no. 7, pp. 1237-1248, July 2012, doi:10.1109/TMC.2011.162REFERENCES