z-logo
open-access-imgOpen Access
Sector Tree-Based Clustering for Energy Efficient Routing Protocol in Heterogeneous Wireless Sensor Network
Author(s) -
Nguyên Duy Tân,
Vũ Khánh Quý,
Phạm Ngọc Hưng,
Lê Văn Vinh
Publication year - 2021
Publication title -
international journal of computer networks and communications
Language(s) - English
Resource type - Journals
eISSN - 0975-2293
pISSN - 0974-9322
DOI - 10.5121/ijcnc.2021.13504
Subject(s) - computer science , routing protocol , wireless sensor network , computer network , network packet , cluster analysis , efficient energy use , node (physics) , tree (set theory) , base station , routing (electronic design automation) , distributed computing , engineering , mathematical analysis , mathematics , structural engineering , machine learning , electrical engineering
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here