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
AN - SCOPUS:33646433729
SN - 0140-3664
VL - 29
SP - 1552
EP - 1560
JO - Computer Communications
JF - Computer Communications
IS - 9 SPEC. ISS.
ER -