A Near Optimal Localized Heuristic for Voice Multicasting over Ad Hoc Wireless Networks

Providing real-time voice multicasting over multi-hop ad hoc wireless networks is a challenging task. The unique characteristics of voice traffic (viz. small packet size, high packet rate, and soft real-time nature) make conventional multicasting protocols perform quite poorly, hence warranting application centric approaches in order to provide robustness against packet losses and lower the overhead due to high packet rate. In this paper, we first show that the optimal voice multicasting tree (OVMT) problem is NP-complete and then propose a localized distributed heuristic for minimum number of transmissions (LDMT). By incorporating LDMT in ADMR protocol, extensive simulations are done in NS-2 framework to measure the performance of LDMT for voice applications. We observed that LDMT reduces the redundant transmissions in transmitting voice packets from the source to all multicast receivers (thus reducing the overall voice traffic considerably), thereby making it suitable for voice multicasting in AWNs.

[1]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[2]  C. Siva Ram Murthy,et al.  Robust Demand-Driven Video Multicast over Ad hoc Wireless Networks , 2006, 2006 3rd International Conference on Broadband Communications, Networks and Systems.

[3]  Anujan Varma,et al.  Distributed algorithms for multicast path setup in data networks , 1996, TNET.

[4]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

[5]  Jorjeta G. Jetcheva,et al.  Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks , 2001, MobiHoc '01.

[6]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[7]  Jerry D. Gibson,et al.  A multiple description speech coder based on AMR-WB for mobile ad hoc networks , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  Carla D. Savage,et al.  Depth-First Search and the Vertex Cover Problem , 1982, Inf. Process. Lett..

[9]  C. Siva Ram Murthy,et al.  On Supporting Real-time Speech over Ad hoc Wireless Networks , 2006, 2006 14th IEEE International Conference on Networks.

[10]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[11]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, ESA.

[12]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[13]  Nuggehally Sampath Jayant,et al.  Effects of Packet Losses in Waveform Coded Speech and Improvements Due to an Odd-Even Sample-Interpolation Procedure , 1981, IEEE Trans. Commun..

[14]  Chang-Jin Suh,et al.  On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks , 2002, Mob. Networks Appl..