A Distributed Routing Algorithm Based on the Reliable Path

Author

Ma Zan ; Xu Zhen ; Rui Liyang

Author_Institution

Sch. of Electron. Inf. Eng., BUAA, Beijing, China

fYear

2009

fDate

24-26 Sept. 2009

Firstpage

1

Lastpage

4

Abstract

In this paper we present a distributed routing algorithm based on the reliable path to improve the efficiency of routing protocols in ad hoc network. This protocol takes advantage of the graphical information, velocity and position, to acquire the link lifetime. When the link is broken, the routing information is updated at once. Moreover, one neighbor with the fewest hops to the destination and relatively greater link lifetime is used to forward messages without transmission back-off delay as the next hop. The experimental results show that DBRP can deliver messages more reliably and more quickly compared to SSR.

Keywords

ad hoc networks; distributed algorithms; mobile radio; routing protocols; telecommunication network reliability; distributed routing algorithm; link lifetime; mobile ad hoc network; reliable path; routing protocol; Ad hoc networks; Couplings; Delay; Mobile ad hoc networks; Network topology; Performance analysis; Qualifications; Reliability engineering; Routing protocols;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-3692-7

Electronic_ISBN

978-1-4244-3693-4

Type

conf

DOI

10.1109/WICOM.2009.5302199

Filename

5302199