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

Reliable multi-hop routing with cooperative transmissions in energy-constrained networks

We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regime, we determine the optimal cardinality of the cooperation sets at each hop on a path minimizing the total energy cost per transmitted bit. Optimal cooperating set cardinality curves are derived, and they can be used to determine the optimal routing strategy based on the required reliability, transmission power, and path loss coefficient. We design a new greedy geographical routing algorithm suitable for vMISO transmissions, and demonstrate the applicability of our results for more general networks

Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead

Mobile ad-hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. Ant colony optimization (ACO) is a population based meta-heuristic for combinatorial optimization problems such as communication network routing problem. In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way, back they choose the path with the highest pheromones which becomes the shortest path. But Ant net Algorithms may cause the network congestion and stagnation. Here, multiple optimal paths are proposed with negligible overhead in spite of single optimal path in Ant net routing algorithm, so that the problem of stagnation can be rectified. This paper proposes an improved Multiple Feasible Paths in Ant Colony Algorithm for mobile Ad-hoc Networks with Minimum Overhead

Energy Efficient QoS Routing Protocol based on Genetic Algorithm in MANET

Abstract- In mobile ad-hoc networks (MANETs), providing quality of service is more challenging than wired networks, because of multi hop communication, node connectivity and lack of central co-ordination. Mobile ad-hoc networks need sure distinctive characteristics which might cause difficulties providing QoS in such network. Coming up with of multi constrained QoS routing protocols remains troublesome. As a result of routing protocols must satisfy the numerous QoS metrics at a time. Genetic algorithm based routing protocol will give the solution for multi constrained QoS routing problem. In existing genetic algorithm based routing, achieving energy efficiency is the major drawback. To overcome this drawback, in this paper, we have proposed genetic algorithm based energy efficient QoS routing for MANET. Proposed GA based routing algorithm discovered the shortest path from source to destination, which can consumes less energy compare to existing algorithms. In this paper TCP,CBR and video sources are applied at a time then energy consumption of proposed algorithm is compared with existing normal GA based and AOMDV. Simulation results show that proposed algorithm consumes less energy towards given scenario. Simulations are performed in NS-2

Mitigating Routing Attacks in Mobile Ad Hoc Networks

Mobile Ad hoc Networks have been highly vulnerable to attacks due to the dynamic nature of its network infrastructure. Among these attacks, routing attacks have received considerable attention since it could cause the most devastating damage to MANET. In existing solutions typically attempt to isolate malicious nodes based on binary or naive fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure. In this paper proposes a risk-aware response mechanism to systematically cope with the identified routing attacks. To avoid the routing attacks Dijkstra’s and Destination sequenced Distance Vector algorithm are used. Dijkstra\u27s algorithm solves the single-source shortest-path problem when all edges have non-negative weights. The primary improvement for ad hoc networks made in DSDV over conventional distance vector is the addition of a sequence number in each routing table entry. Index Terms - Intrusion response, risk aware, dempster- shafer theory, Dijkstra’s algorithm, Destination sequenced Distance Vector

Attacks and countermeasures on routing protocols in wireless networks

Routing in wireless networks is not an easy task as they are highly vulnerable to attacks. The main goal of this work is to study the routing performance and security aspects of wireless ad hoc and mesh networks. Most of the routing protocols use hop-count as the routing metric. Hop count metric may not be appropriate for routing in wireless networks as this does not account for the link qualities, advantages of multi-radio paradigm etc. There are several metrics designed for link quality based source routing protocols for multi-radio wireless ad hoc and mesh networks. For example Weighted Cumulative Expected Transmission Time (WCETT), Adjusted Expected Transfer Delay(AETD) etc. But these metrics do not consider the effect of individual link qualities on the total route quality and route selection. This lack of ability from WCETT or AETD would allow them to select suboptimal paths when actually an optimal path is available. In another point of view, this inability can create a routing disruption attack named as delay-variation attack (a variant of black hole attack). It can be launched by a couple of colluding attackers attracting packets at one point by showing very good link qualities and dropping packets at another point by decreasing the link quality. To select an optimal route and prevent the above mentioned attack, a new routing metric known as Variance Based Path Quality metric (VBPQ) is proposed. VBPQ metric provides a robust, reliable and secure edge to the routing mechanism. Another major contribution of this study is to provide a detection mechanism for wormhole attacks in wireless ad hoc networks operating on link quality based source routing protocols. There have been several detection techniques designed for hop count based routing protocols but not for link quality based source routing protocols. In this work, a data mining approach called Cross feature analysis is used in an algorithm to detect wormhole attacks