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

Energy-Balanced Routing for Maximizing Network Lifetime in WirelessHART

Author

Listed:
  • Sheng Zhang
  • Ao Yan
  • Tianming Ma

Abstract

WirelessHART is an emerging wireless sensor network protocol. In this paper, a joint graph routing algorithm for maximizing the network lifetime (JRMNL) in WirelessHART is proposed. Node communication load factor is approximately estimated by matrix operations for the first time. Then node communication load, the residual energy, and the link transmission power are integrated as a link cost function that is accurately measured in this algorithm. A node chooses the optimal next hop by comparing the link cost function of all its neighbor nodes, which guarantees the energy balancing of the whole network. Simulation results show that the proposed algorithm can extend network lifetime by a factor of 2 relative to the maximum residual energy selection algorithm and prolong the network lifetime by a factor of 7 relative to the minimum transmission power routing algorithm, but the average energy consumption per route will increase by 2 dBm compared with the minimum transmission power routing algorithm.

Suggested Citation

  • Sheng Zhang & Ao Yan & Tianming Ma, 2013. "Energy-Balanced Routing for Maximizing Network Lifetime in WirelessHART," International Journal of Distributed Sensor Networks, , vol. 9(10), pages 173185-1731, October.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:10:p:173185
    DOI: 10.1155/2013/173185
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/173185
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/173185?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:9:y:2013:i:10:p:173185. 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.