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

The mine locomotive wireless network strategy based on successive interference cancellation with dynamic power control

Author

Listed:
  • Lei Shi
  • Yu Gao
  • Zhenchun Wei
  • Xu Ding
  • Yi Shi

Abstract

Mine locomotives are widely used in mining industry for transporting. Usually, these locomotives need to move along the tunnels and communicate with access points which are equipped on the side of these tunnels. It is important to maintain high-quality communication services due to the unsafe underground working environment. In this article, we design the mine locomotive wireless network strategy based on successive interference cancellation with dynamical power control. We first divide the whole schedule time into time segments and build the problem model in each time segment. To maximize throughput for each time segment, we formulate a linear programming problem based on certain features of successive interference cancellation decoding order. However, this problem has lots of constraints which makes it hard to solve in polynomial time. Then, we propose a concept of the maximum successive interference cancellation set to reduce the problem size. Based on this concept, we propose a polynomial complexity algorithm named max-SIC-set algorithm. Simulation results show that our algorithm can increase throughput significantly compared with the algorithm using successive interference cancellation only (no power control) and with the algorithm without using successive interference cancellation and power control.

Suggested Citation

  • Lei Shi & Yu Gao & Zhenchun Wei & Xu Ding & Yi Shi, 2017. "The mine locomotive wireless network strategy based on successive interference cancellation with dynamic power control," International Journal of Distributed Sensor Networks, , vol. 13(5), pages 15501477177, May.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:5:p:1550147717711135
    DOI: 10.1177/1550147717711135
    as

    Download full text from publisher

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

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