2007 6th International Conference on Computer Information Systems and Industrial Management Applications ORRP: Optimal Reactive Routing Protocol for Mobile Ad-Hoc Networks Elk, Poland June 28-June 30 ISBN: 0-7695-2894-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CISIM.2007.55
An ad-hoc network is a self-supporting collection of mobile nodes that happen to exist within a close proximity in an interval of time. In this paper, a reactive routing protocol has been proposed that computes the shortest path in between any source-destination pair on demand. The approach, unlike other reactive protocols, finds a loop-free, optimal path between the end nodes. It does not use broadcasting like DSR or some other reactive protocols. In fact ORRP exchanges only (n-1) control packets, in the best case. A comparative performance evaluation establishes the advantages of ORRP. The paper is a substantial extension of our earlier work reported in [14].
Index Terms:
Mobile ad hoc network, Routing protocol, Reactive Routing, Shortest Path algorithms, Loop-free routing.
Citation:
Nabendu Chaki, Rituparna Chaki, "ORRP: Optimal Reactive Routing Protocol for Mobile Ad-Hoc Networks," cisim, pp.185-190, 2007 6th International Conference on Computer Information Systems and Industrial Management Applications, 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb