Scheme For Mobile Ad Hoc Networks Research Articles

An adaptive congestion and energy aware multipath routing scheme for mobile ad-hoc networks through stable link prediction

Advancement in mobile ad-hoc network (MANET's) has offered solutions to wide range of real-time applications. MANET's consist of group of battery operated wireless mobile nodes that forms a dynamic topology and functions autonomously without infrastructure. Mobile nodes are limited to resource, bandwidth, energy and memory. Due to mobile nature of the nodes, mobility and resource limitations are the two major factors that affect MANET's performance. Frequent topology changes and mobility affects the link stability between two nodes, frequent link interruption results in network congestion, lead to packet drop and increase retransmission delays. During multihop data transmissions, the wireless channel is shared among neighbour nodes. Determining the channel status and predicting the quality of link is still a challenging issue. Existing MANET's routing scheme considers optimal hop count as a metric for data transmission and selects the shortest path. Due to nodes movement, frequent link failure occurs, resulting in packet loss and retransmission of packet, which restablished path avoids packets loss, and alternate paths can be discovered within time such that congestion is controlled and delay is minimised. Therefore, it is required to design routing scheme for MANET's that can adapt to network changes and conditions to support quality of service (QoS). In this paper, we propose an Adaptive Congestion and Energy Aware Multipath Routing Scheme (ACEAMR) to provision QoS requirements in MANET's. ACEAMR discovers stable, energy aware, and congestion free paths towards destination. The congestion level at node is determined by computing queue utilization through adaptive feedback mechanism. ACEAMR integrates stable link prediction (SLP) to estimate the link quality and channel availability for reliable data transmission. Energy aware nodes are computed using fitness function of nodes having sufficient energy to extend network lifetime. Simulation results show that proposed ACEAMR achieves 30 % of higher throughput, 25 % more in packet delivery ratio, 27 % less delay and 28 % energy efficient compared to LLECP-AOMDV, OLEADM and AOMDV schemes.

An Energy Efficient and Cost Reduction based Hybridization Scheme for Mobile Ad-hoc Networks (MANET) over the Internet of Things (IoT)

Wireless networks are viewed as the best-used network and specifically Portable Specially Appointed Organizations (MANETs) have tracked down numerous applications for its information transmission progressively. The plan issues in this organization are to confine the utilization of energy while communicating data and give security to the hubs. Soa protocol needs to be energy efficient to avoid network failures. Thereby this paper brings an effective energy efficient to optimize LEAR and make it energy efficient. The energy-mindfulness element is added to the LEAR guiding convention in this work using the Binary Particle Swarm Optimization method (BPSO). The recommended method selects programmes taking into account course length in addition to the programme level of energy when predicting the future. To get good results, the steered challenge is first designed using LEAR. The next step is to choose a route that enhances the weighting capability of the study hours and programming power used.This MANET has been secured using the cryptographic method known as AES.According to experimental findings, the proposed hybrid version outperformed other cutting-edge models.

Efficient Multimedia Content Transmission Model for Disaster Management using Delay Tolerant Mobile Adhoc Networks

Natural and manmade disasters such as earthquakes, floods, unprecedented rainfall, etc. pose several threats to our society. The citizens upload disaster information in the form of multimedia content such as pictures, audio, and videos. Efficient information and communication framework are critical for disaster management. Mobile Adhoc Networks (MANET) have been used effectively for disaster management. However, Disaster management prerequisites following Quality of Service (QoS) requirements such as bandwidth, high delivery ratio, low overhead, and minimal latency; however, the existing data transmission scheme induces high latency and overhead among intermediate devices; In order to meet the QoS requirement of disaster management applications in this paper, High Delivery Efficiency and Low Latency Multimedia Content Transmission (HDELL-MCT) scheme for MANETs is presented. Then, an improved buffer management scheme is presented for meeting disaster management performance and latency prerequisites. The experiment is conducted using ONE Simulator, the outcome shows the HDELL-MCT scheme achieves very good performance considering different QoS metrics such as improving delivery ratio by 38.02%, reducing latency by 7.53% and minimizing hop communication overhead by 65.1% in comparison with existing multimedia content transmission model.

Enhanced-AODV Routing Protocol to Improve Route Stability of MANETs

Establishing and maintaining link stability in Mobile Ad hoc Networks (MANETs) is one of the key challenging issues. Topology changes in MANET because overhead traffic that leads to consuming extra energy of nodes as well as decreasing the performance of routing protocols. Thus, a comprise approach should be considered during the design of a routing scheme in MANETs to deal with challenges incurred by the mobility of the nodes. In this study, a simple efficient routing scheme called Enhanced_AODV (E-AODV) is proposed, aiming to enhance Ad Hoc On-Demand Distance Vector (AODV) routing protocol performance by constructing the most stable and reliable route from source to the destination node. In this routing scheme, the remaining lifetime of links and hop count are the metrics considered for calculating the Route Stability Factor (RSF) that can be utilized as a cost metric to establish the best route between source and destination node. The simulation results reveal that the proposed E-AODV routing scheme effectively outperforms the conventional AODV routing protocol and Stable and Bandwidth Aware Dynamic Routing Protocol (SBADR) in terms of packet delivery ratio, average network throughput, average end-to-end delay, and normalized routing overhead.

Adaptive Strategy to Change Firing Phases of Collided Nodes in Extended-Desync TDMA-Based MANETs.

As a multi-hop extension of the desynchronization-based TDMA (Desync-TDMA), the extended Desync-TDMA (Ext-Desync) with self-adapting property is proposed to overcome the limitations of existing CSMA/CA and dynamic TDMA-based schemes for Mobile Ad-hoc Networks (MANETs). However, existing studies overlooked the potential problem of firing message collisions caused by node movements, leading to the severe degradation of MANET networking performance. In this paper, we derive a mathematical model to evaluate the problem due to collisions of firing messages for moving nodes. With the derived model, we propose a method for a collided node to determine whether it changes its firing phase or not, adaptively in a distributed manner, by considering both the collision situation and the slot utilization. The comparative analysis between the proposed method and existing representative ones is also presented for various networking features. The performances of the proposed method are compared with CSMA/CA as well as other existing Ext-Desync-based schemes. The numerical results show that the proposed method achieved much faster resolution and higher slot utilization in collision situations than other Ext-Desync-based schemes. In addition, we also show that the proposed method outperformed the comparable methods, including CSMA/CA, in terms of packet delivery ratios and end-to-end delays.

An Active-Routing Authentication Scheme in MANET

Mobile ad-hoc networks (MANET) is a network mode that does not depend on network infrastructure and central access. The fast and flexible networking mode of MANET renders its wide applications in specific scenarios. However, rapidly changing topology and open channels bring potential security problems. In this paper, we proposed an active-routing authentication scheme (AAS) based on the characteristics of active routing protocols. We formally demonstrated that the AAS is effective against selective forwarding attack, false routing attack, byzantine attack and route spoofing attack using the BAN logic considering the possibility of malicious nodes mingling in MANET. Experimental results show that the AAS is compatible with multiple active routing protocols and it is able to increase the packet delivery rate by 33.9%, with an average increase of 18.4% in the network containing some malicious nodes. Furthermore, the AAS is robust which remains the average network connection rate reach 1.6 times of the collusion attack prevention-OLSR(Cap-OLSR) protocol and preserves 79.2% of the network performance in simulation experiments with attacks from malicious nodes.

TASM : Trust Aware Scheme for Secure and Reliable Data Transmission in MANETS

Wireless sensor nodes are tiny and have limited battery and memory. These sensor nodes are distributed and self organizing networks. Mobile Ad Hoc network (MANETs) has wide range of applications areas. Growing usage of MANETs in various applications makes a paramount issue in providing QoS. MANETs are vulnerable to different kinds of malicious attacks due to its dynamic nature, which affects nodes connectivity, increase in energy consumption and functionality. Centralized and cryptographic security approaches requires more computational functions which increases overhead. Traditional approaches have more overhead. Most existing trust-based security schemes for mobile ad-hoc networks (MANETs) consider packet loss an indicator of possible attacks by malicious nodes. Thus to achieve secure and reliable data transfer a trust aware scheme is required to evaluate trust level among honest and malicious nodes. In this paper we propose Trust Aware Scheme for Moving nodes (TASM) which discovers efficient node by computing each node’s trust value. In this scheme moving nodes exchange their trust information and analyses the received trust value and makes judgement. This scheme modifies the existing AODV routing protocol and determines malicious nodes based on trust value and log information. Received Signal Strength Indicator (RSSI) determines efficient and trusted neighbour node selection while routing. Proposed scheme is compared with the existing trust based scheme and network parameters like throughput, packet delivery ratio and end to end delay is evaluated. Trusted routing can efficiently deliver data for different routing applications used in military, Fanets and mobile IoT.

Hybrid Differential Evolution Based Probabilistic Model to Support Quality Aware Best Path Routing Scheme for Mobile Adhoc Networks

The Mobile Ad hoc Networks (MANETs) today represent a new system containing wireless mobile nodes to dynamically and freely organize the topologies of the network without having any communication infrastructure. Owing to the traits such as temporary topology and the absence of a proper centralized authority routing can be a very important issue faced by the ad hoc networks. This multipath routing algorithm has established various paths between the source node and its destination node thus spreading traffic load along various routes. This will be able to alleviate congestion of traffic on a particular path. Thus, the multipath routing algorithms were able to provide route resilience that ensured data transmission reliability. For the purpose of this work, there was a multipath routing scheme which is called the Ad hoc On-demand Multipath Distance Vector Routing (AOMDV) Protocol. This was proposed by means of employing a hybrid Fire Fly (FF) with Differential Evolution (DE) algorithm. This approach was able to achieve better, as well as, reciprocal advantages in a dynamic and hostile network situation. Thus, the proposed scheme of routing was a very powerful method to find effective solutions to MANET routing problems. The proposed method is a well-known probabilistic metaheuristic algorithm to improve the quality aware best path routing protocol. Simulation results indicate that the proposed method FF-DE achieves better performance than AOMDV and FF.

Notice of Violation of IEEE Publication Principles: Clustering Schemes in MANETs: Performance Evaluation, Open Challenges, and Proposed Solutions

Notice of Violation of IEEE Publication Principles Schemes in MANETs: Performance Evaluation, Open Challenges, and Proposed Solutions, by T. Rahman, I. Ullah, A. U. Rehman and R. A. Naqvi,in IEEE Access, vol. 8, January 2020, pp. 25135-25158 After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE’s Publication Principles. This paper contains a figure (Figure 18) that was copied from the paper cited below. The figure was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission. BICSF: Bio-Inspired Clustering Scheme for FANETs, by A. Khan, F. Aftab and Z. Zhang,in IEEE Access, vol. 7, March 2019, pp. 31446-31456 Mobile ad hoc networks (MANETs) have recently received a lot of attention from researchers due to their ease of deployment and versatility. Clustering is one of the most efficient ways to coordinate routing in MANETs to improve network performance using different attributes and metrics. In this paper, the authors have extensively studied clustering schemes and divided the schemes into multiple types based on the Cluster Head (CH) selection criteria, which provides a good understanding of how each type of clustering algorithm differs from each other. The authors analyzed the performance of existing schemes based on the quality of service (QoS) metrics. Based on findings, the authors clarified some important tradeoffs between QoS metrics and also established some important factors influencing the efficiency of clustering schemes. These studies also contain open research challenges and proposed solutions to improve the performance of clustering schemes.

Contention Window and Residual Battery Aware Multipath Routing Schemes in Mobile Ad-hoc Networks

Contention Window and Residual Battery Aware Multipath Routing Schemes in Mobile Ad-hoc Networks

Location Aware Routing Schemes for Mobile Adhoc Networks

Location Aware Routing Schemes for Mobile Adhoc Networks

Differential Evolution Based Probabilistic Model to Support Quality Aware Best Path Routing Scheme for Mobile Ad-Hoc Networks

The mobile ad hoc networks have made the source and the influenced shortest path routing extremely challenging owing to their unstable and dynamic topology. Even though the nodes keep moving and this increases the packets and their retransmission and this brings down the delivery ratio. The Ad hoc networks with their quick deployment and minimal configuration are well-suited for these emergency situations such as disasters that are human-induced, medical situations or emergency, military conflicts and so on. Every mobile node found in a Mobile Ad hoc Network (MANET) can perform a routing function to establish some communication among various nodes, their "death" and also of some nodes owing to the exhaustion of energy that can disrupt service of the whole network. The ad hoc on-demand distance vector routing (AODV) is that routing protocol which gets established at a time there is a demand for another new route. It is found to be similar to the energy and the other parameters of Quality of Service that includes throughput, security, jitter and end-to-end delay. For this work, there is a probabilistic routing scheme which is quality aware for enhancing and improving the mobile ad hoc network and its throughput and this is known as a Differential Evolution (DE). As opposed to looking out for a path that is the shortest, this heuristic has proposed the best path to ensure that there is an overall quality of service that is ensured. This algorithm which is based on the DE has improved the chances of selecting the ideal route for data transmission.

Analytical comparisons of query-broadcast repealing schemes in MANETs

Recent research in mobile ad-hoc networks (MANETs) mostly deals to minimize the broadcast expenses of route discovery by controlling the query-broadcast. In this regard, a variety of broadcast-repealing schemes have been proposed, and employed to improve effectiveness and efficiency in various aspects of route-discovery considering time and energy. These schemes mainly focus on reducing unnecessary propagation of route-query by repealing the query-broadcast. Time-to-live based broadcast is the most common controlled-flooding scheme widely used in routing protocols. Recently some other broadcast-repealing schemes are proposed which work based on chasing-policy. The critical and analytical assessment to evaluate these schemes such aspects is of great importance. In this paper, we investigate their query-diffusion process, and their merits and demerits.

QASEC: A secured data communication scheme for mobile Ad-hoc networks

Mobile Adhoc NETworks (MANETs) are valuable for various applications due to an efficient, flexible, low-cost and dynamic infrastructure. In these networks, proper utilization of network resources is desirable to maintain Quality of Service (QoS). In multi-hop end-to-end communication, intermediate nodes may eavesdrop on data in transit. As a result, a secured and reliable data delivery from source to destination is required. In this paper, we propose a novel scheme, known as QASEC, to achieve better throughput by securing end-to-end communication in MANETs. The QoS is maintained through an optimal link selection from a queue of available transmission links. The end-to-end communication is secured by authentication. A simple secret-key based symmetric encryption is deployed for interacting nodes. Our proposed QASEC scheme prevents the malicious nodes from data exchange with legitimate intermediate nodes on any established path between the source and the destination. Experimental results show that QASEC performs better in terms of packet-loss rate, jitter and end-to-end delay. Furthermore, QASEC is efficient against various attacks and has a much better performance in terms of associated costs, such as key generation, encryption, and storage and communication.

An efficient intrusion detection in resource-constrained mobile ad-hoc networks

We propose an efficient intrusion detection scheme for Mobile Ad-hoc Networks (MANETs). The scheme allows the reinforcing of network security while preserving the resources of the network nodes (e.g. energy). More specifically, the proposed solution provides MANETs with a distributed intrusion detection system in which activation is made according to the estimated threat. Our approach is characterized by the use of game theory for modeling interactions between a defense coalition and a potentially malicious sender node. We study these interactions in Bayesian games by considering the uncertainty about the sender node's maliciousness. Both one-shot and repeated situations are studied in this work. Particularly, in the repeated Bayesian game formulation, the defense coalition is allowed to adapt its defense strategy by exploiting the revealed information from the observations of the sender node's past actions. Furthermore, we perform a thorough analysis of equilibria emerging from game models and their conditions of existence. Finally, a series of simulations are conducted to show the effectiveness of the proposed approach.

Sensitivity Analysis of an Attack-Pattern Discovery Based Trusted Routing Scheme for Mobile Ad-Hoc Networks in Industrial IoT

Mobile ad-hoc networks (MANETs) are pervasive autonomous networks that will play a vital role in future Industrial Internet-of-Things communication, where smart devices will be connected in a completely distributed manner. However, due to lack of infrastructure and absence of centralized administration, MANETs are shrouded with various security threats. Some internal mobile nodes in these resource constrained networks may compromise the routing mechanism in order to launch denial-of-service attacks to carry out distinct kinds of packet forwarding misbehaviors. In order to address this issue, in our previous paper, we devised a trusted routing scheme with pattern discovery (TRS-PD), which identifies packet dropping adversaries in advance by monitoring and analyzing their behavior during route discovery phase. In this paper, we perform sensitivity analysis of TRS-PD which is carried out by varying values of different parameters in distinct network scenarios in the existence of three distinct packet dropping attacks. In addition, this work summarizes the attack-pattern discovery mechanism, trust model, and routing mechanism adopted by TRS-PD in order to counter the adversaries which follow certain attack patterns along with other adversaries. Experiments conducted with network simulator-2 indicate the correct choices of parameter values for distinct network scenarios.

Secure and reliable communication scheme for MANET using ECMS cluster head-based certificate revocation

Mobile ad hoc networks (MANETs) have received increasing attention due to their ease of deployment and mobility. However, MANETs are more suspicious to various malicious activates and unauthorized access. In order to overcome this issue, we have proposed a cluster based certificate revocation method to isolate the malicious node and prevent the unauthorized access. The proposed algorithm effectively used to solve security issues in MANET. The proposed framework is demonstrated as following blocks, namely, cluster construction, cluster head selection, certificate authority, node classification, certificate revocation and evaluation of false accusations. Especially, we have proposed ECMS algorithm for identifying the best cluster head in each cluster. The ECMS algorithm is stands for energy (E), connectivity (C), mobility (M) and signal to noise ratio (S). The sensor nodes present in the network are classified into three types, namely, normal node, warned node, and revoked node. In certificate revocation procedure, every node present in the network is monitored with the help of one-hop neighbours. These neighbours are also used to collect the malicious information about the sensor nodes. If any node is wrongly identified as a malicious node then its legitimate nodes send the vindication packets (VPs) to the appropriate gateways to correct the mistake. The performance of the proposed cluster based certificate revocation method is evaluated on the basis of various parameters it includes successful certification ratio (SSR), settling time (ST), average certification delay (ACD), packet delivery ratio, normalized overhead (NRO), end-to-end delay and throughput. The simulation results of the proposed algorithm are compared with the trust based algorithm, non-voting based algorithm and voting based algorithm. The experimental results proved the good performance of the proposed cluster based certificate revocation method.

Energy and mobility conscious multipath routing scheme for route stability and load balancing in MANETs

Mobility and limited energy resources of nodes are the most critical attributes of Mobile Ad hoc Networks (MANETs). The mobility of the nodes changes the network's topology in an unpredictable manner, which in turn, affects the stability of connected paths. In addition, it causes an excessive overhead traffic that leads to a higher energy consumption and degrades the performance of routing protocols. Therefore, a routing scheme in MANETs should comprise techniques that cope with challenges incurred by both the energy failures and node's mobility. In this paper, we proposed Multipath Battery and Mobility-Aware routing scheme (MBMA-OLSR) based on MP-OLSRv2. Specifically, the study exploits a Multi-Criteria Node Rank (MCNR) metric that comprises the residual battery energy and the speed of nodes. It aims to rank the stability of the links using a link assessment function and to select the most efficient and stable paths to the destination. Moreover, an Energy and Mobility Aware Multi-Point Relay (EMA-MPR) selection mechanism is introduced and utilized by the MBMA-OLSR to set the willingness of nodes to contribute as MPRs, for flooding topological information. We implemented the proposed scheme as an extension to the EXata network simulator. Benefits of the innovative scheme have been demonstrated and validated under various simulation scenarios based on different mobility parameters. The simulation results provided evidence of the effectiveness of our scheme, especially during the high mobility scenarios with heavy traffic load where it outperformed the conventional MP-OLSRv2 routing protocol in terms of QoS and energy related metrics.

Neighbor discovery and routing schemes for mobile ad-hoc networks with beamwidth adaptive smart antennas

The use of smart directional antennas in ad-hoc networks has recently received much attention since this technology offers a way to optimize power consumption, increase spatial reuse and reduce co-channel interference. Neighbor discovery is an important first step for these self-configured networks because it makes it possible to identify the active nodes surrounding a given node and this information is essential for other higher layer protocols like medium access control, routing and topology control protocols. In this article, we present two algorithms that aim to take full advantage of the capabilities of smart antennas. The first one aims to increase the number of discovered nodes by considering the nodes that are located in the second-hop neighborhood of a node. The second algorithm seeks to reduce the number of hops in a route between source and destination nodes by using the extended range that can be achieved when the nodes are equipped with directional antennas. The results of the simulations have shown a reduction in the end-to-end delay and an increase in the network throughput when the scheme is compared with other reactive routing protocols.

Fine-Grained Analysis of Packet Loss in MANETs

Most existing trust-based security schemes for mobile ad-hoc networks (MANETs) consider packet loss an indicator of possible attacks by malicious nodes. There may be several reasons for packet losses, such as interference, queue overflow, and node mobility. Identifying the real underlying cause of a packet loss event is important for any security solution. To detect truly malicious nodes, it is necessary to carry out a fine-grained analysis (FGA) to determine the underlying cause of such loss. Without such analysis, the performance of any security solution may degrade, due to the punishment of innocent nodes while actual malicious nodes may remain undetected. Therefore, approaches are required that can correctly identify the reason for packet losses and can react accordingly. In this paper, we present a scheme that is able to correctly identify malicious nodes, using network parameters to determine whether packet losses are due to queue overflows or node mobility in MANETs. The contributions of this paper include the FGA scheme for packet loss and the development of a comprehensive trust model for malicious node identification and isolation. Our proposed FGA scheme is evaluated in terms of effectiveness and performance metrics under different network parameters and configurations. The experimental results show that our proposed trust model achieves a significant reduction in false positives rate and an increase in the rate of detection of truly malicious nodes compared with traditional non-FGA schemes.