IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/517846.html
   My bibliography  Save this article

Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks

Author

Listed:
  • Frank Yeong-Sung Lin
  • Chiu-Han Hsiao
  • Kuo-Chung Chu
  • Yi-Heng Liu

Abstract

With the continued evolution of wireless communication technology, relaying is one of the features proposed for the 4G LTE Advanced (LTE-A) system. The aim of relaying is to enhance both coverage and capacity. The idea of relays is not new, but relaying is being considered to ensure that the optimum performance is achieved to enable the expectations or good quality of service (QoS) of the users to be met while still keeping capital expenditure (CAPEX) within the budgeted bounds of operators. In this paper, we try to stand for an operator to propose a solution that determines where and how many relays should be deployed in the planning stages to minimize the development cost. In the planning stages, we not only derive a multicast tree routing algorithm to both determine and fulfill the QoS requirements to enhance throughput, but we also utilize the Lagrangian relaxation (LR) method in conjunction with optimization-based heuristics and conduct computational experiments to evaluate the performance. Our contribution is utilizing the LR method to propose an optimal solution to minimize the CAPEX of operators to build up a relay network with more efficiency and effectiveness and the QoS can be guaranteed by service level agreement.

Suggested Citation

  • Frank Yeong-Sung Lin & Chiu-Han Hsiao & Kuo-Chung Chu & Yi-Heng Liu, 2013. "Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-19, October.
  • Handle: RePEc:hin:jnljam:517846
    DOI: 10.1155/2013/517846
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2013/517846.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/JAM/2013/517846.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/517846?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:hin:jnljam:517846. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.