Artículos relacionados a Ad hoc On-Demand Distance Vector Routing: Mobile ad...

Ad hoc On-Demand Distance Vector Routing: Mobile ad hoc network, Wireless ad hoc network, University of California, Santa Barbara, University of Cincinnati, Unicast, Multicast - Tapa blanda

 
9786130888275: Ad hoc On-Demand Distance Vector Routing: Mobile ad hoc network, Wireless ad hoc network, University of California, Santa Barbara, University of Cincinnati, Unicast, Multicast

Sinopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad-hoc networks. It is jointly developed in Nokia Research Center, University of California, Santa Barbara and University of Cincinnati by C. Perkins, E. Belding-Royer and S. Das. AODV is capable of both unicast and multicast routing. It is a reactive routing protocol, meaning that it establishes a route to a destination only on demand. In contrast, the most common routing protocols of the Internet are proactive, meaning they find routing paths independently of the usage of the paths. AODV is, as the name indicates, a distance-vector routing protocol. AODV avoids the counting-to-infinity problem of other distance-vector protocols by using sequence numbers on route updates, a technique pioneered by DSDV. For other alternatives see the Ad hoc routing protocol list.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad-hoc networks. It is jointly developed in Nokia Research Center, University of California, Santa Barbara and University of Cincinnati by C. Perkins, E. Belding-Royer and S. Das. AODV is capable of both unicast and multicast routing. It is a reactive routing protocol, meaning that it establishes a route to a destination only on demand. In contrast, the most common routing protocols of the Internet are proactive, meaning they find routing paths independently of the usage of the paths. AODV is, as the name indicates, a distance-vector routing protocol. AODV avoids the counting-to-infinity problem of other distance-vector protocols by using sequence numbers on route updates, a technique pioneered by DSDV. For other alternatives see the Ad hoc routing protocol list.

"Sobre este título" puede pertenecer a otra edición de este libro.