A Path Fault Avoided RPAODV Routing in Ad Hoc Networks 


Vol. 11,  No. 7, pp. 879-888, Dec.  2004
10.3745/KIPSTC.2004.11.7.879


PDF
  Abstract

A Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node''s mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on-demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delays. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.

  Statistics
  Cite this article

[IEEE Style]

M. R. Wu, Y. R. Kim, C. G. Kim, "A Path Fault Avoided RPAODV Routing in Ad Hoc Networks," The KIPS Transactions:PartC, vol. 11, no. 7, pp. 879-888, 2004. DOI: 10.3745/KIPSTC.2004.11.7.879.

[ACM Style]

Ma Ry Wu, Young Rak Kim, and Chong Gun Kim. 2004. A Path Fault Avoided RPAODV Routing in Ad Hoc Networks. The KIPS Transactions:PartC, 11, 7, (2004), 879-888. DOI: 10.3745/KIPSTC.2004.11.7.879.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals