Ad-hoc On-Demand Distance Vector Routing-英文文献.pdf

Ad-ho c On-Demand Distance Vector Routing Charles E. Perkins Elizab eth M. Royer Sun Microsystems Lab oratories Dept. of Electrical and Computer Engineering Advanced Development Group University of California, Santa Barbara Menlo Park, CA 94025 Santa Barbara, CA 93106 cp erkins@ eroyer@ Abstract tery p ower, users are free to move ab out at their con- venience without b eing constrained by wires. A n ad-ho c network is the cooperative engagement of The idea of forming an on-the- y ad-ho c network of a col lection of mobile nodes without the required inter- mobile no des dates back to DARPA packet radio net- vention of any centralized access point or existing in- work days [11 , 12]. More recently the interest in this fr astructure. In this paper we present Ad-hoc On De- sub ject has grown due to availability of license-free, mand Distance Vector Routing (AOD V), a novel algo- wireless communication devices that users of laptop rithm for the operation of such ad-hoc networks. Each computers can use to communicate with each other. Mobile Host operates as a specialized router, and routes Several recent pap ers on this topic have fo cused on the are obtained as needed (i.e., on-demand) with little algorithmic complexity of cho osing the optimal set of or no reliance on periodic advertisements. Our new ad-ho c routers [6, 8, 15], while others have prop osed routing algorithm is quite suitable for a dynamic self- new routing solutions [4 , 7, 10, 14, 16, 18] leverag- starting network, as