For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc Networks
Min-Gu LEE Sunggu LEE
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/06/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Papers Selected from 2005 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC2005))
routing, mobile ad-hoc networks, pseudo-distance,
Full Text: PDF(1.3MB)>>
Previous routing algorithms for mobile ad-hoc networks (MANETs) have focused on finding short-distance path(s) between communicating nodes. However, due to the dynamic and unreliable communication nature of MANETs, previously determined paths can easily become disconnected. Although dynamic routing can be used to circumvent this problem, determining a new route each time a packet needs to be sent involves a lot of overhead. An alternative form of dynamic routing involves maintaining valid routes in routing tables, which can be dynamically updated whenever network changes are detected. This paper proposes a new routing algorithm, referred to as pseudo-distance routing (PDR), that supports efficient routing table maintenance and dynamic routing based on such routing tables.