%0 Journal Article %1 noauthororeditor %A Tan, Nguyen Duy %A Quy, Vu Khanh %A Hung, Pham Ngoc %A Vinh, Le Van %D 2021 %J International Journal of Computer Networks & Communications (IJCNC) %K Networks Sensor Wireless aggregation data energy-efficient protocol routing tree-based %N 05 %P 57-74 %R 10.5121/ijcnc.2021.13504 %T Sector Tree-Based Clustering for Energy Efficient Routing Protocol in Heterogeneous Wireless Sensor Network %U https://aircconline.com/ijcnc/V13N5/13521cnc04.pdf %V 13 %X 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.

@article{noauthororeditor, abstract = {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. }, added-at = {2021-10-28T09:03:45.000+0200}, author = {Tan, Nguyen Duy and Quy, Vu Khanh and Hung, Pham Ngoc and Vinh, Le Van}, biburl = {https://www.bibsonomy.org/bibtex/2f3695607e6b3ecdb2e8f1c8a46153ab7/laimbee}, doi = {10.5121/ijcnc.2021.13504}, interhash = {6e89adfd04df94aaa077b5b21833e2d2}, intrahash = {f3695607e6b3ecdb2e8f1c8a46153ab7}, issn = {ISSN 0974 - 9322 (Online); 0975 - 2293 (Print)}, journal = {International Journal of Computer Networks & Communications (IJCNC)}, keywords = {Networks Sensor Wireless aggregation data energy-efficient protocol routing tree-based}, language = {english}, month = {september}, number = 05, pages = {57-74}, timestamp = {2021-10-28T09:03:45.000+0200}, title = {Sector Tree-Based Clustering for Energy Efficient Routing Protocol in Heterogeneous Wireless Sensor Network}, url = {https://aircconline.com/ijcnc/V13N5/13521cnc04.pdf}, volume = 13, year = 2021 }