Weighted spanning tree clustering routing algorithm based on LEACH

Zhang, Huazhong; Chen, Peipei; Gong, Shulan

doi:10.1109/icfcc.2010.5497381

Cited by 20 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [ 18 ], Weighted Spanning Tree for LEACH (WST-LEACH) is proposed that is based on a weighted consideration of the remaining energy, distribution density and the distance of nodes from the BS. In a network with N nodes, the algorithm considers variant weights for three following ratios as a coefficient to be applied to T(n): ratio of the residual energy E residual to initial energy E 0 , ratio of the number of neighbours N b in predefined radius R to the average number of nodes in accordance with the probability P r and inverse correlation of the nodes' distances from the BS (d BS ).…”

Section: Cluster Head Selectionmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on the Taxonomy of Cluster-Based Routing Protocols for Homogeneous Wireless Sensor Networks

Naeimi

Ghafghazi

Chow

et al. 2012

Sensors

101

View full text Add to dashboard Cite

The past few years have witnessed increased interest among researchers in cluster-based protocols for homogeneous networks because of their better scalability and higher energy efficiency than other routing protocols. Given the limited capabilities of sensor nodes in terms of energy resources, processing and communication range, the cluster-based protocols should be compatible with these constraints in either the setup state or steady data transmission state. With focus on these constraints, we classify routing protocols according to their objectives and methods towards addressing the shortcomings of clustering process on each stage of cluster head selection, cluster formation, data aggregation and data communication. We summarize the techniques and methods used in these categories, while the weakness and strength of each protocol is pointed out in details. Furthermore, taxonomy of the protocols in each phase is given to provide a deeper understanding of current clustering approaches. Ultimately based on the existing research, a summary of the issues and solutions of the attributes and characteristics of clustering approaches and some open research areas in cluster-based routing protocols that can be further pursued are provided.

show abstract

Section: Cluster Head Selectionmentioning

confidence: 99%

“…The weighted spanning tree is introduced in [ 18 ] as a backbone to relay data. The algorithm improves the formation of the spanning tree from a single-factor distance-based decision to a multi-criteria one.…”

Section: Data Communication Phasementioning

confidence: 99%

A Survey on the Taxonomy of Cluster-Based Routing Protocols for Homogeneous Wireless Sensor Networks

Naeimi

Ghafghazi

Chow

et al. 2012

Sensors

101

View full text Add to dashboard Cite

show abstract

“…Zhang et al [15] presented weighted spanning tree algorithm based on LEACH (WST-LEACH). First, CH selection was not completely random; second, it established a weighted spanning tree through all CH, and the weight value calculation of weighted spanning tree contained factors such as CH remaining energy, surrounding nodes distribution, and distance to other CH.…”

Section: Related Workmentioning

confidence: 99%

An Improved BAT-Optimized Cluster-Based Routing for Wireless Sensor Networks

Seelam

Sailaja

Madhu³

2015

Intelligent Computing and Applications

View full text Add to dashboard Cite

The tiny, battery-powered sensor nodes of the wireless sensor networks (WSNs) sense and send reports to a processing center called sink or base station. The sensor nodes require more energy while gathering information for longer durations. This study proposes a protocol heterogeneous in energy which analyzes basic distributed clustering routing protocol low-energy adaptive clustering hierarchy (LEACH) with BAT optimization algorithm to be used for cluster formation and cluster-head (CH) selection. Pipelining is used for packet scheduling. Simulations show that the energy consumption gets reduced significantly.

show abstract

“…So we need to balance the hop, residual energy, number of child nodes and distance of node to select the best sink node. Referring to (5), (6) of [9] and balancing these four factors we get (1) to calculate the weight of sink nodei.…”

Section: Energy-efficient Self-organization Routing Strategy In Tree mentioning

confidence: 99%

An Energy-Efficient Self-Organization Routing Strategy in Tree Networks

Feng

Zhou

Qiu

2015

Proceedings of the 8th International Conference on Mobile Multimedia Communications

View full text Add to dashboard Cite

This paper proposes a new self-organization and topology dynamic adjustment strategy. Network nodes broadcast packets to select child nodes and non-network nodes collect packets to join in network. During the self-organization process we take hop, residual energy, number of child node and communication distance into account to calculate the weight of available sink nodes, and then select the node with max weight as sink node. After a non-network node joins the network successful it will work as a network node to searching child nodes. A tree network can be constructed one layer by one layer using the new strategy. For balancing energy consumption and prolonging network lifetime we adjust the topology dynamic. All experiments were done with NS2.

show abstract

Weighted spanning tree clustering routing algorithm based on LEACH

Cited by 20 publications

References 5 publications

A Survey on the Taxonomy of Cluster-Based Routing Protocols for Homogeneous Wireless Sensor Networks

A Survey on the Taxonomy of Cluster-Based Routing Protocols for Homogeneous Wireless Sensor Networks

An Improved BAT-Optimized Cluster-Based Routing for Wireless Sensor Networks

An Energy-Efficient Self-Organization Routing Strategy in Tree Networks

Contact Info

Product

Resources

About