Open Access
Translator Disclaimer
2013 Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks
Frank Yeong-Sung Lin, Chiu-Han Hsiao, Kuo-Chung Chu, Yi-Heng Liu
J. Appl. Math. 2013(SI15): 1-19 (2013). DOI: 10.1155/2013/517846

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.

Citation

Download Citation

Frank Yeong-Sung Lin. Chiu-Han Hsiao. Kuo-Chung Chu. Yi-Heng Liu. "Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks." J. Appl. Math. 2013 (SI15) 1 - 19, 2013. https://doi.org/10.1155/2013/517846

Information

Published: 2013
First available in Project Euclid: 14 March 2014

Digital Object Identifier: 10.1155/2013/517846

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
19 PAGES


SHARE
Vol.2013 • No. SI15 • 2013
Back to Top