A comparative study of routing protocols in MANETs

Mobile Ad Hoc networks are emerging area of mobile computing. A mobile ad hoc network (MANET) is composed of mobile routers and associated hosts connected by wireless links. The routers are free to move randomly and organize themselves arbitrarily, thus, the network\u27s wireless topology may change rapidly and unpredictably. In fact, it is considered that each node would have some capacity to relay the information thus constrained by computational power, battery life and increasingly complex routing with added functionality of a router. Nodes may keep joining and leaving an ad hoc network. Such a network may operate in a stand alone fashion, or may be connected to the larger Internet. Lack of infrastructure in ad hoc networks sets new challenges for routing algorithms where the network is formed by a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A number of routing protocols like Dynamic Source Routing (DSR), Ad Hoc On-Demand Distance Vector Routing (AODV), Destination-Sequenced Distance-Vector (DSDV), Zone Routing Protocol (ZRP) and Temporally Ordered Routing Algorithm (TORA) have been implemented. In this thesis an attempt has been made to compare the performance of prominent on-demand reactive routing protocols for mobile ad hoc networks (AODV and TORA), along with the traditional proactive DSDV protocol. Although AODV and TORA share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials are analyzed using varying network loads, mobilities, and network sizes. These simulations are carried out using network simulator (ns-2.1b9a) to run mobile ad hoc network simulations

Research on Quality of Service Based Routing Protocols for Mobile Ad Hoc Networks

Quality of service (QoS) based routing protocols play a significant role in MANETs to maintain proper flow of data with efficient power consumption and without data loss. However, several network resource based technical challenges or issues are encountered in the design and implementation of QoS routing protocols that perform their routing function by considering the shortest route or the lowest cost. Furthermore, a secondary route is not reserved and alternative routes are not searched unless the established route is broken. The current structures of the state-of-the-art protocols for MANETs are not appropriate for today's high bandwidth and mobility requirements. Therefore, research on new routing protocols is needed, considering energy level, coverage, location, speed, movement, and link stability instead of only shortest path and lowest cost. This paper summarizes the main characteristics of QoS-based routing protocols to facilitate researchers to design and select QoS-based routing protocols. In this study, a wide range of protocols with their characteristics were classified according to QoS routing strategy, routing information update mechanism, interaction between network and MAC layer, QoS constraints, QoS guarantee type and number of discovered routes. In addition, the protocols were compared in terms of properties, design features, challenges and QoS metrics

MALMR: Medium Access Level Multicast Routing For Congestion Avoidance in Multicast Mobile Ad Hoc Routing Protocol

This paper is focused on a new solution for congestion avoidance in ad hoc multicast routing by bearing the congestion situations. As the routing strategy belongs to Medium Access Level, the routing strategy is named Medium Access Level Multicast Routing short MALMR. MALMR is aimed at Congestion Avoidance in Multicast Mobile Ad hoc routing protocol. The present MAC level routing strategy is independent which can work with any multicast routing protocol irrespective of tree or mesh structure. During the study of MALMR performance, the MALMR tested along with On-Demand Multicast Routing Protocol where simulation results proved that MALMR raises the performance of ODMRP in order of magnitude

1 A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols

Abstract—In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge of producing multihop routes under host mobility and bandwidth constraints. In recent years, a number of new multicast protocols of different styles have been proposed for ad hoc networks. However, systematic performance evaluations and comparative analysis of these protocols in a common realistic environment has not yet been performed. In this study, we simulate a set of representative wireless ad hoc multicast protocols and evaluate them in various network scenarios. The relative strengths, weaknesses, and applicability of each multicast protocol to diverse situations are studied and discussed. I

Intelligent MANET optimisation system

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In the literature, various Mobile Ad hoc NETwork (MANET) routing protocols proposed. Each performs the best under specific context conditions, for example under high mobility or less volatile topologies. In existing MANET, the degradation in the routing protocol performance is always associated with changes in the network context. To date, no MANET routing protocol is able to produce optimal performance under all possible conditions. The core aim of this thesis is to solve the routing problem in mobile Ad hoc networks by introducing an optimum system that is in charge of the selection of the running routing protocol at all times, the system proposed in this thesis aims to address the degradation mentioned above. This optimisation system is a novel approach that can cope with the network performance’s degradation problem by switching to other routing protocol. The optimisation system proposed for MANET in this thesis adaptively selects the best routing protocol using an Artificial Intelligence mechanism according to the network context. In this thesis, MANET modelling helps in understanding the network performance through different contexts, as well as the models’ support to the optimisation system. Therefore, one of the main contributions of this thesis is the utilisation and comparison of various modelling techniques to create representative MANET performance models. Moreover, the proposed system uses an optimisation method to select the optimal communication routing protocol for the network context. Therefore, to build the proposed system, different optimisation techniques were utilised and compared to identify the best optimisation technique for the MANET intelligent system, which is also an important contribution of this thesis. The parameters selected to describe the network context were the network size and average mobility. The proposed system then functions by varying the routing mechanism with the time to keep the network performance at the best level. The selected protocol has been shown to produce a combination of: higher throughput, lower delay, fewer retransmission attempts, less data drop, and lower load, and was thus chosen on this basis. Validation test results indicate that the identified protocol can achieve both a better network performance quality than other routing protocols and a minimum cost function of 4.4%. The Ad hoc On Demand Distance Vector (AODV) protocol comes in second with a cost minimisation function of 27.5%, and the Optimised Link State Routing (OLSR) algorithm comes in third with a cost minimisation function of 29.8%. Finally, The Dynamic Source Routing (DSR) algorithm comes in last with a cost minimisation function of 38.3%

Scalable wide area ad-hoc networking

The scalability problem of routing algorithms in Mobile Ad-hoc networks (MANET) has conventionally been addressed by introducing hierarchical architectures, clusters, and neighborhood zones. In all of these approaches, some nodes are assigned different routing related roles than others. Examples include cluster heads, virtual backbones and border nodes. The selection of these nodes on a fixed or dynamic basis adds complexity to the routing algorithm, in addition to placing significant demands on mobility and power consumption of these nodes. Furthermore, the scalability achieved with hierarchical architectures or partitions is limited. This thesis demonstrates that location awareness can greatly aid in MANET routing and proposes an enhancement to location management algorithm used by the Terminodes System. This thesis makes use of geographic packet forwarding, geocasting and virtual home area concepts. It draws from the analogy between ad hoc networks and social networks. The Scalable Wide Area ad hoc network (SWAN), nodes update their location information with a geocast group whose area is given by a well-known function. A source node queries the geocast group of the destination and obtains up to date location information. Then, packets are geographically routed to the destination. The SWAN algorithm also optimizes the control overhead and obtains location information with minimal delay. This thesis also presents the results of our comparative performance study

Networked control system with MANET communication and AODV routing

The industries are presently exploring the use of wired and wireless systems for control, automation, and monitoring. The primary benefit of wireless technology is that it reduces the installation cost, in both money and labor terms, as companies already have a significant investment in wiring. The research article presents the work on the analysis of Mobile Ad Hoc Network (MANET) in a wireless real-time communication medium for a Networked Control System (NCS), and determining whether the simulated behavior is significant for a plant or not. The behavior of the MANET is analyzed for Ad-hoc on-demand distance vector routing (AODV) that maintenances communication among 150 nodes for NCS. The simulation is carried out in Network Simulator (NS2) software with different nodes cluster to estimate the network throughput, end-to-end delay, packet delivery ratio (PDR), and control overhead. The benefit of MANET is that it has a fixed topology, which permits flexibility since mobile devices may be used to construct ad-hoc networks anywhere, scalability because more nodes can be added to the network, and minimal operating expenses in that no original infrastructure needs to be developed. AODV routing is a flat routing system that does not require central routing nodes. As the network grows in size, the network can be scaled to meet the network design and configuration requirements. AODV is flexible to support different configurations and topological nodes in dynamic networks because of its versatility. The advantage of such network simulation and routing behavior provides the future direction for the researchers who are working towards the embedded hardware solutions for NCS, as the hardware complexity depends on the delay, throughput, and PDR

A Comparative Study on Routing schemes for Wireless Network

Ubiquitous smart devices with embedded sensors are paving the way for mobile ad hoc networks (ad-hoc network) that enable users to communicate directly, thereby playing a key role in Smart City and Internet of Things applications. In such smart environments, people with smart devices (nodes) can freely self-organize and form self-configuring ad-hoc network to send and forward data packets to a destination over multiple hops via intermediate nodes. Wireless Networks includes a larger advantage in today’s communication application like environmental, traffic, military, and health observation. To realize these applications it's necessary to possess a reliable routing protocol. The main motivation of this paper is to review various routing schemes in ad-hoc network that have recently been proposed to enhance throughput when transmitting and receiving packets during active communication. The review covers various state-of-the-art protocols for each category and highlights their operation concepts, design challenges and key features. In addition, the performance evaluation metrics are also discussed

Tom and Jerry Based Multipath Routing with Optimal K-medoids for choosing Best Clusterhead in MANET

Given the unpredictable nature of a MANET, routing has emerged as a major challenge in recent years. For effective routing in a MANET, it is necessary to establish both the route discovery and the best route selection from among many routes. The primary focus of this investigation is on finding the best path for data transmission in MANETs. In this research, we provide an efficient routing technique for minimising the time spent passing data between routers. Here, we employ a routing strategy based on Tom and Jerry Optimization (TJO) to find the best path via the MANET's routers, called Ad Hoc On-Demand Distance Vector (AODV). The AODV-TJO acronym stands for the suggested approach. This routing technique takes into account not just one but three goal functions: total number of hops. When a node or connection fails in a network, rerouting must be done. In order to prevent packet loss, the MANET employs this rerouting technique. Analyses of AODV-efficacy TJO's are conducted, and results are presented in terms of energy use, end-to-end latency, and bandwidth, as well as the proportion of living and dead nodes. Vortex Search Algorithm (VSO) and cuckoo search are compared to the AODV-TJO approach in terms of performance. Based on the findings, the AODV-TJO approach uses 580 J less energy than the Cuckoo search algorithm when used with 500 nodes