Vainio2002

Link Reversal Routing

Miia Vainio
P.O.Box 407
00045 NOKIA GROUP
Miia.Vainio@nokia.com

Postgraduate Course on Networking Technology
Course Topic Spring 2002: Ad Hoc Networking
Teknillinen Korkeakoulu, Tekniska Högskolan, Helsinki University of Technology
May, 2002

Citeseer

Elaboration:

Abstract

The routing protocols that are used in ad hoc networks must convergence quickly, save power and be scalable and adaptive. Link-Reversal Routing (LRR) protocols are one possible choice for ad hoc networks. LRR protocols try to localize the effect of topology change and react only when necessary. There exist three LRR algorithms:
Gafni-Bertsekas (GB), Lightweight Mobile Routing (LMR) and Temporally-Ordered Routing Algorithm (TORA). The paper describes the principles of these three algorithms. GB is the oldest one but it has a convergence problem in case of partitions. LMR is more stable. It has two phases; The routes are established and maintained. TORA tries to combine the good qualities of GB and LMR. Finally the paper deals with the performance of the algorithms compared to each other and also to some other algorithms related to ad hoc network routing.

BibTeX

@TECHREPORT(Vainio2001,
   AUTHOR = {Miia Vainio},
   TITLE = {Link Reversal Routing},
   TYPE = {Postgraduate Course on Networking Technology, Course Topic Spring 2002: Ad Hoc Networking},
   INSTITUTION = {Teknillinen Korkeakoulu, Tekniska Högskolan, Helsinki University of Technology},
   HOWPUBLISHED = {Published Online},
   MONTH = {May},
   YEAR = {2002},
   URL = {http://keskus.hut.fi/opetus/s38030/k02/Papers/09-Miia.pdf},
   FILE = {link-reversal-routing.pdf}
)

"Vainio2002" is mentioned on: Gafni-Bertsekas | Related Presentations