Routing table maintenance in mobile ad hoc networks

Authors:
Seungjin Park;Seong-Moo Yoo
Affiliations:
Department of Management, MIS, and CS, University of Southem Indiana;Department of Electrical and Computer Engineering, The University of Alabama in Huntsville
Venue:
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Year:
2010

Citing 5
Cited 1

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Route Maintenance in a Wireless Mobile Ad Hoc Network

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Ad Hoc Networking

Ad Hoc Networking

Hash caching mechanism in source-based routing for wireless ad hoc networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the mobility of the nodes, finding routes in a wireless mobile ad hoc network is quite a challenging task, and takes up a lot ofsystem resourcessuch as bandwidth and battery power. Although it would be wise to take full advantage ofthe already discovered paths, many algorithms simply discard the paths if their topology has changed. To overcome this shortcoming, we have proposed a routing table maintenance algorithm that responds to the changes in network topology promptly, and adjusts the paths so that their lifetimes could be maximized.