AODV 60 node work
2016-08-23
0 0 0
4.0
Other
Earn points
Application background
The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile networks. AODV is capable of both unicast and multicast routing. It is an on demand algorithm, meaning that it builds routes between nodes only as desired by source nodes. It maintains these routes as long as they are needed by the sources. Additionally, AODV forms trees which connect multicast group members. The trees are composed of the group members and the nodes needed to connect the members. AODV uses sequence numbers to ensure the freshness of routes. It is loop-free, self-starting, and scales to large numbers of mobile nodes protocol.using ns2Key Technology
AODV builds routes using a route request / route reply query cycle. When a source node desires a route to a destination for which it does not already have a route, it broadcasts a route request (RREQ) packet acro
aodv
工作
节点
Related Source Codes
Aodv source code, which can run simulation
0
0
no vote
AODV implementation
0
0
no vote
BS drag and drop workflow design and research sour
0
0
4.0
> MPS > MPS 107 - D08 > Trabalho Final
1
0
no vote
Trabajo ISG3
1
0
no vote
No comment