Describe: this software provides a routing ns AODV the latest code. Welcome to the study of AD HOC share.

File list(time 2004091016~2009020902)(Click to check if it's the file you need, and recomment it at the bottom):
  aodv
  ....\aodv.c
  ....\aodv.h
  ....\aodv.o
  ....\aodv.rar
  ....\aodv.tcl
  ....\aodv_logs.cc
  ....\aodv_logs.o
  ....\aodv_packet.h
  ....\aodv_rqueue.c
  ....\aodv_rqueue.h
  ....\aodv_rqueue.o
  ....\aodv_rtable.c
  ....\aodv_rtable.h
  ....\aodv_rtable.o

 Downloaders recently:  ftyszyx [More information of uploader yanfengguan]

 To Search: aodv ad hoc ns aodv ns ad hoc ns2 fading tar.gz files ns-edcf 

 [rayleigh_fading.zip] - of wireless communications channel for the Rayleigh fading MATLAB simulation
 [puma-11-30-08.zip] - Multicast Routing Protocol, under ns2.30 ~ 2.32 in the compiler, they can be used to ns2.33 version.
 [wincs.rar] - zigbee routing algorithm uses aodv (Ad hoc On Demand Distance Vetor) algorithm. Each router maintaining a routing table, and regularly with its neighb

 [10291_group_ADhoc_wireless_network_topology_contro] - ADhoc networks for wireless Ad Hoc network topology control
 [NIST_aodv_Programming_Guide.rar] - NIST aodv procedures and functions of the variables the following information for the general post attachments option: [information written time]: [La
 [router.rar] - zigbee protocol stack, network layer of the source, for the development of zigbee protocol stack on the value of the very moment, after all, a great n
 [kernel-aodv_v2.2.2.rar] - opnet- wireless mobile AD hoc networks routing protocol code-aodv- Simulation source
 [on-demandmobileadhocnetworkroutingprotocols] - d hoc mobile network is a fully mobile host of a network. Network topology variable bandwidth, energy is limited ad hoc mobile networks, the main feat
 [DSR.zip] - MANET working group recommended the use of the ns2 simulation software to simulate on the DSR, the number of nodes from the source, packet sent freque
 [DistanceVector_Routing.rar] - Distance Vector Routing, also known as the Bellman-Ford shortest path algorithm. The basic idea is : Each router (routing nodes) has maintained a rout