<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.perkins-manet-aodvbis" target="https://datatracker.ietf.org/doc/html/draft-perkins-manet-aodvbis-01">
   <front>
      <title>Ad hoc On-Demand Distance Vector (AODV) Routing</title>
      <author initials="C. E." surname="Perkins" fullname="Charles E. Perkins">
         <organization>Nokia Research Center</organization>
      </author>
      <date month="February" day="12" year="2004" />
      <abstract>
	 <t>The Ad hoc On-Demand Distance Vector (AODV) routing protocol
is intended for use by mobile nodes in an ad hoc network.  It
offers quick adaptation to dynamic link conditions, low processing
and memory overhead, low network utilization, and unicast route
determination to destinations within the ad hoc network.  It uses
destination sequence numbers to ensure loop freedom at all times
(even in the face of anomalous delivery of routing control messages),
avoiding problems (such as ``counting to infinity&#x27;&#x27;) associated with
classical distance vector protocols.
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-perkins-manet-aodvbis-01" />
   
</reference>
