Sensor Network Protocols Research Articles

Energy Aware Competition-Based Unequal Clustering Protocol for Wireless Sensor Networks

Energy Aware Competition-Based Unequal Clustering Protocol for Wireless Sensor Networks

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

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

The Performance of Stable Zones Protocol for Heterogeneous Wireless Sensor Networks

The Performance of Stable Zones Protocol for Heterogeneous 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

Flexible localization protocol for underwater wireless sensor networks using hybrid reward evaluation scheme

Flexible localization protocol for underwater wireless sensor networks using hybrid reward evaluation scheme

Development and Mathematical Formulation of Secured Memory Efficient Cloning Detection Protocol in WSNs using RSA Algorithm

This paper is related to the developing an improvised of secured memory efficient cloning detection protocol in WSNs using RSA Algorithm and is used for efficient transfer of data packets with security. NS2 is used as the simulation tool to simulate the outputs. The main aim or objective of the proposed work presented in this paper is to develop a secured memory efficient cloning detection protocol in the mobile adhoc wireless sensor networks. The simulation results shows the effectivity of the methodology that is being proposed by us.

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

Node Load and Location-Based Clustering Protocol for Underwater Acoustic Sensor Networks

Clustering protocols for underwater acoustic sensor networks (UASNs) have gained widespread attention due to their importance in reducing network complexity. Congestion occurs when the intra-cluster load is greater than the upper limit of the intra-cluster information transmission capacity, which leads to a dramatic deterioration of network performance despite the reduction of network complexity. To avoid congestion, we propose a node load and location-based clustering protocol for UASNs (LLCP). First, a node load and location-based optimization mechanism is proposed. The number of cluster members is optimized based on node load and location to maximize the number of cluster members while avoiding congestion. Then, a node degree and location-based cluster member selection mechanism is proposed to select the optimal cluster members. Finally, a priority-based clustering mechanism is proposed. The node clustering order is adjusted based on the clustering priority to maximize the reduction of network complexity by increasing the average number of cluster members. Simulation results show that our proposed LLCP minimizes the network complexity while avoiding congestion.

Integration of MQTT-SN and CoAP protocol for enhanced data communications and resource management in WSNs

Lightweight communication protocols for wireless sensor networks (WSNs) are unfolding for machine to machine (M2M) communications and thus there is always going to be a possible conflict of interest on which protocol is best suited for any particular application. The two protocols of interest in this study are the message queue telemetry transport protocol for sensor network (MQTT-SN), a variant of message queue telemetry transport (MQTT) protocol and the constrained application protocol (CoAP). There have been studies that reveal that these protocols perform differently based on the underlying network conditions. CoAP experience lower delays than MQTT for higher packet loss and higher delays for lower packet loss. MQTT default communication via a broker is easier to scale compared to CoAP direct request-response paradigm. Although this is a huge advantage over CoAP, it presents the single point-of-failure problem. In this paper we propose an integration of MQTT-CoAP protocol using an abstraction layer that enables both MQTT-SN and CoAP protocol to be used in the same sensor node. Resources are managed by directly modifying sensor node configuration using CoAP protocol. Performance evaluation of these protocols under the integrated scenario shows acceptable levels of latency and energy consumption for internet of thing (IoT) operations.

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.