A pseudo-distance routing (PDR) algorithm for mobile ad-hoc networks
SCIE
SCOPUS
- Title
- A pseudo-distance routing (PDR) algorithm for mobile ad-hoc networks
- Authors
- Lee, MG; Lee, S
- Date Issued
- 2006-06
- Publisher
- IEICE-INST ELECTRONICS INFORMATION CO
- 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.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/10327
- DOI
- 10.1093/ietfec/e89-a.6.1647
- ISSN
- 0916-8508
- Article Type
- Article
- Citation
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, vol. E89A, no. 6, page. 1647 - 1656, 2006-06
- Files in This Item:
-
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.