Low Routing Overhead Research Articles

Hybrid optimization-based Effective Path Selection and Multipath routing in MANETs

Mobile Adhoc Networks (MANETs) have emerged as a popular technology because of their wide application and independent mobility. Nevertheless, communication through MANETs can be effective because of their inherent nature of high mobility, which in turn results in a higher rate of data loss and delay. Therefore, for effective communication to be achieved, the MANETs’ routing performance must be enhanced. Some extant routing protocols like AOMDV can yield moderate Routing Overhead (RO) during communication. The review of previous studies shows that there is a need for improvement in the following areas: Computational E2E delay: the proposed Genetic Algorithm- Ant Colony Optimization (GA-ACO) was unable to reduce the computational E2E delay that occurs during communication. RO: The schemes that were proposed failed to minimize the RO in the network. Energy consumption: the reduction energy consumed by the network was reduced, however, high throughput and PDR could not be achieved by the method. On the contrary, the EHO-based AOMDV routing protocol achieved low E2E delay and RO but was unable to decrease the energy consumed by the network. Throughput and PDR: The protocol proposed failed to achieve high Quality of Services (QoS). Consequently, this paper aims to provide a solution to this communication problem by proposing a Hybrid Optimization-based Effective Path Selection and Multipath routing (HOEPSM) approach for MANETs. The proposed approach, which is HOEPSM is made up of two parts: Elephant Herding Optimization (EHO)-based AOMDV routing protocol, which makes use of EHO for the identification of the shortest path from the source to the destination. The second part which is the Hybrid optimization using Genetic Ant Optimization (GAO) algorithm, involves finding the best solution through the use of a GAO-based hybrid optimization algorithm. The results of the study revealed that the use of the HOEPSM causes a significant decrease in routing RO while enhancing the network’s Quality of Forwarding (QoF) of the network. Also, the simulation of the proposed approach was carried out in NS2, and afterward, compared with earlier proposed methods like DRARP and MDRARP. Based on the simulation results, the HOEPSM outperformed the other methods, with high Energy Efficiency (EE) (91%), Packet Delivery Ratio (PDR) (95%), RO (155), and End to End (E2E delay) (102ms). These results can be attributed to the HOEPSM’s choice of the best and steady route from the source nodes and destination nodes.

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

Ant with Artificial Bee Colony Techniques in Vehicular Ad-hoc Networks

A VANET faces many problems due to dynamic changing of networks with certain requirements such as low delay, high (PDR) packet delivery ratio, low routing overhead and throughput. However, numerous routing protocols have been suggested to meet the demands of Quality of Service (QoS), but none of them can consistently maintain the highest level of QoS simultaneously. The proposed method Ant with Artificial Bee Colony Techniques provides better performance when compared to the existing techniques. This work is compared with latest developed Techniques in VANET to find the best path and different performance metrics are used to check the performance. This work premeditated the comparative analysis of Quality of services made by the performance of latest emerging techniques in VANET and will provide the best solution for the recognition problem in finding the best path based on the evaluation of performance of Quality of Service. Simulation results imply the benefits of the proposed Ant with Artificial Bee Colony Techniques (AABC) produces better result when compare to the other conventional method and Ant Colony Techniques(ACT)in terms of high packet delivery ratio, less end-to-end delay and less energy consumption level. The performance is evaluated by using Ns2 simulator and results shows that the AABC successfully achieve the optimal routes.

A Novel Method of Enhancing Security Solutions and Energy Efficiency of IoT Protocols

Mobile Ad-hoc Networks (MANET’s) are wireless networks that are capable of operating without any fixed infrastructure. MANET routing protocols must adhere to strict secrecy, integrity, availability and non-repudiation criteria. In MANETs, attacks are roughly categorised into two types: active and passive. An active attack attempts to modify or remove data being transferred across a network. On the other hand, passive attack does not modify or erase the data being sent over the network. The majority of routing protocols for MANETs were built with little regard for security and are therefore susceptible to a variety of assaults. Routing technologies such as AODV and dynamic source routing are quite common. Both however are susceptible to a variety of network layer attacks, including black holes, wormholes, rushing, byzantine, information disclosure. The mobility of the nodes and the open architecture in which the nodes are free to join or leave the network keep changing the topology of the network. The routing in such scenarios becomes a challenging task since it has to take into account the constraints of resources of mobile devices. In this an analysis of these protocols indicates that, though proactive routing protocols maintain a route to every destination and have low latency, they suffer from high routing overheads and inability to keep up with the dynamic topology in a large sized network. The reactive routing protocols in contrast have low routing overheads, better throughput and higher packet delivery ratio. AODVACO-PSO-DHKE Methodology boosts throughput by 10% while reducing routing overhead by 7%, latency by 8% and energy consumption by 5%. To avoid nodes always being on, a duty cycle procedure that's also paired with the hybrid method is used ACO-FDR PSO is applied to a 100-node network and NS-3 is used to measure various metrics such as throughput, latency, overhead, energy consumption and packet delivery ratio.

A Novel Method of Enhancing Security Solutions and Energy Efficiency of IoT Protocols

Mobile Ad-hoc Networks (MANET’s) are wireless networks that are capable of operating without any fixed infrastructure. MANET routing protocols must adhere to strict secrecy, integrity, availability and non-repudiation criteria. In MANETs, attacks are roughly categorised into two types: active and passive. An active attack attempts to modify or remove data being transferred across a network. On the other hand, passive attack does not modify or erase the data being sent over the network. The majority of routing protocols for MANETs were built with little regard for security and are therefore susceptible to a variety of assaults. Routing technologies such as AODV and dynamic source routing are quite common. Both however are susceptible to a variety of network layer attacks, including black holes, wormholes, rushing, byzantine, information disclosure. The mobility of the nodes and the open architecture in which the nodes are free to join or leave the network keep changing the topology of the network. The routing in such scenarios becomes a challenging task since it has to take into account the constraints of resources of mobile devices. In this an analysis of these protocols indicates that, though proactive routing protocols maintain a route to every destination and have low latency, they suffer from high routing overheads and inability to keep up with the dynamic topology in a large sized network. The reactive routing protocols in contrast have low routing overheads, better throughput and higher packet delivery ratio. AODVACO-PSO-DHKE Methodology boosts throughput by 10% while reducing routing overhead by 7%, latency by 8% and energy consumption by 5%. To avoid nodes always being on, a duty cycle procedure that's also paired with the hybrid method is used ACO-FDR PSO is applied to a 100-node network and NS-3 is used to measure various metrics such as throughput, latency, overhead, energy consumption and packet delivery ratio.

A mean field game-theoretic cross-layer optimization for multi-hop swarm UAV communications

Unmanned aerial vehicle (UAV) multi-hop communication networks are foreseen to be widely employed in both military and civilian scenarios. However, in ultra-dense scenarios with swarm UAVs, nodes are highly dynamic mobile, ultra-dense deployment and non-centralized distribution. These characteristics make the centralized resource management policy not apply. Meanwhile, existing routing protocols can't meet the performance challenges of high dynamic, topology and link frequency changes of ultra-dense scenarios with swarm UAVs. To solve the above challenges of resource management and routing protocol, a cross-layer optimization method is presented with a novel mean field game (MFG) in this paper. It is based on the cross-layer design method of the MFG theory and jointly considers the power resources in the physical layer, frequency resources in the medium access control (MAC) layer, and routing resources in the network layer. By dividing into subproblems, the original problem is solved. Meanwhile, the optimal data transmission path can be selected through the management and allocation of frequency resources and power resources. A cross-layer resource management dynamic source routing (CLRM-DSR) protocol is designed based on that which adds link quality measurement. The simulation results show that the presented CLRM-DSR with the proposed resource management scheme can improve the data packet transmission rate, reduce end-to-end delay, and lower routing overhead for the multi-hop swarm UAV communication network.

SRTE: Security Resource Allocation for Trust Model in Evaluate the Strong Node

Mobile ad hoc network (MANET) is a framework-free as well as self-designing network in which Mobile Nodes (MN) travel freely across the contact spectrum using cellular network interfaces. Through the advancement of wireless technologies, a complex network can better handle data communication protection while improving quality of service (QoS) metrics. MANET is defenceless to security breaches due to the absence of a trusted unified authority. In MANET, the SRTE approach, also known as protection allocation of resources for trust model, is introduced for evaluating strong nodes. Main contribution of the work have four parts: First, to improve secure data transmission in MANET’s environment, the H-ACO-DSR method is introduced. Second part, the HTDMA method is developed for better resource allocation. Third part, the HTCMR is introduced and produce the efficient cluster and trust worthiness in the MANET’s environment. Fourth part, the ABT is used to identify the malicious node and trusted Node in the system. To boost the Qos metric efficiency, the trusted nodes in MANET as well as data transmission are carried out with the trusted MN. Finally, as compared to current approaches, simulation results produce improved PDR and low cost Energy, Average Delay, Routing overhead, and Throughput.

AODV Multicast Routing for the Zigbee Heterogeneous Networks in 5G Environment on Wireless Sensor Network

A modified AODV routing protocol is adopted as part of the combined routing strategy in the ZigBee networks. Considering the deploying environment, the emerging 5G technology tends to be ubiquitous in the near future. Aiming to the higher efficiency and the shorter path, an improved ZigBee AODV (Z-AODV) routing protocol using associated gateways for the heterogeneous networks in the 5G environment is proposed in this paper. Besides the regular ZigBee function, by sharing the neighbour and routing information via IP network, the AGs are also responsible for collaboratively finding the optimum path and transmitting the packets to reduce the consumption for ZigBee devices. Moreover, an additional routing information collecting method is developed to further improve the routing performance. The proposed algorithm is evaluated based on simulation results. It is shown that our routing method outperforms the existing ones by higher picketer deliver ratio, shorter path length, lower latency, fewer packets sent per ZigBee node and lower routing overhead.

Internet of Planets (IoP): A New Era of the Internet

Internet of Planets (IoP) is a concept that enables solar planets to communicate with each other using the Internet. While there is a plethora of research on IoP, the delay-tolerant network (DTN) has emerged as the most advanced technology in recent years. DTN is an asynchronous networking technology that has been deployed for the networking environment in which steady communication paths are not available, and therefore, it stores receiving data in a data storage and forward them only when the communication links are established. DTN can be applied to sensor networks and the mobile ad-hoc network, as well as space communication that supports data transmissions among satellites. In DTN networking environments, it is crucial to secure a scheme that has relatively low routing overhead and high reliability to achieve efficiency. Thus, this article proposes a time (delay) information based DTN routing scheme, which is able to predict routing paths for achieving efficient data transmissions among the nodes that have comparatively periodic moving patterns. The results of the proposed DTN routing algorithm using NS-3 simulation tools indicate satisfied levels of routing performance in comparison with the existing DTN algorithm.

Evaluation of Agent-Network Environment Mapping on Open-AI Gym for Q-Routing Algorithm

The changes in network dynamics demands a routing algorithm that adapts intelligently with the changing requirements and parameters. In this regard, an efficient routing mechanism plays an essential role in supporting such requirements of dynamic and QoS-aware network services. This paper has introduced a self-learning intelligent approach to route selection in the network. A Q-Routing approach is designed based on a reinforcement learning algorithm to provide reliable and stable packet transmission for different network services with minimal delay and low routing overhead. The novelty of the proposed work is that a new customized environment for the network, namely Net-AI-Gym, has been integrated into Open-AI Gym. Besides, the proposed Q-routing with Net-AI-Gym offers optimization in exploring the path to support multi-QoS aware services in the different networking applications. The performance assessment of the NET-AI Gym is carried out with less, medium, and a high number of nodes. Also, the results of the proposed system are compared with the existing rule-based method. The study outcome shows the Net-AI-Gym's potential that effectively supports the varied scale of nodes in the network. Apart from this, the proposed Q-routing approach outperforms the rule-based routing technique regarding episodes vs. Rewards and path length.

Bluetooth-based device-to-device routing protocol for self-organized mobile-phone mesh network

The bluetooth technology provides a point-to-point communication interface to mobile phones and other electronic devices, which can be used to form a self-organized ad hoc mesh network consists of mobile phones. In such a self-organized mesh network, the data packets are not transferred by traditional telecommunication backbone network but through bluetooth-based hop-by-hop routing among mesh nodes in the network. Such an ad hoc mesh network may find a wide span of application scenarios where access to backbone network infrastructure is not available, yet it needs an efficient routing protocol to provide a timely transmission mechanism for data packets to reach their destination even under situations when network topology is in constant changes due to mobile node’s movement. In the bluetooth-based device-to-device routing protocol (BDRP) presented in this paper, we propose several key designs as processed data table, node exclusion by packet and source control routing to provide an end-to-end packet transmission solution in a dynamically changing topology with constraints on network bandwidth, battery power, and storage space on a mobile device. The processed data table and node exclusion by packet mechanisms contribute to eliminating a great number of non-useful duplicate packets in routing path, and the source control routing algorithm implemented with a cross-layer packet retransmission process provides a fast and low-overhead routing policy and an assurance to packet reaching destination. In the simulation experiment conducted BDRP demonstrates its effectiveness and efficiency in eliminating undesirable duplicate packets and adaptability to constant topological changes. The performance comparison experiment indicates that the BDRP outperforms the optimized link state routing (OLSR) protocol in packet arrival rate, particularly under situations when mobile nodes are in fast moving mode, yet manages to maintain the same level of transmission delay as OLSR’s even with the packet retransmission process. The work presented in this paper provides a key technology for the applications of Bluetooth mobile phone mesh network in a larger geographic area and a broader application domain.

An Efficient Cluster-Based Approach to Thwart Wormhole Attack in Adhoc Networks

Mobile Ad-hoc networks is an ascertaining domain with promising advancements, attracting researchers with a scope of enhancements and evolutions. These networks lack a definite structure and are autonomous with dynamic nature. The strength of the Ad-hoc network lies in the routing protocols making it an apt choice for transmission. With several types of routing protocols available our focus is on LGF (Location-based Geo-casting and Forwarding) protocol that falls in Position based category. LGF assures to grab the attention with its feature of low bandwidth consumption and routing overhead at the cost of unvolunteered attacks resulting in compromising the security of data. In our approach, we present a technique to overcome the profound attacks like Wormhole and Blackhole by aggregating LGF with k++ Means Clustering aiming at route optimization and promoting security services. The proposed mechanism is evaluated against QoS factors like End to End delay, Delivery Ratio, Load balancing of LGF using Simulator NS3.2 which envisioned drastic performance acceleration in the aforementioned model.

Fuzzy Logic-Based Geographic Routing Protocol for Dynamic Wireless Sensor Networks.

The geographic routing protocol only requires the location information of local nodes for routing decisions, and is considered very efficient in multi-hop wireless sensor networks. However, in dynamic wireless sensor networks, it increases the routing overhead while obtaining the location information of destination nodes by using a location server algorithm. In addition, the routing void problem and location inaccuracy problem also occur in geographic routing. To solve these problems, a novel fuzzy logic-based geographic routing protocol (FLGR) is proposed. The selection criteria and parameters for the assessment of the next forwarding node are also proposed. In FLGR protocol, the next forward node can be selected based on the fuzzy location region of the destination node. Finally, the feasibility of the FLGR forwarding mode is verified and the performance of FLGR protocol is analyzed via simulation. Simulation results show that the proposed FLGR forwarding mode can effectively avoid the routing void problem. Compared with existing protocols, the FLGR protocol has lower routing overhead, and a higher packet delivery rate in a sparse network.

A Trajectory-Driven Opportunistic Routing Protocol for VCPS

By exploring sensing, computing, and communication capabilities on vehicles, vehicular cyber-physical systems (VCPS) are promising solutions to provide road safety and traffic efficiency in intelligent transportation systems. Due to high mobility and sparse network density, VCPS could be severely affected by intermittent connectivity. In this paper, we propose a trajectory-driven opportunistic routing (TDOR) protocol, which is primarily applied for sparse networks, e.g., delay/disruption tolerant networks (DTNs). With geographic routing protocol designed in DTNs, existing works primarily consider the proximity to destination as a criterion for next-hop selections. Differently, by utilizing GPS information of on-board vehicle navigation system to help with data transmission, TDOR selects the relay node based on the proximity to trajectory. This aims to provide reliable and efficient message delivery, i.e., high delivery ratio and low-transmission overhead. TDOR is more immune to disruptions, due to unfavorable mobility of intermediate nodes. Performance evaluation results show TDOR outperforms well-known opportunistic geographic routing protocols, and achieves much lower routing overhead for comparable delivery ratio.

A Geographic Multicopy Routing Scheme for DTNs With Heterogeneous Mobility

Previous geographic routing schemes in Delay/Disruption Tolerant Networks (DTNs) only consider the homogeneous scenario where nodal mobility is identical. Motivated by this gap, we turn to design a DTN based geographic routing scheme in heterogeneous scenario. Systematically, our target is achieved via two steps: 1) We first propose "The-Best-Geographic-Relay (TBGR)" routing scheme to relay messages via a limited number of copies, under the homogeneous scenario. We further overcome the local maximum problem of TBGR given a sparse network density, different from those efforts in dense networks like clustered Wireless Sensor Networks (WSNs). 2) We next extend TBGR for heterogeneous scenario, and propose "The-Best-Heterogeneity-Geographic-Relay (TBHGR)" routing scheme considering individual nodal visiting preference (referred to non-identical nodal mobility). Extensive results under a realistic heterogeneous scenario show the advantage of TBHGR over literature works in terms of reliable message delivery, while with low routing overhead.

Traffic-aware stateless multipath routing for fault-tolerance in IEEE 802.15.4 wireless mesh networks

Single-path routing is widely used in wireless networks due to low resource consumption. However, it is vulnerable to link failure because such a failure may adversely affect an entire path. To overcome this, multipath routing has been proposed providing fault-tolerance. In this paper, we propose a novel multipath routing protocol called traffic-aware stateless multipath routing (TSMR) based on an overlaid tree topology comprising two topologies, namely, bounded degree tree (BDT) and root-oriented directional tree (RODT). BDT is strong on reducing routing overhead, and RODT is resilient against lossy links. By synergistically overlaying them, TSMR dynamically selects the local optimal path according to the given traffic flow and the failure on the primary path. In particular, TSMR enables stateless and low overhead routing despite multipath routing by keeping only one-hop neighbors to maintain multiple paths. To evaluate TSMR, we conducted simulations with a shadowing model reflecting lossy links, and compared with single and multipath routing protocols, such as ZTR, STR, AODV, and RPL. The simulation results show that the overall performance of TSMR surpasses that of others for packet delivery ratio, end-to-end delay, control overhead, memory consumption, and power consumption regardless of network size, number of sessions, and traffic flow.

An improved AODV routing for the zigbee heterogeneous networks in 5G environment

A modified AODV Junior routing protocol is adopted as part of the combined routing strategy in the ZigBee networks. However, its routing overhead caused by the routing discovery and the routing table maintenance needs to be further reduced. Considering the deploying environment, the emerging 5G technology tends to be ubiquitous in the near future. Due to its native support to the smart devices and the M2M communication, the 5G terminals may be used as gateways for the ZigBee networks to improve the existing routing method. The ZigBee coordinator and the 5G terminals, which both have the accessibility to the internet, are defined as associated gateways (AG). Aiming to the higher efficiency and the shorter path, an improved ZigBee AODV (Z-AODV) routing protocol using associated gateways for the heterogeneous networks in the 5G environment is proposed in this paper. Besides the regular ZigBee function, by sharing the neighbour and routing information via IP network, the AGs are also responsible for collaboratively finding the optimum path and transmitting the packets to reduce the consumption for ZigBee devices. Moreover, an additional routing information collecting method is developed to further improve the routing performance. The proposed algorithm is evaluated based on simulation results. It is shown that our routing method outperforms the existing ones by higher picketer deliver ratio, shorter path length, lower latency, fewer packets sent per ZigBee node and lower routing overhead.

A Fast Reroute Algorithm for Infotainment Service in Internet of Vehicles

Failure recovery in Internet of Vehicles (IoVs) is critical to high quality service provisioning. The main challenge is how to achieve fast rerouting without introducing high complexity and resource usage due to the dynamic topology and the constraints on bandwidth. In this paper, we propose a traffic prediction-based fast reroute algorithm for use among the vehicles in IoVs. The proposed algorithm uses the Wavelet Neural Network (WNN) model to predict a vehicle's network traffic. When the predicted value is greater than the predefined network traffic threshold, both Adaptive Retransmission Trigger (ART) that contributes to switch to a better alternate path in advance and trigger efficient retransmission behaviors are enabled successively. Performance comparison of our proposed algorithm with Ant-based Delay-Sensitive Vehicular Routing (AntVehiNet) shows that WNNPFR can: (a) maximize the service data delivery rate by load balancing, (b) provide high quality of service delivery for multimedia streams by switching to a better path towards a target node in advance, (c) reduce useless data retransmissions when various network failures occur, and (d) maintain lower routing overhead.

A Topology-Hiding Secure On-Demand Routing Protocol for Wireless Ad Hoc Network

Secure routing in wireless ad hoc network has been an active area of research and in recent years, a number of secure routing protocols have been introduced. These solutions may be classified as proactive, reactive, and hybrid based on the routing information update mechanism deployed. Studies reveal that the reactive (on-demand) ones often outperform the others due to their ability to adjust the amount of network overhead created to track the mobility in the network. However, the existing secure on-demand routing protocols have also some limitations. In this paper, the weakness of existing popular secure reactive routing protocols is analyzed on the ground of topology exposure. Then a new topologyhiding secure on-demand routing protocol, called TSOR is proposed based on timestamp approach and asymmetric cryptography. Security analysis of TSOR shows that it efficiently defeats all possible threats imposed by external or internal adversaries. Simulation results demonstrate that our protocol has a better capability of finding reliable and shortest routes in the presence of malicious nodes at the cost of low routing overhead.

Double Stairs: A Fault-Tolerant Routing Algorithm for Networks-on-Chip

Reliability is one of the main concerns in the design of networks-on-chip (NoCs) due to the use of deep submicron technologies in fabrication of such products. This paper presents a new fault-tolerant routing algorithm called double stairs for NoCs. Double stairs routing algorithm is a low overhead routing that has the ability to deal with fault. The proposed routing algorithm makes a redundant copy of each packet at the source node and routes the original and redundant packets in a new partially adaptive routing algorithm. The method is evaluated for various packet injection rates and fault rates. Experimental results show that the proposed routing algorithm offers the best trade-off between performance and fault tolerance compared to other routing algorithms, namely flooding, XYX and probabilistic flooding.