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

Maximizing the lifetime of wireless sensor networks in trains for monitoring long-distance goods transportation

Author

Listed:
  • Huiting Xu
  • Xi Jin
  • Fanxin Kong
  • Qingxu Deng

Abstract

One key issue in designing battery-powered wireless sensor networks is to properly control the energy consumption of the sensor nodes in order to prolong their operation time (i.e. lifetime ). In this article, we present a real-life application of wireless sensor networks in trains to monitor the goods conditions in a long-distance transportation. We study the wireless sensor network deployment problem in developing a monitoring system with the goal of maximizing the network lifetime under constraints derived from the real application scenario. The key technical problem to solve is to determine the sensor placement and the transmission level for each sensor node, as well as the appropriate number of sensor nodes. We first formulate the problem with a realistic discrete power model as a mixed integer linear programming problem. Then, a two-step efficient deployment heuristic is proposed to satisfy these constraints step by step. The evaluation results indicate that the proposed heuristic performs almost the same as the optimal mixed integer linear programming solution. Moreover, the wireless sensor network with appropriate number of nodes can improve its lifetime up to 10.6% for a train with 80 boxcars. We also discussed a tested experiment in a laboratory environment, as well as the real implementation of the whole monitoring system.

Suggested Citation

  • Huiting Xu & Xi Jin & Fanxin Kong & Qingxu Deng, 2017. "Maximizing the lifetime of wireless sensor networks in trains for monitoring long-distance goods transportation," International Journal of Distributed Sensor Networks, , vol. 13(5), pages 15501477177, May.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:5:p:1550147717707895
    DOI: 10.1177/1550147717707895
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717707895
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717707895?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:5:p:1550147717707895. 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.