An effective path recovery mechanism for AODV using candidate node

Authors:
Sang-min Lee;Keecheon Kim
Affiliations:
Dept, of Computer Science & engineering, Konkuk University, Seoul, Korea;Dept, of Computer Science & engineering, Konkuk University, Seoul, Korea
Venue:
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Year:
2006

Citing 3
Cited 0

A distance routing effect algorithm for mobility (DREAM)

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an effective path recovery scheme for AODV in mobile ad-hoc network environment. Even though the existing path recovery scheme for AODV routing protocol can recover the disconnected path in some ways, however, they can not utilize the pre-connected routing nodes when we handle the nodes in Ad-hoc environment. In order to utilize the pre-connected routing nodes in recovering the path more effectively, we use a designated candidate nodes. The candidate nodes are used to recover the disconnected path using the pre-connected routing information. This scheme produces better results with less control packets with faster path recovery time.