Node-disjoint Routing Research Articles

Enhanced Whale Optimization Algorithm for Multi-Objective Node Disjoint Routing

Objectives: The research goal is to identify node-disjoint pathways maximizing path lifetime, delivery ratio, etc. while establishing several node-disjoint paths to optimize routing and enhance interference reduction and PDR efficiency. Methods: In the MANET, the Enhanced Whale Optimization Algorithm (EWOA) is utilized to discover the most secure routing path. The dataset used in this research comprises simulated scenarios representing various network conditions and configurations, allowing for a comprehensive evaluation of the proposed work. The software employed for simulation and analysis includes an NS-3 network simulation tool, allowing the model to evaluate the performance of the proposed routing protocol in diverse MANET scenarios. The parameters considered during the evaluation include throughput, end-to-end delay, packet delivery ratio (PDR), and routing overhead. The modifications involve enhancing the routing algorithm to prioritize node-disjoint pathways, thus improving interference reduction, energy efficiency, and overall network performance. Findings: The EWOA for Multi-Objective Node Disjoint Routing demonstrates superior performance compared to existing routing protocols such as SRABC and OLSR across various key metrics. Specifically, in terms of end-to-end delay, EWOA consistently outperforms SRABC and OLSR by reducing delay by 1.3% and 4.7%, respectively. Additionally, EWOA achieves a higher packet delivery ratio, surpassing SRABC and OLSR by 4.3% and 0.4%, respectively. Moreover, EWOA exhibits higher throughput, with a throughput increase of 11.3% compared to SRABC and 6.2% compared to OLSR. Furthermore, EWOA demonstrates lower routing overhead, reducing overhead by 9.6% compared to SRABC and 3.1% compared to OLSR. These findings highlight the efficacy of EWOA in optimizing multi-objective routing in MANETs, offering improved network performance and efficiency compared to existing protocols. Novelty: The Multi-Objective Node Disjoint Routing Protocol with Enhanced Whale Optimization is utilized in MANET to choose the best route, reducing latency resulting from link failure and distributing traffic loads across multiple paths. Keywords: Optimization, Whale Optimization Algorithm (WOA), Optimized Link State Routing (OLSR), Secure Routing Algorithm Blockchain Technology (SRABC)), MANET

Towards Enabling Fault Tolerance and Reliable Green Communications in Next-Generation Wireless Systems

Green communications have witnessed significant attention being paid to the next generation of wireless systems research and development. This is due to growing use of sensor- and battery-oriented smart wireless devices. The related literature in green communications for next-generation wireless systems majorly relies on transmission and sensing power management, but lacks a fault-tolerant centric approach. In this context, this paper presents a fault-tolerant and reliable green communications framework for next-generation wireless systems (FRGNWS). Firstly, maximum node-disjoint routes from all source nodes to the base station are identified based on the hybrid adapted grey wolf sine cosine optimizer. Secondly, a fault-tolerant and reliable route is selected from the maximum disjoint routes for each sensor node to the base station based on the hybrid adapted grey wolf whale optimizer. The performance of our proposed green communications framework is assessed by simulation experiments considering a realistic implementation scenario and different metrics. Simulation results clearly validate the efficacy of the proposed green communications framework as compared to the state-of-the-art techniques.

Designing a Energy Efficient Node Disjoint Multipath Routing technique to achieve energy efficiency in Mobile Ad Hoc Networks

Mobile Ad Hoc Networks (MANETs) are wireless networks which comprise of mobile nodes with limited energy resources. Every node cooperates to perform routing and expends energy on a frequent basis. Nodes are mobile thus link breakages are common and new routes need to be established quickly. Traditional routing protocols tend to find shortest routes to destination providing best-effort delivery service. However due to limited energy and bandwidth resources shortest path routes may not suffice and may usually degrade the performance of the network. In this paper an Energy aware Node Disjoint routing technique END-AODV is proposed that is based on the traditional AODV protocol. The technique designed is based on the argument that node disjoint multipath routing can conserve energy more efficiently as compared to link disjoint routing. Link Disjoint routing leads to overuse of a subset of nodes thus decreasing the overall network lifetime. The technique proposed incorporates energy drain rate metric to establish energy aware routes which are node disjoint in nature. Simulation results with ns2.34 simulator show efficiency of the proposed technique in terms of packet delivery ratio, average energy consumption per data bit delivered, network lifetime and average end to end delay.

Ant Colony System for Energy Consumption Optimization in Mobile IoT Networks

In this paper, a new algorithm is proposed for computing the node-disjoint optimal transmission energy consumption route for coded cooperative mobile IoT networks. Inspired by the potential benefits user cooperation can provide, we incorporate user cooperation to the mobile ad-hoc multi-hop IoT networks. Our results include a novel ant colony system-based node-disjoint energy-efficient routing algorithm. Ant colony system can approximate the optimal route by local information and is thus very suitable for mobile IoT network environment. In particular, ant algorithm makes history-sensitive choice and thus can significantly outperform the greedy algorithm. In addition, it can efficiently handle the case of multiple sources and multiple destinations. For a large IoT network, we investigate the multi-scale ant colony system and when compared to Dijkstra algorithm, such an algorithm usually shortens the runtime by a factor of several hundred.

RETRACTED ARTICLE: RFDCAR: Robust failure node detection and dynamic congestion aware routing with network coding technique for wireless sensor network

Wireless sensor networks is an attractive concept that is being implemented in all fields of work with diverse applications. Hence it is not a surprise that there are several wireless routing algorithms available and they mainly focus on reducing the consumption of energy in WSN, the direction of the fact that a sensor node point work on batteries. But algorithms do not study on these energy deficient nodes and their collision effects. There are various reasons for node failure that can fall under mechanical or electrical problems, battery depletion, environmental degradation or hostile tampering. But the most common failure of nodes occur due to limited energy availability. Failure caused due to a group of nodes can minimize the network paths. These activities can lead to failures in the subset of acting nodes resulting in a disconnected or no path situation from the network. This algorithm introduces the multipath node disjoint routing by combining local and global procedures for adaptive route. The capable nodes in the network are located using Lyapunoy optimization technique through network coding technique that enhances the operation and lifetime of the entire network. Through weight of the packet and along with the packet receiving ratio the algorithm separates the packets and route them to a different path to the base station thereby improving delivery and optimizing time and energy. Simulations are conducted in a NS3 environment and proved that this algorithm is efficient in performance than the existing methods.

Optimal Configuration of Interdependence Between Communication Network and Power Grid

Smart grid is a cyber-physical system with interdependent power grid and communication network. Such interdependence make the smart grid fragile against cascading failures, where an initial failure in communication network may lead to further failures in power grid, and vice versa. We prevent such inter-network cascading failure by stopping an initial failure from propagating. This is achieved by providing a sufficient number of power-disjoint communication routes between power nodes and control center. The number of power-disjoint routes is a robustness metric. We aim to maximize robustness by configuring the interdependence relationship between power grid and communication networks. Such relationship indicates which power node supplies energy to which communication node, and which communication route is used to connect which power node to the control center. Following Menger's Theorem, we transform such configuration problem into a Maxflow problem and solve it using the simplex algorithm. We have evaluated the proposed method through extensive simulations. The results confirm the optimality and computational efficiency of the proposed method. The number of power-disjoint routes increases with an increase in the network size, but can never exceed the number of node-disjoint routes for a same network.

Congestion-Adaptive and Delay-Sensitive Multirate Routing Protocol in MANETs: A Cross-Layer Approach

With a growing demand of multimedia communication over MANETs, to support quality of service (QoS), the MAC standards such as 802.11a/b/g operate with multiple data rates to efficiently utilize the limited resources. Since the wireless channel is shared among the neighbors in MANETs, determining delay-sensitive and congestion-aware routes using the IEEE 802.11 MAC is still a challenging problem. This paper proposes a novel cross-layer approach called congestion-adaptive and delay-sensitive multirate (CADM) routing protocol in MANETs. The CADM protocol exploits the cross-layer interaction between the network layer, MAC, and physical layer. The CADM accesses the correlation between data rate, congestion metric, and MAC delay in delay-sensitive applications to provide enhanced network efficiency in MANETs. The protocol discovers multiple node-disjoint routes and facilitates optimal data rates between the links based on the estimated delay to admit a flow with the certain delay requirement in multirate MANETs. The proposed CADM protocol discovers the route through less congested nodes and also actively handles the congestion if it occurs. The performance of the CADM protocol is comprehensively assessed through the simulation, which highlights the advantages of our cross-layer mechanism.

A survey on power and load-aware multipath node-disjoint routing protocol for MANET

A survey on power and load-aware multipath node-disjoint routing protocol for MANET

ENERGY SENTIENT QOS IMPLEMENTED NODE-DISJOINT MULTIPATH ROUTING PROTOCOLFOR MANET

Some of the main challenges dealing with mobile ad-hoc networks are typically associated with insufficiency of energy and attaining QoS requirements. In order to attain efficient utilization of energy and improve the operational lifetime of the mobile ad-hoc network while at the same time providing reliable packets delivery, energy efficient node disjoint multipath routing was suggested. In such networks attaining Quality of Service (QoS) routing is a not an easy task due to the network breakage by node mobility or high power consumption of mobile nodes. This paper presents a new adaptation of Energy Sentient QoS Implemented in Node- Disjoint Multipath Routing Protocol (ESQI-NDMRP) incorporated with cluster head selection in clusters to allow the sharp selection of node- disjoint routes, and these node-disjoint routes are selected in various cluster head at clusters from the environment circumstance of the network to satisfy the QoS requirements. The performance of our protocol is contrasted with ESQI-NDMRP. From simulation results attained from NS2 simulator by implementing the proposed method, show improved result in terms of energy consumption and throughput as compared to ESQI-NDMRP.

A Void Avoidance Scheme for Grid-Based Multipath Routing in Underwater Wireless Sensor Networks

This work proposes a geographic routing protocol for UWSNs based on the construction of a 3D virtual grid structure, called Void-Avoidance Grid-based Multipath Position-based Routing (VA-GMPR). It consists of two main components, the multipath routing scheme and the grid-based void avoidance (GVA) mechanism for handling routing holes. The multipath routing scheme adopts node-disjoint routes from the source to the sink in order to enhance network reliability and load balancing. While the GVA mechanism handles the problem of holes in 3D virtual grid structure based on three techniques: Hole bypass, path diversion, and path backtracking. The performance evaluation of the VA-GMPR protocol was compared to a recently proposed grid-based routing protocol for UWSNs, called Energy-efficient Multipath Geographic Grid-based Routing (EMGGR). The results showed that the VA-GMPR protocol outperformed the EMGGR protocol in terms of packet delivery ratio, and end-to end-delay. However, the results also showed that the VA-GMPR protocol exhibited higher energy consumption compared to EMGGR.

Proactive vs. reactive multipath routing for mobility enabled RPL

The IPv6 routing protocol for low power and lossy networks (RPL) was proposed as a routing standard for wireless sensor networks (WSNs). However, the RPL performance drastically degrade in the case of nodes' mobility. Therefore, we propose in this paper multipath routing schemes to adapt RPL to mobility scenarios. The first mobility-based braided multipath RPL (MBM-RPL) scheme establishes an alternative path braided with the primary one to replace the loose link (the up to fail link) along the first network route. The second proactive multipath mobility-based RPL (PMM-RPL) approach establishes all node disjoint routes between each node in the network and the sink. Data would not be duplicated on secondary paths until a primary path vulnerability detection. Both MBM-RPL and PMM-RPL performance are evaluated in terms of packet loss rate (PLR), average transmission delay (ADT) and the generated network overhead using the Cooja/Contiki simulation environment.

Multipath Activity Based Routing Protocol for Mobile ‎Cognitive Radio Ad Hoc Networks

Cognitive radio networks improve spectrum utilization by ‎sharing licensed spectrum with cognitive radio devices. In ‎cognitive radio ad hoc networks the routing protocol is one ‎of the most challenging tasks due to the changes in ‎frequency spectrum and the interrupted connectivity ‎caused by the primary user activity. In this paper, a multi‎path activity based routing protocol for cognitive radio ‎network (MACNRP) is proposed. The protocol utilizes ‎channel availability and creates multiple node-disjoint ‎routes between the source and destination nodes. The ‎proposed protocol is compared with D2CARP and FTCRP ‎protocols. The performance evaluation is conducted ‎through mathematical analysis and using OPNET ‎simulation. The performance of the proposed protocol ‎achieves an increase in network throughput; besides it ‎decreases the probability of route failure due to node ‎mobility and primary user activity. We have found that the ‎MACNRP scheme results in 50% to 75% reduction in ‎blocking probability and 33% to 78% improvement in ‎network throughput, with a reasonable additional routing ‎overhead and average packet delay. Due to the successful ‎reduction of collision between primary users and ‎cognitive users, the MACNRP scheme results in decreasing ‎the path failure rate by 50% to 87%.‎

An Effective (FD-E-TOHIP) Fault Detection Enabled E-TOHIP for Mobile Ad-Hoc Networks

Objectives: Security is a challenging issue in mobile ad-hoc networks (MANET). The main objective is to implement FD-ETOHIP Fault Detection Mechanism (FDM) on Enhanced Topology-Hiding Multipath Routing Protocol (E-TOHIP) in mobile ad-hoc networks (MANETs). Methods/Statistical Analysis: E-TOHIP do not permit packets to hold routing information. Once a route is recognized, E-TOHIP will publicize a set having the nodes that have been positioned on routes, which prevents a node from being located on another route. It also establishes multiple node-disjoint routes and excludes unreliable routes before transmitting packets. Findings: With the help of FDM faults in the network can be easily identified. Message loss due to node permanent fault and message loss due to data transmission are the types of faults that occur here. If the node is considered to be a everlasting fault, then the messages at the node location will get lost and it won’t work until a re-establishment is done. The message loss during data transmission occurs due to three kinds of faults namely message redirection, topology change and buffer overflow. Applications/Improvements: Along with FDM, various attack implementation is also done in order to test the efficiency of E-TOHIP protocol.

An optimized node-disjoint multipath routing scheme in mobile ad hoc

In mobile ad hoc networks (MANETs), link failures are caused frequently because of node’s mobility and use of unreliable wireless channels for data transmission. Multipath routing strategy can cope with the problem of the traffic overloads while balancing the network resource consumption. In the paper, an optimized node-disjoint multipath routing (ONMR) protocol based on ad hoc on-demand vector (AODV) is proposed to establish effective multipath to enhance the network reliability and robustness. The scheme combines the characteristics of reverse AODV (R-AODV) strategy and on-demand node-disjoint multipath routing protocol to determine available node-disjoint routes with minimum routing control overhead. Meanwhile, it adds the backup routing strategy to make the process of data salvation more efficient in case of link failure. The results obtained through various simulations show the effectiveness of the proposed scheme in terms of route availability, control overhead and packet delivery ratio.

Power Aware QoS Management in Node-Disjoint Multipath Routing Protocol FOR Mobile Adhoc Network

Multipath routing protocols are gradually increasing the network duration by share out the traffic between several paths. To widen the load between dissimilar nodes, node disjoint multiple paths are implemented for data communication. In such networks achieving Quality of Service (QoS) routing is a challenging task due to the network breakage by node mobility or high power consumption of mobile nodes. This paper presents a novel adaptation of Power Aware QoS Management in Node-Disjoint Multipath Routing Protocol (PAQM-NDMRP) to permit the sharp selection of node-disjoint routes from the environment condition of the network to satisfy the QoS requirements. The performance of our protocol is contrasted with NDMRP. From simulation results obtained from NS2 simulator by implementing the proposed protocol, show improved result in terms of power consumption, end-to-end delay, node mobility and throughput as compared to NDMRP.

A Cross-Layer Delay-Aware Node Disjoint Multipath Routing Algorithm for Mobile Ad Hoc Networks

Future mobile Ad hoc networks (MANETs) are expected to be based on all-IP architecture and be capable of carrying multitudinous real-time multimedia applications such as voice, video and data. It is very necessary for MANETs to have a reliable and efficient routing and quality of service (QoS) mechanism to support diverse applications which have variances and stringent requirements for delay, jitter, bandwidth, packet loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with the minimum hop count as the main metric for path selection, hence are not suitable for delay sensitive real time applications. To support such applications delay constrained routing protocols are employed. These Protocols makes path selection between source and destination based on the delay over the discovered links during routing discovery and routing table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV) based on delay constraint. It employs cross-layer communications between MAC and routing layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay incurred at each intermediate node. The performance of the proposed protocol is compared with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and reduced overhead between intermediate nodes.

TOHIP: A topology-hiding multipath routing protocol in mobile ad hoc networks

Existing multipath routing protocols in MANETs ignore the topology-exposure problem. This paper analyzes the threats of topology-exposure and propose a TOpology-HIding multipath Protocol (TOHIP). TOHIP does not allow packets to carry routing information, so the malicious nodes cannot deduce network topology and launch various attacks based on that. The protocol can also establish multiple node-disjoint routes in a route discovery attempt and exclude unreliable routes before transmitting packets. We formally prove that TOHIP is loop-free and does not expose network topology. Security analysis shows that TOHIP can resist various kinds of attacks efficiently and effectively. Simulation results demonstrate that TOHIP has better capability of finding routes and can greatly increase the capability of delivering packets in the scenarios where there are malicious nodes at the cost of low routing overhead.

Multiagent Based Multipath Routing In Wireless Sensor Networks

This paper proposes a Multiagent Based Multipath Routing (MBMR) using a set of static and mobile agents by employing localization technique. The operation of proposed routing technique can be briefly explained as follows. (1) Anchor nodes are deployed evenly over the network environment. (2) Unknown sensor nodes are deployed randomly over network environment and these nodes perform localization. (3) Source node computes the shortest route to destination node through arbitrary midpoint node and intermediate nodes. (4) Source node generates mobile agents for partial route discovery, which traverses to destination node through the midpoint and intermediate nodes by carrying information. (5) Mobile agents update the destination node with carried information. (6) Destination node computes route weight factor for all the routes discovered by mobile agents. (7) Destination node computes the node disjoint routes and it selects routes depending on the criticalness of event for communication. The performance of the proposed scheme is evaluated in terms of performance parameters such as localization error, network lifetime, energy consumption, cost factor, packet delivery ratio, and latency.

A Modification to DSR using Multipath Technique

MANET is a collection of self organized mobile nodes with dynamic topologies and no fixed infrastructure. DSR is single path routing protocol applied for MANET and gives better performance when routes are not long enough. Its performance depends on different parameters value, like number of nodes and mobile connections. Thus routing efficiency is determined based on two aspects: firstly the time needed to react on a link break and secondly the ability to optimize to a shorter route when one is available. Developing better routing protocol became challenging task due to dynamic topology. Multipath routing is effective in mobile ad-hoc networks since link breakage is less likely to occur. A multipath extension to DSR namely Quality Aware Multipath DSR is proposed. Main interest is to divert the traffic through several node disjoint routes. Here source node maintains up to five paths corresponding to same destination as a result of route discovery procedure. The proposed work is implemented in NS2 and simulation results show that the proposed protocol achieves better packet delivery ratio, throughput and decrease average delay.

Performance analysis of fuzzy logic-based geographical node-disjoint path routing for WSNs

Geographical routing in wireless sensor networks is an effective approach for monitoring of seismically sensitive zones where the probability of earthquake and hazards is very high. In this letter, we are proposing an efficient fuzzy logic-based geographical routing approach for seismically sensitive areas using wireless sensor network (WSN). The proposed system uses the concept of basic geographical node-disjoint path routing (GNPR). The difference between proposed system and its conventional GNPR is that, it uses fuzzy logic to find out the shortest path per iteration and repeatedly apply the fuzzy inference rules in subsequent iteration to find the next on-demand node. Simulation results show that the proposed scheme gives better performance in terms of higher throughput and lower delay as compared to basic GNPR approach.