A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc Networks

Authors:
Min-Gu Lee;Sunggu Lee
Affiliations:
The authors are with the EE Department, Pohang University of Science and Technology, Pohang, Korea. E-mail: slee@postech.ac.kr;The authors are with the EE Department, Pohang University of Science and Technology, Pohang, Korea. E-mail: slee@postech.ac.kr
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2006

Citing 0
Cited 1

A link stability model and stable routing for mobile ad-hoc networks

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.