Enhanced Routing Protocol Research Articles

Research on intelligent lighting Bluetooth Mesh networking control based on AODV

This paper discusses the deficiencies of the flooding broadcast mechanism in Bluetooth Mesh networks and puts forth an enhanced routing protocol Olq-AODV. The limitations of traditional AODV routing protocols are particularly evident in smart light networks with high node density, where packet redundancy and link quality judgment are crucial. To this end, Olq-AODV introduces an optimized link quality judgment mechanism in the process of route discovery, considering delay, hop count, and cascade PRR, with the aim of improving the transmission efficiency and reliability of the network. The test results demonstrate that the Olq-AODV routing protocol outperforms the traditional flooding algorithm in terms of network transmission delay and packet delivery rate, and effectively improve the performance of Bluetooth Mesh networks.

LoRaWAN-Based Reliable and Secure Enhanced Routing Protocol for Vehicular Communication System

LoRaWAN-Based Reliable and Secure Enhanced Routing Protocol for Vehicular Communication System

Enhanced Routing Protocol for Health Monitoring in Urban Traffic Networks via VANET: Analyzing IW-GeoR Against WGeoR

The primary aim of this initiative is to establish an effective routing system for managing both human-induced and natural calamities using a Wireless Body Sensor Network (WBSN) integrated with VANET within urban traffic networks. This is accomplished through a comparison between the Weighed Geographic Routing (WGeoR) protocol and the Improved Weighed Geographical Routing (IWGeoR) protocol, targeting minimized packet loss and reduced delay. The IWGeoR protocol stands out by efficiently selecting cluster heads to mitigate delay and packet loss, considering various factors such as differences in vehicle speeds, inter-vehicle distances, and traffic mobility. The protocol’s effectiveness relies on innovative node degrees, channel quality, proximity factors, and communication connection expiration times. For this study, twenty samples (n=20) were gathered from each of the two groups using diverse vehicles. Clinical.com established a pre-test power of 80% (G-power) for each group, with alpha and beta coefficients set at 0.05 and 0.2 respectively, in order to assess the protocol’s performance in terms of packet loss and average latency. The simulation outcomes indicate that the IWGeoR protocol surpasses the WGeoR protocol in crucial metrics such as packet loss and mean delay. Specifically, the IWGeoR protocol reduces packet loss by 10.77% and delay by 31.03%. The Independent Sample T-test calculates a significant p-value of 0.001 for the IWGeoR and WGeoR protocols, demonstrating statistical significance (p<0.005). Based on experimental findings and the Independent Sample T-test, the proposed IWGeoR protocol has demonstrated superior performance compared to the WGeoR protocol.

Navigating Routing Challenges in Internet of Things (IoT): A Focus on Routing Protocols and Wireless Sensor Networks

This paper states the routing issues in the Internet of Things (IoT). The main point of focus is especially on routing protocols in IoT and wireless sensor networks (WSN). “Everything which is connected to the internet is alive”, is going to be the new rule for the future. The future is the Internet of Things (IoT), the world is changing every day with new technologies and inventions. The Internet of Things (IoT) has known as a future scenario of technology in human life. IoT expands the concept of the Internet from a network of rather homogenous devices such as computers to a network of heterogeneous devices such as home appliances and the conventional network is mostly replaced with IoT. Devices are the main users of the IoT framework an important part is IEEE 802.15.4, a standard that operates at the PHY layer and MAC layer of IoT devices. The IoT Ecosystem includes a large number of integrated heterogeneous low-power, low-cost devices, and secure connections are needed between them [15]. They communicate with each other to gather, share and forward the information in a multi-hop manner, this requires a complex routing between them. WSN, new technology in the IoT system comprised of a large collection of sensors, a mesh network can be used to individually gather data and send data through a router to the internet in an IoT system [6]. an enormous number of sensors are used and its growth is also fast, they are collecting inexperienced data and transforming it into meaningful and useful information. considering the full usability of these devices and a huge number of them, produce routing challenges [16]. Routing in IoT is the most critical part because we are working with devices that have restricted device resources. the optimum goal is to have enhanced routing protocols and efficient performance with such limited resource devices [15, 18].

Hybrid sooty tern naked mole-rat algorithm and Fuzzy Type-2 logic-based trust and energy-aware stable clustering protocol

With the advent of low-cost circuitry, sensor and communication technologies, it is feasible to sense and communicate the condition of surroundings to end user. The wireless networks of these circuits, called Wireless Sensor Network (WSN) that are utilized in a multitude of applications such as in hospitals, smart industries, environmental sensing and military protection. WSN's main issue is efficient data sharing between various sensors and efficient communication with sink. However, in the real-world sensors have restricted range of communication and resources, which in turn imposes constraints for successful coordination in the design of the communication strategy. Investigating the trust level of a node is also a significant aspect of WSNs using which two sensor nodes can communicate since an untrustworthy node has adverse effect on the reliability and quality of data. The biggest challenge in this domain is to devise a suitable communication system that helps sensors to achieve their target with minimal energy loss and high confidence level transmission of the full exploration data. Clustering is an effective way to extend the network performance parameters. In order to address the restrictions in these protocols such as cluster head (CH) lifetime, cluster quality etc.; an enhanced routing protocol with optimum CH selection algorithm and trust management are required to design an efficient WSN framework. A hybrid sooty tern naked mole rat algorithm (STNMRA) is developed to mitigate the effect of local stagnation problem in classical naked mole rat algorithm (NMRA). In order to evaluate the effectiveness of proposed STNMRA, highly challenging CEC 2019 numerical test problems are taken into consideration and statistical test validates that STNMRA provides better results with respect to competitive algorithms. STNMRA based clustering protocol using a Fuzzy Type-2 logic is proposed in this paper to enhance the trust level and thus the network lifetime. The proposed clustering protocol outperforms state-of-the-art techniques in terms of the efficient removal of malicious nodes together with improved network lifespan and reduced energy consumption.The source code for the proposed algorithms is available at: https://github.com/mittalnitinsvsu/STNMRA.

Enhanced clustering based routing protocol in vehicular ad‐hoc networks

AbstractA vehicular ad‐hoc network (VANET) is derived from a mobile ad‐hoc network that is a part of less infrastructure network design. Vehicular communication in VANET can be achieved using vehicle‐to‐infrastructure (V2I) and vehicle‐to‐vehicle (V2V) communication. A vehicle communicates with other vehicles through onboard units while communicating with roadside units in an infrastructure mode. Secure clustering is required for the communication between nodes in the whole network. The fundamental problem with the VANET is the instability of the network that occurs due to vehicles' mobile nature, which decreases the network's efficiency. This research proposes an enhanced cluster‐based lifetime protocol ECBLTR that focuses on maximising the network's stability of routing and average throughput. The Sugeno model fuzzy inference system is used for assessing the cluster head (CH) that takes residual energy, local distance, node degree, concentration, and distance from the base station as input parameters. Our enhanced routing protocol shows that the proper channel model with an efficient routing protocol enhances the link throughput of the VANET for fixed network size. Our results show an efficient selection method of CH through the fuzzy system and a 10% increase in network lifetime. Furthermore, performance evaluation also demonstrates the impact of network sizes and routing protocols on packet delivery ratio and packet loss, average end‐to‐end delay, and overhead transmission.

Analysis of power optimization and enhanced routing protocols for wireless sensor networks

Computers are connected through a network. Wireless sensor nodes are used in sensor networks to keep tabs on their surroundings. The building components of a network are sensor nodes. Processors, transceiver and memory are all onboard as well as a power supply. A WSN is a network of devices. Lifespan, data collection, and security are WSN parameters. Wireless sensors' low cost and quick deployment make them ideal for real-time applications. WSN's key problem is long-term energy supply. Energy resource, energy harvesting, topology, and effective routing may extend network lifespan. WSN energy is improved using an efficient manner. The recommended technique relies heavily on grouping and selecting the best possible path. The energy levels of the sensor nodes decide the cluster leader. Chikoo search algorithm selects the best path. This algorithm saves more energy than others. Optimum search ideas identify optimal sink location. Based on the network's energy dissipation and distribution, this technique finds the ideal location for all sinks to improve the network's lifespan and move with intelligent sink placement.

A Novel and Enhanced Routing Protocol for Large Scale Disruption Tolerant Mobile Ad hoc Networks

Because of the lack of fixed infrastructures, the existence of open media and diverse network topologies, internetworking networks and mobile ad hoc networks (MANET’s), the design of MANET protocols is complicated. In this paper, we propose an evolutionary trust mechanism imitating cognitive processes that uses sensitive information to avoid routing. Moreover, we propose an Enhanced Self-organizing Cooperation and Trust based (ESCT) Protocol, where the mobile nodes share self-reliance and interpret information from a cognitive point of view. Each node develops its information dynamically to eradicate malicious entities. The most attractive attribute of the proposed ESCT protocol, even if domestic attackers know how it operates, is to prevent infringements. In this paper, the efficiency of the proposed ESCT protocol is assessed for different routing disturbances and varying number of attackers. The results of a simulation show that, the proposed ESCT protocol supports diverse network platforms and provides an efficient routing method for MANET routers. The proposed ESCT protocol displays increased throughput, reduction in end-to-end delay and increase in packet delivery ratio when compared to the peers that were taken for comparison.

A REVIEW ON DESCENDANTS OF LEACH PROTOCOL - A PRAGMATIC APPROACH

A Wireless Sensor Networks (WSN) is a Wireless Networks comprising of spatially disseminated independent sensors to screen physical or natural circumstances. The battery power in these sensor nodes assumes a significant part in expanding the life expectancy of the nodes. Hierarchical routing protocols are the most popular protocols to limit the energy utilization when compared to Flat Routing. Low-Energy Adaptive Clustering Hierarchy (LEACH) is a traditional Cluster based routing protocol for WSNs having great execution, energy productivity, and successful in elongating the lifetime of the network life time by consuming a little level of the complete disseminated energy in the framework. This paper reviews the condition of craft of various progressed, enhanced routing protocols that have been created from the LEACH. This paper features a portion of the downsides and issues of LEACH how these issues are vanquished by the relatives of LEACH. Appraisal of descendants of LEACH routing protocols in advised with regards to versatility, self-association, and conveyance of nodes, network control, Hop count, energy proficiency, and utilization of data.

An Enhanced Traffic Split Routing Heuristic for Layer 2 and Layer 1 Services

Virtual Private Networks (VPNs) have now taken an important place in computer and communication networks. A virtual private network is the extension of a private network that encompasses links through shared or public networks, such as the Internet. A VPN is a transmission network service for businesses with two or more remote locations. It offers a range of access speeds and options depending on the needs of each site. This service supports voice, data and video and is fully managed by the service provider, including routing equipment installed at the customer’s premises. According to its characteristics, VPN has widely deployed on ”COVID-19” offering extensive services to connect roaming employees to their corporate networks and have access to all the company information and applications. Hence, VPN focuses on two important issues such as security and Quality-of-Service. This latter has a direct relationship with network performance such as delay, bandwidth, throughput, and jitter. Traditionally, Internet Service Providers (ISPs) accommo-date static point-to-point resource demand, named, Layer 1 VPN (L1VPN). The primary disadvantage of L1VPN is that the data plane connectivity does not guarantee control plane connectivity. Layer 2 VPN is designed to provide end-to-end layer 2 connection by transporting layer 2 frames between distributed sites. An L2VPN is suitable for supporting heterogeneous higher-level protocols. In this paper we propose an enhanced routing protocol based on Traffic Split Routing (TSR) and Shortest Path Routing (SPR) algorithms. Simulation results show that our proposed scheme outperforms the Shortest Path Routing (SPR) in term of network resources. Indeed, 72% of network links are used by the Enhanced Traffic Split Routing compared to Shortest Path Routing (SPR) which only used 44% of the network links.

Enhanced GAF protocol based on graph theory to optimize energy efficiency and lifetime in WSN technology

PurposeThe purpose of this paper is to design an enhanced routing protocol to minimize energy consumed and extend network lifetime in sensor network (WSN).Design/methodology/approachWith the use of appropriate routing protocols, data collected by sensor nodes reache the BS. The entire network lifetime can be extended well beyond that of its single nodes by putting the nodes in sleep state when they are not in use, and make active just a single node at a time within a given area of interest. So that, the lowest-cost routing arises by minimizing the communication cost. This paper proposes an enhanced adaptive geographic fidelity (E-GAF) routing protocol based on theory of graphs approach to improve the discovery phase, select the optimal path, reduce the energy used by nodes and therefore extend the network lifetime. Following the simulations established by varying the number of grids and tests, a comparison is made between the E-GAF and basic GAF (B-GAF) based on the number of dead nodes and energy consumption.FindingsThe results obtained show that E-GAF is better than the existing basic GAF protocol in terms of energy efficiency and network lifetime.Originality/valueThis paper adopts the latest optimization algorithm know as E-GAF, which is used to solve the problem of energy and improve the network lifetime in a WSN. This is the first work that utilizes network lifetime in WSN.

Proposed emerged and enhanced routing protocols for wireless networks

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as DS-ZRP routing protocol. The third proposed routing protocol is designed based on using the advantaged of multipoint relays in OSLR protocol with the advantages of route cashing in DSR protocol, and we named it as OLS-DSR routing protocol. Then, some experimental tests are doing by demonstration case studies and the experimental results proved that our proposed routing protocols outperformed than current wireless routing protocols in terms of important network performance metrics such as periodical broadcast, network control overhead, bandwidth overhead, energy consumed and latency.

Enhanced Routing Algorithm Based on Reinforcement Machine Learning-A Case of VoIP Service.

The routing algorithm is one of the main factors that directly impact on network performance. However, conventional routing algorithms do not consider the network data history, for instances, overloaded paths or equipment faults. It is expected that routing algorithms based on machine learning present advantages using that network data. Nevertheless, in a routing algorithm based on reinforcement learning (RL) technique, additional control message headers could be required. In this context, this research presents an enhanced routing protocol based on RL, named e-RLRP, in which the overhead is reduced. Specifically, a dynamic adjustment in the Hello message interval is implemented to compensate the overhead generated by the use of RL. Different network scenarios with variable number of nodes, routes, traffic flows and degree of mobility are implemented, in which network parameters, such as packet loss, delay, throughput and overhead are obtained. Additionally, a Voice-over-IP (VoIP) communication scenario is implemented, in which the E-model algorithm is used to predict the communication quality. For performance comparison, the OLSR, BATMAN and RLRP protocols are used. Experimental results show that the e-RLRP reduces network overhead compared to RLRP, and overcomes in most cases all of these protocols, considering both network parameters and VoIP quality.

A traffic-aware Q-network enhanced routing protocol based on GPSR for unmanned aerial vehicle ad-hoc networks

In dense traffic unmanned aerial vehicle (UAV) ad-hoc networks, traffic congestion can cause increased delay and packet loss, which limit the performance of the networks; therefore, a traffic balancing strategy is required to control the traffic. In this study, we propose TQNGPSR, a traffic-aware Q-network enhanced geographic routing protocol based on greedy perimeter stateless routing (GPSR), for UAV ad-hoc networks. The protocol enforces a traffic balancing strategy using the congestion information of neighbors, and evaluates the quality of a wireless link by the Q-network algorithm, which is a reinforcement learning algorithm. Based on the evaluation of each wireless link, the protocol makes routing decisions in multiple available choices to reduce delay and decrease packet loss. We simulate the performance of TQNGPSR and compare it with AODV, OLSR, GPSR, and QNGPSR. Simulation results show that TQNGPSR obtains higher packet delivery ratios and lower end-to-end delays than GPSR and QNGPSR. In high node density scenarios, it also outperforms AODV and OLSR in terms of the packet delivery ratio, end-to-end delay, and throughput.

A Cloud Based Disaster Management System

The combination of wireless sensor networks (WSNs) and 3D virtual environments opens a new paradigm for their use in natural disaster management applications. It is important to have a realistic virtual environment based on datasets received from WSNs to prepare a backup rescue scenario with an acceptable response time. This paper describes a complete cloud-based system that collects data from wireless sensor nodes deployed in real environments and then builds a 3D environment in near real-time to reflect the incident detected by sensors (fire, gas leaking, etc.). The system’s purpose is to be used as a training environment for a rescue team to develop various rescue plans before they are applied in real emergency situations. The proposed cloud architecture combines 3D data streaming and sensor data collection to build an efficient network infrastructure that meets the strict network latency requirements for 3D mobile disaster applications. As compared to other existing systems, the proposed system is truly complete. First, it collects data from sensor nodes and then transfers it using an enhanced Routing Protocol for Low-Power and Lossy Networks (RLP). A 3D modular visualizer with a dynamic game engine was also developed in the cloud for near-real time 3D rendering. This is an advantage for highly-complex rendering algorithms and less powerful devices. An Extensible Markup Language (XML) atomic action concept was used to inject 3D scene modifications into the game engine without stopping or restarting the engine. Finally, a multi-objective multiple traveling salesman problem (AHP-MTSP) algorithm is proposed to generate an efficient rescue plan by assigning robots and multiple unmanned aerial vehicles to disaster target locations, while minimizing a set of predefined objectives that depend on the situation. The results demonstrate that immediate feedback obtained from the reconstructed 3D environment can help to investigate what–if scenarios, allowing for the preparation of effective rescue plans with an appropriate management effort.

RPL Enhancement for a Parent Selection Mechanism and an Efficient Objective Function

In routing protocol (RPL), a child node exclusively makes the decision in selecting a parent based on the Rank value. In this paper, we make the parent selection mechanism, a mutual decision between the potential parent node and the child node, which significantly improves the network throughput under a heavy and highly dynamic load. To demonstrate the effectiveness of our parent selection mechanism, we used it to balance the load to avoid congestion by preventing the child node from using the congested parent node. The proposed parent selection mechanism is implemented as an add-on feature in RPL and hence is called enhanced RPL (EN-RPL). Furthermore, we introduce a new objective function for efficient routing (OF-ER) that is based on the newly defined composite efficient routing (CER) metric. CER metric takes important metrics, namely, the link quality, queue utilization, lifetime of node, delay, and number of bottleneck nodes, into account for optimal parent selection. The simulation results demonstrate that EN-RPL lowers the packet loss by up to 37% and reduces energy consumption by up to 46.5% compared with the standard RPL. The evaluation results of OF-ER outperform the state-of-the-art load balancing-based OF with respect to the network stability, reliability, and energy efficiency.

Reduced Overhead Routing in Short-Range Low-Power and Lossy Wireless Networks.

In this paper we present enhanced routing protocol for low-lower and lossy networks (ERPL), a reduced overhead routing protocol for short-range low-power and lossy wireless networks, based on RPL. ERPL enhances peer-to-peer (P2P) route construction and data packet forwarding in RPL’s storing and non-storing modes of operation (MoPs). In order to minimize source routing overhead, it encodes routing paths in Bloom Filters (BF). The salient features of ERPL include the following: (i) optimized P2P routing and data forwarding; (ii) no additional control messages; and (iii) minimized source routing overhead. We extensively evaluated ERPL against RPL using emulation, simulation, and physical test-bed based experiments. Our results demonstrate that ERPL outperforms standard RPL in P2P communication and its optimized P2P route construction and data forwarding algorithms also positively impact the protocol’s performance in multi-point to point (MP2P) and point to multi-point (P2MP) communications. Our results demonstrate that the BF-based approach towards compressed source routing information is feasible for the kinds of networks considered in this paper. The BF-based approach results in 65% lower source routing control overhead compared to RPL. Our results also provide new insights into the performance of MP2P, P2MP, and P2P communications relative to RPL’s destination-oriented directed a-cyclic graph (DODAG) depth, i.e., a deeper DODAG negatively impacts the performance of MP2P and P2MP communications, however it positively impacts P2P communication, while the reverse holds true for a relatively shallow DODAG.

LOADng-IoT: An Enhanced Routing Protocol for Internet of Things Applications over Low Power Networks.

The Internet of Things (IoT) is an emerging paradigm that proposes the connection of objects to exchange information in order to reach a common objective. In IoT networks, it is expected that the nodes will exchange data between each other and with external Internet services. However, due to deployment costs, not all the network devices are able to communicate with the Internet directly. Thus, other network nodes should use Internet-connected nodes as a gateway to forward messages to Internet services. Considering the fact that main routing protocols for low-power networks are not able to reach suitable performance in the displayed IoT environment, this work presents an enhancement to the Lightweight On-demand Ad hoc Distance-vector Routing Protocol—Next Generation (LOADng) for IoT scenarios. The proposal, named LOADng-IoT, is based on three improvements that will allow the nodes to find Internet-connected nodes autonomously and dynamically, decreasing the control message overhead required for the route construction, and reducing the loss of data messages directed to the Internet. Based on the performed assessment study, which considered several number of nodes in dense, sparse, and mobility scenarios, the proposed approach is able to present significant results in metrics related to quality-of-service, reliability, and energy efficiency.

A topology-oblivious routing protocol for NDN-VANETs

Vehicular Ad Hoc Networks (VANETs) are characterized by intermittent connectivity, which leads to failures of end-to-end paths between nodes. Named Data Networking (NDN) is a network paradigm that deals with such problems, since information is forwarded based on content and not on the location of the hosts. In this work, we propose an enhanced routing protocol of our previous topology-oblivious Multihop, Multipath, and Multichannel NDN for VANETs (MMM-VNDN) routing strategy that exploits several paths to achieve more efficient content retrieval. Our new enhanced protocol, i mproved MMM-VNDN (iMMM-VNDN), creates paths between a requester node and a provider by broadcasting Interest messages. When a provider responds with a Data message to a broadcast Interest message, we create unicast routes between nodes, by using the MAC address(es) as the distinct address(es) of each node. iMMM-VNDN extracts and thus creates routes based on the MAC addresses from the strategy layer of an NDN node. Simulation results show that our routing strategy performs better than other state of the art strategies in terms of Interest Satisfaction Rate, while keeping the latency and jitter of messages low.

Security Enhanced Routing Protocol based on Cluster Head Multi-hop Communication for WSN

Security Enhanced Routing Protocol based on Cluster Head Multi-hop Communication for WSN