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

Mobile-IP ad-hoc network MPLS-based with QoS support.

The support for Quality of Service (QoS) is the main focus of this thesis. Major issues and challenges for Mobile-IP Ad-Hoc Networks (MANETs) to support QoS in a multi-layer manner are considered discussed and investigated through simulation setups. Different parameters contributing to the subjective measures of QoS have been considered and consequently, appropriate testbeds were formed to measure these parameters and compare them to other schemes to check for superiority. These parameters are: Maximum Round-Trip Delay (MRTD), Minimum Bandwidth Guaranteed (MBG), Bit Error Rate (BER), Packet Loss Ratio (PER), End-To-End Delay (ETED), and Packet Drop Ratio (PDR) to name a few. For network simulations, NS-II (Network Simulator Version II) and OPNET simulation software systems were used.Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .A355. Source: Masters Abstracts International, Volume: 44-03, page: 1444. Thesis (M.Sc.)--University of Windsor (Canada), 2005

Cross Layer Solution for Energy and Delay Optimization in MANETs

A novel method for packet forwarding in MANETs has been proposed in this paper. A node in the network acts as both host and router. Energy utilization of the node increases as all nodes in MANET operate as source, destination, and router to forward packets to the next hop ultimately to reach destination. Routers execute a variety of functions from simple packet classification for forwarding to complex payload revision. As the number of tasks and complexity increases, processing time required also increases resulting in significant processing delay in routers. The proposed work optimizes packet header at transport and network layer by calculating Unique Identifier using pairing function for the fields which do not change for a source–destination pair. This technique optimizes the processing cost of each packet header thereby conserving energy and reducing delay. It also simplifies the task of system administration. This paper elucidates an extension to basic AODV protocol, allowing routing of most packets without an explicit header, reducing the overhead of the protocol while still conserving its basic properties. The proposed method improves the network performance significantly compared to AODV, MTPR, and S-AODV protocol

Secure Routing in Wireless Mesh Networks

Wireless mesh networks (WMNs) have emerged as a promising concept to meet the challenges in next-generation networks such as providing flexible, adaptive, and reconfigurable architecture while offering cost-effective solutions to the service providers. Unlike traditional Wi-Fi networks, with each access point (AP) connected to the wired network, in WMNs only a subset of the APs are required to be connected to the wired network. The APs that are connected to the wired network are called the Internet gateways (IGWs), while the APs that do not have wired connections are called the mesh routers (MRs). The MRs are connected to the IGWs using multi-hop communication. The IGWs provide access to conventional clients and interconnect ad hoc, sensor, cellular, and other networks to the Internet. However, most of the existing routing protocols for WMNs are extensions of protocols originally designed for mobile ad hoc networks (MANETs) and thus they perform sub-optimally. Moreover, most routing protocols for WMNs are designed without security issues in mind, where the nodes are all assumed to be honest. In practical deployment scenarios, this assumption does not hold. This chapter provides a comprehensive overview of security issues in WMNs and then particularly focuses on secure routing in these networks. First, it identifies security vulnerabilities in the medium access control (MAC) and the network layers. Various possibilities of compromising data confidentiality, data integrity, replay attacks and offline cryptanalysis are also discussed. Then various types of attacks in the MAC and the network layers are discussed. After enumerating the various types of attacks on the MAC and the network layer, the chapter briefly discusses on some of the preventive mechanisms for these attacks.Comment: 44 pages, 17 figures, 5 table

Performance Analysis of Mobile Ad Hoc Network Routing Protocols Using ns-3 Simulations

Mobile ad hoc networks (MANETs) consist of mobile nodes that can communicate with each other through wireless links without reliance on any infrastructure. The dynamic topology of MANETs poses a significant challenge for the design of routing protocols. Many routing protocols have been developed to discover routes in MANETs through various mechanisms such as source, distance vector, and link state routing. In this thesis, we present a comprehensive performance comparison of several prominent MANET routing protocols. The protocols studied are Destination-Sequenced Distance-Vector (DSDV), Optimized Link State Routing (OLSR), Ad Hoc On-Demand Distance Vector protocol (AODV), and Dynamic Source Routing (DSR). We consider a range of network dynamicity and node density, model three mobility models: Steady-State Random Waypoint (SS-RWP), Gauss-Markov (G-M), and Lévy Walk, and use ns-3 to evaluate their performance on metrics such as packet delivery ratio, end-to-end delay, and routing overhead. We believe this study will be helpful for the understanding of mobile routing dynamics, the improvement of current MANET routing protocols, and the development of new protocols

Mobility-based Routing Overhead Management in Reconfigurable Wireless Ad hoc Networks

Mobility-Based Routing Overhead Management in Reconfigurable Wireless Ad Hoc Networks Routing Overheads are the non-data message packets whose roles are establishment and maintenance of routes for data packets as well as neighbourhood discovery and maintenance. They have to be broadcasted in the network either through flooding or other techniques that can ensure that a path exists before data packets can be sent to various destinations. They can be sent reactively or periodically to neighbours so as to keep nodes updated on their neighbourhoods. While we cannot do without these overhead packets, they occupy much of the limited wireless bandwidth available in wireless networks. In a reconfigurable wireless ad hoc network scenario, these packets have more negative effects, as links need to be confirmed more frequently than in traditional networks mainly because of the unpredictable behaviour of the ad hoc networks. We therefore need suitable algorithms that will manage these overheads so as to allow data packet to have more access to the wireless medium, save node energy for longer life of the network, increased efficiency, and scalability. Various protocols have been suggested in the research area. They mostly address routing overheads for suitability of particular protocols leading to lack of standardisation and inapplicability to other protocol classes. In this dissertation ways of ensuring that the routing overheads are kept low are investigated. The issue is addressed both at node and network levels with a common goal of improving efficiency and performance of ad hoc networks without dedicating ourselves to a particular class of routing protocol. At node level, a method hereby referred to as "link availability forecast", that minimises routing overheads used for maintenance of neighbourhood, is derived. The targeted packets are packets that are broadcasted periodically (e.g. hello messages). The basic idea in this method is collection of mobility parameters from the neighbours and predictions or forecasts of these parameters in future. Using these parameters in simple calculations helps in identifying link availabilities between nodes participating in maintenance of networks backbone. At the network level, various approaches have been suggested. The first approach is the cone flooding method that broadcasts route request messages through a predetermined cone shaped region. This region is determined through computation using last known mobility parameters of the destination. Another approach is what is hereby referred as "destination search reverse zone method". In this method, a node will keep routes to destinations for a long time and use these routes for tracing the destination. The destination will then initiate route search in a reverse manner, whereby the source selects the best route for next delivery. A modification to this method is for the source node to determine the zone of route search and define the boundaries within which the packet should be broadcasted. The later method has been used for simulation purposes. The protocol used for verification of the improvements offered by the schemes was the AODV. The link availability forecast scheme was implemented on the AODV and labelled AODV_LA while the network level implementation was labelled AODV_RO. A combination of the two schemes was labelled AODV_LARO

Evaluation of on-demand routing in mobile ad hoc networks and proposal for a secure routing protocol

Secure routing Mobile Ad hoc Networks (MANETs) has emerged as an important MANET research area. Initial work in MANET focused mainly on the problem of providing efficient mechanisms for finding paths in very dynamic networks, without considering the security of the routing process. Because of this, a number of attacks exploit these routing vulnerabilities to manipulate MANETs. In this thesis, we performed an in-depth evaluation and performance analysis of existing MANET Routing protocols, identifying Dynamic Source Routing (DSR) as the most robust (based on throughput, latency and routing overhead) which can be secured with negligible routing efficiency trade-off. We describe security threats, specifically showing their effects on DSR. We proposed a new routing protocol, named Authenticated Source Routing for Ad hoc Networks (ASRAN) which is an out-of-band certification-based, authenticated source routing protocol with modifications to the route acquisition process of DSR to defeat all identified attacks. Simulation studies confirm that ASRAN has a good trade-off balance in reference to the addition of security and routing efficiency