@techreport{perkins-manet-aodvbis-01,
    number =    {draft-perkins-manet-aodvbis-01},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-perkins-manet-aodvbis/01/},
    author =    {Charles E. Perkins},
    title =     {{Ad hoc On-Demand Distance Vector (AODV) Routing}},
    pagetotal = 29,
    year =      2004,
    month =     feb,
    day =       12,
    abstract =  {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'') associated with classical distance vector protocols.},
}