Dynamic energy balanced max flow routing in energy-harvesting sensor networks
We propose a dynamic energy balanced max flow routing algorithm to maximize load flow within the network lifetime and balance energy consumption to prolong the network lifetime in an energy-harvesting wireless sensor network. The proposed routing algorithm updates the transmission capacity between t...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-11-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147717739815 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547322511228928 |
|---|---|
| author | Bin Cai Shan-Li Mao Xiao-Hui Li Yue-Min Ding |
| author_facet | Bin Cai Shan-Li Mao Xiao-Hui Li Yue-Min Ding |
| author_sort | Bin Cai |
| collection | DOAJ |
| description | We propose a dynamic energy balanced max flow routing algorithm to maximize load flow within the network lifetime and balance energy consumption to prolong the network lifetime in an energy-harvesting wireless sensor network. The proposed routing algorithm updates the transmission capacity between two nodes based on the residual energy of the nodes, which changes over time. Hence, the harvested energy is included in calculation of the maximum flow. Because the flow distribution of the Ford–Fulkerson algorithm is not balanced, the energy consumption among the nodes is not balanced, which limits the lifetime of the network. The proposed routing algorithm selects the node with the maximum residual energy as the next hop and updates the edge capacity when the flow of any edge is not sufficient for the next delivery, to balance energy consumption among nodes and prolong the lifetime of the network. Simulation results revealed that the proposed routing algorithm has advantages over the Ford–Fulkerson algorithm and the dynamic max flow algorithm with respect to extending the load flow and the lifetime of the network in a regular network, a small-world network, and a scale-free network. |
| format | Article |
| id | doaj-art-d2d4dc279371445d95d51df083ff9d80 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2017-11-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-d2d4dc279371445d95d51df083ff9d802025-02-03T06:45:17ZengWileyInternational Journal of Distributed Sensor Networks1550-14772017-11-011310.1177/1550147717739815Dynamic energy balanced max flow routing in energy-harvesting sensor networksBin Cai0Shan-Li Mao1Xiao-Hui Li2Yue-Min Ding3College of Information Science and Engineering, Wuhan University of Science and Technology, Wuhan, ChinaCollege of Information Science and Engineering, Wuhan University of Science and Technology, Wuhan, ChinaCollege of Information Science and Engineering, Wuhan University of Science and Technology, Wuhan, ChinaSchool of Computer Science and Engineering, Tianjin University of Technology, Tianjin, ChinaWe propose a dynamic energy balanced max flow routing algorithm to maximize load flow within the network lifetime and balance energy consumption to prolong the network lifetime in an energy-harvesting wireless sensor network. The proposed routing algorithm updates the transmission capacity between two nodes based on the residual energy of the nodes, which changes over time. Hence, the harvested energy is included in calculation of the maximum flow. Because the flow distribution of the Ford–Fulkerson algorithm is not balanced, the energy consumption among the nodes is not balanced, which limits the lifetime of the network. The proposed routing algorithm selects the node with the maximum residual energy as the next hop and updates the edge capacity when the flow of any edge is not sufficient for the next delivery, to balance energy consumption among nodes and prolong the lifetime of the network. Simulation results revealed that the proposed routing algorithm has advantages over the Ford–Fulkerson algorithm and the dynamic max flow algorithm with respect to extending the load flow and the lifetime of the network in a regular network, a small-world network, and a scale-free network.https://doi.org/10.1177/1550147717739815 |
| spellingShingle | Bin Cai Shan-Li Mao Xiao-Hui Li Yue-Min Ding Dynamic energy balanced max flow routing in energy-harvesting sensor networks International Journal of Distributed Sensor Networks |
| title | Dynamic energy balanced max flow routing in energy-harvesting sensor networks |
| title_full | Dynamic energy balanced max flow routing in energy-harvesting sensor networks |
| title_fullStr | Dynamic energy balanced max flow routing in energy-harvesting sensor networks |
| title_full_unstemmed | Dynamic energy balanced max flow routing in energy-harvesting sensor networks |
| title_short | Dynamic energy balanced max flow routing in energy-harvesting sensor networks |
| title_sort | dynamic energy balanced max flow routing in energy harvesting sensor networks |
| url | https://doi.org/10.1177/1550147717739815 |
| work_keys_str_mv | AT bincai dynamicenergybalancedmaxflowroutinginenergyharvestingsensornetworks AT shanlimao dynamicenergybalancedmaxflowroutinginenergyharvestingsensornetworks AT xiaohuili dynamicenergybalancedmaxflowroutinginenergyharvestingsensornetworks AT yueminding dynamicenergybalancedmaxflowroutinginenergyharvestingsensornetworks |