JOURNAL OF COMPUTING, VOLUME 4, ISSUE 1, JANUARY 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.

ORG

56

Performance Analysis of AODV+ Over Mac Layer Based on Throughput

Rahul Malhotra, Sangeeta Monga, and Kamaljeet Kaur
Abstract The AODV is an adhoc on demand distance vector routing protocol; this protocol is a reactive protocol means the source node sends the data to the destination node. It maintains routes of each node and reduces overhead. The scenario that designed in this paper, the source node sends the data to the destination node with communicating with host. When the destination node had not on its network, then a gateway communicated with other gateway that is technique by nodes communicating over nodes in the Internet. The scenario designed in this dissertation has wired cum wireless network by using network simulator (NS2) in 802.11 and using various scripts to calculate the performance on the MAC Layer.

Index TermsAODV; NS2; MANET

1 INTRODUCTION
etwork is series of nodes interconnected by communication media. Network is basically of two types: wired network and wireless network. Wired network uses the fixed arrangement of devices but in wireless network devices can move in any direction within some communication range. Wireless network are further divided into two classes: Fixed infrastructure network and adhoc network. Fixed infrastructure network uses central controller to control nodes within network [7]. But in adhoc network all the nodes act as router and having no access point in network. To transfer data from one node to other node we need routing protocols. Routing is the process of moving information from source to destination in an internetwork. In MANET there are many problems related to routing like dynamic topology change and interference. There two types routing protocols: proactive routing and reactive routing. Proactive routing keeps the routing information even after its use. Reactive routing keeps the information about present link only.

Dijktsa algorithm is also known as single source shortest path. AODV makes sure that route do not contains loops and tries to find shortest route possible. AODV is also able to handle changes in routes and can create new route. It uses HELLO messages to track neighbors. In AODV RREQ message RREQID is used to identify the originating nodes IP address. Every route table entry at every node must include the latest information available about the sequence no for the IP address of destination node for which route table entry is maintained [10].

1.2 AODV+ Protocol

AODV is modified to support mobile devices in network to communicate with fixed devices in Internet. This modified addition if AODV is known as AODV+ [27]. For the Internet access AODV+ has to discovery gateway. This gateway discovery is classified into three types: Pro-active gateway discovery, Reactive gateway discovery and Hybrid gateway discovery. In pro-active gateway discovery, gateway periodically broadcast a gateway advertisement (GWADV) message to all the mobile nodes. The mobile node that receives the advertisement creates a route entry for the gateway and then sends the acknowledgment back to gateway. To avoid duplication of advertisement GWADV ID Field is used with message .In reactive gateway discovery process is initiated by mobile nodes. This mobile node broadcast RREQ message to all nearby gateway. Intermediate mobile nodes are not allowed to process RREQ message. When RREQ message is received by gateway it unicasts the RREP to mobile nodes.

1.1 AODV Protocol

Adhoc on demand routing protocol is a reactive routing protocol to discover and to maintain route for adhoc network. Reactive routing do not maintain routing information at network nodes if there is no communication. AODV determines the route only when nodes have data for transmission [8]. Each node has multiple paths to destination but node has to select only one best path based upon shortest distance from transmitter to receiver. AODV uses various messages like RREQ and RREP. RREQ is a route request message, which is broad cast to all nearby nodes to find out destination. Destination sends back a route reply to source

2 PREVIOUS WORK
Many protocols like AODV, DSR, OLSR has been proposed by IIETF but these protocols were designed to work with single autonomous system so we need to modify these protocols to work with Internet. Javad Akari modified the AODV to work with wide devices [10]. All the gateway discovery methods are compared by SS.MCANE using NS2.This protocols are not sufficient for connectivity of mobile devices with Internet. Aim of this paper is to improve the AODV connectivity to wired network using gateway.

F.A. Rahul Malhotra is with Adesh Institute of Engineering & Technology, Faridkot. S.B. Sangeeta Monga is with Adesh Institute of Engineering & Technology, Faridkot. T.C. Kamaljeet Kaur is with Adesh Institute of Engineering & Technology, Faridkot.

using reuse path. We can find shortest path from source to destination using Dijktsa algorithm.

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 1, JANUARY 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG

57

3 SCENARIO USED IN AODV+

5. RESULTS
5.1. Throughput of sending packets

Figure1.1: Scenario of AODV+ networks

In this scenario the mobile node 5 is a source node communicating with host, the green circle represents the active node. The source node (MN5) starts at 0.5 ms and communicating with host 0 at 1 ms. the protocol in this scenario is UDP for transmitting both video and data over the networks. This scenario work on reactive AODV protocol and the approach comes under wired cum wireless networks.

Figure 1.2: Throughput of sending Packets

4. AODV+ STATISTICS
This scenario provides a user to Internet connectivity between nodes, host and their gateways. The simulation statistics has been calculated by using trace graph tool with support of Mat lab library files. TABLE 1 AODV + SIMULATION STATISTICS

Throughput measures the data rate at which information is exchanged in the network. The throughput high at the time interval length of 4; where the throughput of sending rate is zero as shown in figure 1.2. The simulation time IS approximately 1T to 28ms (milliseconds) because of noise and disconnection of mobile nodes. The simulation time interval length of sending rate is fluctuated at every 1 or 2 ms due to noise factor and every disconnection of mobile node due to the disadvantage of wireless connections.

5.2. Throughput of receiving packets

S.No. 1 2 3 4 5 6 7

Parameter Topology Area Number of mobile stations Transmission range Number of gateways Data rate Packet size Simulation Time

Value 500 meter x 500 meter 5 250 ms 1 2 Mbps 512 Bytes 60 seconds
Figure 1.3: Throughput of receiving Packets

The figure 1.3 shows that the efficiency of AODV+ protocol increases with minimum loss of the packets over the wireless networks. The straight line represents the minimum loss of the packets. As figure 1.3 shows when mobile node 5 sends the data to the other nodes then no retransmission of the packets and queue at the receiver end is maintained.

6 CONCLUSION
The performance of the AODV+ protocols is high at time interval length of 4, where the throughput of sending rate is zero at simulation time approximately 13 to 28ms because of noise and disconnection of mobile nodes. Throughput of receiving packets of AODV+ protocol increases with minimum loss of the packets over the wireless network. The packet receive time of receiver increases with increase in id of receive packets. AODV+ methodology observe that there are more

JOURNAL OF COMPUTING, VOLUME 4, ISSUE 1, JANUARY 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG

58

applications in which adhoc networks are integrated with other wireless networks.

7 FUTURE WORK
Although adhoc networks have been well studied, there are challenges for future research. Our analysis reveals interesting properties that are not captured by the frequently used grid, uniform, and RWMs: node degree distribution and average node degree differ significantly; bridges and articulation points in real networks are common, which can negatively impact multipath routing or optimistic routing protocols. Generated network traffic is not distributed equally over all participating nodes, and the amount of generated traffic also exceeds the typical simulation scenarios.

REFRENCES
[1] [Lin 2000] Lin, C. R.; Liu, C.-C., "An on-demand QoS routing protocol for mobile ad hoc networks", Conference on IEEE International Networks, 2000. (ICON 2000). Proceedings, , 5-8 Sept. 2000, pages: 160 164. [Perkins1999] Perkins C.E.; Royer, E.M.; "Ad hoc on demand distance vector routing", Second IEEE Workshop on Mobile Computing and Applications, 1999, Proceedings. WMCSA '99, pages 90-100. K-B. Lee, G.-S. Ahn, X. Zhang, A. T. Campbell, INSIGNIA: an IP-based quality of service framework for mobile ad hoc network, Journal of Parallel and Disrribured Comphng, vol. 60, Apr. 2000, pp. 374-406. L.C. Pond and V. OK. Li, A distributed time-slot assignment protocol for mobile multi-hop broadcast radio networks, Proc. IEEE MILCOM89, Boston, USA, Oct. 1989, pp. 70-74. Reznik and S. Verdu, On the Transport Capacity of a Broadcast Gaussian Channel, in proceedings of Communications in Information and Systems, vol. 2, no. 2,September 2002. ,pp. 157-190 Lin, C. R. and Liu, J. S., "QoS Routing in Ad Hoc Wireless Networks," IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8,1999, pp. 14261438. H.-K. Wu and P.-H. Chuang, Dynamic QoS Allocation for Multimedia Ad hoc Wireless Networks, Mobile Networks and Apps. vol. 6, 2001, pp. 37784. W.-H. Liao, Y.-C. Tseng, K.-P. Shih, A TDMA-based Bandwidth Reservation Protocol for QoS Routing in a Wireless Mobile Ad Hoc Network, Proceedings of the IEEE International Conference on Communications (ICC), vol.5, 2002, pp. 31863190. Wen-Hwa Liao, Yu-Chee Tseng, Kuei-Ping Shih, "A TDMA-based Bandwidth Reservation Protocol for QoS Routing in a Wireless Mobile Ad Hoc Network, IEEE International Conference on Communications, vol. 52002, pp. 3186 3190. Javad Akbari Torkestani, Mohammad Reza Meybodi, Mobility-based Multicast Routing Algorithm for Wireless Mobile Ad-hoc Networks: A Learning Automata Approach, Computer Communications, vol.33 no.6, April, 2010, pp.721-735. Justin Lipman, Hai Liu, and Ivan Stojmenovic, " Broadcast in Ad Hoc Networks", Springer, 2009, page(s): 121 150. Lin, C.R., "On-Demand QoS Routing in Multihop MobileNetworks," Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3, 2001, pp. 1735-1744.

[2]

[3]

[4]

[5]

[6]

[7] [8]

[9]

[10]

[11] [12]