A Routing Protocol Based on Distance Vector in Ad Hoc Networks

Author

Liu, Zhipeng ; Cheon, SeongKwon ; Kim, Chonggun

Author_Institution

Dept. Of Comput. Eng., Yeungnam Univ. Gyeongsan, Gyeongbuk

Volume

1

fYear

2008

fDate

2-4 Sept. 2008

Firstpage

92

Lastpage

97

Abstract

Since ad hoc network does not rely on existing infrastructure and is self-organized, the nodes on such network act as hosts and routers to transmit packets. With its intense change in topology ad hoc network does not relay on pre-established cable network, but it requires special routing algorithm. We provide a specific shortest routing protocol based on distance vector and adjacency matrix and compare the performance of the proposed routing protocol with those of AODV and DSDV by computer simulations using NS-2. By the main comparison results, the proposed protocol shows better performance on data delivery ratio, end-to-end delay, and control overheads.

Keywords

ad hoc networks; routing protocols; telecommunication network topology; ad hoc networks; adjacency matrix; distance vector; network topology; routing protocol; special routing algorithm; Ad hoc networks; Computer networks; Computer simulation; Delay; Graph theory; Information management; Mobile ad hoc networks; Network topology; Relays; Routing protocols; A shortest Path Search Method; Ad hoc networks; NS-2 simulations; a topology discovery agent; adjacency matrix; simplified distance vector;

fLanguage

English

Publisher

ieee

Conference_Titel

Networked Computing and Advanced Information Management, 2008. NCM '08. Fourth International Conference on

Conference_Location

Gyeongju

Print_ISBN

978-0-7695-3322-3

Type

conf

DOI

10.1109/NCM.2008.134

Filename

4623984