Mobile Ad Hoc Network Routing Research Articles

NS2 Based Performance Comparison Study between DSR and AODV Protocols

Mobile AD-HOC Network (MANETs) are useful when no traditional communication infrastructure exists, and have applications in military and other fields; MANET is a set of nodes capable of communicating with each other irrespective of infrastructure or centralized management. The mobility of system nodes leads them to be arranged and designed automatically. In addition, wireless networks have received extensive attention in the fields of communication systems owing to their prospective applications in different fields such as military, industrial and private area networks. Moreover, wireless networks are easy to install, inexpensive, reliable, and do not need a fixed infrastructure, unlike the wired networks. In the MANETs, routing protocols play an essential role to discover the ways between the source and the destination. Generally, an appointed routing protocol system aims to address the difficulties of the progressively evolving topologies. It is possible to divide MANET routing protocols into three kinds: proactive, receptive and hybrid. In this report, routing protocol topology such as queue size and a number of nodes was altered and the efficiency metrics of two reactive routing protocols such as Ad hoc On-Demand Distance Vector AODV and Dynamic Source Routing DSR were contrasted in terms of average end-to-end delay, average throughput and packet delivery ratio.

Comparative Assessment and Performance Analysis of Numerous Mobile Ad-Hoc Network Routing Protocols

Recent progression in the field of information and communication cause increase of packet count over the World Wide Web network. These communicated packets should deliver on time from origin node to destination node using a reliable and shortest route. In this way routing plays an important part in dispatching the packets to destination form the source. This routing becomes more crucial when packets delivery is done in independent mobile nodes which dynamically form a temporary network. This network named as Mobile Ad-Hoc Network and therefore it is said to be particular reason-specific, self-ruling and dynamic. In this paper we analyzed 3 protocols and for a quality of service (i.e., Packet Delivery Ratio) and achieved comparative study of various protocols of routing with respect to Operation of protocols, Route maintenance, Routing table, Route, Route selection, Routing structure, Routing Approaches, Protocol types, Merits and Demerits.

Modifying the MANET Routing algorithm by GBR CNR-Efficient Neighbor Selection Algorithm

In today’s worlds, Mobile Ad-Hoc Network (MANET) plays most important role in the field networks technology in the world. The MANET has been rapidly rising and becoming signif-icant from the last decade. A MANET is a kind of wireless net-work which has been set-up without requirement of fixed infra-structure where mobile nodes are connected over wireless link. Due to moving nature of the devices, the network topology is unstable and will change dynamically. That’s why stable routing in MANET cannot work properly. In this research paper, a new routing algorithm is proposed to get better routing performance in the MANET. The proposed algorithm designed based on the number of neighbors in the network. Planned algorithm is the improvement of GBR-CNR-LN (GBR-CNR with less neighbors) by calculating the stay time between the selected neighbor nodes and the transmission nodes. If the stay time of sender node is more than the packet transmission time then the selected node is the efficient neighbor selection. The algorithm is implemented and results are analyzed. The results of this paper show the use-fulness of the proposed algorithm. The Evaluation of AODV protocol was carried out using Python and outcome of this evalu-ation showed that proposed Algorithm gave better results than GBR-CNR with less neighbor in terms of End-to-End delay, Number of control message transferred(Routing Overhead) and Network Load. The proposed Algorithm (GC-ENS) decrease Average End-to-End delay 52.54 %, reduce Average Routing Overhead 60.54% and decline the Average load on Network 61.17%.

Node pattern state and trust-rate base route selection for reliable data transmission in mobile ad hoc networks

Mobile ad hoc networks (MANET) have plethora of security issues related to its dynamic topology. Black-hole and gray-hole attacks are more commonly impacting issues in the data transmission between nodes in the selected route. This manuscript addresses the proposal of node pattern state and trust-rate (PSTR)-based reliable data transmission in MANET. The method PSTR allows detecting optimal route without the nodes compromised to block-hole and gray-hole attacks. The model is proposed as an extension to the earlier proposed model trust-rate-based cooperative neighbor selection for optimal routing in MANET. The proposed solution scales the optimality of the routes. The test results from the experimental study have shown that the results are very effective when compared to those of the contemporary models. The proposed model focuses on improving the scalability and detection of black-hole and gray-hole attacks under very minimal computational costs.

Enhanced Routing Protocol for VANET

A class of networks called VANET(vehicular adhoc network) ,the extension of MANETs(mobile adhoc network) are based on the principle of the formation of wireless network for exchange of data and the creation of network is spontaneous in nature. The mobility constraints, behavior of driver, high speed, limited coverage of wifi, hard delay constraints leads to unique characteristics in VANETS. So the MANET routing protocols are not suitable for VANET. Optimization of routing protocols becomes necessary to make it suitable for VANET. In this paper , various optimized routing protocols are analyzed and their optimization techniques are discussed. Parameters such as end to end delay and energy spent are taken into consideration in order to show the improvement from the routing protocols that are standard protocols. Then a method has been proposed to optimize the fine tuned OLSR (optimized link state routing)protocol with the use of advanced genetic algorithm to further improve the results and to make the protocol more efficient

Simulation-based Evaluation of Mobile Ad Hoc Network Routing Protocols: Ad hoc On-Demand Distance Vector, Fisheye State Routing, and Zone Routing Protocol

Mobile ad hoc network (MANET) is an infrastructure-less and decentralized network without any physical connections. Nodes are mobile, free to move, and independent of each other which makes routing a difficult task. Hence, a dynamic routing protocol is needed to make MANET reliable and function properly. Several routing protocols have been proposed with different working mechanisms and performance levels. Therefore, the performance study of those protocols is needed. This paper evaluates the performance of MANET routing protocols using simulation based experiments to observe the behavior of the network as the density of the nodes increases. The paper evaluates the performance of proactive (fisheye state routing), reactive (ad hoc on-demand distance vector), and hybrid (zone routing protocol) routing protocols in terms of the packet delivery fraction, average throughput, and average end-to-end delay. The simulations of protocols to analyze their performance in different conditions were performed using the network simulator 2 (NS 2).

Reliability-based dynamic multicast group formation provisioning local adjustment ensuring quality of service globally in MANETs

Mobile Ad hoc Networks (MANETs) is an infrastructure less and random mobility-based class of wireless networks with seamless possibilities of ‘on the fly’ communication through self-coordination among autonomous mobile nodes while being in the transmission range of each other. This low cost, easy to deploy, simplicity, and self-organisation of MANET altogether revolutionised wired networks and could connect otherwise unreachable terrains/sites. To handle the severity of colossal issues like dynamic topology, scarce resources and frequent rupturing of established routes in MANETs, conservation of energy becomes inevitable to administer contemporary applications. After an extensive literature survey for provisioning reliability and multicast routing in MANETs, researchers concluded the conservation of mobile nodes energy embrace a very consequential role in extending network life. The PLA (Proposed Local Adjustment) model is based on eliminating flooding, preserving nodes battery life by selectively choosing forwarder node at each hop level, and handling route failures locally, eventually makes the network more robust and resilient. The PLA model when simulated on NS2.35 against AODV on various parameters like control overhead generated, packet delivery ratio, energy conserved index, produced quite convincing and promising results, to be offered to remote and rescue-based applications in the vicinity of infrastructure less regions.

Trust-Based Secure Routing in Mobile Ad Hoc Network Using Hybrid Optimization Algorithm

Abstract Routing in mobile ad hoc networks (MANETs) is a hectic challenge due to the dynamic nature of the network. The provisional communication links are assured due to the infrastructure-independent capability of MANET, but with no proper centralized monitoring process, which makes routing in MANETs with respect to the security and trust a major issue. Thus, the paper introduces Advanced Encryption Standard-enabled Trust-based Secure Routing protocol based on the proposed Dolphin Cat Optimizer (AES-TDCO), which is an energy and trust-aware routing protocol. The proposed Dolphin Cat Optimizer is engaged in the optimal route selection based on the modeled objective function based on the trust factors, recent trust, historical trust, direct and indirect trust in addition to delay, distance and link lifetime. The Dolphin Cat Optimizer is the integration of Dolphin Echolocation and Cat Swarm Optimization algorithm that inherits the faster global convergence. The simulation using 75 nodes revealed that the proposed routing protocol acquired the maximal throughput, minimal delay, minimal packet drop and detection rate of 0.6531, 0.0107, 0.3267 and 0.9898 in the absence of network attacks and 0.7693, 0.0112, 0.3605 and 0.9961 in the presence of the network attacks.

A Reconfigurable Multicast Routing Protocol for Mobile Ad-Hoc Networks

An infrastructure independent and self-organizing network where the mobile nodes are communicated with each other through wireless links is referred asMobile ad-hoc network. Amajor challenging task of mobile ad-hoc networks is Route maintenance due to some reasons such as frequent topological changes, packet collisions and bad channels which may cause some link breakages. Reconfigurable Virtual Backbone (RVB) construction and maintenance play a vital role, mainly in the multicast routing of mobile ad-hoc networks (MANETs). In this paper, the issues in providing a reconfigurable virtual backbone with the lower overhead are investigated and here we come up with a solution and propose a Reconfigurable Multicast Routing Protocol (RMRP) for constructing a virtual backbone and generating an alternate path during link failures. In comparison with the existing backbone and link recovery protocols like Backbone Group Model (BGM), Hierarchical Virtual Backbone Construction (HVBC) protocol and Local Link Failure Recovery (LLFR) protocol, the proposed protocol yields effective results in constructing a reconfigurable virtual backbone and generating an on-demand alternate path with the minimized overhead, increasing packet delivery ratio, throughput, minimizing delay of transmission, energy consumption, and with the improved routing performance significantly.

ABCIP: Artificial Bee Colony Inspired Protocol for Routing in Flying Ad-Hoc Network

Flying Ad-hoc Network (FANET) is described as a special kind of ad-hoc network coming under the family of Mobile Ad-hoc Network (MANET). FANETs is characterized to have high range of mobility when comparing with MANET. Setting up the route and maintaining its lifetime is a tedious job in FANET, because the MANET routing protocols that already exist will never fit for FANET because of its increased level of mobility, environmental circumstances and topography structure. There arises a need for bio-inspired based routing protocol to overcome the obstacles. This paper proposes Artificial Bee Colony Inspired Protocol inspired from the bio-inspired concepts. The proposed protocol gradually reduces the level of congestion occurring at different routing path, where it considers the successful route setup and its life time to increase the data delivery. In ABCIP, bee colony is enhanced to analyze and choose the routing path instead of picking up in random. Simulation is carried out using NS2and the results indicates the proposed protocol considerably performs better than the existing protocols in maximizing the successful route setup and its life time, which minimizes the service disruption.

Energy and Velocity Based Tree Multicast Routing in Mobile Ad-Hoc Networks

Nodes in ad hoc networks are mostly mobile, moving with arbitrary velocity and direction. Therefore, it is always beneficial if nodes are equipped with alternative paths to successors. The present article proposes both energy and velocity based (together called weight based) tree multicast protocol where not only the relative velocity of nodes, but also their expected residual lifetime contribute in computing acceptability of a path from a multicast sender to a multicast receiver. Experimental results confirm superiority of the proposed scheme over existing state-of-the-art multicast protocols, in terms of data packet delivery ratio, multicast route lifetime, control message overhead and end-to-end delay.

Mobility, Residual Energy, and Link Quality Aware Multipath Routing in MANETs with Q-learning Algorithm

To facilitate connectivity to the internet, the easiest way to establish communication infrastructure in areas affected by natural disaster and in remote locations with intermittent cellular services and/or lack of Wi-Fi coverage is to deploy an end-to-end connection over Mobile Ad-hoc Networks (MANETs). However, the potentials of MANETs are yet to be fully realized as existing MANETs routing protocols still suffer some major technical drawback in the areas of mobility, link quality, and battery constraint of mobile nodes between the overlay connections. To address these problems, a routing scheme named Mobility, Residual energy and Link quality Aware Multipath (MRLAM) is proposed for routing in MANETs. The proposed scheme makes routing decisions by determining the optimal route with energy efficient nodes to maintain the stability, reliability, and lifetime of the network over a sustained period of time. The MRLAM scheme uses a Q-Learning algorithm for the selection of optimal intermediate nodes based on the available status of energy level, mobility, and link quality parameters, and then provides positive and negative reward values accordingly. The proposed routing scheme reduces energy cost by 33% and 23%, end to end delay by 15% and 10%, packet loss ratio by 30.76% and 24.59%, and convergence time by 16.49% and 11.34% approximately, compared with other well-known routing schemes such as Multipath Optimized Link State Routing protocol (MP-OLSR) and MP-OLSRv2, respectively. Overall, the acquired results indicate that the proposed MRLAM routing scheme significantly improves the overall performance of the network.

Efficient Congestion Control Routing in Mobile Ad-Hoc Networks Based on Optimized Queue Utilization

Efficient Congestion Control Routing in Mobile Ad-Hoc Networks Based on Optimized Queue Utilization

QoS in Mobile Ad-Hoc Networks

A mobile ad hoc network (MANET) consists of mobile nodes communicating over wireless channels. Routing in MANETs is very challenging due to the random mobility of nodes and unreliability of wireles...

A congestion avoidance mechanism in multimedia transmission over MANET using SCTP multi-streaming

Congestion is a challenging problem in Mobile Ad hoc Networks (MANETs) because of resource constraints, and dynamic routing. Congestion control is a big concern in achieving fairness between optimal network resource utilization and end-to-end flow control. In MANETs, with shared resources, when multiple senders contend for the same link bandwidth, data rate by each sender must be adjusted to avoid network overload which causes Quality of Service compromises. Strict ordering of data transmission in Transmission Control Protocol (TCP) causes poorer performance during data transmission in MANETs. Unlike TCP, Stream Control Transmission Protocol (SCTP) has a built-in multi-streaming feature to alleviate this issue caused by strict data ordering when using a single data stream within a transport connection. In this paper, we propose a Congestion Avoidance Mechanism over MANET routing based on Data Priority and Streaming Delay Weights (SDWs) which also utilizes SCTP multi-streaming (namely CAM-SCTP). Our proposal implements a Priority Manager (PM) to effectively select a stream to transmit data based on the data priority and by dynamically computing an SDW value per node. Experimental evaluation of the CAM-SCTP is performed for three different data types. The results show improvement in throughput for all data types while maintaining lower jitter, loss, and overhead.

A probabilistic home-based routing scheme for delay tolerant networks

In traditional Mobile Adhoc Networks routing algorithms, the existence of a sustainable path between the source and destination is a crucial issue. These algorithms are shown to be unsuccessful in Delay Tolerant Networks (DTNs) since the network is almost disrupted, and then such a path is not guaranteed. Although Store-and-Forward routing approach has provided an adequate solution for these networks, it suffers from the large end-to-end delay and the additional traffic and communication costs incurring the network. This study presents an efficient single-copy home-based routing scheme for DTNs. Two different scenarios, referred as blind and semi-blind, are considered based on the amount of available knowledge about the destination. Simulation results presented in this paper demonstrate that the performance of the proposed scheme is closely approaching the unrestricted flooding algorithm, the Epidemic. Moreover, the proposed scheme provides a low communication cost, an outstanding end-to-end delay and a high successful delivery ratio as compared to state-of-art algorithms.

Ant Colony Optimization (ACO) Based MANET Routing Protocols: A Comprehensive Review

Application of mobile ad hoc networks (MANETs) has gained significant popularity among researchers in the field of data communication networks. However, a MANET operating in a wireless environment imposes a number of challenges for the implementers so far as routing of packets across it is concerned. There is a wide range of research contributions are available in the literature wherein authors propose various solutions to overcome the problems and bottleneck related to routing in MANET. Especially soft computing techniques and Ant Colony Optimization (ACO) in particular has been significantly popular among the researchers to resolve MANET routing issues. This technique plays a vital role in route discovery in particular. In this paper, we have conducted a comprehensive review of this technique applied to routing in MANET with respect to various criteria. Hopefully this paper serves to a perfect document for researchers in this field.

A power aware mechanism for energy efficient routing in MANET

In this paper, mobile ad hoc network (MANET) is used to refer a wireless network wherein there is no definite architecture and required configuration is done by itself. Multiple protocols are suggested to reduce the overall transmission power in MANET routing. Several multicasting routing protocols are available and two of them are power aware dual tree based multicast routing protocol (PDTMRP) and load balancing and power aware multicast routing in MANET (LPMR). Here, a power aware mechanism for energy efficient routing (PAMER) for MANET is designed to improve route stability as well as to obtain load balance data transmission by taking into account the energy reduction rate (ERR) as well as residual energy (RE). A suitable band width (BW) assessment is integrated to respond to network traffic as well as explore a QoS aware strategy into route discovery for appropriate traffic management. Thus, the improved system can monitor overhead, lessen the number of route reconstruction as well as improve the life span of network.

Cross-layered-based adaptive secured routing and data transmission in MANET

Mobile ad hoc network (MANET) is a self-organising network consisting of a group of nodes connected to each other wirelessly. Due to the self sustaining nature of MANET, it has been used in various applications and provides good communication. However, because of certain features of MANET such as wireless medium, highly dynamic topology, limited resources, etc., the network is easily prone to various attacks which hamper the communication efficiency. The nodes are attacked mainly during the routing process and the data packets are dropped or its authenticity is compromised mostly during the data transmission process. Hence, it is critical to ensure that routing and data transmission process is performed in a secure manner to ensure security of the network. In this paper, we propose to develop a cross-layered-based adaptive secured routing and data transmission technique in MANET. Initially, the multipath routing is performed securely by encrypting every message transmission, to guarantee routing security. Then the highly secured data is transmitted through secure routes to ensure data security. Then the network is examined for intrusions. In this way, network is safeguarded from attacks and hence enhancing network operations.

Swarm intelligence on MANET routing issues: an empirical study revealing latent research topics

A mobile ad hoc network (MANET) is formed by a group of mobile nodes which communicate using wireless links. MANETs are usually deployed in environments where it is difficult to deploy telecommunications, such as in emergency rescue operations. MANET networks are very flexible, as new nodes join and other nodes leave arbitrarily, hence finding an optimal path to route data packets in MANET networks is a challenging domain. This paper presents a review on MANET optimisation routing areas to reveal hidden and less researched areas on swarm-based optimisation routing. The research findings can be used as a reference guide to understand swarm-based optimisation routing techniques in wireless networks. A framework covering various sub-themes on MANET routing optimisation has been developed. Exploration of the generated open research questions can be beneficial in the development of intelligent software critical to optimise mobile network solutions to satisfy network providers and subscribers needs.