QoS routing in ad-hoc networks using GA and multi-objective optimization

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version

Situation-Aware QoS Routing Algorithm for Vehicular Ad hoc Networks

A wide range of services has been developed for Vehicular Ad hoc Networks (VANETs) ranging from safety to infotainment applications. An essential requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Searching for feasible routes subject to multiple QoS constraints is in general an NP-hard problem. Besides, routing reliability needs to be paid special attention as communication links frequently break in VANETs. In this paper, we propose employing the Situational Awareness (SA) concept and an Ant Colony System (ACS) based algorithm to develop a Situation-Aware Multi-constrained QoS (SAMQ) routing algorithm for VANETs. SAMQ aims to compute feasible routes between the communicating vehicles subject to multiple QoS constraints and pick the best computed route, if such a route exists. To mitigate the risks inherited from selecting the best computed route that may turn out to fail at any moment, SAMQ utilises the SA levels and ACS mechanisms to prepare certain countermeasures with the aim of assuring a reliable data transmission. Simulation results demonstrate that SAMQ is capable of achieving a reliable data transmission as compared to the existing QoS routing algorithms even when the network topology is highly dynamic

Performance Evaluation of Reactive Routing Protocols in MANETs in Association with TCP Newreno

We inspect the performance of TCP NewReno protocol for data transfer in Mobile Ad hoc networks (MANETs). Dynamic Source Routing (DSR) protocols and AdHoc On-demand Distance Vector (AODV) are standard reactive routing protocols widely used in MANETs. In addition we also have to consider Transmission Control Protocol (TCP) as essential for MANETs since it is one of the widely used internet protocol for dependable data transmission. TCP has its variants namely TCP Reno, TCP NewReno , TCP Vegas and TCP SACK. In this paper we are evaluating the performance of DSR and AODV in association with TCP Newreno with respect to various parameters such as Average throughput, instant throughput, residual energy, packet delivery ratio. The ns-2 network simulator was used for simulation

A Survey on Underwater Acoustic Sensor Network Routing Protocols

Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research

Optimal resource allocation for route selection in ad-hoc networks

Nowadays, the selection of the optimum path in mobile ad hoc networks (MANETS) is being an important issue that should be solved smartly. In this paper, an optimal path selection method is proposed for MANET using the Lagrange multiplier approach. The optimization problem considers the objective function of maximizing bit rate, under the constraints of minimizing the packet loss, and latency. The obtained simulation results show that the proposed Lagrange optimization of rate, delay, and packet loss algorithm (LORDP) improves the selection of optimal path in comparison to ad-hoc on-demand distance vector protocol (AODV). We increased the performance of the system by 10.6 Mbps for bit rate and 0.133 ms for latency

Based on Pause Time Comparative Analysis made among Bee-Ant Colony Optimized Routing (BACOR) Vs Existing Routing Protocols for Scalable Mobile Ad Hoc Networks (MANETs)

In this paper based on swarm intelligence a new approach for an on demand ad-hoc routing algorithm is proposed. The foraging behavior of Ant colony optimization and Bee colony optimization, which are the subset of swarm intelligence and considering the ability of simple ants to solve complex problems by cooperation. Several algorithms which are based on ant colony problems were introduced in the literatures to solve different problems, e.g., optimization problems. The proposed algorithm is compared and proven by results that the approach has the potential to become an appropriate routing tactics for mobile ad-hoc networks. The results were presented based on the simulations made with the implementation in ns-2. Keywords:BACOR, Bee Routing, Ant Routing, Bee-Ant Routin