Routing Protocol For Sensor Networks Research Articles

Achieving Reliability of Privacy-preserving Phantom Routing Protocols in Multi-hop Wireless Sensor Networks

Due to the open nature of wireless channels and sensor node resource constraints, it is challenging to secure the communication in wireless sensor networks (WSNs) while simultaneously protecting the privacy of node location data. Therefore, a significant amount of research focusing on source location privacy (SLP) protocols has been conducted. The amount of research on SLP reliability, meanwhile, is insignificant. This study explores the operational features of various privacy-preserving phantom routing protocols and simulates WSNs with varied network configurations to investigate how different routing strategies affect SLP reliability. Safety period and capture ratio metrics are used to compute SLP reliability. Simulation results show that integration of phantom routing with fake packet distribution mechanisms adversely impacts SLP reliability. SLP reliability decreases also as the number of fake packet sources increases. Research proves that a protocol with many fake packet sources achieves SLP reliability for a mission duration of 940 rounds, while a protocol with no fake packet sources achieves SLP reliability for 1658 rounds.

Threshold-driven K-means sector clustering algorithm for wireless sensor networks

The clustering algorithm is an effective method for developing energy efficiency routing protocol for wireless sensor networks (WSNs). In clustered WSNs, cluster heads must handle high traffic, thus consuming more energy. Therefore, forming balanced clusters and selecting optimal cluster heads are significant challenges. The paper proposes a sector clustering algorithm based on K-means called KMSC. KMSC improves efficiency and balances the cluster size by employing symmetric dividing sectors in conjunction with K-means. For the selection of cluster heads (CHs), KMSC uses the residual energy and distance to calculate the weight of the node, then selects the node with the highest weight as CH. A hybrid single-hop and multi-hop communication is utilized to reduce long-distance transmissions. Furthermore, the impact of the number of sectors, the threshold for clustering, and the network size on the performance of KMSC has been explored. The simulation results show that KMSC outperforms EECPK-means, K-means, TSC, LSC, and SEECP in terms of FND, HND, and LND.

Secure Routing Protocol for Low-Energy Medium and Large Wireless Sensor Networks

Secure Routing Protocol for Low-Energy Medium and Large Wireless Sensor Networks

Metaheuristic optimization‐based clustering with routing protocol in wireless sensor networks

SummaryIn recent years, the use of wireless sensor devices in several applications, for example, monitoring in dangerous geographical spaces and the Internet of Things, has dramatically increased. Though sensor nodes (SNs) have limited power, battery replacement is not feasible in most cases. Therefore, energy saving in wireless sensor networks (WSN) is the major concern in the design of effective transmission protocol. Clustering might lower energy usage and increase network lifetime. Routing protocol for WSN represents an engineering area that has gained considerable interest among researchers due to its rapid evolution and development. Among them, the clustering routing protocol corresponds to the most effective technique to manage the energy consumption of each SN. In this manuscript, we focus on the design of a new metaheuristic optimization‐based energy‐aware clustering with routing protocol for lifetime maximization (MOEACR‐LM) method in WSN. The purpose of the MOEACR‐LM method is to improve network efficiency via proper selection of cluster heads (CHs) and effective data transmission. Initially, a hunter–prey optimization (HPO) method‐based clustering technique is used for cluster construction and the CH selection process. Next, the clouded leopard optimization (CLO) model is used for the route selection process in WSN. The HPO and CLO models derive a fitness function involving multiple parameters for clustering and routing processes. A comprehensive experimental analysis is carried out to demonstrate the enhanced performance of the MOEACR‐LM technique. The overall comparison study pointed out the improved energy efficiency results of the MOEACR‐LM technique over other existing approaches.

Hybrid Boosted Chameleon and modified Honey Badger optimization algorithm-based energy efficient cluster routing protocol for cognitive radio sensor network

Single clustering protocols cannot meet the event-driven and time-triggered traffic requirements of Cognitive Radio Sensor Networks (CRSNs). The long wait between the completion of events and the process of clustering and searching for accessible routes results in increased time for information transmission. This paper proposed a Hybrid Boosted Chameleon and Modified Honey Badge optimization Algorithm-based Energy Efficient cluster routing protocol (HBCMHBOA) for handling the issues of traffic driven information transfer with energy efficiency in the CRSNs. This HBCMHBOA is proposed as one among few event-driven and time-triggered clustering protocol for the requirements of CRSNs. The integration of Boosted Chameleon and Modified Honey Badge optimization Algorithm is adopted for determining optimal number of clusters and constructs the structure of primitive clusters in an automated way to serve the time-triggered traffic in a periodic manner. It adopted priority-based schedule and its associated frame structure for guaranteeing reliable event-driven information delivery. It leveraged the merits of time-triggering for the construction of clustering architecture and confirmed than none of the cluster construction and selection of routes are facilitated after the emergent events. This characteristic helps in permitting only the nodes and their associated Cluster Heads (CHs) of CRSNs to discover emergent events. It facilitates the coverage of a fewer nodes, especially when sink is positioned in a corner to minimize the delay and node energy consumption. The simulation results of the proposed HBCMHBOA confirmed a reduction in total energy consumption and number of covered nodes on an average of 34.12 %, and 26.89 % than the prevailing studies.

Adaptive Location-based Routing Protocols for Dynamic Wireless Sensor Networks in Urban Cyber-physical Systems

This study investigates the development and enhancement of adaptive location-based routing protocols within dynamic wireless sensor networks (WSNs) in urban cyber-physical systems, recommending the implementation of the study’s innovative Urban Adaptive Location-based Routing Protocol (UALRP). This innovative protocol integrates real-time data analytics and adaptive machine learning models into its algorithmic framework to dynamically optimize routing decisions based on continuously changing urban conditions. Through the utilization of data-driven simulation models and machine learning techniques, the research sought to significantly improve the efficiency, reliability, and scalability of urban WSNs. Existing protocols such as Geographic Adaptive Fidelity (GAF), Greedy Perimeter Stateless Routing (GPSR), and Dynamic Source Routing (DSR) were critically assessed under urban settings using extensive datasets detailing New York City's traffic patterns and environmental variables. The analysis demonstrated that while GPSR showed superior performance in terms of latency, throughput, and energy efficiency among the traditional protocols, the introduction of UALRP, with its advanced predictive and adaptive capabilities, can further optimize these metrics. The study affirms the critical role of enhancing location accuracy and the ongoing advancement of machine learning models within urban routing protocols. These insights advocate for the broader implementation of adaptive strategies like UALRP to foster the development of more resilient and efficient urban cyber-physical systems.

A Multilayer Energy-Balanced Opportunistic Routing Protocol for Underwater Optical Wireless Sensor Networks

A Multilayer Energy-Balanced Opportunistic Routing Protocol for Underwater Optical Wireless Sensor Networks

A reliable cluster-based opportunistic routing protocol for underwater wireless sensor networks

Underwater Acoustic Sensor Networks (UASNs) have gained significant popularity and application in various marine engineering exploration scenarios, driven by the global evolution of the ocean ecosystem. However, UASNs face numerous challenges arising from the unique characteristics of the underwater environment and acoustic channels, such as limited energy resources, unreliable communication, and dynamic network topology in uncertain environments, all of which impact the network lifetime and transmission reliability. To address these challenges and enable efficient underwater data packet transmissions, this paper proposes a reliable cluster-based routing method called RCRP. The RCRP organizes sensor nodes into clusters, where cluster heads transmit the fused data to the sink node through multi-hop forwarding. To overcome routing voids caused by node failures during packet transmission, a prediction model based on the Markov chain is introduced to identify void nodes and inform neighboring nodes about the routing holes. Furthermore, a connection prediction mechanism is developed to tackle changes in the uncertain network topology, taking into account node mobility and the received SNR. For packet transmissions, a waiting mechanism inspired by the opportunistic routing (OR) paradigm is proposed, which determines the optimal forwarding route based on the calculated probability of successful connection between nodes. Simulation results demonstrate that RCRP outperforms existing routing protocols in terms of packet delivery ratio, surviving time, and energy consumption, highlighting its effectiveness in enhancing the performance of UASNs.

A Novel Quantum Chimp Optimization with DNA Sequence Based Multihop Secure Routing Protocol for Wireless Sensor Networks

A Novel Quantum Chimp Optimization with DNA Sequence Based Multihop Secure Routing Protocol for Wireless Sensor Networks

Performance evaluation of low energy adaptive clustering hierarchy-based cluster routing protocols in wireless sensor networks using a new graphical user interface

Wireless sensor network (WSN) is widely used for field data acquisition and monitoring in different domains. To make this type of network functional, efficient routing protocols must be implemented. Nevertheless, WSNs have an energy constraint due to limited batteries. Many clustered protocols are proposed to overcome it. However, the implementation of these protocols would be difficult to understand without a simulation tool, as some problems may arise during their development. Testing real-world applications requires a lot of effort and cost because they often use many nodes in large networks. Therefore, the simulation tool is the most relative way to evaluate these protocols. This paper presents graphical-based cluster protocols simulation interface for WSN(GCPS-WSN), a new interface to simulate some clustered protocols in WSNs. GCPS-WSN allows the user to evaluate the performance of certain low energy adaptive clustering hierarchy (LEACH) enhanced protocols to choose the most appropriate one for his system. The user can simulate protocols without any knowledge of software programming.

A Review on Energy and Latency Efficient Routing Protocol Design for Wireless Sensor Networks

Wireless sensor networks (WSNs) have been utilized by various industries, such as disaster management, the chemical and heavy industries, marine research, and space exploration. One of the primary challenges faced by wireless sensor networks is their limited network lifetime. Several techniques have been devised to extend the duration of network operation. This proposed method introduces a threshold-based algorithm to minimize the amount of data that needs to be transferred. In this approach, the selection of cluster heads and their sizes is not fixed. Instead, they are dynamically determined at the beginning of each iteration. The design of routing algorithms for wireless sensor networks faces three main challenges: lowering the rate at which the average node energy declines, minimizing the number of dead nodes, and eventually prolonging the network's lifetime. This paper provides a thorough examination of efficient routing protocols for wireless sensor networks with the goal of improving network longevity. Keywords: Efficient Routing, WSN Clustering, Network Latency, Network Lifetime.

Elliptic curve encryption-based energy-efficient secured ACO routing protocol for wireless sensor networks

Elliptic curve encryption-based energy-efficient secured ACO routing protocol for wireless sensor networks

Design and Development of a Hybrid Cooperative- Based Routing Protocol avoiding the void nodes in WSNs using the Concepts of Minimum Energy Consumption with good Data Security features

This paper presents a novel cooperative-based routing protocol designed for underwater Wireless Sensor Network Cloud Applications (uWSNCA). The protocol aims to minimize energy consumption by avoiding void nodes, which are areas without sensor coverage. The proposed approach consists of two main steps: first, avoiding void nodes using an adaptive hop-by-hop vector method, and second, applying a cooperative rule-based adaptive hop-by-hop vector method to create a hybrid algorithm that is more efficient than existing approaches, such as the watch-dog protocol. The research focuses on developing an energy-efficient distributed cooperative routing protocol for wireless sensor networks, specifically tailored for cooperation-based uWSNCA. This is achieved by preventing data packets from being forwarded through void nodes. The proposed routing protocol utilizes cooperation-based adaptive hop-by-hop vector-based forwarding concepts, where sensor nodes forward data packets in a multi-hop fashion within a virtual pipeline. In the developed algorithm for the underwater WSN cloud application, data packets are forwarded in a multi-hop manner using a virtual pipelining mechanism.Nodes outside the virtual pipeline do not forward data packets, thereby reducing flooding in the cooperative WSN. To prevent data packets from being forwarded towards void areas in the WSN, 2-hop information is used at each hop. This approach improves the performance of the wireless sensor network in terms of various performance criteria compared to existing routing protocols. The simulation tool NS2 is used to observe the simulation results of the energy packets being transferred from the source to the sink. The simulation results demonstrate the effectiveness of the proposed methodology. Overall, this paper contributes to the field of underwater WSNs by introducing a novel routing protocol that improves energy efficiency and performance for cloud applications.

Fuzzy logic with honey badger algorithm for cluster‐based multi‐hop routing protocol for wireless sensor networks

SummaryIn the last decades, wireless sensor networks (WSNs) have appeared as an active research area owing to their high applicability in different application areas like healthcare, automation, and the military. Several issues have been encountered in the WSNs, including energy consumption, deployment of sensor nodes, routing algorithms, energy efficiency, cluster head (CH) selection, and robustness. Cluster‐based routing is one of the energy‐efficient solutions in the WSN. At the same time, the hot spot problem remains a challenging problem, which needs to be addressed in the design of energy‐efficient solutions for WSNs. Motivated by the abovementioned discussion, c The comprehensive comparison study pointed out the betterment of the FLHBA‐CMHR technique in terms of different measures. The FLHBA‐CMHR technique obtains a maximum half‐node die (HND) of 1629 nodes, while the LEACH, FUCA, URBD, DEFL, and E‐FUCA techniques attain decreased HND of 793, 1085, 1092, 1139, and 1344 nodes correspondingly.

An Efficient Framework for Localization Based Optimized Opportunistic Routing Protocol in Underwater Acoustic Sensor Networks

An Efficient Framework for Localization Based Optimized Opportunistic Routing Protocol in Underwater Acoustic Sensor Networks

Enhanced reliability in hazardous event detection: A resilient multipath routing protocol for wireless sensor networks

AbstractWith the advance of climate change and the local effects of human activity, it has become of utmost importance to sense spatially extended natural and artificial physical phenomena to predict, monitor, and mitigate hazardous events. Wireless sensor networks are suitable for observing such phenomena, for example, wildfires, floods or landslides, without human supervision. This is due to affordable devices, independent power sources, wireless communication, and a broad range of sensors. During normal operation a few, while during the occurrence of an event a multitude of devices can fail. This leads to further disconnected devices, degrading the network's sensing capabilities. The communication requirements of such applications are difficult to fulfil with general routing protocols. The monitored event is rare compared to the network's lifetime, while its occurrence results in multiple, gradual node failures, still demanding the network to perform reliably. Available routing protocols fail to address every aspect of such application, thus the authors propose the Reliable Resilient Multipath Routing Protocol, designed to construct multiple disjoint paths from each device to a distinguished one, called the sink. The protocol employs proactive and reactive network management techniques to increase connection redundancy and maintain connectivity during failures. To verify the proposed protocol end‐to‐end, we evaluated the supported parameters, performed comparative simulations with routing algorithms known from the literature, and provided estimates of a realistic deployment.

A Taxonomy and Survey on Grid-Based Routing Protocols Designed for Wireless Sensor Networks

Minimization of energy consumption is the main attention of researchers while developing a routing protocol for wireless sensor networks, as sensor nodes are equipped with limited power supply. Virtual topology is an integral part of routing, and grid-based routing protocols are quite popular due to their simplified and efficient virtual grid topology construction. Although a list of surveys exists that either focus on routing protocols in a broader way or on other virtual topologies, none of these surveys are concerned about grid topology and grid-based routing protocols. Having this motivation in mind and considering the impact of these routing protocols on controlling and managing the energy consumption of wireless sensor networks, this article provides an expansive assessment of grid-based routing protocols based on their methodology. In this survey, the existing grid-based routing protocols are classified into two categories from the perspective of sink mobility: static sink and mobile sink. A phase-wise comprehensive overview of these routing protocols is provided in chronological order, along with their comparative analysis. Furthermore, the characteristics, design issues, and challenges of grid-based routing protocols are also provided.

EVRP: A novel geometrical based energy efficient eye vision routing protocol for wireless sensor networks based on the k-means algorithm

The limited energy source used in wireless sensor networks (WSNs) is a crucial aspect when designing a routing protocol. Developing a routing protocol that tries to maximize energy utilization can significantly improve the system's lifetime and balance energy consumption. A novel geometrical-based energy-efficient routing protocol called "EVRP" is presented in this paper. The Cluster generation process is based on the k-means algorithm for nodes grouping. To choose a cluster head (CH) for each cluster, a cost function is calculated for each node considering factors such as remaining energy level for the node, and the mean distance between the node and its neighbors. In the inter-cluster routing phase, a novel geometrical-based routing protocol is introduced considering factors such as the distance to a base station (BS), remaining energy level, and distance between CHs to find the optimal path between BS and CH. The cluster structure is integrated with direct communication in addition to a dynamic clustering mechanism based on the optimum number of CHs and a load balancing mechanism to reduce the load on CHs near BS. The simulation results demonstrate that in different scenarios, the proposed protocol can significantly increase the network lifetime, network throughput, and network stability by 52 %, 45 %, and 30 % respectively compared with the EECRAIFA protocol and by 100 %, 97.6 %, 64.3 % respectively compared with D2CRP protocol.

A novel energy-efficient dynamic programming routing protocol in wireless multimedia sensor networks

Wireless multimedia sensor networks (WMSNs) have characteristics that may influence the routing decisions, such as limited energy resources, storage and computing capacity. Therefore, a routing optimization needs to be done to match the characteristics of the WMSNs. Existing routing protocols only consider energy efficiency regardless of energy threshold, maximum energy, and link cost collectively as the primary basis of routing. In this work, the energy-efficient dynamic programming (EEDP) protocol is proposed to optimize routing decisions that take into account the energy threshold, the maximum energy, and the link cost. Then, the protocol is compared with the dynamic programming (DP), and the ant colony optimization (ACO) protocol. The simulation results show that the EEDP protocol can improve energy efficiency of nodes and network lifetime of the WMSNs. Then, the EEDP protocol is also implemented into a network topology of 10 NodeMCU ESP32 devices. As a result, the EEDP protocol can work very well by selecting routes based on nodes that have the remaining energy above 50 and has the shortest distance. The average delay in sending data for the entire route for the 10 iterations of sending data is 3.99 seconds.

Multi-hop clustering routing protocol design based on simultaneous wireless information and power transfer technology and imperfect spectrum sensing for EH-CRSNs

Existing clustering routing protocols for multi-hop energy harvesting-cognitive radio sensor networks (EH-CRSNs) generally assume perfect spectrum sensing, which is not aligned with the practical spectrum sensing capabilities of nodes in real networks. Additionally, the severe imbalance in residual energy among cluster heads (CHs) negatively affects the successful data delivery. To resolve these problems, this paper introduces a simultaneous wireless information and power transfer (SWIPT)- and imperfect spectrum sensing-based multi-hop clustering routing protocol (ES-ISSMCRP). ES-ISSMCRP makes full use of downlink EH and intra-cluster SWIPT technologies to replenish and equalize the remaining energy among nodes, further extending network lifespan while maintaining network surveillance capabilities. Specifically, to reduce the adverse impact of imperfect spectrum sensing on network performance and improve energy utilization, this paper proposes an EH-based energy level function and associated selection criteria for CHs and relays, facilitating distributed cluster formation and multi-hop routing selection between clusters. To equalize the residual energy among nodes within a cluster, ES-ISSMCRP protocol enables cluster members (CMs) to decide whether employ SWIPT technology with a power splitting (PS) receiver architecture to transmit energy to their CH while sending data. The actual energy value transmitted by CMs using SWIPT technology is deduced by calculating the PS ratio and the expected energy expenditure of nodes for data transmission. Simulation results show that ES-ISSMCRP protocol offers significant improvements over other comparative protocols in terms of extending network lifespan and enhancing network surveillance capabilities.