loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops
Distributed Steiner-Like Multicast Path Setup for Mesh-based Multicast Routing in Ad Hoc Networks
Taichung, Taiwan
June 05-June 07
ISBN: 0-7695-2553-9
ASCII Text
x 
 
Inn Inn ER, Winston K.G. Seah, "Distributed Steiner-Like Multicast Path Setup for Mesh-based Multicast Routing in Ad Hoc Networks," Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on, vol. 2, pp. 192-197, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops, 2006.
 
 
BibTex
x
 
@article{ 10.1109/SUTC.2006.59,
author = {Inn Inn ER and Winston K.G. Seah},
title = {Distributed Steiner-Like Multicast Path Setup for Mesh-based Multicast Routing in Ad Hoc Networks},
journal ={Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on},
volume = {2},
year = {2006},
isbn = {0-7695-2553-9},
pages = {192-197},
doi = {http://doi.ieeecomputersociety.org/10.1109/SUTC.2006.59},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on
TI - Distributed Steiner-Like Multicast Path Setup for Mesh-based Multicast Routing in Ad Hoc Networks
SN - 0-7695-2553-9
SP192
EP197
A1 - Inn Inn ER,
A1 - Winston K.G. Seah,
PY - 2006
KW - null
VL - 2
JA - Sensor Networks, Ubiquitous, and Trustworthy Computing, International Conference on
ER -
 
Inn Inn ER, National University of Singap
Winston K.G. Seah, Agency for Science Technology and Research, Singapore
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.
Citation:
Inn Inn ER, Winston K.G. Seah, "Distributed Steiner-Like Multicast Path Setup for Mesh-based Multicast Routing in Ad Hoc Networks," sutc, vol. 2, pp.192-197, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops, 2006
Usage of this product signifies your acceptance of the Terms of Use.