Optimal Reactive Routing Protocol (ORRP): A New Reactive Routing Protocol for the Shortest Path in Ad Hoc Networks

Author

Dutta, Sagnik ; Chaki, Ritupama ; Chaki, Nabendu

fYear

2006

fDate

15-17 Sept. 2006

Firstpage

1

Lastpage

4

Abstract

In this paper, we present a new reactive routing protocol that we call optimal reactive routing protocol (ORRP). The proposed protocol does not require global periodic advertisement of routing messages like the proactive approaches. At the same time, ORRP guarantees optimal path solution. The protocol uses the Dijkstra´s shortest path routing algorithm. The demand on the overall bandwidth available is substantially less for the proposed protocol. It has been established that ORRP combines the advantages of both proactive and reactive routing protocols while reducing the limitations of the two approaches

Keywords

ad hoc networks; mobile radio; routing protocols; Dijkstra´s shortest path routing algorithm; ORRP; ad hoc networks; optimal reactive routing protocol; Ad hoc networks; Bandwidth; Centralized control; Costs; Mobile ad hoc networks; Network topology; Performance evaluation; Routing protocols; Telecommunication traffic; Wireless sensor networks; Loop-free routing; Mobile ad hoc network; Reactive Routing; Routing protocol; Shortest Path algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

India Conference, 2006 Annual IEEE

Conference_Location

New Delhi

Print_ISBN

1-4244-0369-3

Electronic_ISBN

1-4244-0370-7

Type

conf

DOI

10.1109/INDCON.2006.302850

Filename

4086321