On-demand multicast routing protocols in dynamic ad hoc networks

Author

Galatchi, Dan ; Zoican, Roxana

Author_Institution

Fac. of Electron., Telecommun. & Inf. Technol., Univ. "Politeh." of Bucharest, Bucharest, Romania

fYear

2009

fDate

7-9 Oct. 2009

Firstpage

540

Lastpage

543

Abstract

One of the major goals of on-demand routing protocols is to minimize control traffic overhead. In this paper, we perform a simulation and performance study on some routing protocols for ad hoc networks. Distributed Bellman-Ford, a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless networks. In addition, two on-demand routing protocols (dynamic source routing (DSR) and associativity-based routing (ABR) ) with distinctive route selection algorithms are simulated in a common environment to quantitatively measure and contrast the the control message overhead and the storage overhead.

Keywords

ad hoc networks; multicast protocols; routing protocols; associativity-based routing; distinctive route selection algorithm; distributed Bellman-Ford algorithm; dynamic ad hoc network; dynamic source routing; multihop wireless network; ondemand multicast routing protocol; table-driven routing algorithm; Ad hoc networks; Bandwidth; Delay; Multicast protocols; Performance analysis; Routing protocols; Telecommunication traffic; Traffic control; WiMAX; Wireless LAN; Control message overhead; Routing algorithm; Storage overhead;

fLanguage

English

Publisher

ieee

Conference_Titel

Telecommunication in Modern Satellite, Cable, and Broadcasting Services, 2009. TELSIKS '09. 9th International Conference on

Conference_Location

Nis

Print_ISBN

978-1-4244-4382-6

Electronic_ISBN

978-1-4244-4383-3

Type

conf

DOI

10.1109/TELSKS.2009.5339451

Filename

5339451