IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i11p1550147717739815.html
   My bibliography  Save this article

Dynamic energy balanced max flow routing in energy-harvesting sensor networks

Author

Listed:
  • Bin Cai
  • Shan-Li Mao
  • Xiao-Hui Li
  • Yue-Min Ding

Abstract

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.

Suggested Citation

  • Bin Cai & Shan-Li Mao & Xiao-Hui Li & Yue-Min Ding, 2017. "Dynamic energy balanced max flow routing in energy-harvesting sensor networks," International Journal of Distributed Sensor Networks, , vol. 13(11), pages 15501477177, November.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717739815
    DOI: 10.1177/1550147717739815
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717739815
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147717739815?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717739815. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.