Performance Evaluation of Scalable Ad-Hoc Network Using Dynamic Address Routing (DART)

In this paper we develop a scalable network layer routing protocol for mobile ad hoc networks and also compared the Dynamic Address Routing (DART) performances like overhead and throughput with respect to network size and dataflow with the existing Protocol. Dynamic Address Routing (DART) addresses this scalability problem by separating the address of a node into two separate numbers: a) a unique and static node identifier, serving the same purpose as today's IP addresses and b) a dynamic routing address, which indicates the node's current position in the network topology. The use of dynamic routing addresses creates an opportunity for route aggregation which in the case of DART, greatly improves scalability. The paper describes the method of address allocation, which executes locally on each node, and relies only on routing updates from immediate neighbors to select an available and accurate routing address. Dynamic Address Routing (DART) does not require any geographical location information, nor does it make any assumption as to the underlying medium. Wireless Omni directional links, as well as directional and even wired links are supported equally well. In addition, nodes participating in a DART network do not require any manual network configuration, making Dynamic Address Routing (DART) a strong candidate for future mesh networking applications in additional to current ad hoc networking applications. The simulations for different scenarios are run and compared graphs are obtained. The analysis of these graphs shows the increase in number of Flows and network size the reduction in the overhead of the network. It is also shown by the graphs that the overall throughput of the network is increased.