Design and Performance of QOSRGA Protocol for Mobile Adhoc Networks

QoS Routing for Mobile Ad Hoc Network (MANET) generally posses several challenges that must be addressed. In selecting the best route from source to destination, one has to choose from a set of routes with the corresponding quality of connectivity and resources. Due to the nature of node mobility the protocol demands an exceptional performance. It needs to select a single route with the longest residual node-pair connectivity time simultaneously. As the name implies, QOSRGA (QoS Routing Using GA) was designed to select QoS route based on QoS metrics such as bandwidth, delay and node connectivity index (nci). The design of QOSRGA and its choice of parameters are elaborated. The performance considered here is the effect of mobility and node density on the average packet delivery ratio, average packet end to end delay and total average throughputs

Simulation study on the impact of the transmission power on the performance of routing protocols under different mobility models

© 2014 IEEE. the dynamic topology of a mobile ad hoc network poses a real challenge in designing the routing protocol. This paper examine through simulation the fundamental factors, mobility models and transmission power which have a major impacts on the performance of position based routing protocols. We analyse the effect of the transmission power of on the performance of protocols under two different mobility models. Using OPNET simulation tool, results show the evaluation and performance of the proposed protocol under a unified simulation environment for different scenarios

Using Labeled Paths for Loop-free On-Demand Routing in Ad Hoc Networks

We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree incremental (hop-by-hop) routing of data packets using only the addresses of their destinations. Like the dynamic source routing (DSR) protocol, FLR avoids the need for any time-stamps or sequence numbers by the use of path vectors exchanged when routes are established or repaired. Instantaneous loop freedom is attained by using path information for a destination as labels with which routers are ordered lexicographically with respect to the destination, i.e., FLR ensures that the labels of routers for a given destination become "smaller" the closer they are to the destination. Simulation experiments in Qualnet show that the performance of FLR is far better than the performance of the ad-hoc on-demand distance vector (AODV) protocol, the dynamic source routing (DSR) protocol, and the optimized link state routing (OLSR) protocol, in terms of the packet delivery ratio and average delivery latencies achieved, as well as the overhead incurred in the network

Local Area Dynamic Routing Protocol: a Position Based Routing Protocol for MANET

A Mobile Ad Hoc Network (MANET) comprises mobile nodes (MNs), equipped with wireless communications devices; which form a temporary communication network without fixed network infrastructure or topology. The characteristics of MANET are: limited bandwidth; limited radio range; high mobility; and vulnerability to attacks that degrade the signal to noise ratio and bit error rates. These characteristics create challenges to MANET routing protocols. In addition, the mobility pattern of the MNs also has major impact on the MANET routing protocols. The issue of routing and maintaining packets between MNs in the mobile ad hoc networks (MANETs) has always been a challenge; i.e. encountering broadcast storm under high node density, geographically constrained broadcasting of a service discovery message and local minimum problem under low node density. This requires an efficient design and development of a lightweight routing algorithm which can be handled by those GPS equipped devices. Most proposed location based routing protocols however, rely on a single route for each data transmission. They also use a location based system to find the destination address of MNs which over time, will not be accurate and may result in routing loop or routing failure. Our proposed lightweight protocol, ‘Local Area Network Dynamic Routing’ (LANDY) uses a localized routing technique which combines a unique locomotion prediction method and velocity information of MNs to route packets. The protocol is capable of optimising routing performance in advanced mobility scenarios, by reducing the control overhead and improving the data packet delivery. In addition, the approach of using locomotion prediction, has the advantage of fast and accurate routing over other position based routing algorithms in mobile scenarios. Recovery with LANDY is faster than other location protocols, which use mainly greedy algorithms, (such as GPRS), no signalling or configuration of the intermediate nodes is required after a failure. The key difference is that it allows sharing of locomotion and velocity information among the nodes through locomotion table. The protocol is designed for applications in which we expect that nodes will have access to a position service (e.g., future combat system). Simulation results show that LANDY`s performance improves upon other position based routing protocols