Optimizing ad-hoc on-demand distance vector (AODV) routing protocol using geographical location data

This thesis summarizes the body of research regarding location-aided routing protocols for mobile ad-hoc networks (MANET). This study focuses on the use of geographical location information to reduce the control traffic overhead caused by the route discovery process in the ad-hoc on-demand distance vector (AODV) routing protocol. During this process, AODV will flood the entire network with route request packets. This introduces significant packet-handling overhead into the network. This thesis introduces Geographical AODV (GeoAODV), which uses geographical location information to limit the search area during the route discovery process to include only promising search paths. Also, this thesis benchmarks GeoAODV\u27s performance against Location Aided Routing (LAR) and examines four mechanisms for reducing the control-packet overhead introduced by the route discovery process: LAR Distance, LAR Zone, GeoAODV, and GeoAODV Rotate. OPNET Modeler version 16.0 was used to implement each of these mechanisms and compare their performance via network simulations. The results indicate that location-aided routing can significantly reduce the aforementioned control-packet overhead

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

DIRECTIONAL ANTENNA BASED EFFICIENT LOCATION AWARE ROUTING IN MOBILE ADHOC NETWORK

Mobile Adhoc Network (MANET) also called as wireless ad hoc network is a self-organizing, self-configuring infrastructure less network containing a group of mobile nodes communicating wirelessly. As the hosts move often resulting in dynamic topology of the network, routing seeks more attention. Therefore, routing protocol using node’s location information like LAR (location aided routing) has emerged as potential solution. Here, the route discovery is limited to a small region named as request zone in contrast to blind flooding over the entire network. Also it is noticeable that the shape and size of the request zone play a vital role in enhancing the protocol’s performance. After various analyses it was concluded that for higher node density, elliptical shaped request zone performs better than other possible shapes. Further, suitable route must be chosen based on current load status of the network so that successful delivery of packets is ensured. Generally, omni-directional antennas are used for communication between moving motes. The disadvantage of mobile ad hoc networks with omni-directional antenna lies in the limited capacity caused by high interference and low spatial reuse. This paper focuses on obtaining optimal size for request zone in accordance with varying node density. Further, optimal path between source and destination is selected using Dijkstra’s algorithm. Our simulation results show that directional antennas outshines the performance of omni-directional antennas in increasing transmission range of nodes, reducing the number of redundant nodes involving in data communication etc

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks

Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Such a phenomenon induces what is known as broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput