Distance vector routing

Ad-hoc On-Demand Distance Vector Routing
Charles E. Perkins Sun Microsystems Laboratories Advanced Development Group Menlo Park, CA 94025 [e-mail] Elizabeth M. Royer Dept. of Electrical and Computer Engineering University of California, Santa Barbara Santa Barbara, CA 93106 [e-mail] tery power, users are free to move about at their convenience without being constrained by wires. The idea of forming an on-the- y ad-hoc network of mobile nodes dates back to DARPA packet radio network days 11, 12 . More recently the interest in this subject has grown due to availability of license-free, wireless communication devices that users of laptop computers can use to communicate with each other. Several recent papers on this topic have focused on the algorithmic complexity of choosing the optimal set of ad-hoc routers 6, 8, 15 , while others have proposed new routing solutions 4, 7, 10, 14, 16, 18 leveraging features from the existing Internet routing algorithms. Interest within the Internet Engineering Task Force IETF is also growing as is evidenced by the formation of a new working group manet 5, 13  whose charter is to develop a solution framework for routing in ad-hoc networks. The manet working group has goals that are quite distinct from the goals of the IETF mobileip working group, and make little or no use of Mobile IP 20 or any of its forerunners e.g., 9, 22 . The Destination-Sequenced Distance Vector DSDV algorithm has been proposed 18 as a variant of the distance vector routing method by which mobile nodes cooperate to form an ad-hoc network. DSDV is e ective for creating ad-hoc networks for small populations of mobile nodes, but it is a fairly brute force approach because it depends for its correct operation on the periodic advertisement and global dissemination of connectivity information. Frequent system-wide broadcasts limit the size of ad-hoc networks that can e ectively use DSDV because the control message overhead grows