Conference Paper

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

Yahoo! Software Dev. India Pvt. Ltd., Bangalore
DOI: 10.1109/ICC.2007.276 Conference: Communications, 2007. ICC '07. IEEE International Conference on
Source: IEEE Xplore

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

0 Bookmarks
 · 
91 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIreless Multicast). SWIM constructs a tree on which each multicast destination has the minimum possible depth (number of hops from the nearest source). It is proved that SWIM is fully distributed, with a worst case complexity upper-bounded by O(N3), and an empirically found average complexity of only O(N2). SWIM forms one shared tree from source(s) to the multicast destinations; yet, as a by-product, it creates a multicast mesh structure by maintaining alternative branches at every tree node, thus providing robustness to link failures. This makes it suitable for both ad hoc networks and access networks with multiple gateways. In terms of minimizing the number of forwarding nodes, SWIM is optimal for unicast and competitive with the state of the art for multicast, outperforming the best known distributed approaches from the literature except for the multicast ad hoc on demand distance vector (MAODV) algorithm. However, simulations of the MAODV algorithm alongside SWIM on a large set of network instances show that the depth minimality of SWIM leads to lower average delay per multicast destination. It is also shown that the delay performance of SWIM is virtually unaffected by the presence of low mobility in the network.
    Comput. J. 01/2011; 54:988-1003.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIreless Multicast). SWIM forms one shared tree from source(s) to the multicast destinations; yet, as a side product it creates a multicast mesh structure by maintaining alternative branches at every tree node, thus providing robustness to link failures. This makes it suitable for both ad-hoc networks and access networks with multiple gateways. It is proved that SWIM is fully distributed, with a worst case complexity (for multicast) upper-bounded by O(N<sup>3</sup>), and average complexity of only O(N<sup>2</sup>). SWIM constructs a tree on which each multicast destination has the minimum possible depth (number of hops from the nearest source). In terms of minimizing the number of forwarding nodes (NFN), SWIM is optimal for unicast. Its average NFN in the broadcast and multicast cases is compared with practical algorithms targeting low NFN reported in the literature. In both multicast and unicast, SWIM performs competitively in terms of NFN with the previous solutions, while having smaller maximum depth, and consequently low delay.
    MILITARY COMMUNICATIONS CONFERENCE, 2010 - MILCOM 2010; 12/2010

Full-text

View
0 Downloads
Available from