Efficient Route Maintenance Scheme for Wireless Ad-hoc Network Environments 


Vol. 30,  No. 8, pp. 639-648, Aug.  2005


PDF
  Abstract

A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized ad-ministration. Numerous routing protocols have been developed for changing messages among the nodes in a wireless ad-hoc network. Some multi-path routing protocols have also been proposed to support load balancing and QoS for wireless ad-hoc networks. In this paper, we propose not only an efficient routing algorithm for wireless ad-hoc net-works but also a protocol that can improve data transmission rate and reduce end-to-end delay. In our protocol, each mobile node need not broadcast routing messages periodically and the mobile node that wants to send data packets initiates route request and route establishment procedure. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. J. Kim and Y. I. Eom, "Efficient Route Maintenance Scheme for Wireless Ad-hoc Network Environments," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 8, pp. 639-648, 2005. DOI: .

[ACM Style]

Moon Jeong Kim and Young Ik Eom. 2005. Efficient Route Maintenance Scheme for Wireless Ad-hoc Network Environments. The Journal of Korean Institute of Communications and Information Sciences, 30, 8, (2005), 639-648. DOI: .

[KICS Style]

Moon Jeong Kim and Young Ik Eom, "Efficient Route Maintenance Scheme for Wireless Ad-hoc Network Environments," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 8, pp. 639-648, 8. 2005.