Mobile ad hoc networks (MANETs) are wireless networks that include many peer nodes. The node mobility in the MANETs leads to several issues like maintenance of paths, lifespan of the battery, safety, reliability and unpredictable link traits. All these in turn would adversely affect the network Quality of Service (QoS). In MANETs, a major role is played by the routing protocol for discovering as well as maintaining the paths. There are two types of routing: uni-path and multi-path. The MANET network can be made more reliable using the multipath routing protocol. The focus of this research is evaluating the multipath routing protocol for QoS. For better delivering of data, the Ad hoc On-demand Multipath Distance Vector (AOMDV) has improved methods. This maintains the QoS in terms of factors like MANET end-to-end delay, hop count and bandwidth. This work explores the evolutionary computation schemes for optimizing the routing. The discovery of QoS route in multi-constrained network is a complex problem, this is solved optimally using heuristic algorithms. In that, specifically used for intrusion detection programs in such challenging set ups would be Grammatical Evolution (GE). For finding out familiar threats in MANETs, the natural evolution-motivated GE scheme has been applied. The outcomes have shown that in MANETs, the proposed AOMDV-QoS schemes fulfill the Quality of Service requirements along with lesser delay and high reliability.

Quality of Service based Ad hoc On-demand Multipath Distance Vector Routing protocol in mobile ad hoc network

An on demand load balancing multi-path routing protocol for differentiated services in MWSN

Mobile ad-hoc networks are multihop wireless networks. Wireless communications and the lack of fixed infrastructure generate new research problems compared with fixed multihop networks: Dynamic topologies. Because nodes can move arbitrarily, the network topology, which is typically multihop, can change randomly and rapidly; Bandwidth-constrained, variable capacity, possibly asymmetric links. Wireless links will continue to have significantly lower capacity than wired links and hence congestion is more problematic. Energy-constrained operation. Some, or all nodes in a Mobile ad-hoc network may rely on batteries for energy. For these nodes, power conservation is a critical design criterion. Wireless vulnerabilities and limited physical security. Mobile wireless networks are generally more prone to information and physical security threats than are fixed, hardwired nets. Network technologies for single-hop wireless networks are becoming to appear on the market. The IEEE 802.11 standard is a good platform to implement a one level multi-hop architecture because of its extreme. The Hiperlan standard is the ETSI standard for wireless LANs. Bluetooth technology is an open specification (supported by several hundreds of IT companies) for wireless communication of data and voice. Soon, mobile ad-hoc networks that cover areas of several square kilometres could be built from WLAN technologies such as IEEE 802.11. Furthermore, wireless-network technologies are the building blocks to construct multi-hop mobile ad-hoc networks. In the IETF, the Mobile Ad-hoc NETwork (MANET) working group was set up for developing and evolving mobile ad-hoc network routing specification(s) and introduce them to the Internet Standards track. The goal is to support networks scaling up to hundreds of routers. The step toward a large network (larger than thousand nodes) consisting of nodes with limited resources is not straightforward and presents many challenges that are still to be solved in areas such as: highcapacity wireless technologies, configuration management, addressing, routing, location management, interoperability, and security. The minitrack presents six papers related to the design, modeling and performance evaluation of architectures and

Mobile Ad-hoc Networking - Minitrack Introduction.

In an increasingly wireless world, Ad hoc networks have progressively been developed to become a suitable replacement or, at least complement to the traditional wireless networks. In contrast to the conventional wireless network, the Ad hoc network does not necessarily need a preset infrastructure to be functional. The network members move freely and arrange themselves to perform the routing operations in a distributed fashion. The kernel technology enabling such flexibility is the routing protocol. Though the absence of the infrastructure lowers the installation, configuration and maintenance cost of the dynamic networks, the mobile nodes must deal with several complex issues. Thus, managing : a) security, b) power consumption and balance, c) Quality of Service, in a distributed manner is very challenging. However, above all else, maintaining a path formed by moving particles is the most problematic task. In this paper we analyse the effect of the nodes mobility on the routing protocol performance. Then, we propose a simple schema to counter this issue.

/pdf/a-mobility-aware-schema-to-lower-packet-losses-for-reactive-4j5wi5un5f.pdf

A Mobility Aware Schema To Lower Packet Losses For Reactive Ad Hoc Routing Protocols

AbstractThe objective of the research work is to examine energy-efficient routing in wireless sensor networks for moving nodes by contrasting new evolutionary algorithms with the Particle Swarm Optimization (PSO) Algorithm. Comparative analysis of energy efficient routing is performed by a novel genetic algorithm where there are several samples (N = 10) and a PSO algorithm where there are several samples (N = 10) techniques with pre-test power of 80% using NS2. When routing wireless sensor networks with moving nodes, Various metrics, including delay, energy use, and packet delivery ratio, are used to compare PSO and genetic algorithms. The evolutionary algorithm outperforms the PSO algorithm in these ways in terms of packet delivery ratio, energy usage, and delay. (p < 0.05) indicates a statistically significant difference. The research's findings comprised the three metrics of delay, energy consumption and packet delivery ratio. The method shows that the novel Genetic algorithm outperforms the PSO algorithm for wireless sensor network energy-efficient routing for moving nodes by identifying a set of routes that can satisfy the delay restrictions.KeywordsNovel genetic algorithmParticle Swarm Optimization (PSO)Wireless sensor networkDelayEnergy consumptionPacket delivery ratio 

Energy Efficient Routing in Wireless Sensor Network for Moving Nodes Using Genetic Algorithm Compared with PSO

Design of multipath routing schemeis a challenging task as its topology is very dynamic in mobile adhoc network (MANET) environments. Providing reliability is more important while designing the routing protocol. Hence, multipath routing protocol which is based on Quality of Service parameters is proposed in this paper. The QoS parameters considered are delay, bandwidth and hop count. Different types of traffic such as real- time traffic and non-real-time traffic are considered. In order to improve reliability by reducing number of retransmissions, an additional packet is generated in the case of non-real time traffic and multiple description coding is used in the case of real-time traffic. The proposed algorithm, MRQ is simulated using NS-2 and compared with the existing competing schemes - QAMR and RA-MDC. Simulation results proved that the perfomance of our scheme is better in terms of End-to-End delay, packet delivery ratio, Peak Signal Noise Ratio (PSNR) and retransmissions ratio metrics.

Efficient Multipath Routing Protocol with Quality of Service for Mobile Ad Hoc Networks

Mobile Ad-hoc NETwork MANET is a prevalent deployable network for easy plug-in and it is widely applied for many real time scenarios. Clustering is a well known solution for efficient communication among nodes with least control overheads. The communication link breaks between nodes when a node moves beyond the transmission range of another node because of mobility. Frequent link breaks happen because of nodes mobility which cannot be controlled without increasing the network control overheads. The authors propose an Mobility Adjustment Routing MAR routing algorithm for establishing a stable path between the source and the destination. In this approach the choice of cluster heads based on the smallest weight age, node mobility and remaining battery power are used as a metric for weight computation. The cluster head and the gate way nodes forward RREQ packets to set up a path between the source and the destination which proves efficient communication, before forwarding a RREQ packet cluster the head/gateway node compares its mobility value with RREQ and updates the least value in RREQ. The destination node advertises the least mobility value to the remaining nodes in the path with the help of RREP packet, therefore stable paths are found without increasing the network control overheads. The simulation results done with the help of network simulator 2 show that the algorithm proposed performs well even at higher traffic load compared to existing algorithms.

I. Alagiri

Papers

Efficient Multipath Routing Protocol with Quality of Service for Mobile Ad Hoc Networks

Efficient Data Transfer by Mobility Adjustment Algorithm for Clustered Mobile Ad-Hoc Networks