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

An Energy-Efficient and Relay Hop Bounded Mobile Data Gathering Algorithm in Wireless Sensor Networks

Author

Listed:
  • Ling Chen
  • Jianxin Wang
  • Xiaoqing Peng
  • Xiaoyan Kui

Abstract

Recent studies reveal that great benefit can be achieved by employing mobile collectors to gather data in wireless sensor networks. Since the mobile collector can traverse the transmission range of each sensor, the energy of nodes may be saved near maximally. However, for directly receiving data packet from every node, the length of mobile collector route should be very long. Hence it may significantly increase the data gathering latency. To solve this problem, several algorithms have been proposed. One of them called BRH-MDG found that data gathering latency can be effectively shortened by performing proper local aggregation via multihop transmissions and then uploading the aggregated data to the mobile collector. But, the BRH-MDG algorithm did not carefully analyze and optimize the energy consumption of the entire network. In this paper, we propose a mathematical model for the energy consumption of the LNs and present a new algorithm called EEBRHM. The simulation results show that under the premise of bounded relay hop, compared with BRH-MDG, EEBRHM can prolong the networks lifetime by 730%.

Suggested Citation

  • Ling Chen & Jianxin Wang & Xiaoqing Peng & Xiaoyan Kui, 2015. "An Energy-Efficient and Relay Hop Bounded Mobile Data Gathering Algorithm in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(5), pages 680301-6803, May.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:5:p:680301
    DOI: 10.1155/2015/680301
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/680301
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/680301?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:11:y:2015:i:5:p:680301. 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.