A New Energy Efficient Clustering Algorithm Based on Routing Spanning Tree for Wireless Sensor Network

Yating GAO; Guixia KANG; Jianming CHENG; Ningbo ZHANG

doi:10.1587/transcom.2016EBP3487

A New Energy Efficient Clustering Algorithm Based on Routing Spanning Tree for Wireless Sensor Network

Yating GAO, Guixia KANG, Jianming CHENG, Ningbo ZHANG

Full Text Views

0

Share
Cite this

Summary :

Wireless sensor networks usually deploy sensor nodes with limited energy resources in unattended environments so that people have difficulty in replacing or recharging the depleted devices. In order to balance the energy dissipation and prolong the network lifetime, this paper proposes a routing spanning tree-based clustering algorithm (RSTCA) which uses routing spanning tree to analyze clustering. In this study, the proposed scheme consists of three phases: setup phase, cluster head (CH) selection phase and steady phase. In the setup phase, several clusters are formed by adopting the K-means algorithm to balance network load on the basis of geographic location, which solves the randomness problem in traditional distributed clustering algorithm. Meanwhile, a conditional inter-cluster data traffic routing strategy is created to simplify the networks into subsystems. For the CH selection phase, a novel CH selection method, where CH is selected by a probability based on the residual energy of each node and its estimated next-time energy consumption as a function of distance, is formulated for optimizing the energy dissipation among the nodes in the same cluster. In the steady phase, an effective modification that counters the boundary node problem by adjusting the data traffic routing is designed. Additionally, by the simulation, the construction procedure of routing spanning tree (RST) and the effect of the three phases are presented. Finally, a comparison is made between the RSTCA and the current distributed clustering protocols such as LEACH and LEACH-DT. The results show that RSTCA outperforms other protocols in terms of network lifetime, energy dissipation and coverage ratio.

Publication: IEICE TRANSACTIONS on Communications Vol.E100-B No.12 pp.2110-2120

Publication Date: 2017/12/01

Publicized: 2017/05/26

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2016EBP3487

Type of Manuscript: PAPER

Category: Network

Authors

Yating GAO
  Beijing University of Posts and Telecommunications
Guixia KANG
  Beijing University of Posts and Telecommunications
Jianming CHENG
  Beijing University of Posts and Telecommunications
Ningbo ZHANG
  Beijing University of Posts and Telecommunications

Keyword

wireless sensor network, clustering algorithm, routing spanning tree, network lifetime, energy balance

Cite this

Copy

Yating GAO, Guixia KANG, Jianming CHENG, Ningbo ZHANG, "A New Energy Efficient Clustering Algorithm Based on Routing Spanning Tree for Wireless Sensor Network" in IEICE TRANSACTIONS on Communications, vol. E100-B, no. 12, pp. 2110-2120, December 2017, doi: 10.1587/transcom.2016EBP3487.
Abstract: Wireless sensor networks usually deploy sensor nodes with limited energy resources in unattended environments so that people have difficulty in replacing or recharging the depleted devices. In order to balance the energy dissipation and prolong the network lifetime, this paper proposes a routing spanning tree-based clustering algorithm (RSTCA) which uses routing spanning tree to analyze clustering. In this study, the proposed scheme consists of three phases: setup phase, cluster head (CH) selection phase and steady phase. In the setup phase, several clusters are formed by adopting the K-means algorithm to balance network load on the basis of geographic location, which solves the randomness problem in traditional distributed clustering algorithm. Meanwhile, a conditional inter-cluster data traffic routing strategy is created to simplify the networks into subsystems. For the CH selection phase, a novel CH selection method, where CH is selected by a probability based on the residual energy of each node and its estimated next-time energy consumption as a function of distance, is formulated for optimizing the energy dissipation among the nodes in the same cluster. In the steady phase, an effective modification that counters the boundary node problem by adjusting the data traffic routing is designed. Additionally, by the simulation, the construction procedure of routing spanning tree (RST) and the effect of the three phases are presented. Finally, a comparison is made between the RSTCA and the current distributed clustering protocols such as LEACH and LEACH-DT. The results show that RSTCA outperforms other protocols in terms of network lifetime, energy dissipation and coverage ratio.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.2016EBP3487/_p

Copy

@ARTICLE{e100-b_12_2110,
author={Yating GAO, Guixia KANG, Jianming CHENG, Ningbo ZHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A New Energy Efficient Clustering Algorithm Based on Routing Spanning Tree for Wireless Sensor Network},
year={2017},
volume={E100-B},
number={12},
pages={2110-2120},
abstract={Wireless sensor networks usually deploy sensor nodes with limited energy resources in unattended environments so that people have difficulty in replacing or recharging the depleted devices. In order to balance the energy dissipation and prolong the network lifetime, this paper proposes a routing spanning tree-based clustering algorithm (RSTCA) which uses routing spanning tree to analyze clustering. In this study, the proposed scheme consists of three phases: setup phase, cluster head (CH) selection phase and steady phase. In the setup phase, several clusters are formed by adopting the K-means algorithm to balance network load on the basis of geographic location, which solves the randomness problem in traditional distributed clustering algorithm. Meanwhile, a conditional inter-cluster data traffic routing strategy is created to simplify the networks into subsystems. For the CH selection phase, a novel CH selection method, where CH is selected by a probability based on the residual energy of each node and its estimated next-time energy consumption as a function of distance, is formulated for optimizing the energy dissipation among the nodes in the same cluster. In the steady phase, an effective modification that counters the boundary node problem by adjusting the data traffic routing is designed. Additionally, by the simulation, the construction procedure of routing spanning tree (RST) and the effect of the three phases are presented. Finally, a comparison is made between the RSTCA and the current distributed clustering protocols such as LEACH and LEACH-DT. The results show that RSTCA outperforms other protocols in terms of network lifetime, energy dissipation and coverage ratio.},
keywords={},
doi={10.1587/transcom.2016EBP3487},
ISSN={1745-1345},
month={December},}

Copy

TY - JOUR
TI - A New Energy Efficient Clustering Algorithm Based on Routing Spanning Tree for Wireless Sensor Network
T2 - IEICE TRANSACTIONS on Communications
SP - 2110
EP - 2120
AU - Yating GAO
AU - Guixia KANG
AU - Jianming CHENG
AU - Ningbo ZHANG
PY - 2017
DO - 10.1587/transcom.2016EBP3487
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2017
AB - Wireless sensor networks usually deploy sensor nodes with limited energy resources in unattended environments so that people have difficulty in replacing or recharging the depleted devices. In order to balance the energy dissipation and prolong the network lifetime, this paper proposes a routing spanning tree-based clustering algorithm (RSTCA) which uses routing spanning tree to analyze clustering. In this study, the proposed scheme consists of three phases: setup phase, cluster head (CH) selection phase and steady phase. In the setup phase, several clusters are formed by adopting the K-means algorithm to balance network load on the basis of geographic location, which solves the randomness problem in traditional distributed clustering algorithm. Meanwhile, a conditional inter-cluster data traffic routing strategy is created to simplify the networks into subsystems. For the CH selection phase, a novel CH selection method, where CH is selected by a probability based on the residual energy of each node and its estimated next-time energy consumption as a function of distance, is formulated for optimizing the energy dissipation among the nodes in the same cluster. In the steady phase, an effective modification that counters the boundary node problem by adjusting the data traffic routing is designed. Additionally, by the simulation, the construction procedure of routing spanning tree (RST) and the effect of the three phases are presented. Finally, a comparison is made between the RSTCA and the current distributed clustering protocols such as LEACH and LEACH-DT. The results show that RSTCA outperforms other protocols in terms of network lifetime, energy dissipation and coverage ratio.
ER -