The Community for Technology Leaders
RSS Icon
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
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.162
REFERENCES
[1] C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath, "Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks," Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 64-71, 1999.
[2] J. Jetcheva, Y. Hu, D. Maltz, and D. Johnson, "A Simple Protocol for Multicast and Broadcast in Mobile Ad Hoc Networks," IETF Internet draft, July 2001.
[3] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The Broadcast Storm Problem in a Mobile Ad Hoc Network," Proc. ACM/IEEE MobiCom, pp. 151-162, 1999.
[4] R. Gandhi, A. Mishra, and S. Parthasarathy, "Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks," IEEE/ACM Trans. Networking, vol. 16, no. 4, pp. 840-851, Aug. 2008.
[5] S. Huang, P. Wan, X. Jia, H. Du, and W. Shang, "Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks," Proc. IEEE INFOCOM, pp. 733-739, 2007.
[6] S.C.-H. Huang, H. Du, and E.-K. Park, "Minimum-Latency Gossiping in Multi-Hop Wireless Networks," Proc. ACM MobiHoc, pp. 323-330, 2008.
[7] H. Lim and C. Kim, "Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks," Proc. Third ACM Int'l Workshop Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM '00), pp. 61-68, 2000.
[8] W. Peng and X.-C. Lu, "On the Reduction of Broadcast Redundancy in Mobile Adhoc Networks," Proc. ACM MobiHoc, Aug. 2000.
[9] A. Qayyum, L. Viennot, and A. Laouiti, "Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks," Technical Report RR-3898, INRIA, Feb. 2000.
[10] W. Peng and X. Lu, "AHBP: An Efficient Broadcast Protocol for Mobile Adhoc Networks," J. Science and Technology, vol. 16, pp. 114-125, 2000.
[11] J. Sucec and I. Marsic, "An Efficient Distributed Network-Wide Broadcast Algorithm for Mobile Adhoc Networks," technical report, Rutgers Univ., 2000.
[12] W. Peng and X. Lu, "Efficient Broadcast in Mobile Ad Hoc Networks Using Connected Dominating Sets," J. Software, 1999.
[13] I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[14] L. Orecchia, A. Panconesi, C. Petrioli, and A. Vitaletti, "Localized Techniques for Broadcasting in Wireless Sensor Networks," Proc. Joint Workshop Foundations of Mobile Computing (DIALM-POMC '04), pp. 41-51, 2004.
[15] H.F. Salama, D.S. Reeves, and Y. Viniotis, "The Delay-Constrained Minimum Spanning Tree Problem," Proc. IEEE Second Symp. Computers and Comm., pp. 699-704, 1997.
[16] I. Chlamtac and S. Kutten, "On Broadcasting in Radio Networks— Problem Analysis and Protocol Design," IEEE Trans. Comm., vol. 33, no. 12, pp. 1240-1246, Dec. 1985.
[17] I. Chlamtac and O. Weinstein, "The Wave Expansion Approach to Broadcasting in Multihop Radio Networks," IEEE Trans. Comm., vol. 39, no. 3, pp. 426-433, Mar. 1991.
[18] S. Basagni, I. Chlamtac, and D. Bruschi, "A Mobility-Transparent Deterministic Broadcast Mechanism for Ad Hoc Networks," IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 799-807, Dec. 1999.
[19] Z. Chen, C. Qiao, J. Xu, and T. Lee, "A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks," Proc. IEEE INFOCOM, pp. 740-748, 2007.
[20] R. Tiwari, T.N. Dinh, and M.T. Thai, "On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks," Proc. Fourth Int'l Conf. Wireless Algorithms, Systems, and Applications (WASA '09), pp. 438-448, 2009.
[21] R. Mahjourian, F. Chen, R. Tiwari, M. Thai, H. Zhai, and Y. Fang, "An Approximation Algorithm for Conflict-Aware Broadcast Scheduling in Wireless Ad Hoc Networks," Proc. ACM MobiHoc, pp. 331-340, 2008.
[22] P.-K. Hung, J.-P. Sheu, and C.-S. Hsu, "Scheduling of Broadcasts in Multihop Wireless Networks," Proc. European Wireless, 2002.
[23] B. Williams and T. Camp, "Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks," Proc. ACM MobiHoc, pp. 194-205, 2002.
[24] P. Bateman and P. Erdös, "Geometrical Extrema Suggested by a Lemma of Besicovitch," The Am. Math. Monthly, vol. 58, pp. 306-314, May 1951.
[25] C. Florens and R. McEliece, "Packets Distribution Algorithms for Sensor Networks," Proc. IEEE INFOCOM, pp. 1063-1072, 200.
57 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool