A Hybrid Algorithm for Reliable and Energy-efficient Data Gathering in Wireless Sensor Networks

Reliability and energy efficiency are two important requirements of the data gathering process in wireless sensor networks. Accordingly, we propose a novel data gathering algorithm which meets these requirements. The proposed scheme categorizes the sensed data into valuable and normal data and handles each type of data based on its demands. The main requirement of valuable data is reliability. Thus, the adopted strategy to gather this type of data is to send several copies of data packets toward the sink. The rise of energy exhaustion in this scheme is tolerable. This is due to that, the valuable data is generated at a low rate. On the other hand, our main concern in gathering normal data is energy efficiency. As most of the sensed data is normal, an energy-efficient approach to gather normal data results in considerable energy conserving. Thus, we exploit clustering technique for normal data gathering. We also propose a lightweight intrusion detection system to detect malicious nodes. Simulation results and theoretical analysis confirm that our proposed algorithm provides reliability and energy efficiency at an acceptable level

A RELIABLE ROUTING MECHANISM WITH ENERGY-EFFICIENT NODE SELECTION FOR DATA TRANSMISSION USING A GENETIC ALGORITHM IN WIRELESS SENSOR NETWORK

Energy-efficient and reliable data routing is critical in Wireless Sensor Networks (WSNs) application scenarios. Due to oscillations in wireless links in adverse environmental conditions, sensed data may not be sent to a sink node. As a result of wireless connectivity fluctuations, packet loss may occur. However, retransmission-based approaches are used to improve reliable data delivery. These approaches need a high quantity of data transfers for reliable data collection. Energy usage and packet delivery delays increase as a result of an increase in data transmissions. An energy-efficient data collection approach based on a genetic algorithm has been suggested in this paper to determine the most energy-efficient and reliable data routing in wireless sensor networks. The proposed algorithm reduced the number of data transmissions, energy consumption, and delay in network packet delivery. However, increased network lifetime. Furthermore, simulation results demonstrated the efficacy of the proposed method, considering the parameters energy consumption, network lifetime, number of data transmissions, and average delivery delay

An improved cluster formation process in wireless sensor network to decrease energy consumption

Wireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time. © 2020, The Author(s)