Sensor Network Protocols Research Articles

Void Avoiding Opportunistic Routing Protocols for Underwater Wireless Sensor Networks: A Survey.

One of the most challenging issues in the routing protocols for underwater wireless sensor networks (UWSNs) is the occurrence of void areas (communication void). That is, when void areas are present, the data packets could be trapped in a sensor node and cannot be sent further to reach the sink(s) due to the features of the UWSNs environment and/or the configuration of the network itself. Opportunistic routing (OR) is an innovative prototype in routing for UWSNs. In routing protocols employing the OR technique, the most suitable sensor node according to the criteria adopted by the protocol rules will be elected as a next-hop forwarder node to forward the data packets first. This routing method takes advantage of the broadcast nature of wireless sensor networks. OR has made a noticeable improvement in the sensor networks' performance in terms of efficiency, throughput, and reliability. Several routing protocols that utilize OR in UWSNs have been proposed to extend the lifetime of the network and maintain its connectivity by addressing void areas. In addition, a number of survey papers were presented in routing protocols with different points of approach. Our paper focuses on reviewing void avoiding OR protocols. In this paper, we briefly present the basic concept of OR and its building blocks. We also indicate the concept of the void area and list the reasons that could lead to its occurrence, as well as reviewing the state-of-the-art OR protocols proposed for this challenging area and presenting their strengths and weaknesses.

Novel reliable and dynamic energy-aware routing protocol for large scale wireless sensor networks

<p>Wireless sensor networks (WSN) are made up of an important number of sensors, called nodes, distributed in random way in a concerned monitoring area. All sensor nodes in the network are mounted with limited energy sources, which makes energy harvesting on top of the list of issues in WSN. A poor communication architecture can result in excessive consumption, reducing the network lifetime and throughput. Centralizing data collection and the introduction of gateways (GTs), to help cluster heads (CHs), improved WSN life time significantly. However, in vast regions, misplacement and poor distribution of GTs wastes a huge amount of energy and decreases network’s performances. In this work, we describe a reliable and dynamic with energy-awareness routing (RDEAR) protocol that provides a new GT’s election approach taking into consideration CHs density, transmission distance and energy. Applied on 20 different networks, RDEAR reduced the overall energy consumption, increased stability zone and network life time as well as other compared metrics. Our proposed approach increased network’s throughput up to 75.92% , 67.7% and 9.78% compared to the low energy adaptive clustering hierarchy (LEACH), distributed energy efficient clustering (DEEC) and static multihop routing (SMR), protocols, respectively.</p>

Correction to: Trust-based energy-aware routing using GEOSR protocol for Ad-Hoc sensor networks

Correction to: Trust-based energy-aware routing using GEOSR protocol for Ad-Hoc sensor networks

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.

SAPWSN: A Secure Authentication Protocol for Wireless Sensor Networks

With the advancement of RFID systems, there is a need for secure RFID authentication that can provide security against a variety of attacks, so designing a perfectly safe protocol has become a security challenge. The most remarkable security challenges may be information leakage, traceability, and tag impersonation. Several researchers have attempted to address this security demand by proposing ultra-lightweight solutions that use only very low-cost operations such as bit-wise operations. However, approximately all of the presented previous ultra-lightweight authentication schemes are vulnerable to a variety of attacks. For this purpose, Chiou and Chang recently proposed an EPC Class 1 Gen-2-based RFID authentication protocol and claimed it is resistant against replay attacks and also other known active and passive attacks. They also stated that their proposed protocol does not require features such as a secure channel, time parameters, or virtual IDs. In this paper, we will investigate the security of the Chiou and Chang authentication scheme and demonstrate that it is completely insecure. Specifically, we will present the security faults of this scheme. In addition, we will present an enhanced protocol called SAPWSN. The proposed protocol presents precise authentication and highly secure transfers. We demonstrate the proposed protocol’s security in the formal and informal methods. In the formal method, we use the Compromise version of Scyther tool.

Hybrid time synchronization protocol for large-scale wireless sensor networks

There are two common approaches to design a time synchronization protocol as reference-based and consensus-based. The first approach is mainly employed in protocols operating in large-scale wireless sensor networks (WSNs) because of its fast convergence. However, reference-based time synchronization protocols are vulnerable to node-failure in real-world applications. Although consensus-based time synchronization protocols do not experience the aforementioned problem, they are not suitable for operation in large-scale WSNs owing to their slow convergence. In this study, we propose a hybrid time synchronization protocol (HTSP) to utilize the advantages of both approaches. In particular, HTSP exploits a temporary reference node to significantly reduce the convergence time and employs average-based consensus during normal operation to cope with node failures. It is notable that each node in HTSP can seamlessly switch between the reference and consensus modes during its operation. Moreover, HTSP is a fully distributed protocol as it does not rely on any leader-election mechanism. Our simulation results demonstrated that HTSP outperforms flooding, gradient, and virtual link-based time synchronization protocols considering various types of network topologies and scales.

Quality of Service-Based Cross-Layer Protocol for Wireless Sensor Networks

Sensor nodes in wireless sensor networks (WSN) are used for perceiving, monitoring, and controlling a wide range of applications. Owing to the small size of sensor nodes and limited power sources, energy saving is critical for ensuring network longevity. Protocols in different layers consume energy for their function. It is possible to significantly reduce energy usage by including energy-efficiency measures in the protocol design. Most protocols in the literature focus on the energy efficiency in individual layers. Recent studies have shown that cross-layer designs are more energy efficient than individual layer designs. Therefore, this study presents a cross-layer protocol design that combines network and data link layers to minimize energy consumption. This article proposes a novel "Quality of Service Based Cross-layer (QSCL) Protocol" by combining the IEEE 802.15.4-based MAC protocol and the LEACH-based routing protocol. The dynamic duty cycle of the IEEE 802.15.4 protocol was modified based on the amount of data present in the node, which minimized the energy consumption of the data-transfer mechanism. The cluster head (CH) selection of the LEACH-based protocol was modified to consider the average residual energy (RE) of the nodes and their distance from the sink. This helps preserve the energy in the CH, thereby extending the network lifetime. Simulation studies demonstrated that the proposed QSCL outperformed the existing protocols by prolonging the network lifetime.

An Improved Routing Protocol for Heterogeneous Wireless Sensor Networks

An Improved Routing Protocol for Heterogeneous Wireless Sensor Networks

Energy Efficient Routing and Dynamic Cluster Head Selection Using Enhanced Optimization Algorithms for Wireless Sensor Networks

A large number of spatially dispersed nodes on the wireless network create Wireless Sensor Networks (WSNs) to collect and analyze the physical data from the environment. The issues that affected the network and had an impact on network energy consumption were cluster head random selection, working node redundancy, and cluster head transmission path construction. Consequently, this energy constraint also has an impact on the network lifetime and energy-efficient routing. Therefore, the primary goals of this research are to decrease energy consumption and lengthen the network’s lifespan. So, using improved optimization algorithms, this paper presents a dynamic cluster head-based energy-efficient routing system. The Improved Coyote Optimization Algorithm (ICOA), in this case, consists of three phases setup, transmission, and measurement phase. The Improved Jaya Optimization Algorithm with Levy Flight (IJO-LF) then determines the route between the BS and the CH. It selects the most effective course based on the distance, node degree, and remaining energy. The proposed approach is compared with traditional methods and the routing protocols Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and Threshold sensitive Energy Efficient Sensor Network protocol (TEEN) during implementation on the MATLAB platform. Performance indicators for the suggested methodology are evaluated based on data packets collected by the BS, energy usage, alive nodes, and dead nodes. The outputs of the suggested methodology performed better than the conventional plans.

Design of secured blockchain based decentralized authentication protocol for sensor networks with auditing and accountability

The traditional system designed by incorporating the Wireless Sensor Network (WSN) suffers from important issues such as centralization of information, single source of trust, and fails to provide a trusted data-auditing solution due to the involvement of Third Party Auditor (TPA). This article proposes a novel solution by leveraging the concept of blockchain and Distributed Data Storage Service (DDSS) system to mitigate the issues mentioned above. In our model, the sensor nodes are accountable for their activity because the blockchain permanently records the logs of sensor nodes. The proposed solution provides the decentralized authentication of sensor nodes and the information stored in the fully distributed system. Furthermore, a decentralized data-auditing scheme without involving the TPA is also suggested, which finally benefits the user in terms of bandwidth and money. The formal verification of the proposed protocol is done using the Scyther simulator tool, which indicates that the protocol is safe and can protect against the relevant attacks with 100% accuracy. We have estimated the proposed scheme’s time complexity and computational efficiencies and compared them with the existing one. The computation and communication overhead of the proposed method is reduced by 22.143% and 12.5% compared with the Khalid et al. (2020) scheme. Lastly, the ethereum platform simulates our solution, confirming that less than USD 2 is required to execute the proposed solution.

Energy Efficient Routing Protocol for wireless sensor network with Mobile Sink

Energy Efficient Routing Protocol for wireless sensor network with Mobile Sink

Multispectral image analysis for monitoring by IoT based wireless communication using secure locations protocol and classification by deep learning techniques

Land surface data is one of the entry points for a enormous resource management and human activity such as to monitor farming, ecology, urban management, and territories. This research aimed to improve the performance of the multispectral image processing technique using a novel deep learning based classification approaches used in classifying the surfaces in multispectral satellite images. The monitoring of Internet of Things (IoT) based wireless communication using secure locations sensor network protocol (SLSNP). The multispectral satellite images are collected based on developing and developed countries. Upon the collection of multispectral image data using deep convolution neural network (DCNN) deep learning system landmarks of the multispectral images are estimated. This will be effective for the identification of resources in a particular location. The simulation results show classification accuracy, precision, recall and the network lifetime, efficiency, throughput based on data transmission from satellite for secure location based wireless sensor networks (WSNs).

An improved high performance clustering based routing protocol for wireless sensor networks in IoT

An improved high performance clustering based routing protocol for wireless sensor networks in IoT

Low-Delay and Energy-Efficient Opportunistic Routing for Maritime Search and Rescue Wireless Sensor Networks

After the occurrence of a maritime disaster, to save human life and search for important property equipment in the first time, it is indispensable to efficiently transmit search and rescue sea area data to the maritime search and rescue command center (MSRCC) in real-time, so that the MSRCC can make timely and accurate decisions. The key to determining the efficiency of data forwarding is the quality of the routing protocol. Due to the high dynamics of the marine environment and the limited energy of the marine node, the coverage hole and routing path failure problems occur frequently when using the existing routing algorithm for marine data forwarding. Based on the above background, in this work, we study a low-latency and energy-efficient opportunistic routing protocol for maritime search and rescue wireless sensor networks (MSR-WSNs). Considering the adverse impact of wave shadowing on signal transmission, an effective link reliability prediction method is first investigated to quantify the link connectivity among nodes. To mitigate the end-to-end time delay, an optimal expected packet advancement is then derived by combining link con-nectivity with geographic progress threshold θ. After that, based on the link connectivity between marine nodes, the optimal expected packet advancement prediction, the distance from the sensing nodes to the sink, and the remaining energy distribution of the nodes, the priority of candidate nodes is calculated and sorted in descending order. Finally, timer-based coordination algorithm is adopted to perform the marine data packet forwarding so as to avoid packet conflict. Computer simulation results demonstrate that compared with benchmark algorithms, the data packet delivery ratio, the delay performance and the average node energy consumption (the average node speed is 20 m/s) of the proposed opportunistic routing protocol are improved by more than 21.4%, 39.2% and 18.1%, respectively.

A self-organized priority-based MAC protocol in wireless sensor networks based on SDR-RHSO optimal relay node selection and HL-ANN wake-up scheduling

A self-organized priority-based MAC protocol in wireless sensor networks based on SDR-RHSO optimal relay node selection and HL-ANN wake-up scheduling

A Low-Delay Routing-Integrated MAC Protocol for Wireless Sensor Networks

In this article, we propose a low-delay routing-integrated MAC (LDRI-MAC) protocol for wireless sensor networks (WSNs). In the LDRI-MAC protocol, we first assign a parameter termed as grade to each node. The grade of a node represents the minimum hop distance between the node and the sink. Then, we partition each node’s possible senders into disjoint sets (DSs) of size <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula> . We allow all <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula> nodes of a DS for data transmission in a cycle if a node of the DS succeeds in channel contention in the cycle. Thus, we allow <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\alpha -1$ </tex-math></inline-formula> nodes for data transmission even when they failed in channel contention in the same cycle. In this way, we reduce the channel access competition and the energy consumption in control overhead, overhearing, and idle listening. For performance evaluation, we develop a discrete-time Markov-chain (DTMC) model and drive closed-form expressions for packet delivery ratio (PDR), event-reporting delay <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(D)$ </tex-math></inline-formula> , and average energy consumption of a sensor node per received data packet at the sink (AEC). We also develop an algorithm to determine the value of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula> that minimizes <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$D$ </tex-math></inline-formula> . The results show that LDRI-MAC provides higher PDR, lower <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$D$ </tex-math></inline-formula> , and greater energy efficiency, than H-MAC and JRAM protocols, in a multihop WSN.

Performance Analysis and Evaluation of a Multi-Hop Routing Protocol for Wireless Multimedia Sensor Networks

Researchers in wireless multimedia sensor networks (WMSNs) are constantly interested in designing and developing energy-efficient routing protocols. Numerous clustering routing protocols have been developed in recent years to overcome the limitation of consuming less energy and prolong the lifetime of sensor nodes in homogeneous and heterogeneous WMSNs. Existing approaches depend on single-hope communication, in which sensor nodes consume more energy and die faster. Inter-communication nodes can play an important role in reducing energy by transmitting data in a multi-hope fashion to the sink. An energy-efficient multi-path clustering with load balancing routing protocol for wireless multimedia sensor networks (EEMCL) is proposed in this study. In this protocol, the main cluster heads (MCHs) are preselected in each network cluster and filled with more energy than normal sensor nodes. The two secondary cluster heads (SCHs) with the highest energy nodes will be selected by the main cluster head algorithm. Moreover, inter-cluster multi-hop routing with the help of MCHs can enhance the network lifetime when the sink is located at the corner of the sensing field. The simulation results verify that the proposed multi-hop technique provides better performance than existing LEACH, LEACH-C, SEEN, and IEE-LEACH routing protocols in scenario 1 and when compared with CPMA in scenario 2. The last node dead (LND) for the proposed protocol is at round 5721, 2225 for LEACH, 2300 for LEACH-C, 2900 for SEEN, and 3160 for IEE−LEACH in scenario 1, while in scenario 2, the LND for the proposed protocol is at round 3820 and 435 for the CPMA routing protocol.

A Q-Learning-based distributed routing protocol for frequency-switchable magnetic induction-based wireless underground sensor networks

Magnetic Induction (MI) based Wireless underground sensor networks (WUSNs) consist of magnetic-antenna sensors that are buried in and communicate through soil, considered as part of full-coverage 6G wireless system. The wireless channel in MI-WUSNs appears a considerable frequency-selective property due to those conductivity objects in underground environment. This results in that a single frequency is almost impossible to ensure that all sensors in MI-WUSNs are both connected. To this end, the frequency-switch strategy is introduced into MI-WUSNs to cope with its frequency-selective property and ensure network connectivity, forming frequency-switchable MI-WUSNs. In this paper, the distributed routing protocol for frequency-switchable MI-WUSNs is studied to contribute to the network design of underground wireless systems. To be specific, we first map the frequency-switchable MI-WUSN to a multi-layer network and give a description about its routing decision in the Q-Learning framework. Then, we discuss several special designs in system implementation for the proposed routing protocol. In addition, simulation experiments are also considered to verify the convergence and effectiveness of our routing protocol.

IoT Actuator Networks Based on Inverse Directed Diffusion

Abstract An IoT system comprises servers or a cloud at the center,30000 possibly surrounded by edge cloudlets and fog computing devices, a group of sensors on one side, and a group of actuators on the other side if the purpose of the system is not only data analysis but also automated control. Actuators are connected to the central servers or a cloud via an actuator network. Due to progress in smart robotics and related technologies, actuator networks are now getting large, wide, and complex, and should be decentralized and self-organizing as well as sensor networks are. However, as far as we know, there have been no noticeable researches on actuator networks yet. In this paper, we propose a new routing protocol for actuator networks based on an inverse of Directed Diffusion, which is one of the most well-known protocols for sensor networks. Our protocol aims at realizing efficient dissemination and delivery of signals, commands, and data for control, and exhibits good results in simulation-based experiments regarding network traffic reduction. Keywords: Internet of Things, Actuator networks, Directed Diffusion.

New Lattice-Based Broadcast Authentication Protocol for Wireless Sensor Networks

At present, wireless sensor networks have become one of the indispensable infrastructures in people’s lives. Considering the frequent mobility of wireless sensor network nodes, an efficient lattice-based random broadcast authentication protocol is proposed. The security of the proposed protocol is based on the SIS problem which helps to resist against quantum attacks. In this paper, we propose two forms of broadcast authentication, that is, one-to-many broadcast authentication and one-to-one broadcast authentication. The proposed protocol satisfies the broadcast authentication property. Moreover, the resistance against man in the middle attack, antireplay attack, unforgeability, and scalability properties are achieved. Moreover, its efficiency has certain advantages with other lattice-based studies.