W-LEACH: Weighted Low Energy Adaptive Clustering Hierarchy Aggregation Algorithm for Data Streams in Wireless Sensor Networks

Abdulsalam, Hanady M.; Kamel, Layla K.

doi:10.1109/icdmw.2010.28

Cited by 71 publications

(31 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To solve this problem, W-LEACH requires that sensors in these areas send data with some probability , such that in each round , % sensors are chosen; then if any of these chosen sensors has the value of ≤ thresh , then it does not send data to the CH unless it satisfies a probability , which is an application specific parameter and can be chosen empirically. Details of W-LEACH algorithm can be found in the paper by Abdulsalam and Kamel [1].…”

Section: Weighted Low Energy Adaptive Clustering Hierarchy Aggregatiomentioning

confidence: 99%

“…Weighted Low Energy Adaptive Clustering Hierarchy Aggregation (W-LEACH), is a centralized data aggregation algorithm [1]. As in LEACH, W-LEACH consists of a setup phase and a steady state phase.…”

Section: Weighted Low Energy Adaptive Clustering Hierarchy Aggregatiomentioning

confidence: 99%

“…The algorithm is intricate, so we introduce its explanation in three phases. The first phase presents a new algorithm, namely, Weighted Low Energy Aggregation Clustering Hierarchy (W-LEACH) [1]. W-LEACH directly extends LEACH-C [6] to introduce the concept of weighted sensors that is used to decide which sensors are chosen to be cluster heads and which sensors are chosen to send data at certain rounds.…”

Section: International Journal Of Distributed Sensor Networkmentioning

confidence: 99%

“…There are many data aggregation methods that are proposed in the literature, such as LEACH, DD, FEDA, TAG, OCABTR, CLUDDA, and SUMAC [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15]. Many of the existing aggregation algorithms for WSNs are designed to work with cluster-based routing algorithms [1-7, 10, 13-15], while some others are based on other ways of routing [8,9,11,12] such as direct connection between sensors and the base station.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

W-LEACH Based Dynamic Adaptive Data Aggregation Algorithm for Wireless Sensor Networks

Abdulsalam

Ali

2013

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

We consider the problem of data aggregation for nonuniform and evolving wireless sensor networks. We introduce a new data aggregation algorithm that is able to run on uniform, non-uniform, and evolving networks while maintaining the data accuracy. In addition, the algorithm is able to handle sudden bursts in the underlying data by recording the data in the area of interest for the whole event duration. Experimental results on real and synthetic data show that the algorithm performs well in terms of extending the lifetime of the network, maintaining the original distribution of the sensors as long as possible, maintaining the accuracy of the sensed data, and being able to detect and handle sudden bursts of data.

show abstract

Section: Weighted Low Energy Adaptive Clustering Hierarchy Aggregatiomentioning

confidence: 99%

Section: Weighted Low Energy Adaptive Clustering Hierarchy Aggregatiomentioning

confidence: 99%

Section: International Journal Of Distributed Sensor Networkmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

W-LEACH Based Dynamic Adaptive Data Aggregation Algorithm for Wireless Sensor Networks

Abdulsalam

Ali

2013

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…After a certain time period the network goes back to the set-up phase again. In the literature, various alteration have been made to LEACH protocol, such as two level-LEACH (TL-LEACH) [12], Energy-LEACH (E-LEACH) [13], Weight-LEACH (W-LEACH) [14] etc.…”

Section: Low Energy Adaptive Clustering Hierarchy (Leach)mentioning

confidence: 99%

A Comparative Study of Existing Cluster-Based Routing Protocols in Wireless Sensor Networks

Mishra¹,

Sharma²

2016

IJFGCN

View full text Add to dashboard Cite

show abstract

A new rank‐order clustering algorithm for prolonging the lifetime of wireless sensor networks

Mostafavi

Hakami

2020

Int J Communication

View full text Add to dashboard Cite

Energy efficient resource management is critical for prolonging the lifetime of wireless sensor networks (WSNs). Clustering of sensor nodes with the aim of distributing the traffic loads in the network is a proven approach for balanced energy consumption in WSN. The main body of literature in this topic can be classified as hierarchical and distance-based clustering techniques in which multi-hop, multi-level forwarding, and distance-based criteria are utilized for categorization of sensor nodes. In this study, we propose the approximate rank-order wireless sensor networks (ARO-WSNs) clustering algorithm as a combined hierarchical and distance-based clustering approach. Different from absolute distance, ARO-WSN algorithm utilizes a new rank-order distance measure for agglomerative hierarchical clustering. Specifically, for each sensor node, we generate a ranking order list by sorting all other sensor nodes in the neighborhood by absolute distance. Then, the rank-order distance of two sensor nodes is computed using their ranking orders. The designed algorithm iteratively group all sensor nodes into a small number of sub-clusters. The results show that ARO-WSN outperforms the competitive clustering algorithms in terms of efficiency and precision/recall. The lifetime of the network with the first node death criterion improved relative to LEACH, LEACH-C, LEACH with fuzzy descriptors, and BPA-CRP by 60%, 85%, 22%, and 18%, respectively, and with last node death criterion improved relative to K-means, LEACH, LEACH-C, and LEACH with fuzzy descriptors by 42%, 67%, 64%, and 24%, respectively. KEYWORDSapproximate rank-order, clustering, network lifetime, wireless sensor networks INTRODUCTIONWireless sensor networks (WSNs) have been utilized for a wide range of applications such as environmental monitoring, 1 target tracking, 2 health care monitoring, 3 and crisis management. 4 Sensors networks, as a group of collaborative sensors for a specific application, have made significant changes in the way that people interact with the environment. However, the WSNs face strict limitations in terms of communication bandwidth, battery, and computing power. These inherent constraints in sensor nodes have posed great challenges to the WSNs. Therefore, how to find cost-effective solutions to reduce energy consumption in WSN and efficiently exploit the scare resources in the network remains an important research area.Int J Commun Syst. 2020;33:e4313.wileyonlinelibrary.com/journal/dac

show abstract

W-LEACH: Weighted Low Energy Adaptive Clustering Hierarchy Aggregation Algorithm for Data Streams in Wireless Sensor Networks

Cited by 71 publications

References 16 publications

W-LEACH Based Dynamic Adaptive Data Aggregation Algorithm for Wireless Sensor Networks

W-LEACH Based Dynamic Adaptive Data Aggregation Algorithm for Wireless Sensor Networks

A Comparative Study of Existing Cluster-Based Routing Protocols in Wireless Sensor Networks

A new rank‐order clustering algorithm for prolonging the lifetime of wireless sensor networks

Contact Info

Product

Resources

About