Route Discovery Process Research Articles

A local filtering-based energy-aware routing scheme in flying ad hoc networks

Flying ad hoc network (FANET) is a new technology, which creates a self-organized wireless network containing unmanned aerial vehicles (UAVs). In FANET, routing protocols deal with important challenges due to limited energy, frequent link failures, high mobility of UAVs, and limited communication range of UAVs. Thus, a suitable path is always essential to transmit data between UAVs. In this paper, a local filtering-based energy-aware routing scheme (LFEAR) is proposed for FANETs. LFEAR improves the template of the route request (RREQ) packet by adding three fields, namely the energy, reliable distance, and movement similarity of the relevant route to create stable and energy-efficient paths. In the routing process, LFEAR presents a local filtering construction technique to avoid the broadcasting storm issue. This filter limits the broadcasting range of RREQs in the network. Accordingly, only UAVs inside this local filtered area can rebroadcast RREQs and other UAVs must eliminate these packets. After ending the route discovery process, the destination begins the route selection phase and extracts information about each discovered route, including the number of hops, route energy, reliable distance, and movement similarity. Then, the destination node calculates a score for each path based on the extracted information, selects the route with the highest score, and sends a route reply (RREP) packet to the source node through this route. Finally, the simulation process of LFEAR is performed using the NS2 simulator, and two simulation scenarios, namely change in network density and change in the speed of UAVs, are defined to evaluate network performance. In the first scenario, LFEAR improves energy consumption, packet delivery rate, network lifespan, and delay by 1.33%, 1.77%, 6.74%, and 1.71%, while its routing overhead is about 16.51% more than EARVRT. In the second scenario, LFEAR optimizes energy consumption and network lifetime by 5.55% and 5.67%, respectively. However, its performance in terms of routing overhead, packet delivery rate, and delay is 23%, 2.29%, and 6.67% weaker than EARVRT, respectively.

A Statistical Analysis of Wireless Body Area Network using Clustering Based Routing Protocols

Recently, research on wireless body-area sensor networks (WBASN) or wireless body area networks (WBANs) has gained great importance in medical applications, and now plays an important role in patient monitoring. Clustering is the most important task in wireless sensor networks (WSNs) by data aggregation through each cluster head (CH). The development of technology has seen comfort in the domestic and professional life of an individual. However, such survival was not able to meet medical emergencies during the pandemic COVID-19 and other health surveillance scenarios. As a result, it is important to design an energy-efficient routing system for WBAN. Existing routing algorithms focus more on energy efficiency than security. A Secure Optimal Path-Routing (SOPR) protocol is proposed to identify and discover routes in WBAN that are secure against black-hole attacks. In this paper the sensor's wireless capability has been tested with a simulator to detect and transmit signals across a wide range of frequencies and to ensure that data is transferred successfully. CARF reduces the maximum work done by relay nodes in case of overloaded nodes and thereby increases the energy distribution in the network. The proposed CARF design reduces packet loss and time delay, thereby increasing network lifetime compared to other fuzzy and heuristic methods used for routing in WSNs. The proposed algorithm maintains more than 75% of the residual energy in the network at a minimum initial energy level of 1 J to enable data syncing. A SAC-TA approach for data aggregation in WSNs is presented. False injection attacks are identified based on traffic analysis at the time of the route discovery process. One-time key generation algorithm is introduced to eliminate malicious nodes from the network. The presented paper proposes a congestion-free routing framework for data transmission from source to sink nodes in WSNs. Congestion-aware routing mechanisms modeled using fuzzy sets (CARF) include operations such as establishing non-localized nodes, by which more paths can be created for traffic distribution, and predicting an optimal congestion.

Fuzzy Heuristics for Detecting and Preventing Black Hole Attack

Mobile Ad-hoc Networks (MANET) is a set of computing nodes with there is no fixed infrastructure support. Every node in the network communicates with one another through wireless links. However, in MANET, the dynamic topology of the nodes is the vital demanding duty to produce security to the network and the black hole attacks get identified and prevented. In this paper, a novel fuzzy inference system is designed for black hole attack detection depending on the node authentication, trust value, Certificate Authority (CA), energy level, and message integrity. Before initiating the route discovery process in MANET, the proposed work mainly concentrates on node authentication. The simulation gets carried out using the Network Simulator (NS2), wherein the fuzzy inference system designed shows better performance by providing a certificate to only the trusted nodes. This helps the malicious nodes detection and prevents the black hole attack. The improvement in Packet Delivery Ratio (PDR) enhances throughput and the end to end delay gets reduced through better performance results. This proves that the system is more reliable and recovered to be used in military applications

Power Aware MANET Routing Protocol for Efficient Packet Transmission Using T–Test and Sleep and Awake Strategy

The majority of the suggested routing protocols have not given any attention to energy consumption whatsoever, despite the fact that advances in battery design have not yet reached the point where a device can be able to operate for a longer amount of time. Energy-efficient routing is one of the crucial issues that must be taken into account in MANETs. Numerous scholars have offered highly effective solutions for this problem. Since all nodes in MANETs are connected to and run by low-power battery devices, energy-aware routing is without a doubt the highest design standard The lifespan of the network is eventually shortened when an intermediary node is shut down due to a power outage because it not only impacts the node's own system but also its capacity to relay packets on behalf of others. The untimely shutdown of a node damages the entire network system because packet forwarding on the route will become fully disconnected as soon as a node Electronics 2020, 9, 1129 5 of 64 fails due to a power outage. However, the preceding node continues to wastefully retransmit the same packets up to a specific threshold, wasting both its power and bandwidth in the process. The preceding node then informs the source that the path is severed as a result of this. Finally, route finding is once more carried out by the source node, which uses a lot of energy in the network. This work suggested a new routing method that uses the T-test procedure to discover the most effective path between nodes. This proposed technique recursively identifies the optimum way between nodes for communication, ensuring that each node participating in route discovery has enough energy for transmission. The T-Test procedure defines and supports the criteria for evaluating the nodes that are chosen and rejected during the route discovery process. This technique, in conjunction with T-Test, enables successful packet transmission in MANET packet flows with sleep and awake strategies. It is also developed using network simulation and compared to the present routing system, indicating that it performs better overall.

Fuzzified swarm intelligence framework using FPSOR algorithm for high-speed MANET- Internet of Things (IoT)

Internet of things (IoT) is an inventive technology which permit the association of physical things by means of the digital world throughout the use of heterogeneous networks and communication technologies. Ad-hoc routing protocols may be dispersed and involve every node in route discovery process by making routing data more reliable. Mobile-Adhoc-Networks (MANETs) consist of many portable nodes that can commune directly with each other or through intermediate nodes. Repeatedly, nodes in a MANETs operate with batteries and can roam freely, and thus, a node may exhaust its energy or move away without providing any notice to its cooperative nodes. IoT system using a combination of MANET, a route consists of numerous links in sequence, and so, its lifetime is based on the lifetime of every node and also the wireless links among adjacent nodes. In this research work Fuzzified Particle Swarm Optimization oriented Routing (FPSOR) algorithm is planned to minimize data loss and computational overhead, which in turn maximizes the lifetime of MANETs. Particle Swarm Optimization oriented Routing protocol (PSOR) have taken energy competence as significant criterion for processing routing and driving optimized path for the data accelerating and processing to the source node. The PSOR produces a fresh route for routing by considering fitness value of energy to evaluate diverse path and to choose best-optimized path whose energy consumption is less as compared to ant colony optimization routing paths. This algorithm utilizes a good approach focusing energy levels/status of the nodes through fuzzification and the lengths of the routed ways. NS2 simulator is casted for performance evaluation.

Novel Routing Algorithm for Efficient Packet Transmission in MANET using T –Test Procedure and Sleep and Awake Strategy

Packet transmission is one of the time-consuming communication processes in a mobile ad hoc network. Many routing pathways may encounter failed packet delivery as a result of the MANET node's power backup. The routing algorithm determines the path packets follow as they travel from the source to the destination nodes, but it provides no assurances about packet delivery. This work suggested a new routing method that uses the T-test procedure to discover the most effective path between nodes. This proposed technique recursively identifies the optimum way between nodes for communication, ensuring that each node participating in route discovery has enough energy for transmission.. The T-Test procedure defines and supports the criteria for evaluating the nodes that are chosen and rejected during the route discovery process. This technique, in conjunction with T-Test, enables successful packet transmission in MANET packet flows with sleep and awake strategies. It is also developed using network simulation and compared to the present routing system, indicating that it performs better overall.

Detecting Sybil Attack During Data Transmission Using Concealed Data Sharing Algorithm in Manet

As the mobile users are increasing sharply, the wireless or mobile ad hoc network data transmission is on the rise and gaining lot of attention from the research communities. The most important issue that has to be handled is the detecting the Sybil attack and increase the reliability and confidentiality of the data transmission. The foremost aim of this paper is to develop a mechanism to detect the Sybil attack early and evade the data loss and privacy to ensure credibility to the users. The proposed algorithm employs a concealed data sharing plan during the route discovery phase and detects and alleviates the attack to guarantee attack free data transmission in the MANET. The data sharing plan allows only the nodes that are trustworthy and permit the data to be transmitted across them, thereby evading the malicious nodes during the route discovery process and curtails the wastage of time and energy of the nodes.

Routing Algorithm for Efficient Packet Transmission in Manet Using T–Test Procedure

One of the laborious communication tasks in a mobile ad hoc network is packet transmission. Due to the MANET node's power backup, many routing paths may experience unsuccessful packet delivery. The routing algorithm chooses the path that packets take as they travel from the source node to the destination nodes, but it makes no guarantees regarding packet delivery. In order to determine the most effective path between nodes, this paper proposed a new routing algorithm with the use of the T-test process. This suggested technique determines the best path between nodes for communication in a recursive manner, ensuring that each node participating in the route discovery has enough energy for transmission. The criteria for evaluating the nodes that are chosen and rejected throughout the route discovery process are defined and supported by the T-Test procedure. This technique, together with T-Test, supports effective packet transmission in MANET packet flow. It is also built with the help of network simulation and compared to the current routing protocol, demonstrating that it performs better overall.

An improved firefly algorithm for the rank generation to optimize the route discovery process in IoV

<p>Vehicular ad hoc networks (VANET) have been the attention gainer for the last couple of years due to increasing number of vehicles on the road. Incorporation of VANET with Internet of Things (IoT) has created large number possibilities in terms of power efficiency and secure transmission. The article focuses on the ad-hoc on-demand distance vector (AODV) protocol and its applications in route discovery in VANETs. In this work, the swarm intelligence (SI) inspired modified firefly algorithm has been employed for rank generation of the nodes. It is concluded that the use of IoT devices and advanced routing protocols with SI algorithms can lead to efficient and low-latency route discovery in VANETs using quality of service (QoS) parameters. The experimental analysis shown that the proposed technique has been outperformed the other existing technique in terms of QoS parameters and provides the optimal route discovery mechanism with high throughput and minimum latency.</p>

Design of a Self-Organizing Routing Protocol for Underwater Wireless Sensor Networks Based on Location and Energy Information

Underwater wireless sensor networks (UWSNs) are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, variable topology, limited battery, low processing power and so on. These new features pose many challenges to the design of self-organizing routing protocol for UWSNs. This paper focuses on the application of Ad Hoc On-demand Distance Vector (AODV) routing protocol in UWSNs. In order to solve the problems of packet collision and excessive energy consumption associated with the flooding-based routing discovery method and the periodic hello packet routing maintenance mechanism of AODV, a routing discovery and maintenance method based on location and energy information is proposed, and it is referred to as the route-focusing AODV (RFAODV) routing protocol. In the RFAODV protocol, the routing discovery process is focused on a few nodes through forwarding area control and dynamic delay adjustment. In addition, feedback from a media access control layer and residual energy control are used for routing maintenance. We implement the RFAODV and evaluate its performance according to the sea trial data as parameters in the NS-2. The simulation results show that compared with the other protocols, RFAODV improves the routing discovery success ratio by at least 18%, increases the packet transmission ratio by at least 4%, reduces the protocol overhead by at least 15% and reduces the energy consumption by at least 5% under various simulation scenarios. RFAODV is suitable for large-scale, high-load and dynamic networks underwater wireless sensor networks.

An Energy-Efficient Clustering and Fuzzy-Based Path Selection for Flying Ad-Hoc Networks

Flying Ad-hoc Networks (FANET) allow for an ad-hoc networking among Unmanned Aerial Vehicles (UAV), have recently gained popularity in a variety of military and non-militant applications. The existing work used the Glowworm Swarm Optimization (GSO) algorithm to create a self-organization depending on clustering technique for FANET. Owing to UAV increased mobility, network topology might vary over time, providing route discovery and maintenance is one of the most difficult tasks. And also, the network throughput is still more worsened by the network congestion. To solve this problem, the proposed work designed an energy efficient clustering and fuzzy-based path selection for FANET. In this work, initially, the clustering is performed using the UAV distance. For efficient communication and energy consumption, optimal selection of Cluster Head (CH) is performed by using Adaptive Mutation with Teaching-Learning-Based Optimization (AMTLBO) algorithm. To improve the optimal selection of CH nodes, the best fitness values are calculated. The fitness function depends on Link capacity, remaining energy and neighbor UAV distance. Next to that, nodes begin communications as well as transmit their information to their CH. Improved Fuzzy-based Routing (IFR) is introduced for improving the route discovery process. The goal is to find routes that have a high level of flying autonomy, minimal mobility, and a higher Received Signal Strength Indicator (RSSI). As a result, the energy usage of network is decreased, as well as the cluster’s lifespan is extended. Finally, an adaptive and reliable congestion detection mechanism is introduced to transmit the packets with congestion free path. The experimental result shows that the proposed AMTLBO system attains higher performance compared to the existing system in terms of energy usage, throughput, delay, overhead and packet delivery ratio.

Secure and Optimal LOADng Routing for IoT with Composite Routing Metric

Security is the one of the major challenges for routing the data between the source and destination in an Internet of Things (IoT) network. To overcome this challenge, a secure Lightweight On-demand Ad hoc Distance-vector—Next Generation (LOADng) Routing Protocol is proposed in this paper. As the LOADng protocol is the second version of Ad Hoc On-Demand Distance Vector (AODV) protocol, it retains most of the basic functionality and characteristics of AODV. During the route discovery process, the cyclic shift transposition algorithm (CSTA) is used to encrypt the control packets of the LOADng protocol to improve its security. CSTA approach only derives transposition and substitution without product cipher with respect to input data. Besides this, for choosing the best probable path between the source and destination, routing metrics such as link quality Indicator (LQI), hop count (HC) and queue length (QL) are included in the control packets. The data is then securely sent using CSTA using the optimal secure path selected. Experimental Results depict that the proposed secure and optimal LOADng (SO-LOADng) using CSTA encryption obtains better throughput, delivery ratio encryption time and decryption time than the existing state-of-art approaches.

Efficient route discovery method in MANETs and packet loss reduction mechanisms

In the route of expansion in mobiles, quantity of nodes in the mobile ad-hoc networks (MANETs) must be expanded. The MANETs being active in nature and it starts issues in deciding the most ideal route for packets. In this paper an attempt to propose another routing method which consolidates the properties of both static and dynamic routing method from that point tries to take out the issues innate in the system through size-based routing is done. The paper concentrates on efficient route discovery process for secure data transfer with less ratio of packet loss. For the minimisation of assault and packet dropping different authors manufactured different technique such strategy is node validation, distant analysis scheme, ACK-based method, status-based plan and motivating force dependent plan. ACK-based plan endured an issue of monstrous overhead because of additional affirmation packet and it likewise endured choice equivocalness if asked for node decline to send back acknowledgement. In this paper we utilises 2-ACK-based plan utilising protected channel for conquering the issue of choice equivocalness for asked for node, enhanced node confirmation and limit packet dropping in ad-hoc network.

Meningkatkan Kinerja Protokol Routing Aomdv Dalam Memilih Node Tetangga Berdasarkan Bandwidth, Round Trip Time, Dan Packet Loss Ratio Untuk Menemukan Rute Terbaik

Mobile ad hoc network or in short MANET is a group of node that exchange the information from source node to destination node on wireless network. The main problem in MANET is on the network structure that change continously that is cause by node mobility that made route disconnected. If route disconnect there will be another route discovery processes that will take much time. AOMDV (Ad hoc On-demand Multipath Distance Vector) routing protocol works by doing broadcast Route Request Packet (RREQ) from source node to neighbor node (intermediate node) and then it will continously until it arrives to destination node. AOMDV didnt choose the best neighbor node while broadcast RREQ packet so the route constructed have high possibility to disconnected and must re-broadcast until it find stable route and it will be a long time and not effective. To solve this problem it proposed to add a modification with AOMDV routing protocol with calculation of bandwidth, round trip time, and packet loss ratio to choose neighbor node to find the best route. Routing protocol performance will tested using test parameter throughput, delay, and packet delivery ratio to choose the best neighbor node. Based on test result, the proposed modification can improve the preformance of AOMDV routing protocol. After modification, average throughput has improved 43.26 %, Packet Delivery Ratio (PDR) improved 3.15 % and average end-to-end delay reduce 31.26%.

Safe Routing Approach by Identifying and Subsequently Eliminating the Attacks in MANET

Wireless networks that are decentralized and communicate without using existing infrastructure are known as mobile ad-hoc networks. The most common sorts of threats and attacks can affect MANETs. Therefore, it is advised to utilize intrusion detection, which controls the system to detect additional security issues. Monitoring is essential to avoid attacks and provide extra protection against unauthorized access. Although the current solutions have been designed to defeat the attack nodes, they still require additional hardware, have considerable delivery delays, do not offer high throughput or packet delivery ratios, or do not do so without using more energy. The capability of a mobile node to forward packets, which is dependent on the platform's life quality, may be impacted by the absence of the network node power source. We developed the Safe Routing Approach (SRA), which uses behaviour analysis to track and monitor attackers who discard packets during the route discovery process. The attacking node recognition system is made for irregular routing node detection to protect the controller network's usual properties from becoming recognized as an attack node. The suggested method examines the nearby attack nodes and conceals the trusted node in the routing pathway. The path is instantly assigned after the initial discovery of trust nodes based on each node's strength value. It extends the network's life span and reduces packet loss. In terms of Packet Delivery Ratio (PDR), energy consumption, network performance, and detection of attack nodes, the suggested approach is contrasted with AIS, ZIDS, and Improved AODV. The findings demonstrate that the recommended strategy performs superior in terms of PDR, residual energy, and network throughput.

Enhanced Energy Aware Geographic Routing (EEGR) Algorithm for MANET

Since the current EGR has a problem, it makes a local decision during the route discovery process to choose the next neighbour node that has the highest residual energy. This could be the worst case scenario if there is no way to stop the process and the intermediate node has lower energy than the alternate path. To solve this issue, we suggested the Enhanced Energy Aware Geographic Routing (EEGR) protocol. In EEGR, we use a modified transmission energy strategy along with numerous route requests at the destination and replies that have better node residual energy. Our simulation findings demonstrate the enhancement over the current EGR routing mechanism.

A Technique of NLAODV algorithm to get Routes of Nodes-List in Mobile Ad-hoc Network (MANET)

A Mobile Ad-hoc Network (MANET) is a group of nodes that connect to each other wirelessly without the use of a central server or a traditional network structure. In MANETs, data packets are sent through wireless channels to keep communication going. Ad-hoc On-Demand Distance Vector Routing is a MANET-related reactive routing technology that generates a path of nodes to a destination by broadcasting packets of route request across the network. In this kind of Routing protocol, a connection loss causes the source to send control (RREQ) on the network, causing network congestion and performance deterioration. This study offers a Node List (NLAODV) Node List Ad-hoc On-Demand Distance Vector routing method that includes links and path-nodes to identify if any node on the network is involved in the route discovery process for sending control packets from wireless source node to the wireless destination node. Simulation findings reveal that the proposed NLAODV algorithm minimizes flood Packets and get best network as it’s not necessary for all nodes to be present in route discovery.

Neighbor Coverage and Bandwidth Aware Multiple Disjoint Path Discovery in Wireless Mesh Networks

With the ease of appending new nodes without re-installing the whole network, the Internet of Things (IoT) builds several smart applications on Wireless Mesh Network (WMN). One of the important aspects of integrating WMN and smart IoT applications is to provide an energy-efficient and reliable routing protocol. Seeking the communication route that delivers the high-quality stream quickly over WMN is an important issue, but the maximum utilization of a single high-quality path leads to poor throughput and large communication delay, including route discovery and data forwarding delay. The broadcasting mechanism creates redundant transmissions of control packets into the network and reinitializes the blind route discovery process due to link disconnections leading to network resource constraints and high delay during the route discovery process. Moreover, the congestion in the communication route incurs data transmission latency. This paper proposes the Multiple Disjoint Path Determination (MDPD) mechanism based on-demand routing in WMN to formulate the path discovery and data transmission latency. Reducing the neighbor list into the uncommon neighbor set reduces the unnecessary latency in route discovery, and deriving high capacity multiple disjoint communication routes reduce the communication delay in the proposed work. The proposed work employs the queue dynamics in queuing delay, which mainly provides adaptability to the dynamics in network capacity and efficient diversity paths to the gateway node to infer the available bandwidth and optimize the network traffic. To fully utilize the advantage of heterogeneous routers, it disables the flooding of control packets across the stable mesh routers, excluding the initial route discovery process, because it enables the available route storage system in each mesh router. Hence, the proposed work efficiently supports wireless broadband internet access with reduced delay and control overhead. The simulation results demonstrate the fast detection of the multiple disjoint routes and data traffic optimization over the discovered disjoint routes in the proposed MDPD mechanism over WMN.

A cluster-based routing method with authentication capability in Vehicular Ad hoc Networks (VANETs)

Routing is challenging in vehicular ad hoc networks due to their features, such as high mobility of nodes and unstable wireless communication links. Therefore, it is an interesting issue for researchers. In addition, it is very important to design an authentication mechanism between the source node and the destination node because these networks are exposed to many attacks due to their features mentioned above. In this paper, we present a fuzzy logic-based routing method with authentication capability in vehicular ad hoc networks. The proposed routing method has three phases: clustering phase, routing phase between cluster head nodes, and authentication phase. In the first phase, vehicles are clustered using an efficient scheme. In the proposed method, we define two types of data packets: immediate and ordinary. Various data packets have different route discovery processes that are described in Phase 2. Note that any data packet type is divided into two groups: simple and secure. Simple data packets have no authentication mechanism. On the other hand, secure data packets use an authentication mechanism based on message authentication code (MAC) and symmetric key cryptography. We simulate the proposed method using NS2. Simulation results are compared with three routing protocols including, AODV, R2SCDT, and 3VSR. Experiments show that the proposed method outperforms others in terms of end-to-end delay, packet collision, packet delivery rate (PDR), packet loss rate (PLR), and throughput. However, it increases the routing overhead slightly.

The Performance Analysis and Security Aspects of Manet

Mobile Ad hoc NETwork (MANET) is a type of network that is built by connecting a number of mobile devices together in a temporary manner through impermanent connections. Through broadcasting, the information should be distributed to all nodes in the network. A MANET is a network of self-configurable mobile nodes that are connected wirelessly. The security aspect of MANET is a major challenge, and there is a great deal of research being done in this area. The availability of energy is a critical criterion for a decentralised network. The protocol for AODV and DSR routing, as well as the security of the black hole node, are all investigated in this study. Protocols that are used during the route discovery process are particularly vulnerable to attack by the black hole. The goal of this survey, as a result, is to thoroughly investigate black hole attacks while also evaluating the performance of AODV and DSR during black hole attack scenarios. With Network Simulator 3, the work is completed by simulating both protocols under normal operation as well as under a black hole attack. The work is completed with Network Simulator 3 by simulating both protocols under a black hole attack (NS-3). AODV is more vulnerable to a black hole attack than the DSR, according to the results of simulations, and this vulnerability is greater under normal operating conditions. It has been discovered that MANET attacks are carried out with the assistance of a "black hole," according to simulation results.