Mobile Ad Hoc Network Routing Research Articles

MAC Layer Energy Consumption and Routing Protocol Optimization Algorithm for Mobile Ad Hoc Networks

Mobile ad hoc network is a network composed of mobile terminals without infrastructure. Due to its fast-networking ability, it is widely used in smart cities, car networking, military, agriculture, medicine, and other fields. Routing technology is a key technology in the field of MANET (mobile ad hoc network). The energy consumption is optimized through the technical network simulator NS-3, and the nodes in the MANET routing protocol can accurately simulate the problem, thereby optimizing the MAC layer of important research tools. This article combines the advantages of the lithium-ion (lithium) battery model. Compared with the KiBaM battery model, the effective charge in the KiBaM model simulates the output voltage well, which can reflect the battery capacity effect rate and the recovery effect of the lithium-ion-KiBaM battery model. The model can respond to the characteristics of the output voltage as the society gets lower and lower. In order to solve the problem that the analytic solution of differential equations cannot be obtained in the model, a numerical solution of the optimization algorithm is proposed based on the implicit Runge–Kutta method. The MAC layer energy consumption and routing protocol optimization algorithm proposed in this paper can be applied well in various fields.

One Hop Neighbor based Broadcast Method for Reactive Routing in Mobile Ad-hoc Network

To overcome redundant issues of routing messages for the reactive routing protocol is become research challenge. In general, to discover route or path reactive routing protocols broadcast routing messages which may leads congestions and degrades battery power unnecessary. Though, to resolve the challenges several efficient broadcast methods have been suggested. Each method has its own procedure and results sort of advantage and disadvantages. The motive of the paper is to presents a method which is proposed to minimize redundant issue of routing messages resulted by broadcasting. Proposed method uses one hop neighbor’s knowledge to broadcast routing messages for the purpose of route discovery. Proposed method experimented through simulation software that named as NS-2. An experimental accomplish certain factors like number of nodes, routing protocol, MAC protocol etc. Proposed method evaluated on the basis of different criteria such as throughput, control overhead, routing efficiency and node remaining battery power.

Mobile ad-hoc network routing protocols of time-critical events for search and rescue missions

The most important experiences we discovered from several disasters are that cellular networks were vulnerable, and the loss of the communication system may have a catastrophic consequence. Mobile ad-hoc networks (MANETs) play a significant role in the construction of campus, resident, battlefield and search/rescue region. MANET is an appropriate network for supporting a communication where is no permanent infrastructure. MANET is an effective network that uses to establishing urgent communication between rescue members in critical situations like, disaster or natural calamities. The sending and receiving data in MANET is depending on the routing protocols to adapt the dynamic topology and maintain the routing information. Consequently, This paper evaluates the performance of three routing protocols in MANET: ad-hoc on-demand distance vector (AODV), destination sequenced distance vector (DSDV), and ad-hoc on-demand multipath distance vector (AOMDV). These protocols are inherent from different types of routing protocols: single-path, multi-path, reactive and proactive mechanisms. The NS2 simulator is utilized to evaluate the quality of these protocols. Several metrics are used to assess the performance of these protocols such: packet delivery ratio (PDR), packet loss ratios (PLR), throughput (TP), and end-to-end delay (E2E delay). The outcomes reveal the AOMDV is the most suitable protocol for time-critical events of search and rescue missions.

Optimization Driven-Based Secure Routing in MANET Using Atom Whale Optimization Algorithm

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Optimisation driven-based secure routing in MANET using atom whale optimisation algorithm

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Adaptive Expanding Ring Search Based Per Hop Behavior Rendition of Routing in MANETs

Routing protocols in Mobile Ad Hoc Networks (MANETs) operate with Expanding Ring Search (ERS) mechanism to avoid flooding in the network while tracing step. ERS mechanism searches the network with discerning Time to Live (TTL) values described by respective routing protocol that save both energy and time. This work exploits the relation between the TTL value of a packet, traffic on a node and ERS mechanism for routing in MANETs and achieves an Adaptive ERS based Per Hop Behavior (AERSPHB) rendition of requests handling. Each search request is classified based on ERS attributes and then processed for routing while monitoring the node traffic. Two algorithms are designed and examined for performance under exhaustive parametric setup and employed on adaptive premises to enhance the performance of the network. The network is tested under congestion scenario that is based on buffer utilization at node level and link utilization via back-off stage of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). Both the link and node level congestion is handled through retransmission and rerouting the packets based on ERS parameters. The aim is to drop the packets that are exhausting the network energy whereas forward the packets nearer to the destination with priority. Extensive simulations are carried out for network scalability, node speed and network terrain size. Our results show that the proposed models attain evident performance enhancement.

Mobile adhoc network routing protocols: Performance evaluation & assessment

Mobile Adhoc Networks (MANETs) is a form of wireless networks that lack fixed infrastructure and centralized routers, as opposed to wired networks’ routers or managed wireless networks’ access points. One of the most difficult difficulties with MANETs is routing. The primary goal of routing algorithms is to construct efficient routes between nodes so that messages can be sent on time. Many routing protocols have been created to aid in the routing of MANETs. The aim of this study is to give a study on several popular MANET routing protocols, including OLSR, TORA and AODV. The goal of this study is to analyze MANET's routing protocol performances based on performance metrics such as data packet, overhead, delivery ratio, throughput, and end-point delay using the OPNET simulation program. We model a MANET in which all nodes receive FTP traffic from a single source (FTP server). As a result of this research, the results would also represent a case in which the MANET gets traffic from another network through a similar. According to our findings, OLSR dominated the network with the most routing traffic. TORA is the second, AODV third and DSR is the last. All protocols have a poor packet delivery ratio of up to 59 percent. This degradation is anticipated as a result of massive retransmissions in the network caused by the use of TCP traffic. In terms of throughput and end-to-end latency, OLSR outperforms TORA, DSR and DSR.

Mobile Ad Hoc Network Routing Protocols for Intelligent Transportation Systems

Nowadays, the use of wireless technology has invaded the market of telecommunications networks. There are two main families of wireless networks: networks with infrastructure and networks without infrastructure or AdHoc. In the networks with infrastructure, communications are made via a fixed base station; however, communications in an AdHoc network occur in the absence of any fixed communication infrastructure. There are three types of AdHoc networks: mobile AdHoc networks, mesh networks, and sensor networks. This research applied the mobile AdHoc network to the intelligent transportation systems that improve the traditional transport system with reducing the risk of human errors and with the effective management of traffic congestion. The authors focus in the work especially on the routing protocols inside the MANETs to come out with four routing protocols (AODV, OLSR, DSR, and TORA), and this paper compared their performances in case of using HTTP application, FTP application, email application, voice application, and the rate of the routing control traffic.

Fuzzy Extended Krill Herd Optimization with Quantum Bat Algorithm for Cluster Based Routing in Mobile Adhoc Networks

ABSTRACT MANET integrates a set of autonomous mobile nodes which move independently and send data through wireless links. Clustering and routing are the commonly employed energy efficient techniques, which can be treated as an NP hard problem and is resolved by computational intelligence algorithms. The mobility of the nodes leads to repeated link failures and low energy efficiency. In order to achieve high energy efficiency and network connectivity, this paper presents a new Fuzzy Extended Krill Herd Optimization with Quantum Bat algorithm (FEKHO-QBA) for Cluster Based Routing in MANET.The presented model uses FEKHO algorithm by integrating the concepts of fuzzy logic and KHO algorithm for clustering process and effective selection of cluster heads (CHs). Besides, the QBA is applied as a routing technique to determine the optimal paths to the destination nodes. The QBA involves the features of faster convergence rate, easier to implement, and improved accurateness. The application of FEKHO-QBA algorithm offers maximum energy efficiency and network longevity. For determining the effectual performance of the EKHO-QBA algorithm, a set of different experiments were carried out and highlighted the supremacy over the compared methods interms of different performance measures.

Innovative Techniques for Attack Detection in Wireless Ad-Hoc Networks

As a result of the inherent weaknesses of the wireless medium, ad hoc networks are susceptible to a broad variety of threats and assaults. As a direct consequence of this, intrusion detection, as well as security, privacy, and authentication in ad-hoc networks, have developed into a primary focus of the current study. This body of research aims to identify the dangers posed by a variety of assaults that are often seen in wireless ad-hoc networks and provide strategies to counteract those dangers. The Black hole assault, Wormhole attack, Selective Forwarding attack, Sybil attack, and Denial-of-Service attack are the specific topics covered in this proposed work. In this paper, we describe a trust-based safe routing protocol with the goal of mitigating the interference of black hole nodes while routing in mobile ad-hoc networks. The overall performance of the network is negatively impacted when there are black hole nodes in the route that routing takes. As a result, we have developed a routing protocol that reduces the likelihood that packets would be lost because of black hole nodes. This routing system has been subjected to experimental testing to guarantee that the most secure path will be selected for the delivery of packets between a source and a destination. The invasion of wormholes into wireless networks results in the segmentation of the network as well as a disorder in the routing. As a result, we provide an effective approach for locating wormholes by using ordinal multi-dimensional scaling and round-trip duration in wireless ad hoc networks with either sparse or dense topologies. Wormholes that are linked by both short-route and long-path wormhole linkages may be found using the approach that was given. To guarantee that this ad hoc network does not include any wormholes that go unnoticed, this method is subjected to experimental testing. To fight against selective forwarding attacks in wireless ad-hoc networks, we have developed three different techniques. The first method is an incentive-based algorithm that makes use of a reward-punishment system to drive cooperation among three nodes for forwarding messages in crowded ad-hoc networks. A unique adversarial model has been developed by our team, and inside it, three distinct types of nodes and the activities they participate in are specified. We have demonstrated that the proposed method that is based on incentives prevents nodes from adopting individualistic behaviour, which ensures cooperation in the process of packet forwarding. In the second algorithm, a game theoretic model is proposed that uses non-cooperative game theory to ensure that intermediate nodes in resource-constrained ad-hoc networks faithfully forward packets.

Performance Evaluation of Different Mobile Ad-hoc Network Routing Protocols in Difficult Situations

Performance evaluation of Mobile Ad-hoc Network (MANET) routing protocols is essential for selecting the appropriate protocol for the network. Many routing protocols and different simulation tools were proposed to address this task. This paper will introduce an overview of MANETs routing protocols as well as evaluate MANET performance by using three reactive protocols—Dynamic Source Routing (DSR), Ad-Hoc On-demand Distance Vector (AODV), and Dynamic MANET On-Demand (DYMO)—in three different scenarios. These scenarios are designed carefully to mimic real situations by using OMNET++. The first scenario evaluates the performance when the number of nodes increases. In the second scenario, the performance of the network will be evaluated in the presence of obstacles. In the third scenario, a group of nodes will be suddenly shut down during the communication. The network evaluation is carried out in terms of packets received, end-to-end delay, transmission count or routing overhead, throughput, and packet ratio.

Genetic Algorithm Routing Protocol for Mobile Ad Hoc Network

Mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network with time-variable infrastructure. Given that nodes are highly mobile, MANET’s topology often changes. These changes increase the difficulty in finding the routes that the packets use when they are routed. This study proposes an algorithm called genetic algorithm-based location-aided routing (GALAR) to enhance the MANET routing protocol efficiency. The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination. The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization. Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99% with less network overhead. Moreover, GALAR was compared to other algorithms in terms of different network evaluation measures. The GALAR algorithm significantly outperformed the other algorithms that were used in the study.

Yates Algorithm to Analyze the Performance of MANET Routing Protocol

To test the performance of any routing protocol in Mobile Ad hoc Network (MANET), the re-searchers simulate their scenarios several times with different simulators to get either positive or negative results. This operation of the simulation can last many hours and sometimes several days depending on the performance either of the software or the hardware, and the number of factors used to analyze. In this paper, we propose a new method reckons on the Yates algorithm that are considered as a solution to evaluate the performance of any MANET routing protocols under the effect of any number of factors. This approach allows creating a simulation model in the form of mathematical formulas. To check the efficiency of our proposed method we chose Optimized Link State Routing Protocol (OLSR) as MANET routing protocol and the effect of four factors which are: The Black Hole attack, Worm Hole attack, Node Speed and the Pause Time.

Design of Novel Mobility and Obstacle-Aware Algorithm for Optimal MANET Routing

Existence obstacles in terrain area and the mobility of the nodes in the network are the vital constrains that degrade the performance in Mobile Adhoc Network (MANET). To diminish the effect of such obstacles and mobility on the performance of MANET, the protocol used for routing must be efficient enough to handle both the factors. In the present work, we have considered the issues of Mobility and obstacle aware multipath communication in MANET. For avoiding obstacles, DeCasteljau Algorithm with Bezier curve concept has been applied. To the minimize impact of mobility, a speed based mobility prediction concept is used. Here optimal routing path across the obstacle is selected depending on its mobility prediction indicator, link duration, network connectivity and path availability. The performance of the suggested protocol is evaluated with Network Simulator-2. Simulation results confirm that the suggested protocol minimizes average energy consumption, network overhead, average delay and improves data deliverance in MANET.

Performance Analysis of Routing Protocols in Mobile Ad Hoc Networks (MANETs)

Mobile devices are able to build their own networks, which are referred to as mobile ad hoc networks. These networks do not require any kind of permanent wiring or other infrastructure (MANETs). The success of MANETs and their adaptability to a variety of tasks is, to a considerable extent, based on the routing protocols that they use. Using metrics such as routing overhead, end-to-end delay, and packet delivery ratio, we compare and contrast the various routing protocols that can be employed in MANETs, including proactive, reactive, and hybrid protocols. This comparison and contrast is carried out in this study. In addition to this, we discuss the simulation tools that are utilized to evaluate the efficacy of MANET routing algorithms and define the several performance indicators that may be utilizedin the course of this endeavor. This paper makes a contribution to an ongoing body of research into the analysis of routing protocols in MANETs by offering guidance to network engineers and researchers on how to select the most appropriate routing protocol and simulation tool for a particular MANET scenario. In doing so, the paper maximizes the potential for effective and efficient communication between mobile nodes, which is one of the main goals of the research.

WITHDRAWN: Improving QOS in mobile adhoc networks routing using fuzzy inference algorithm

Mobile Ad hoc Networks (MANET) contains an enormous and moderately thick populace of versatile units that move in any region, and its solitary methods for correspondence is the utilization of remote interfaces without utilizing previous framework or brought together organization. Also, steering ought to give a methodology to sending information whenever between a couple of hubs (i.e., source and objective) over an organization. In any case, the fundamental issue is to decide an ideal steering of parcels over the organization. The fundamental goal of the proposed convention is to locate the minimum cost interest in ostensible limits that guarantees the directing of perceived amount of data packets and ensures its existence in the event of circular segment or hub disappointment. In this unique circumstance, the fuzzy coordinated Petri net is considerably embraced in the displaying of the directing and discovery/choice capacities that utilization a corresponding fuzzy change approach, wherever the proposed framework is utilized to discover an answer for the issue of vulnerability functions in specially appointed organizations. The acquired outcomes illustrate the adequacy of the proposed fuzzy inference algorithm performs well when compared to Route selection algorithm and Ant colony based Routing Algorithm. This proposed fuzzy inference algorithm is evaluated under energy consumption and sensing delay parameters. Our algorithm performs well in both the parameters and ultimately improves quality of service in mobile ad hoc networks.

Optimized Particle Swarm Optimization Algorithm for the Realization of an Enhanced Energy-Aware Location-Aided Routing Protocol in MANET

Mobile Ad-hoc Network (MANETs) is a wireless network topology with mobile network nodes and movable communication routes. In addition, the network nodes in MANETs are free to either join or leave the network. Typically, routing in MANETs is multi-hop because of the limited communication range of nodes. Then, routing protocols have been developed for MANETs. Among them, energy-aware location-aided routing (EALAR) is an efficient reactive MANET routing protocol that has been recently obtained by integrating particle swarm optimization (PSO) with mutation operation into the conventional LAR protocol. However, the mutation operation (nonuniform) used in EALAR has some drawbacks, which make EALAR provide insufficient exploration, exploitation, and diversity of solutions. Therefore, this study aims to propose to apply the Optimized PSO (OPSO) via adopting a mutation operation (uniform) instead of nonuniform. The OPSO is integrated into the LAR protocol to enhance all critical performance metrics, including packet delivery ratio, energy consumption, overhead, and end-to-end delay.

282 Published By: Blue Eyes Intelligence Engineering and Sciences Publication Retrieval Number: 100.1/ijitee.A4813119119 DOI: 10.35940/ijitee.A4813.1091220 Journal Website: www.ijitee.org An Accurate Identification of Packet Dropping Attacks Using Cat Swarm Optimization (Cso) to Ensure Better Intrusion Detection in Manet Environment

Mobile Ad hoc Network (MANET), which is comprised of a number of self-organized and battery equipped mobile nodes, is used widely in different applications, like private sectors and military. However, security is a major issue in MANET routing, as the network is prone to attacks. The main objective of intrusion detection system is for categorizing normal and suspicious activities in network. This paper introduce the intrusion detection scheme for establishing the secured path in MANET. For mobile ad hoc networks, swarm optimization approach based novel intrusion detection system is proposed in this paper. The proposed system is based on Cat swarm optimization (CSO) for detecting, one of vey possible attack, i.e. packet dropping attack in mobile ad hoc networks. Also Failure node discovery can be optimized by considering nodes historical information along with the neighbor node information. Before using the swarm optimization for findingsensor node’s trust values and for improving provenance data transmission security, an Extend the secure provenance scheme with Side Channel Monitoring – Information gaining ability (SCM) for detecting packet drop attacks staged by malicious data forwarding nodes is used. It assist in finding presence of selfish nodes as well as packet drop behaviours. With low false positive rate and high true positive rate, packet dropping attacks are detected effectively using proposed technique as shown in simulation results.

An optimal energy efficient cross-layer routing in MANETs

In mobile ad hoc network (MANET), battery power is a significant resource for mobile devices. Hence conservation of energy and prolonging the network lifetime must be considered when designing routing protocols. But design of an energy-efficient routing protocol requires various factors of nodes from different layers, such as remaining energy, total traffic load and the number of channel contentions. Traditional layered approach has been found ineffective in handling power-related problems which can affect all the layers of the stack. To solve these issues, we propose a technique known as cross-layer routing protocol which utilize particle-swarm optimization (PSO) algorithm. The data success rate, node mobility and predicted remaining energy are measured from the network layer and PSO algorithm is applied to establish stable and energy efficient paths. After establishing the set of paths using PSO, the network contention is measured from the MAC layer and the contention window (CW) is adjusted dynamically based on the measured contention and predicted remaining energy. Simulation results prove that the proposed technique provides increased delivery ratio of packet with reduced consumption of energy and overhead when compared with existing techniques.

Three-Tier Architecture Supporting QoS Multimedia Routing in Cloud-Assisted MANET with 5G Communication (TCM5G)

Recently, evolving technologies such as 5G and cloud computing have offered new prospects in mobile ad hoc networks (MANETs). However, achieving a high quality of service (QoS) in multimedia routing over MANET–cloud using 5G networks remains challenging owing to the dynamic nature of mobile devices. The present study addresses this problem by proposing a three-tier architecture in cloud-assisted MANETs with 5G (TCM5G) communication. The network comprises the MANET, cloudlet, and cloud tiers. In the proposed scheme, partitioning and clustering are performed to optimize the cluster size. Specifically, partitioning is first performed by the improved monarch butterfly optimization algorithm. Here, the cluster head (CH) is first selected by computing the importance rate. The selected CH then forms a cluster around itself by broadcasting its selection message. Device-to-device (D2D) communication is established using the Kuhn–Munkres algorithm, which determines the optimal device for each D2D communication in the network in order to increase data transmission efficiency. Network performance depends on effective routing; hence, we considered two routing types: inter-cluster and cloudlet. The former is performed through chaotic flower pollination, and the latter is achieved by using the improved Type-2 Takagi Sugeno fuzzy algorithm. To improve the QoS in multimedia routing, we employ a full-interpolation, scalable video-coding algorithm for effective multimedia data encoding. Task offloading among cloudlets is performed based on a load criterion to balance the cloudlet load. The performance of the proposed system is evaluated using five metrics: throughput, packet delivery ratio (PDR), end-to-end delay, task-completion time, and bandwidth consumption. The results demonstrate that in comparison with the existing DCRM, PCA, and HRM methods, the proposed TCM5G scheme enhances throughput and PDR by 30%, and reduces end-to-end delay, task-completion time, and bandwidth consumption by up to 40%.