A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.6 pp.1647-1656
- Publication Date
- 2006/06/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e89-a.6.1647
- Type of Manuscript
- Special Section PAPER (Special Section on Papers Selected from 2005 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC2005))
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Min-Gu LEE, Sunggu LEE, "A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 6, pp. 1647-1656, June 2006, doi: 10.1093/ietfec/e89-a.6.1647.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.6.1647/_p
Copy
@ARTICLE{e89-a_6_1647,
author={Min-Gu LEE, Sunggu LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc Networks},
year={2006},
volume={E89-A},
number={6},
pages={1647-1656},
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.},
keywords={},
doi={10.1093/ietfec/e89-a.6.1647},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1647
EP - 1656
AU - Min-Gu LEE
AU - Sunggu LEE
PY - 2006
DO - 10.1093/ietfec/e89-a.6.1647
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2006
AB - 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.
ER -
English
