Intelligent Water Drop Based Coverage-Connectivity and Lifespan Maximization Protocol for Wireless Sensor Networks

2019 ◽  
Vol 13 (3) ◽  
pp. 261-273
Author(s):  
R. Sharma ◽  
D.K. Lobiyal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Water Drop ◽  
Relay Node ◽  
Residual Energy ◽  
Base Station ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Coverage Ratio ◽  
Area Of Interest

Background: A significant issue of consideration in wireless sensor networks is to reduce the energy utilization while preserving the required coverage and connectivity of an area of interest. We have revised all patents relating to preserving of energy in sensor motes of the wireless sensor networks. Methods: We proposed a novel; Intelligent Water Drop based coverage-connectivity and lifespan protocol which minimizes energy consumption of the network. In this routing protocol, sensors are partitioned into the connected first layer and connected successive layer sets and a scheduling mechanism has been used to activate and deactivate sensors. Multi-hoping is used to transmit packets from sensors to the Base Station and sensor with maximum residual energy has been selected as the next hop. Power wastage has been avoided by removing duplicate information through a common relay node. Results: We have derived the expected number of sensors required to cover an area of interest and our protocol gives a long life to the network. A theorem has been provided to validate the results for different communication ranges of sensors. Conclusion: The protocol has been compared with other protocols and it proved better than other protocols in terms of the lifespan and the coverage ratio of the area. Results approve that our protocol reduces the problem of energy holes and maintains the connectivity of the network.

scholarly journals A lifetime-enhancing cooperative data gathering and relaying algorithm for cluster-based wireless sensor networks

2020 ◽  
Vol 16 (2) ◽  
pp. 155014771990011 ◽  
Author(s):  
G Pius Agbulu ◽  
G Joselin Retna Kumar ◽  
A Vimala Juliet
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Data Gathering ◽  
Relay Node ◽  
Base Station ◽  
Huffman Coding ◽  
Wireless Sensor ◽  
Data Propagation ◽  
Gradient Descent Algorithm

Despite unique energy-saving dispositions of cluster-based routing protocols, clustered wireless sensor networks with static sinks typically have problems of unbalanced energy consumptions, as the cluster head nodes around the sink are typically loaded with traffic from upper levels of clusters. This results in reduced lifetimes of the nodes and deterioration of other crucial performances. Meanwhile, it has been inferred from current literature that dedicated relay cooperation in cluster-based wireless sensor networks guarantees longer lifetime of the nodes and more improved performance. Therefore, to attain further enhanced performance among the current schemes, a lifetime-enhancing cooperative data gathering and relaying algorithm for cluster-based wireless sensor networks is proposed in this article. The proposed lifetime-enhancing cooperative data gathering and relaying algorithm shares the nodes into clusters using a hybrid K-means clustering algorithm that combines K-means clustering and Huffman coding algorithms. It makes full use of dedicated relay cooperative multi-hop communication with network coding mechanisms to achieve reduced data propagation cost from the various cluster sections to the central base station. The relay node selection is framed as a NP-hard problem, with regard to communication distances and residual energy metrics. Furthermore, to resolve the problem, a gradient descent algorithm is proposed. Simulation results endorse the proposed scheme to outperform related schemes in terms of latency, lifetime, and energy consumption and delivery rates.

scholarly journals Hierarchical Agglomerative Clustering Schemes for Energy-Efficiency in Wireless Sensor Networks

2017 ◽  
Vol 18 (2) ◽  
pp. 128-138 ◽  
Author(s):  
Tariq Taleb ◽  
Mejdi Kaddour
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Agglomerative Clustering ◽  
Efficient Communication ◽  
Hierarchical Agglomerative Clustering ◽  
Primary Means ◽  
Topic Clustering

Abstract Extending the lifetime of wireless sensor networks (WSNs) while delivering the expected level of service remains a hot research topic. Clustering has been identified in the literature as one of the primary means to save communication energy. In this paper, we argue that hierarchical agglomerative clustering (HAC) provides a suitable foundation for designing highly energy efficient communication protocols for WSNs. To this end, we study a new mechanism for selecting cluster heads (CHs) based both on the physical location of the sensors and their residual energy. Furthermore, we study different patterns of communications between the CHs and the base station depending on the possible transmission ranges and the ability of the sensors to act as traffic relays. Simulation results show that our proposed clustering and communication schemes outperform well-knows existing approaches by comfortable margins. In particular, networks lifetime is increased by more than 60% compared to LEACH and HEED, and by more than 30% compared to K-means clustering.

scholarly journals A Cluster-Head Rotating Election Routing Protocol for Energy Consumption Optimization in Wireless Sensor Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Cluster Head Election

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.

scholarly journals Minimizing the Energy Hole Problem in Wireless Sensor Networks: A Wedge Merging Approach

Sensors ◽  
2020 ◽  
Vol 20 (1) ◽  
pp. 277 ◽  
Author(s):  
Nusrat Sharmin ◽  
Amit Karmaker ◽  
William Luke Lambert ◽  
Mohammad Shah Alam ◽  
MST Shamim Ara Shawkat
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Research Work ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Selection Scheme ◽  
Energy Hole ◽  
Head Node ◽  
Energy Hole Problem

The Energy hole problem, a common phenomenon in wireless sensor networks, significantly decreases the lifetime of any deployed network. Some of the popular techniques to minimize such problems are using mobile sinks instead of static sinks, extending the transmission range dynamically, and deploying redundant sensor nodes near the base station/sink. The major drawback to these techniques are that energy holes may still be created at some point due to their static nature of deployment, despite having the overall residual energy very high. In this research work, we adopt a new approach by dividing the whole network into equiangular wedges and merging a wedge with its neighboring wedge dynamically whenever individual residual energy of all member nodes of a wedge fall below a threshold value. We also propose an efficient Head Node (HN) selection scheme to reduce the transmission energy needed for forwarding data packets among Head Nodes. Simulation results show that WEMER, our proposed WEdge MERging based scheme, provides significantly higher lifetime and better energy efficiency compared to state-of-the-art Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and contemporary Concentric Clustering Scheme (CCS), and Multilayer Cluster Designing Algorithm (MCDA).

scholarly journals Energy-efficient genetic algorithm variants of PEGASIS for 3D Wireless Sensor Networks

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Aaqil Somauroo ◽  
Vandana Bassoo
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Delay Performance

Due to its boundless potential applications, Wireless Sensor Networks have been subject to much research in the last two decades. WSNs are often deployed in remote environments making replacement of batteries not feasible. Low energy consumption being of prime requisite led to the development of energy-efficient routing protocols. The proposed routing algorithms seek to prolong the lifetime of sensor nodes in the relatively unexplored area of 3D WSNs. The schemes use chain-based routing technique PEGASIS as basis and employ genetic algorithm to build the chain instead of the greedy algorithm. Proposed schemes will incorporate an energy and distance aware CH selection technique to improve load balancing. Clustering of the network is also implemented to reduce number of nodes in a chain and hence reduce delay. Simulation of our proposed protocols is carried out for homogeneous networks considering separately cases for a static base-station inside and outside the network. Results indicate considerable improvement in lifetime over PEGASIS of 817% and 420% for base station inside and outside the network respectively. Residual energy and delay performance are also considered.

Enhanced Auxiliary Cluster Head Selection Routing Algorithm in Wireless Sensor Networks

2019 ◽  
Vol 12 ◽  
Author(s):  
Gaurav Kumar Nigam ◽  
Chetna Dabas
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Cluster Head ◽  
Base Station ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection

Background & Objective: Wireless sensor networks are made up of huge amount of less powered small sensor nodes that can audit the surroundings, collect meaningful data, and send it base station. Various energy management plans that pursue to lengthen the endurance of overall network has been proposed over the years, but energy conservation remains the major challenge as the sensor nodes have finite battery and low computational capabilities. Cluster based routing is the most fitting system to help for burden adjusting, adaptation to internal failure, and solid correspondence to draw out execution parameters of wireless sensor network. Low energy adaptive clustering hierarchy is an efficient clustering based hierarchical protocol that is used to enhance the lifetime of sensor nodes in wireless sensor network. It has some basic flaws that need to be overwhelmed in order to reduce the energy utilization and inflating the nodes lifetime. Methods : In this paper, an effective auxiliary cluster head selection is used to propose a new enhanced GC-LEACH algorithm in order to minimize the energy utilization and prolonged the lifespan of wireless sensor network. Results & Conclusion: Simulation is performed in NS-2 and the outcomes show that the GC-LEACH outperforms conventional LEACH and its existing versions in the context of frequent cluster head rotation in various rounds, number of data packets collected at base station, as well as reduces the energy consumption 14% - 19% and prolongs the system lifetime 8% - 15%.

scholarly journals An area coverage algorithm for wireless sensor networks based on differential evolution

2018 ◽  
Vol 14 (8) ◽  
pp. 155014771879673 ◽  
Author(s):  
Ning-ning Qin ◽  
Jia-le Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Differential Evolution ◽  
High Energy ◽  
Area Coverage ◽  
Wireless Sensor ◽  
Compensation Strategy ◽  
Coverage Ratio ◽  
Area Of Interest ◽  
Binary Differential Evolution

Lifetime requirements and coverage demands are emphasized in wireless sensor networks. An area coverage algorithm based on differential evolution is developed in this study to obtain a given coverage ratio [Formula: see text]. The proposed algorithm maximizes the lifetime of wireless sensor networks to monitor the area of interest. To this end, we translate continuous area coverage into classical discrete point coverage, so that the optimization process can be realized by wireless sensor networks. Based on maintaining the ε-coverage performance, area coverage algorithm based on differential evolution takes the minimal energy as optimization objective. In area coverage algorithm based on differential evolution, binary differential evolution is redeveloped to search for an improved node subset and thus meet the coverage demand. Taking into account that the results of binary differential evolution are depended on the initial value, the resulting individual is not an absolutely perfect node subset. A compensation strategy is provided to avoid unbalanced energy consumption for the obtained node subset by introducing the positive and negative utility ratios. Under the helps of those ratios and compensation strategy, the resulting node subset can be added additional nodes to remedy insufficient coverage, and redundancy active nodes can be pushed into sleep state. Furthermore, balance and residual energy are considered in area coverage algorithm based on differential evolution, which can expand the scope of population exploration and accelerate convergence. Experimental results show that area coverage algorithm based on differential evolution possesses high energy and computation efficiencies and provides 90% network coverage.

scholarly journals Majority Decision Aggregation with Binarized Data in Wireless Sensor Networks

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1671
Author(s):  
Fanpyn Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Contact Tracing ◽  
Redundant Data ◽  
Area Of Interest ◽  
Majority Decision ◽  
Rotation Scheme

Wireless sensor networks (WSNs) are the cornerstone of the current Internet of Things era. They have limited resources and features, a smaller packet size than other types of networks, and dynamic multi-hop transmission. WSNs can monitor a particular area of interest and are used in many different applications. For example, during the COVID-19 pandemic, WSNs have been used to measure social distancing/contact tracing among people. However, the major challenge faced by WSN protocols is limited battery energy. Therefore, the whole WSN area is divided into odd clusters using k-means++ clustering to make a majority rule decision to reduce the amount of additional data sent to the base station (or sink) and achieve node energy-saving efficiency. This study proposes an energy-efficient binarized data aggregation (EEBDA) scheme, by which, through a threshold value, the collected sensing data are asserted with binary values. Subsequently, the corresponding cluster head (CH), according to the Hamming weight and the final majority decision, is calculated and sent to the base station (BS). The EEBDA is based on each cluster and divides the entire WSN area into four quadrants. All CHs construct a data-relay transmission link in the same quadrant; the binary value is transferred from the CHs to the sink. The EEBDA adopts a CH rotation scheme to aggregate the data based on the majority results in the cluster. The simulation results demonstrate that the EEBDA can reduce redundant data transmissions, average the energy consumption of nodes in the cluster, and obtain a better network lifetime when compared to the LEACH, LEACH-C, and DEEC algorithms.

Trust Aware Moth Flame Optimization based Secure Clustering for Wireless Sensor Networks

2019 ◽  
pp. 54-64
Author(s):  
Abdul Rahaman Wahab Sait ◽  
◽  
M. Ilayaraja ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Selection Process ◽  
Fitness Function ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Channel ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Trust Level

Wireless sensor networks (WSN) encompass numerous sensor nodes deployed in the physical environment to sense parameters and transmit to the base station (BS). Since the nodes in WSN communicate via a wireless channel, security remains a significant issue that needs to be resolved. The choice of cluster heads (CHs) is critical to achieving secure data transmission in WSN. In this aspect, this article presents a novel trust-aware mothflame optimization-based secure clustering (TAMFO-SC) technique for WSN. The goal of the TAMFO-SC technique is to determine the trust level of the nodes and determine the secure CHs. The proposed TAMFO-SC technique initially determines the nodes' trust level, and the node with maximum trust factor can be chosen as CHs. In addition, the TAMFO-SC technique derives a fitness function using two parameters, namely residual energy and trust level. The inclusion of trust level in the CH selection process helps to accomplish security in WSN. A comprehensive experimental analysis exhibits the promising performance of the TAMFO-SC technique over the other compared methods.

An energy minimizing score based optimal data gathering in wireless sensor networks

2018 ◽  
Vol 7 (2.31) ◽  
pp. 161
Author(s):  
P Balamurugan ◽  
M Shyamala Devi ◽  
V Sharmila
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Efficient Manner ◽  
High Level ◽  
The Impact

In wireless sensor networks, Sensor nodes are arranged randomly in unkind physical surroundings to collect data and distribute the data to the remote base station. However the sensor nodes have to preserve the power source that has restricted estimation competence. The sensed information is difficult to be transmitted over the sensor network for a long period of time in an energy efficient manner.  In this paper, it finds the problem of communication data between sink nodes and remote data sources via intermediate nodes in sensor field. So this paper proposes a score based data gathering algorithm in wireless sensor networks. The high-level contribution of this study is the enhancement of a score- based data gathering algorithm and the impact of energy entity for Wireless Sensor Networks.  Then the energy and delay of data gathering are evaluated. Unlike PEGASIS and LEACH, the delay for every process of data gathering is considerably lower when SBDG is employed.  The energy consumed per round of data gathering for both SBDG and EE-SBDG is less than half of that incurred with PEGASIS and LEACH. Compared with LEACH and PEGASIS, SBDG and EE-SBDG are fair with node usage because of the scoring system and residual energy respectively.  Overall, the Score-based data gathering algorithm provides a significant solution to maximize the network lifetime as well as minimum delay per round of data gathering.

Sign in / Sign up

Export Citation Format

Share Document