IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v64y2017i1d10.1007_s11235-016-0153-7.html
   My bibliography  Save this article

Downlink resource allocation for on-demand multimedia services in high-speed railway communication systems

Author

Listed:
  • Yan Lei

    (Beijing Jiaotong University)

Abstract

With the rapid development of high-speed railway (HSR) system, there is an increasing demand on providing high throughput and continuous multimedia (CM) services for HSR passengers. In this paper, we investigate the downlink resource allocation problem for on-demand CM services in HSR OFDMA systems with a cellular/infostation integrated network architecture. Considering both the integrity and continuity of service transmission, the resource allocation problem is formulated as a two-stage optimization programming. The aim of this study is to maximize the total reward of delivered services then to minimize the weighted total number of cumulative discontinuity packets over the trip of the train. To resolve the difficulty of multi-stage optimization, an equivalent one-stage programming is proposed. Since the resultant mixed integer programming is NP-hard in general, we reformulate it as a sparse $$\ell _{0}$$ ℓ 0 -minimization problem and then relax it to a linear programming. Furthermore, a reweighted $$\ell _1$$ ℓ 1 -minimization technique is applied to improve the system performance. Guided by the proposed optimization approaches, we next develop two efficient online resource allocation algorithms for practical systems,where a-priori knowledge of future service arrivals and channel gains is not available. Finally, simulation results are provided to validate the feasibility and effectiveness of the proposed algorithms.

Suggested Citation

  • Yan Lei, 2017. "Downlink resource allocation for on-demand multimedia services in high-speed railway communication systems," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(1), pages 17-29, January.
  • Handle: RePEc:spr:telsys:v:64:y:2017:i:1:d:10.1007_s11235-016-0153-7
    DOI: 10.1007/s11235-016-0153-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0153-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-016-0153-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:telsys:v:64:y:2017:i:1:d:10.1007_s11235-016-0153-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.