1

Enhancing the Performance of AODV Protocol Using Bi-Model Approach

1

Miss Rubia.G

Prof Mrs. Agnes Kalarani.X

[1] M.Phil, Research Scholar, Department of Computer Science, Karpagam University, Coimbatore, Tamilnadu. [2] Professor, Department of Computer Application, Karpagam University, Coimbatore, Tamilnadu [email protected], [email protected]

Abstract
An Ad hoc network is a connection of wireless mobile nodes dynamically forming a temporary network without use of any existing network infrastructure of centralized administration. Due to the limited transmission range of wireless network interfaces, multiple network hops may be required for one node to exchange data with another across the network. In recent years, a variety of new routing protocols targeted specifically at this environment have been developed. The widely used protocols are Dynamic source routing (DSR and Ad hoc On Demand Vector Routing protocol (AODV). Many ad hoc routing protocols are based on some variant of flooding. In these approaches many routing messages are propagated unnecessarily to all neighbor nodes. A new approach called Gossip approach, where each node forwards a message with some probability, is proposed to reduce the overhead of the routing protocols. The fraction of executions in which most nodes get the message depends on the gossiping probability and the topology of the network. The gossiping approach will be added to AODV protocol to have significant improvement on all standard metrics. The network simulator ns-2 is used to accurately model the particular wireless network and to analyze the performance. Index Terms Ad Hoc Networks, Dynamic Source Routing Flooding, Gossiping, AODV routing.

INTRODUCTION
Wireless networking is an emerging technology that allows users to access information and service electronically, regardless of their geographic position. A Mobile Ad hoc Network (MANET) consists of a set of wireless mobile nodes communicating with each other without use of any centralized control or fixed network infrastructure. MIT rooftop networks and sensor networks are two examples of networks that might be implemented using the ad hoc network technology. Ad hoc networks can be usefully deployed for communication in applications such as disaster relief, tether less classrooms and battlefield situations.There have been various routing protocols proposed for ad hoc networks. Most of these protocols are analyzed by two standard techniques

Fig.1. an Example of Ad hoc network. Many ad hoc routing protocols have been proposed. Such as LAR, GPSR, and DREAM assume that nodes are equipped with GPS hardware and thus know their locations. Others such as DSR, AODV, ZPR, and TORA do not make this assumption. Essentially all protocols that do not use

GPS make use of flooding, usually with some optimizations.

A. Table driven routing protocols B. Demand routing protocols 1) Destination sequenced distance vector routing (DSDV) DSDV is a hop by hop distance vector routing protocol requiring each node to periodically broadcast routing updates. The key advantage DSDV over traditional distance vector protocols is that guarantees loop freedom. Its memory requirement is very moderate and it guarantees loop free path at all instants. Each node maintains a routing table which contains entries for all the nodes in the network. Each entry consists of The destination address The number of hops required to reach the destination The sequence number as stamped by the destination 2) Dynamic Source Routing (DSR) The key distinguishing feature of DSR is the use of source routing. That is, the sender knows the complete hop by hop route to the destination. These routes are stored in a route cache. The data packets carry the source route in the packet header. When a node in the ad hoc network attempts to send a data packet to a destination for which it does not already know the route, it uses a route discovery process to dynamically determine such a route. 3) Ad Hoc On demand Distance vector routing (AODV) AODV shares DSRs on-demand characteristics in that it also discovers routes on an as needed basis via a similar route discovery process. However, AODV adopts a very different mechanism to maintain routing information. It uses traditional routing tables, one entry per destination. This is in contrast to DSR, which can maintain multiple route cache entries for each destination. Without source routing, AODV relies on routing table entries to propagate an RREP back to the source and, subsequently, to route data

AN OVERVIEW OF MOBILE NETWORKS

In an ad hoc network, if a message is transmitted by a node it is in fact usually sent as a broadcast rather than a point to point communication, and thus is received by the entire nodes one hop away from the sender. Because of the fact that wireless resources are expensive, it makes sense to take of this physical layer broadcasting feature of the radio transmission. In our gossiping protocol, we control the probability with which this physical layer broadcast is sent. We show by simulation that even in networks with small nodes only, adding gossiping to AODV can result in significant performance improvements on all standard metrics

Characteristics of MANETs
Ad Hoc networks can be used in situations where either there is no other there is no other wireless communication infrastructure present or where such infrastructure cannot be used because of security, cost, or safety reasons. Similarly, the nodes in the network can be added easily. The following are the characteristics of MANETs. Dynamic Topologies Energy constrained operation 3) Limited physical security
1) 2)

AD HOC NETWORK ROUTING PROTOCOLS

In ad hoc networks all nodes are mobile and can be connected dynamically in an arbitrary manner. Ad hoc networks are very useful in emergency search and rescue operations, meeting as or conventions in which persons wish to quickly share information, and data acquisition operations in inhospitable terrain. These ad hoc routing protocols can be divided in to two categories:

packets to the destination. AODV uses sequence numbers maintained at each destination to determine freshness of routing information and to prevent routing loops. All routing packets carry these sequence numbers. An important feature of AODV is the maintenance of timer based states in each node, regarding utilization of individual routing table entries.

IMPLEMENTATION OF AODV PROTOCOL

AODV is essentially a combination of both DSR and DSDV. It borrows the basis on-demand mechanism of Route Discovery and Route maintenance from DSR, plus the use of hop-by routing, sequence numbers, and periodic beacons from DSDV. A. Basic mechanisms Each node that participates in forwarding this REPLY back toward the originator of RREQ creates forward route to Destination D. The state created in each node along the path from S to D is hop-by-hop state. When a link goes down, any upstream node that has recently forwarded packets to a destination using that link is notified by an UNSOLICITED ROUTE REPLY containing infinite metric for that destination. Upon receipt of such ROUTE REPLY, a node must acquire a new route to the destination using ROUTE DISCOVERY. B. Simulation models The overall goal of experiments was to measure the ability of the routing protocols to react to network topology change while continuing to successfully deliver data packets to their destinations. To measure this ability, basic methodology was to apply to a simulated network a variety of workloads, in effect testing with each data packet originated by some sender whether the routing protocol can at that time route to the destination of that packet.

There has been some recent work on applying gossiping in ad hoc networks. Vahdat and Becker apply gossiping to ad hoc unicast routing. In the previous works, the protocols tried to ensure that messages are eventually delivered even if there is no connected path between the source and the destination at any given point in time. As long as there exists a path using communication links at some point in time, messages can be delivered through a random pair-wise exchanges among mobile hosts. These techniques would not perform well in all multicast routes. A. The bimodal behavior of gossiping Since flooding is a basic element in many of the ad hoc routing protocols, we start by comparing gossiping to flooding. Our basic gossiping protocol is simple. A source sends the route request with probability 1. When a node first receives a route request, with probability p it broadcasts the request to its neighbors and with probability 1 p it discards the request; if the node receives the same route request again, it is discarded. Thus, a node broadcasts a given route request at most once. This simple protocol is called GOSSIP1 (p).GOSSIP1 has a slight problem with initial conditions. If the source has relatively few neighbors, there is a chance that none of them will gossip, and the gossip will die. To make sure this does not happen, we gossip with probability 1 for the first k hops before continuing to gossip with probability p. We call this modified protocol GOSSIP1 (p, k). The performance of GOSSIP1 (p, k) clearly depends on the choice of p and k. Clearly, GOSSIP1 (1, 1) is equivalent to flooding.

INTRODUCTION TO GOSSIPING

Fig.3. Flooding process If the gossiping is considered as spreading a disease in an epidemic, this simply says that the

likelihood of an epidemic spreading depends in part on how many people each person can infect (the degree), the likelihood of the infection spreading (the gossip probability), and how many people are initially infected. Gossiping GOSSIP1 (p, 0) is the scenario where even the source gossips with probability p. B. Incorporating gossiping in AODV Regular networks may allow us to easily analyze how GOSSIP1 and may respond to different parameters, such as the gossip probability. In random networks, nodes are placed at random on a twodimensional area. These networks can be easily represented by regular and random graphs respectively. An edge is placed between any pair of nodes less than a fixed distance d apart. Random graph seems appropriate for modeling a number of applications involving ad hoc networks. Gossiping really depends on issues like the network topology, mobility, and how frequently messages are generated. Larger networks with high mobility many of the optimizations will be much less effective. Gossiping can provide significant advantages even in small networks. To test the impact of gossiping, we considered AODV, one of the best-studied ad hoc routing protocols in the literature. We compare pure AODV that use flooding to a variant of AODV that uses gossiping. We do not have the resources to simulate the protocols in large networks.

REFERENCES
[1] Zygmunt J.Haas, Senior member, IEEE, Joseph Y.Halpern, Senior member, IEEE: Gossip Based Ad Hoc Routing, IEEE Transactions on networking, Vol.14, No.3, June 2006. [2] K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Transactions on Computer Systems, 17(2):4188, May 1999. [3] R. Chandra, V. Ramasubramanian, and K. Birman. Anonymous gossip: Improving multicast reliability in mobile ad-hoc networks. In Proc. 21st International Conference on Distributed Computing Systems (ICDCS), pages 275283, 2001. [4] S.R. Das, C. E. Perkins, and E. M. Royer. Performance comparison of two on-demand routing protocols for ad hoc networks. In Proc. IEEE Conference on Computer Communications (INFOCOM), pages 312, March 2000. [5] G. Grimmett. Percolation. Springer-Verlag, New York, NY, 1989. [6] P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, IT-46(2):388404, 2000.

CONCLUSION
In this paper, the performance metrics considered are, Packet delivery ratio, Routing overhead and Path optimality. Since flooding and looping affect the performances of routing protocol, new approach known as Gossiping is used to avoid these problems. The simulation of pure AODV protocol will be done first. Then, the Gossiping will be incorporated with the AODV and simulated. The performance of both simulated protocols will be analyzed using performance graphs.

RESULTS OBTAINED