Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks
In wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundanc...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2021-01-01
|
Series: | Journal of Sensors |
Online Access: | http://dx.doi.org/10.1155/2021/6671978 |
id |
doaj-7114694d264e473691b3177b290abd77 |
---|---|
record_format |
Article |
spelling |
doaj-7114694d264e473691b3177b290abd772021-05-10T00:26:31ZengHindawi LimitedJournal of Sensors1687-72682021-01-01202110.1155/2021/6671978Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor NetworksJin Yong0Zhou Lin1Wei Qian2Bai Ke3Wang Chen4Li Ji-fang5School of Artificial IntelligenceSchool of Artificial IntelligenceSchool of Artificial IntelligenceSchool of Artificial IntelligenceSchool of Artificial IntelligenceNorth China University of Water Resources and Electric PowerIn wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundancy of working node, and construction of cluster head transmission path, which affect network energy consumption, this paper proposes a multihop routing algorithm based on path tree (MHRA-PT) to optimize the network energy. Firstly, some nodes are those close to the base station and have large remaining energy which are selected to construct a cluster head set. Then, after clustering, each cluster is divided into different regions, and in each region, nodes with residual energy greater than the average residual energy of the cluster are selected as a working node. Finally, the cluster heads are sorted according to their distance from base station, and the next hop node is selected for each cluster head in turn until a path tree rooted at base station is formed completely, leading to data transmission from working node to base station. Simulation results show that the proposed algorithm can effectively reduce network energy consumption, balance network resources, and prolong network life cycle.http://dx.doi.org/10.1155/2021/6671978 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jin Yong Zhou Lin Wei Qian Bai Ke Wang Chen Li Ji-fang |
spellingShingle |
Jin Yong Zhou Lin Wei Qian Bai Ke Wang Chen Li Ji-fang Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks Journal of Sensors |
author_facet |
Jin Yong Zhou Lin Wei Qian Bai Ke Wang Chen Li Ji-fang |
author_sort |
Jin Yong |
title |
Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks |
title_short |
Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks |
title_full |
Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks |
title_fullStr |
Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks |
title_full_unstemmed |
Tree-Based Multihop Routing Method for Energy Efficiency of Wireless Sensor Networks |
title_sort |
tree-based multihop routing method for energy efficiency of wireless sensor networks |
publisher |
Hindawi Limited |
series |
Journal of Sensors |
issn |
1687-7268 |
publishDate |
2021-01-01 |
description |
In wireless sensor networks (WSNs), due to the limited energy of sensor nodes, how to design efficient hierarchical routing algorithms to balance network resources and extend network life is an important problem to be solved. Aiming at the problems such as random selection of cluster head, redundancy of working node, and construction of cluster head transmission path, which affect network energy consumption, this paper proposes a multihop routing algorithm based on path tree (MHRA-PT) to optimize the network energy. Firstly, some nodes are those close to the base station and have large remaining energy which are selected to construct a cluster head set. Then, after clustering, each cluster is divided into different regions, and in each region, nodes with residual energy greater than the average residual energy of the cluster are selected as a working node. Finally, the cluster heads are sorted according to their distance from base station, and the next hop node is selected for each cluster head in turn until a path tree rooted at base station is formed completely, leading to data transmission from working node to base station. Simulation results show that the proposed algorithm can effectively reduce network energy consumption, balance network resources, and prolong network life cycle. |
url |
http://dx.doi.org/10.1155/2021/6671978 |
work_keys_str_mv |
AT jinyong treebasedmultihoproutingmethodforenergyefficiencyofwirelesssensornetworks AT zhoulin treebasedmultihoproutingmethodforenergyefficiencyofwirelesssensornetworks AT weiqian treebasedmultihoproutingmethodforenergyefficiencyofwirelesssensornetworks AT baike treebasedmultihoproutingmethodforenergyefficiencyofwirelesssensornetworks AT wangchen treebasedmultihoproutingmethodforenergyefficiencyofwirelesssensornetworks AT lijifang treebasedmultihoproutingmethodforenergyefficiencyofwirelesssensornetworks |
_version_ |
1721453830545080320 |