A cross-layer implementation of Ad hoc On-demand Distance Vector routing (AODV) protocol

Mobile Ad hoc Networks (MANETs) are networks which will form the basis for the ubiquitous data access because of their ease of deployment. Due to the dynamic nature of a MANET, routing is one of the most critical elements of MANET. Routing protocols for MANET can be broadly classified as a proactive routing protocol or a reactive routing protocol. In the proactive routing protocols, mobile nodes periodically exchange routing information among themselves. Hence proactive routing protocols generate high overhead messages in the network. On the other hand, reactive routing protocols work on-demand. Thereby generating less number of overhead messages in the network compared to proactive routing protocols. But reactive routing protocols use a global search mechanism called \u27flooding\u27 during the route discovery process. \u27Flooding\u27 generates a huge number of overhead messages in the network. Those overhead messages affect the performance of reactive routing protocols in term of network throughput. That kind of performance problem is called \u27scaling\u27 problem. Ad hoc On-demand Distance Vector Routing with Cross-Layer Design (AODV-CL) protocol has been proposed to solve this scaling problem. The AODV routing protocol has been modified to implement AODV-CL protocol. AODV-CL protocol reduces \u27flooding\u27 problem of reactive routing protocols by limiting the number of nodes that should participate in route discovery process based on their status in the network and also avoiding congested area of the network. It is shown that AODV-CL protocol reduces overhead messages by 73% and reduces end-to-end delay per packet by 32% compared to regular AODV protocol. I

Internet connectivity for mobile Ad Hoc networks

Ad hoc networking allows portable devices to establish communication independent of a central infrastructure. However, the fact that there is no central infrastructure and that the devices can move randomly gives rise to various kind of problems, such as routing and security. In this thesis the problem of routing is considered. There are several ad hoc routing protocols, such as AODV, DSR, OLSR and ZRP, that propose solutions for routing within a mobile ad hoc network. However, since there is an interest in communication between not only mobile devices in an ad hoc network, but also between a mobile device in an ad hoc network and a fixed device in a fixed network (e.g. the Internet), the ad hoc routing protocols need to be modified. In this thesis the ad hoc routing protocol AODV is used and modified to examine the interconnection between a mobile adhoc network and the Internet. For this purpose Network Simulator 2, ns2, has been used. Moreover, three proposed approaches for gateway discovery are implemented and investigated. The goal of the thesis project is twofold: • To modify the source code of AODV in accordance with the Internet draft\Global connectivity for IPv6 Mobile Ad Hoc Networks " which presents a solution where AODV is used to provide Internet access to mobile nodes. • To implement and compare di®erent approaches for gateway discovery. In this thesis, three di®erent type of gateway discovery have been taken: • The proactive gateway discovery is initiated by the gateway itself. The gateway periodically broadcasts a gateway advertisement message which is transmitted after expiration of the gateways timer. The time between two consecutive advertisements must be chosen with care so that the network is not °ooded unnecessarily. All mobile devices residing in the gateways transmission range receive the advertisement and update information about gateway. After receiving advertisement, a mobile device just forward it broadcast it again. This process goes on within entire MANET. • In reactive gateway discovery a mobile device of MANET connects by gateway only when it is needed. For that the mobile device broadcasts request message to the ALL MANET GW MULTICAST address (the IP address for the group of all gateways in a mobile ad hoc network). Thus, only the gateways are addressed by this message and only they process it. Intermediate mobile nodes that receive the message just forward it by broadcasting it again up to gateway. • To minimize the disadvantages of proactive and reactive gateway discovery, the two approaches can be combined. This results is a hybrid gateway discovery. For mobile devices in a certain range around a gateway, proactive gateway discovery is used. Mobile devices residing outside this range use reactive gateway discovery to obtain information about the gateway. In comparing theses di®erent gateway discovery, three matrices are used. These are packet delivery ratio,average end-to-end delay and overhead. In case of proactive gateway discovery and hybrid gateway discovery, value of packet delivery ratio is larger than reactive gateway discovery. In case of proactive gateway discovery and hybrid gateway discovery, value of end to end delay is less than reactive gateway discovery. The overhead of proactive gateway discovery is greater than other two gateway discovery As for the average end-to-end delay, the proactive and hybrid methods perform slightly better than the reactive method. Concerning the routing overhead, when the advertisement interval is short the reactive method generates much less overhead than the proactive method, which in turn generates much less overhead than the hybrid method

Minimizing the Overhead caused due to dynamic nodes in Mobile Ad-hoc Networks using Zone routing protocol

Opportunistic data forwarding has become a interesting topic in the multi-hop wireless networking. Opportunistic data forwarding is not used in mobile ad hoc networks (MANETs) due to the lack of an efficient lightweight proactive strong source routing scheme. Proactive Source Routing uses Breadth First Spanning Trees (BFSTs) and maintains more network topology information to facilitate source routing. Although it has greatly reduced overhead than traditional link state (LS)-based routing protocols and reactive source routing protocols, the computational and memory overhead involved in maintaining BFSTs to reach every node in the denser networks will be high. In this paper Zone-based Proactive Source Routing Protocol is proposed. Zone routing protocol (ZRP) uses partition based routing. The ZRP make use of source routing inside a zone and on-demand routing outside the zone. This approach combines the advantages of both proactive and zone based routing protocols. The simulation shows that the Z-PSR i.e. zone based proactive source routing protocol performs better compared to PSR

Signature and Database Exchange for Wireless OSPF Interfaces

In this paper, we specify a mechanism for link-state database exchanges in wireless ad-hoc networks. The mechanism is taylored for ad-hoc networks employing the wireless OSPF interface extension specification , however is suitable for any proactive link-state routing protocol.The database exchange mechanism is specified with the following applications in mind: \begin{itemize} reliable diffusion of link-state information, replacing OSPF acknowledgements with a mechanism, suitable for mobile wireless networks; reduced overhead for performing OSPF style database exchanges in a mobile wireless network; reduced initialization time when new node(s) are emerging in the network; reduced overhead and reduced convergence time when two (or more) WOSPF adhoc network clouds merge. \end{itemize

Making On-Demand Routing Efficient with Route-Request Aggregation

In theory, on-demand routing is very attractive for mobile ad hoc networks (MANET), because it induces signaling only for those destinations for which there is data traffic. However, in practice, the signaling overhead of existing on-demand routing protocols becomes excessive as the rate of topology changes increases due to mobility or other causes. We introduce the first on-demand routing approach that eliminates the main limitation of on-demand routing by aggregating route requests (RREQ) for the same destinations. The approach can be applied to any existing on-demand routing protocol, and we introduce the Ad-hoc Demand-Aggregated Routing with Adaptation (ADARA) as an example of how RREQ aggregation can be used. ADARA is compared to AODV and OLSR using discrete-event simulations, and the results show that aggregating RREQs can make on-demand routing more efficient than existing proactive or on-demand routing protocols

Analysis and Modeling Experiment Performance Parameters of Routing Protocols in MANETs and VANETs

In this paper, a framework for experimental parameters in which Packet Delivery Ratio (PDR), effect of link duration over End-to-End Delay (E2ED) and Normalized Routing Overhead (NRO) in terms of control packets is analyzed and modeled for Mobile Ad-Hoc NETworks (MANETs) and Vehicular Ad-Hoc NETworks (VANETs) with the assumption that nodes (vehicles) are sparsely moving in two different road. Moreover, this paper contributes the performance comparison of one Proactive Routing Protocol; Destination Sequenced Distance vector (DSDV) and two reactive protocols; DYnamic Source Routing (DSR) and DYnamic MANET On-Demand (DYMO). A novel contribution of this work is enhancements in default versions of selected routing protocols. Three performance parameters; PDR, E2ED and NRO with varying scalabilities are measured to analyze the performance of selected routing protocols with their original and enhanced versions. From extensive simulations, it is observed that DSR outperforms among all three protocols at the cost of delay. NS-2 simulator is used for simulation with TwoRayGround propagation model to evaluate analytical results

Game theoretic approach in routing protocols for wireless mobile ad hoc networks

Mobile Ad hoc Networks (MANETs) are becoming popular as a means of providing communication among a group of people. Because of self-configuring and self-organizing characteristics, MANETs can be deployed quickly. There is no infrastructure defined in the network, therefore all of the participating nodes relay packets for other nodes and perform routing if necessary. Because of the limitations in wireless transmission range, communication links could be multi-hop. Routing protocol is the most important element of MANET. Routing protocols for MANET can broadly be classified as proactive routing protocol and reactive routing protocol. In proactive routing protocols like Destination Sequence Distance Vector (DSDV), mobile nodes periodically exchange routing information among themselves. Hence proactive routing protocols generate high overhead messages in the network. On the other hand, reactive routing protocols like Ad hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) work on-demand. Hence reactive routing protocols generate fewer number of overhead messages in the network compared to proactive routing protocols. But reactive routing protocols use a global search mechanism called flooding during the route discovery process. By flooding mechanism a source node can discover multiple routes to a destination. Flooding generates a large number of overhead packets in the network and is the root cause of scaling problem of reactive routing protocols. Hierarchical Dynamic Source Routing (HDSR) protocol has been proposed in this dissertation to solve that scaling problem. The DSR protocol has been modified and optimized to implement HDSR protocol. HDSR protocol reduces the flooding problem of reactive routing protocols by introducing hierarchy among nodes. Two game theoretic models, Forwarding Dilemma Game (FDG) and Forwarding Game Routing Protocol (FGRP), is proposed to minimize the \u27flooding\u27 effect by restricting nodes that should participate in route discovery process based on their status. Both FDG and FGRP protocols reduce overhead packet and improve network performances in terms of delay packet delivery ratio and throughput. Both protocols were implemented in AODV and the resulting protocol outperformed AODV in our NS-2 simulations. A thorough connectivity analysis was also performed for FDG and FGRP to ensure that these protocols do not introduce disconnectivity. Surprisingly, both FDG and FGRP showed better connectivity compared to AODV in moderate to high node density networks

ANALISIS PERFORMANSI METODE PENCARIAN GATEWAY DENGAN AD HOC ON-DEMAND DISTANCE VECTOR (AODV)PADA JARINGAN MOBILE NETWORK

ABSTRAKSI: Jaringan mobile ad hoc (MANET) dapat dibangun antar peralatan mobile di dalam suatu area tanpa mengharuskan adanya infrastruktur tetap semacam router dan base station. Salah satu protokol ruting untuk jaringan mobile ad hoc yang berkembang adalah Ad hoc On-Demand Distance Vector (AODV). Muncul ketertarikan untuk mengkoneksikan MANET dengan fixed network melalui gateway, yang berfungsi sebagai jembatan penghubung antar mobile node dengan fixed host. Sebelum berkomunikasi tentunya mobile node harus bisa menemukan gateway tersebut, oleh karena itu metode pencarian gateway mutlak diperlukan. Metode pencarian gateway meliputi tiga metode yaitu reaktif, proaktif dan hybrid.Tiap metode pencarian gateway diuji dengan parameter jaringan yang berbeda-beda seperti pertambahan jumlah pengirim, perubahan kecepatan mobile node, interval waktu kirim paket dan interval ruting message. Hasil dari simulasi metode pencarian gateway tersebut dianalisis berdasarkan nilai performansi packet delivery ratio, AODV overhead, average end to end delay, dan throughput.Dari hasil simulasi, metode proaktif dan hybrid menawarkan paket delivery ratio dan throughput yang lebih baik dari metode reaktif. Namun nilai AODV overhead yang besar pada metode proaktif menjadi beban di jaringan. Pengaruh efektifitas AODV ruting message akan menentukan seberapa besar nilai end to end delay yang diperoleh. Pertimbangan pemilihan metode pencarian gateway sangat terpengaruh parameter pengujian yang dilakukan.Kata Kunci : Routing protocol ad hoc, gateway discoveryABSTRACT: Mobile Ad hoc Network (MANET) could be established between mobile devices in certain area without fixed infrastructure like router or base station. One of routing protocols that have been developed is Ad hoc On Demand Distance Vector (AODV). There is interested to connecting MANET with fixed network across gateway, this gateway has function as bridge between mobile node and fixed host. Mobile node must find gateway address before have connectivity between MANET and Fixed network. For that reason, gateway discovery mechanism absolutely needed. Gateway discovery mechanism offers three way, reactive, proactive and hybrid method.For each gateway discovery mechanism tested with different network parameter like number of mobile node sender, velocity changes, packet sending interval, and routing message interval. From the simulation, the result will analyze by performance metric like packet delivery ratio, AODV overhead, Average end to end delay, and throughput.From the simulation, proactive and hybrid mechanism offer higher packet delivery ratio and throughput than reactive. However, AODV overhead in proactive have higher value and can lead constrain in networks. The effectively of AODV routing message will decide how large end to end delay in gateway discovery mechanism. The consideration of gateway discovery mechanism that chosen, influenced by testing parameters.Keyword: Routing protocol ad hoc, gateway discover

Energy Efficient Location Aided Routing Protocol for Wireless MANETs

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.Comment: 9 Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423, http://sites.google.com/site/ijcsis