On Energy Efficiency and Delay Minimization in Reactive Protocols in Wireless Multi-hop Networks

In Wireless Multi-hop Networks (WMhNs), routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models (LP_models) to assess and enhance reactive routing protocols. To practically examine constraints of respective LP_models over reactive protocols, we select AODV, DSR and DYMO. It is deduced from analytical simulations of LP_models in MATLAB that quick route repair reduces routing latency and optimizations of retransmission attempts results efficient energy utilization. To provide quick repair, we enhance AODV and DSR. To practically examine the efficiency of enhanced protocols in different scenarios of WMhNs, we conduct simulations using NS- 2. From simulation results, enhanced DSR and AODV achieve efficient output by optimizing routing latencies and routing load in terms of retransmission attempts

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

On Link Availability Probability of Routing Protocols for Urban Scenario in VANETs

This paper presents the link availability probability. We evaluate and compare the link availability probability for routing protocols; Ad hoc On-demand Distance vector (AODV), Dynamic Source Routing (DSR) and Fisheye State Routing (FSR) for different number of connections and node density. A novel contribution of this work is enhancement in existing parameters of routing protocols; AODV, DSR and FSR as MOD-AODV, MOD-DSR and MOD-FSR. From the results, we observe that MOD-DSR and DSR outperform MOD-AODV, AODV, MODOLSR and OLSR in terms of Packet Delivery Ratio (PDR), Average End-to End Delay (AE2ED), link availability probability at the cost of high value of Normalized Routing Overhead (NRO).Comment: IEEE Conference on Open Systems (ICOS2012)", Kuala Lumpur, Malaysia, 201

Enhanced Internet Access in MANETs: A Robust and Efficient Gateway Detection Approach with Amplified Backing

When a certain gateway is connected to a significant number of mobile devices, the quality of service begins to decline. As a result, we propose that the number of mobile devices up to which a specific gateway performs well within expectations be identified, and that this number be referred to as the gateway's capacity. The capacity of each node should then be verified in the optimum gateway discovery protocol before connecting to the gateway for the best results. Trust-based systems might help protect decentralised, self-organized networks like dedicated cellular carriers and dedicated vehicle networks against insider attacks. To guard against external threats, A/V encryption and access control might be utilised. Cryptographic systems, for example, are prevention-focused

The Effect Of Using XCAST Based Routing Protocol in Wireless Ad Hoc Networks.

Wireless ad hoc networks are a type of wireless network that can be easily created without the need of network infrastructure or central administration

Performance Comparison of Routing Protocols in Bipartite Wireless Sensor Network

This paper evaluates and ranks the suitability of routing algorithms for bipartite wireless sensor network topology. The network considered in this paper, consists of an irregular combination of fixed and mobile nodes, which leads to construction of a bipartite graph among them. A wireless sensor network is usually constrained by the energy limitations and processing capabilities. We therefore, consider the important metrics for analysis namely, carried load, energy consumption and the average delay incurred. We present the possibilities of employing the routing algorithms subject to the quality of service required by the wireless sensor networks application

Vulnerabilities for Reactive Routing in Mobile Adhoc Networks

Mobile ad hoc network got outstanding success as well as tremendous attention due to its self -maintenance and self-configuration properties or behavior. This paper presents the area of wireless network i.e. work on ad-hoc network. This paper presents protocols of routing and their classification and their comparison. This paper also presents security issues of wireless network. This paper provides an overview of the security issues in MANETs. It classifies the attacks that are possible against the existing routing protocols. An understanding of these attacks and their impacts on the routing mechanism will help researchers in designing secure routing protocols. Keywords: MANET, AODV, DSR, FLOODING