Mobile Ad Hoc Network Routing Research Articles

IEEHR: Improved Energy Efficient Honeycomb based Routing in MANET for Improving Network Performance and Longevity

In present scenario, efficient energy conservation has been the greatest focus in Mobile Adhoc Networks (MANETs). Typically, the energy consumption rate of dense networks is to be reduced by proper topological management. Honeycomb based model is an efficient parallel computing technique, which can manage the topological structures in a promising manner. Moreover, discovering optimal routes in MANET is the most significant task, to be considered with energy efficiency. With that motive, this paper presents a model called Improved Energy Efficient Honeycomb based Routing (IEEHR) in MANET. The model combines the Honeycomb based area coverage with Location-Aided Routing (LAR), thereby reducing the broadcasting range during the process of path finding. In addition to optimal routing, energy has to be effectively utilized in MANET, since the mobile nodes have energy constraints. When the energy is effectively consumed in a network, the network performance and the network longevity will be increased in respective manner. Here, more amount of energy is preserved during the sleeping state of the mobile nodes, which are further consumed during the process of optimal routing. The designed model has been implemented and analyzed with NS-2 Network Simulator based on the performance factors such as Energy Efficiency, Transmission Delay, Packet Delivery Ratio and Network Lifetime.

Investigation of Video Streaming over MANETS Routing Protocols

For industrial and academic researchers from all around the world, the Mobile Ad-hoc Network (MANET) is a specific focus. A MANET was created as a result of the fast growth of wireless gadgets. Mobile Ad hoc network is a self-organizing network with no framework. MANET’s device has the ability to travel in any direction in order to transmit and receive data with other devices or network nodes. An administrator node which is capable of controlling other nodes is absent in MANET. All nodes in MANET act as its own router and host and arrange its own network. The most important element of MANET is Routing protocol. For routing in MANET, various routing protocol is responsible. Providing a video streaming service using mobile ad-hoc networks is a hard task. The network topology is immensely unstable and its instability causes data to be lost. The performance of MANET routing protocols for video applications has been examined in this paper. There are many routing protocols, however the Optimized Link State Routing (OLSR) protocol and Ad-hoc On-Demand Distance Vector (AODV) routing protocols are explored here. In this work, a comparison of these two effective routing protocols for supporting video streaming applications is offered.

Investigating Energy Efficiency of Mobile Ad-hoc Network Routing Protocols

Mobile Ad-hoc Network (MANET) is a wireless network that comes with a few routing protocols which have varied mechanisms. Studies show that routing operations consume energy while current research focuses more on MANET routing protocol operation and its performance evaluation, the required energy for successful routing operations equally demands quality attention of researchers. Hence, the need to expand the scope of study on MANET routing protocols to the neglected area of studies. To bridge the research gap between MANET routing protocols and energy consumption, this paper used residual energy to analyze routing protocols’ energy efficiency as a metric to analyze selected routing protocols; Destination Sequence Distance Vector (DSDV) and Ad-hoc On-demand Distance Vector (AODV) via simulation. It also compared the amount of energy required to transmit the data packets to their destinations in DSDV and AODV. Results, in terms of energy efficiency, indicated that AODV was better than DSDV because it consumed less energy for its successful routing operations

Performance and statistical analysis of ant colony route in mobile ad-hoc networks

<div class="WordSection1"><p>Research on mobile ad-hoc networks (MANETs) is increasing in popularity due to its rapid, budget-friendly, and easily altered implementation, and relevance to emergencies such as forest firefighting and health care provisioning. The main concerns that ad-hoc networks face is dynamic topology, energy usage, packet drop rate, and throughput. Routing protocol selection is a critical point to surmount alterations in topology and maintain quality in MANET networks. The effectiveness of any network can be vastly enhanced with a well-designed routing protocol. In recent decades, standard MANET protocols have not been able to keep pace with growing demands for MANET applications. The current study investigates and contrasts ant colony optimization (ACO) with various routing protocols. This paper compares ad-hoc on-demand multi-path distance vector (AOMDV), dynamic source routing protocol (DSR), ad-hoc on-demand distance vector routing (AODV), and AntHocNet protocols regarding the quality of service (QoS) and statistical analysis. The current research aims to study the behavior of the state-of-the-art MANET protocols with the ACO technique. The ACO technique is a hybrid technique, integrating a reactive route maintaining technique with a proactive method. The reason and motivation for including the ACO algorithm in the current study is to improve by using optimization algorithms proved in other domains. The ACO algorithm appears to have substantial use in large-scale MANET simulation.</p></div>

Design and development of anonymous location based routing for mobile ad-hoc network

Mobile ad-hoc network (MANET) consists of wireless nodes interacting with each other impulsively over the air. MANET network is dynamic in nature because of which there is high risk in security. In MANET keeping node and routing secure is main task. Many proposed methods have tried to clear this issue but unable to fully resolve. The proposed method has strong secure anonymous location based routing (S2ALBR) method for MANET using optimal partitioning and trust inference model. Here initially partitions of network is done into sectors by using optimal tug of war (OTW) algorithm and compute the trustiness of every node by parameters received signal strength, mobility, path loss and co-operation rate. The process of trust computation is optimized by the optimal decided trust inference (ODTI) model, which provides the trustiness of each node, highest trust owned node is done in each sector and intermediate nodes used for transmission. The proposed method is focusing towards optimization with respect to parameter such as energy, delay, network lifetime, and throughput also above parameter is compared with the existing methods like anonymous location-based efficient routing protocol (ALERT), anonymous location-aided routing in suspicious MANET (ALARM) and authenticated anonymous secure routing (AASR).

Enhancing OLSR Protocol by an Advanced Greedy Forwarding Mechanism for VANET in Smart Cities

The future Intelligent Transport System "ITS" is one of the major challenges of the smart city. It requires fast and efficient communication between vehicles (vehicle-to-vehicle “V2V”), to ensure information exchange in order to improve safety, which reduces accidents and consequently save lives, hence the need of the Vehicular Ad Hoc Network “VANET”, which makes possible the inter-vehicle communication. This network is characterized by a variable topology. Therefore, MANET (Mobile Adhoc NETwork) routing protocols need a few tweaks to be available for the vehicle environment. In this paper, we start by exposing some works related to the evaluation of the most well-known protocols. After a comparative study, we deduce that the OLSR (Optimized Link State Routing) protocol outperforms other routing protocols in terms of End-to-End Delay (EED) and Packet Delivery Ratio (PDR). In addition, we note that the Greedy forwarding “GF” mechanism is suited for the VANET environment, which has been improved and called Greedy forwarding Advanced “GFA”, to overcome the stationary node problem. Our approach improves the OLSR protocol to be more suitable and efficient for VANET by introducing the GFA mechanism. Moreover, we compare our approach to the OLSR classic version. In this work, we use a realistic scenario from Open Street Map (OSM), and simulations are performed using SUMO (Simulation of Urban MObility). The trace files generated from SUMO are used for further simulation in NS-3 (Network Simulator) to validate our proposition. The simulation results are analyzed and discussed. Our approach performs best compared to OLSR in terms of EED and PDR, especially for dense traffic.

Hybrid trust and weight evaluation-based trust assessment using ECK-ANFIS and AOMDV-REPO-based optimal routing in MANET environment

Many researchers have been inspired to work on diverse challenges by a particularly favourable platform, namely mobile ad hoc networks (MANET) routing optimization. However, the lack of trust assessment is one of MANET’s main flaws. As a result, trust-based routing has received increasing attention in MANET over the last few years. Hence, the majority of recent work has focused on the development of routing protocols for security enhancement in a hostile environment. However, on the MANET environment, these protocols have many weaknesses and are also not that much secure. Hence, the primary goal of this study is to design a framework for balancing multiple performance measures in order to find the optimal multipath routing solution. In this scheme, we have employed the exponential cauchy kernelized adaptive neuro-fuzzy inference system (ECK-ANFIS) focused trust assessment with hybrid trust (HT) evaluation and optimal MANET routing. The ECK-ANFIS evaluates the trust after the nodes are initialised where, HT and the weight value, which are estimated for each node throughout the evaluation. The performance of the proposed mechanism has been measured using the various metrics defined in the existing protocols and also proved the superiority of the scheme by comparing it with other related ones.

A Secure Approach to Autonomous Mobile Ad-Hoc Networks Using Superman Technique

Abstract: Mobile Ad-hoc Networks or MANETs are mostly found where any fixed facilities are not available and so it is dynamic. Secure transmission of data is an important aspect in MANET. They have unique characteristics like dynamic topology, wireless radio medium and lack of centralized administration. As a result they are vulnerable to different types of attacks in different layers of protocol. To protect these networks, various security protocols have been developed. To address these issues, a framework called Security Using Pre-Existing Routing for Mobile Ad-hoc Networks (SUPERMAN) [ 1 ] is proposed. This paper presents a security framework SUPERMAN which enables data confidentiality and prevention of data loss by using AES encryption. And a report is generated at the destination side to view user details, path details and attack node details. Keywords: mobile ad hoc networks, node authentication, data confidentiality.

Energy Factor Based Routing Algorithm for Lifetime Enhancement in Mobile Ad-Hoc Networks

Energy consumption and dissipation of mobile nodes is considered as one of the significant aspect affecting the entire lifetime of Mobile Ad-Hoc Networks (MANETs), as the nodes depends on limited battery power. In addition, spatial and temporal characteristics of mobile nodes also make energy imbalance in the network. Towards this, there are several studies that emphasis on improving the network lifetime and reliability by altering the existing MANET routing protocols. In this paper, an Energy Factor based Ad-Hoc On Demand Distance Vector routing algorithm (EF-AODV) is proposed in MANETs for lifetime enhancement. The proposed technique includes two algorithms by leveraging the cross layer paradigm. Firstly, proposed EF-AODV dynamically chooses intermediate nodes based on battery power, and mobility of the nodes in the direction of destination. Secondly, for uniform energy consumption, we calculate the energy factor at each intermediate mobile node by considering the sleep and ideal states of the nodes along with mobility. Further, the energy factor is considered as a key metric to obtain the optimal path from the source to the destination to balance the energy disparity in the network, leading to reduced delay in packet transmission. The path with highest energy factor value is selected for networking of data packets. Upon extensive simulation using Network Simulator (NS-2.34), we illustrate that the proposed EF-AODV outperforms over existing ad-hoc routing approaches under the various performance metrics.

The Impact of selfishness Attack on Mobile Ad Hoc Network

Mobile Ad-Hoc Network (MANET) is an infrastructure-less network that has the ability to configure itself without any centralized management. The topology of MANET changes dynamically which makes it open for new nodes to join it easily. The openness area of MANET makes it very vulnerable to different types of attacks. One of the most dangerous attacks is selfishness attack. In this type of attack, each node tries to save its resources, behave selfishly or non-cooperatively by not forwarding packets that are generated by other nodes. Routing in MANET is susceptible to selfishness attack and this is a crucial issue which deserves to be studied and solved. Therefore, the main objective of this paper is to study the impact of selfishness attack on two routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Destination Sequenced Distance Vector (DSDV), as a try to find the most resistant routing protocol to such attack. The contribution of this paper is a new Selfishness Attack Model (SAM) which applies selfishness attack on the two chosen routing protocols in the NS-2 simulator. According to the conducted simulation results, AODV shows higher performance than DSDV under the effect of selfishness attack.

Recommendations Based QoS Trust Aggregation and Routing in Mobile Adhoc Networks

In mobile adhoc netwotk (MANET), a node’s quality of service (QoS) trust represents how much it is reliable in quality. QoS trust of a node is computed based on its multiple quality parameters and it is an interesting and challenging area in MANETs. In this work, QoS trust is evaluated by taking into consideration quality parameters like node residual energy, bandwidth and mobility. The proposed method “Recommendations Based QoS Trust Aggregation and Routing in Mobile Adhoc Networks-QTAR” is a frame work. Where the trust is established through four phases like QoS trust computation, aggregation, propagation and routing. The Dempster Shafer Theory (DST) is used for aggregation of trust recommendations. In the network, trust information is propagated through HELLO packets. Each node stores the QoS trust information of other nodes in the form of trust matrices. We applied matrix algebra operations on trust matrices for route establishment from source to destination. The time and space complexity of proposed method is discussed theoretically. The simulation is conducted for the varying of node velocity and network size, where the proposed method shown considerable improvement over existing protocols.

EEPR-OLSR: an Energy Efficient and Path Reliability protocol for proactive MANET routing

Routing in Mobile Ad-hoc Networks has received a lot of attention due to the challenges posed by the self-organizing nature of the network, the dynamic topology, and the unreliable wireless medium. One of the most critical issues for MANETs is how to increase network lifetime, since nodes are typically battery powered. In this paper we consider the proactive MANET protocol OLSR to improve the network lifetime, we propose a novel multiple metric routing scheme for MANET, based on energy efficient and path reliability metrics, integrating it to standard OLSR, named Energy Efficient and Path Reliability OLSR (EEPR-OLSR), in which we investigate cross layer parameters that effect the network lifetime and a prediction-based link availability estimation is introduced. Simulation results, by NS3 simulator, show that the proposed EEPR-OLSR provides significant performance gains in both the network lifetime and packet delivery ration (PDR), compared to the standard OLSR.

A cryptographic approach to prevent network incursion for enhancement of QoS in sustainable smart city using MANET

A city-wide communication network capable of supporting a range of applica- tions should be established through the use of wireless sensor networks that collect, analyze, and act on data in order to provide solutions for smart city im- plementation. A smart city network confronts a number of obstacles, including changing the network's coverage area to accommodate different applications, non-uniform node distribution, an increase in message volume, the use of multi- ple communication technologies, and node and message heterogeneity. Numer- ous aspects of smart cities are being investigated, with a few applications being developed in each. This article conducts a survey to describe various sensor network choices for smart cities. The research explores message transmission challenges via the lens of applications such as taxi sharing, ambulance services, and other emergency services that rely on real-time traffic data provided by the smart traffic domain to work successfully. Mobile Ad Hoc Networks (MANETs) are employed in a range of areas due to its advantage in rapidly establishing networks. The network will perform ideally if mobile nodes collaborate and trust one another; hence, message transmission for this service, as well as the utility of MANET routing algorithms, are examined.

Multipath routing protocol based on backward routing with optimal fuzzy logic in medical telemetry systems for physiological data measurements

<p class="Abstract">Mobile ad hoc network (MANET) performance is critically affected by the mobility and resource constraints of nodes. Node mobility will impact on connecting stability, and node resource limitations will result in congestion, so the development of a routing protocol that promotes quality of service (QoS) in MANET is quite difficult. In particular, frequent interrupting connection may degrade QoS performance in the high-speed node drive scenario, so it is required to build the MANET protocol routing which can be adapted for changes in the networking architecture to support QoS. Moreover, MANET's multipath routing is the most necessary for secure transmission that can be achieved if self-centered nodes in the MANET network are ignored. Secure routing guarantees the reliability of data, confidentiality, authorization and authentication and non-denial. A novel safe multi-way method for dependable data transfer, which depends on the quality of service, is offered in this study. The Ad Hoc on Demand Backward Routing protocol with Optimal Fuzzy Logic (OFL) is also designed to provide multi-path routing. The hybridization of the bat optimization approach provides the optimum route by generating rules in OFL, and hence chooses an optimal rule. The efficiency of the planned technique is evaluated for factors such as final delay, the packet delivery ratio and so on. When the node is 150, the proposed hybrid bat algorithm achieved 0.61 of average packet latency, where the existing technique Particle Swarm Optimization achieved nearly 1.2 to 1.3 packet latency. In this communication network, measurement of packet delivery ratio is an important task for establishing the communication network. The results show that our suggested work has more energy efficiency and network lifetime than existing ones.</p>

Extended buffer zone algorithm to reduce rerouting time in biotelemetry systems using sensing

Mobile Adhoc Network (MANET) routing methods must deal with connection breakdowns caused by frequent node movement, measurement and a dynamic network topology. In these cases, the protocol must discover alternate routes. Rerouting time refers to the lag that happens during this retransmission. Researchers have proposed many ways to reduce rerouting period. One such technique is buffer zone routing (BZR), which divides a node transmission region into a safe zone adjacent to the node and a hazardous zone towards the end of the broadcast range. This technique, however, has rare gaps and restrictions, such as the ideal dimensions of the buffer zone, a rise in hop duration, network stress, and so on. This study offers a method to improve or expand buffer zone communication by grouping nodes inside the buffer zone into virtual zones based on their energy flat. When the routing decisions are made quickly, the energy consumption of the nodes is minimized. In the safe area of extended BZR, transfer time is reduced, and routing efficiency is increased. It solves issues in the present algorithm and fills holes in it, decreasing the time required for rerouting in MANET.

A Comparative Study of Routing Protocols for Minimum Path Cost Matric in MANETS

The Routing is the process of transmitting data packets from one node to another another node from source to destination The Mobile Adhoc Networks (MANETs ) doesn't have any fixed network structure or any centralized process to administer. The selection of the route is important for performance of packet transfer from source to destination. These routing protocol are classified as inter domain routing and Intra domain routing protocol. The routing protocols have been classified into Non Reactive , Reactive and Hybrid protocols. In the present paper we proposes to compare reactive routing protocols videlicet Ad hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR) protocols, Temporarily Ordered Routing Algorithm (TORA) and Associativity Grounded Routing (ABR) protocol.The Routing in MANETs is a one of the robustly and demanding task and has entered a great quantum of mindfulness from experimenters around the globe. To overcome this problem, a colorful number of routing classes have been introduced and the number is still rising day by day fastly. It's relatively hard to decide which protocols or routing classes may do well under an quantum of different network scripts similar as network volume and network topology etc. The study and performance of the above mentioned protocol has also been tabulated in the present two tables . The protocols are based on minimum power and temporary configuration of topology. The table 1 gives comparison of the main characteristics of routing protocols and Table2. provide comparison of various reactive routing protocol.

Novel Framework-Based Routing for Task-Adaptive Mobile Networks of Unmanned Aerial Vehicular

Many practical mobile ad hoc networks (MANET) have certain tasks instead of just randomly changing each node’s positions. We call such a mission-driven network task-adaptive MANET. A typical example is the flying ad hoc network (FANET) that consist of unmanned aerial vehicles (UAVs), which may change its network topology based on different task requirements. Each node moves to new locations based on the targeted network shape. To maintain a smooth topology transformation and minimize the position changes, during shape change, a MANET typically keeps the core-area nodes more stable and allows the nodes in the outer area of the network to move more drastically. This means the entire network has an approximate framework that reflects the relatively stable nodes located in the core area. This research proposes a new routing scheme to quickly identify the optimal end-to-end path using the network framework extraction result. The proposed routing scheme ensures that the packets flow along the more stable network regions (thus with a lower packet loss rate). The framework extraction scheme is based on network shape geometry analysis for the median axis recognition. Our work has contributions to three aspects of realistic network protocol applications: (1) Provides a network multi-center election and member control methodology with detailed protocol design. (2) Creates a stable and reliable MANET framework extraction algorithm which aids in routing table generation. (3) Real-time Unix system protocol implementation and emulation based on Common Open Research Emulator (CORE) + Extendable Mobile Ad-hoc Network Emulator (EMANE). Simulation results indicate that our framework-based routing scheme outperforms a popularly used mobility-adaptive MANET routing scheme—OLSR (optimized link state routing)—in terms of throughput and delay.

Mobile Ad Hoc Network Improvement against Jammers for Video Applications Using Riverbed Modeler (v17.5)

MANETs (Mobile Ad hoc Networks) had become the most important next generation wireless network technologies. It is made up of self-configurable mobile nodes, Intruders mieght decrease MANET functionality due to the dispersed and wireless nature of MANETs, and therefore they were vulnerable to numerous attacks at different levels. The important challenges for MANET were the security and routing protocols. This paper examined the impact of Jammer which it was a kind of DoS attack which interfere with the normal operation of network and show how the Jammer increased the delay and data dropped and decreased the throughput which they were the important parameters for the measurements of network performance. This performance could be improved using routing protocols (AODV, DSR, OLSR and GRP). Riverbed Modeler Academic Edition (17.5) was utilized for this study in number of modeled scenarios for video applications. The results address the impact of Jammers and show that the MANET's Routing Protocols could improve the throughput and data dropped of the network but on the expense of increasing the delay.

Mobile Ad-hoc Networks: A Survey on multipath routing protocols

A Mobile Ad Hoc Network (MANETs) connects mobile nodes without any base station. These nodes in the network can change the topology dynamically and transfer the data among themselves. The nodes in the MANET are categorized based on the resource factors like memory, computation, and power levels. The dynamic change in route makes the connection of the destination node more complex. Sometimes, it results in link failure, and hence the primary route is failed, which means an alternative route is required to transmit the packets. It required multiple paths from the source node to destination node with a stable path connecting the source node. This issue makes MANET routing a crucial task. To address these problems, multipath routing in MANET is discussed in this paper. Multipath routing provides various paths for a single source node to a single destination node. It is more important to consider load balancing and fault tolerance when establishing the multipath routing mechanism. This paper describes the various type of challenges along with their respective multipath routing protocols in MANETs.

Investigation of a GNN approach to mitigate congestion in a realistic MANET scenario

Mobile Ad-hoc Networks (MANETs) can be modelled as time-varying graphs as their topology and traffic demands change. Optimizing routing in MANETs by proactively adapting the routes is a challenge, even with a fixed topology and user demand Omniscient Dijkstra Routing (ODRb) is one of the best known approaches, which computes alternative paths but has limitations to mitigate congestions. In this paper, we investigate Graph Neural Networks (GNNs) for routing optimization in MANETs. Our contribution is inspired by the centralized GNN-based Data Driven Routing (GDDR) framework developed by Hope [1]. GDDR was developed for optical fibre networks to support time varying user demands. After failing to obtain good results using the GDDR approach on the tactical Anglova MANET scenario, we adapted GDDR to minimize the maximum number of traversals. Our GNN-t proposal is able to find alternative longer paths mitigating congestion on central nodes. Considering a challenging static topology, the first second of the 24-node Anglova scenario: GNN-t achieves a Completion Ratio of CR=99% for a traffic of acked-messages averaging 1msg/s/node and CR=77% when the traffic is doubled (2msg/s/node). For the challenging first 300s of Anglova CP1, similar performance is reported for ODRb and GNN-t: CR=81% without fading and CR=54% with fading.