Please use this identifier to cite or link to this item:
|Title:||Distributed Steiner-like multicast path setup for mesh-based multicast routing in ad hoc networks|
|Authors:||Inn Inn, E.R.|
|Source:||Inn Inn, E.R.,Seah, W.K.G. (2006). Distributed Steiner-like multicast path setup for mesh-based multicast routing in ad hoc networks. Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing 2006 I : 192-197. ScholarBank@NUS Repository. https://doi.org/10.1109/SUTC.2006.59|
|Abstract:||In most multicast routing protocols for ad hoc networks, the problem of connecting a group of receivers to the source has been approximated using the polynomial shortest path heuristic because of its simplicity. The main goal for multicasting is to achieve better bandwidth utilization when group communication is most likely to take place in the network. However, the shortest path heuristic does not setup an optimal multicast delivery infrastructure in terms of bandwidth consumption. In this paper, we propose a multicast path setup algorithm based on Steiner-trees, Our proposed Bandwidth-Optimized and Delay-Sensitive (BODS) algorithm constructs a multicast delivery mesh based on Nearest Participant heuristic without sacrificing delay performance. Being a multicast path setup algorithm, BODS is a general algorithm that can be integrated into any existing mesh-based multicast routing protocols. We integrated BODS into the On Demand Multicast Routing Protocol (ODMRP) and evaluated the performance of the enhanced ODMRP. The simulation results revealed that the enhanced ODMRP achieved a similar or better delivery ratio as original ODMRP with a reduction of around 30% data overhead. © 2006 IEEE.|
|Source Title:||Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 11, 2017
checked on Dec 16, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.