Recycled path routing in mobile ad hoc networks

John Eisbrener, Greg Murphy, David Eade, Christopher K. Pinnow, Kohinoor Begum, Seungjin Park, Seong Moo Yoo, Jong-Hoon Youn

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In mobile ad hoc networks, many routing algorithms rely on some form of flooding to accomplish the route discovery process. Flooding, however, consumes many valuable network resources such as time, bandwidth, and power. Most current routing schemes expire valid routes after a time period to account for nodal movement. This paper proposes a new route discovery method, called recycled path routing (RPR), which directs broadcasts toward the destination node even in the absence of location information. The recycled path routing scheme reduces the search space for the destination node by implementing an expired route cache that is utilized by each node in the network. Routes are added to the expired route cache as they expire from the active route cache and remain there until some time interval has passed or a new route has been discovered. Since these expired routes can provide valuable insight into finding new routes, RPR uses them to direct broadcasts toward the destination node. RPR can save a significant quantity of valuable network resources because only nodes near the optimal path will rebroadcast route requests.

Original languageEnglish (US)
Pages (from-to)1552-1560
Number of pages9
JournalComputer Communications
Volume29
Issue number9 SPEC. ISS.
DOIs
StatePublished - May 31 2006

Fingerprint

Routing algorithms
Mobile ad hoc networks
Bandwidth

Keywords

  • Flooding
  • Mobile ad hoc networks
  • Recycled path routing
  • Route discovery

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Eisbrener, J., Murphy, G., Eade, D., Pinnow, C. K., Begum, K., Park, S., ... Youn, J-H. (2006). Recycled path routing in mobile ad hoc networks. Computer Communications, 29(9 SPEC. ISS.), 1552-1560. https://doi.org/10.1016/j.comcom.2005.10.018

Recycled path routing in mobile ad hoc networks. / Eisbrener, John; Murphy, Greg; Eade, David; Pinnow, Christopher K.; Begum, Kohinoor; Park, Seungjin; Yoo, Seong Moo; Youn, Jong-Hoon.

In: Computer Communications, Vol. 29, No. 9 SPEC. ISS., 31.05.2006, p. 1552-1560.

Research output: Contribution to journalArticle

Eisbrener, J, Murphy, G, Eade, D, Pinnow, CK, Begum, K, Park, S, Yoo, SM & Youn, J-H 2006, 'Recycled path routing in mobile ad hoc networks', Computer Communications, vol. 29, no. 9 SPEC. ISS., pp. 1552-1560. https://doi.org/10.1016/j.comcom.2005.10.018
Eisbrener J, Murphy G, Eade D, Pinnow CK, Begum K, Park S et al. Recycled path routing in mobile ad hoc networks. Computer Communications. 2006 May 31;29(9 SPEC. ISS.):1552-1560. https://doi.org/10.1016/j.comcom.2005.10.018
Eisbrener, John ; Murphy, Greg ; Eade, David ; Pinnow, Christopher K. ; Begum, Kohinoor ; Park, Seungjin ; Yoo, Seong Moo ; Youn, Jong-Hoon. / Recycled path routing in mobile ad hoc networks. In: Computer Communications. 2006 ; Vol. 29, No. 9 SPEC. ISS. pp. 1552-1560.
@article{9c97deecd6ac46b18f69ac5d7b2ae1ae,
title = "Recycled path routing in mobile ad hoc networks",
abstract = "In mobile ad hoc networks, many routing algorithms rely on some form of flooding to accomplish the route discovery process. Flooding, however, consumes many valuable network resources such as time, bandwidth, and power. Most current routing schemes expire valid routes after a time period to account for nodal movement. This paper proposes a new route discovery method, called recycled path routing (RPR), which directs broadcasts toward the destination node even in the absence of location information. The recycled path routing scheme reduces the search space for the destination node by implementing an expired route cache that is utilized by each node in the network. Routes are added to the expired route cache as they expire from the active route cache and remain there until some time interval has passed or a new route has been discovered. Since these expired routes can provide valuable insight into finding new routes, RPR uses them to direct broadcasts toward the destination node. RPR can save a significant quantity of valuable network resources because only nodes near the optimal path will rebroadcast route requests.",
keywords = "Flooding, Mobile ad hoc networks, Recycled path routing, Route discovery",
author = "John Eisbrener and Greg Murphy and David Eade and Pinnow, {Christopher K.} and Kohinoor Begum and Seungjin Park and Yoo, {Seong Moo} and Jong-Hoon Youn",
year = "2006",
month = "5",
day = "31",
doi = "10.1016/j.comcom.2005.10.018",
language = "English (US)",
volume = "29",
pages = "1552--1560",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "9 SPEC. ISS.",

}

TY - JOUR

T1 - Recycled path routing in mobile ad hoc networks

AU - Eisbrener, John

AU - Murphy, Greg

AU - Eade, David

AU - Pinnow, Christopher K.

AU - Begum, Kohinoor

AU - Park, Seungjin

AU - Yoo, Seong Moo

AU - Youn, Jong-Hoon

PY - 2006/5/31

Y1 - 2006/5/31

N2 - In mobile ad hoc networks, many routing algorithms rely on some form of flooding to accomplish the route discovery process. Flooding, however, consumes many valuable network resources such as time, bandwidth, and power. Most current routing schemes expire valid routes after a time period to account for nodal movement. This paper proposes a new route discovery method, called recycled path routing (RPR), which directs broadcasts toward the destination node even in the absence of location information. The recycled path routing scheme reduces the search space for the destination node by implementing an expired route cache that is utilized by each node in the network. Routes are added to the expired route cache as they expire from the active route cache and remain there until some time interval has passed or a new route has been discovered. Since these expired routes can provide valuable insight into finding new routes, RPR uses them to direct broadcasts toward the destination node. RPR can save a significant quantity of valuable network resources because only nodes near the optimal path will rebroadcast route requests.

AB - In mobile ad hoc networks, many routing algorithms rely on some form of flooding to accomplish the route discovery process. Flooding, however, consumes many valuable network resources such as time, bandwidth, and power. Most current routing schemes expire valid routes after a time period to account for nodal movement. This paper proposes a new route discovery method, called recycled path routing (RPR), which directs broadcasts toward the destination node even in the absence of location information. The recycled path routing scheme reduces the search space for the destination node by implementing an expired route cache that is utilized by each node in the network. Routes are added to the expired route cache as they expire from the active route cache and remain there until some time interval has passed or a new route has been discovered. Since these expired routes can provide valuable insight into finding new routes, RPR uses them to direct broadcasts toward the destination node. RPR can save a significant quantity of valuable network resources because only nodes near the optimal path will rebroadcast route requests.

KW - Flooding

KW - Mobile ad hoc networks

KW - Recycled path routing

KW - Route discovery

UR - http://www.scopus.com/inward/record.url?scp=33646433729&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646433729&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2005.10.018

DO - 10.1016/j.comcom.2005.10.018

M3 - Article

VL - 29

SP - 1552

EP - 1560

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 9 SPEC. ISS.

ER -