Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/517846 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832555535352725504 |
|---|---|
| author | Frank Yeong-Sung Lin Chiu-Han Hsiao Kuo-Chung Chu Yi-Heng Liu |
| author_facet | Frank Yeong-Sung Lin Chiu-Han Hsiao Kuo-Chung Chu Yi-Heng Liu |
| author_sort | Frank Yeong-Sung Lin |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-640fd63503404a3199df3f2e607e5da3 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-640fd63503404a3199df3f2e607e5da32025-02-03T05:47:51ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/517846517846Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay NetworksFrank Yeong-Sung Lin0Chiu-Han Hsiao1Kuo-Chung Chu2Yi-Heng Liu3Department of Information Management, National Taiwan University, No. 1 Section 4, Roosevelt Road, Taipei 106, TaiwanDepartment of Information Management, National Taiwan University, No. 1 Section 4, Roosevelt Road, Taipei 106, TaiwanDepartment of Information Management, National Taipei University of Nursing & Health Sciences, No. 365, Ming Te Road, Taipei 112, TaiwanDepartment of Information Management, National Taipei University of Nursing & Health Sciences, No. 365, Ming Te Road, Taipei 112, TaiwanWith 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.http://dx.doi.org/10.1155/2013/517846 |
| spellingShingle | 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 Journal of Applied Mathematics |
| title | Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks |
| title_full | Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks |
| title_fullStr | Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks |
| title_full_unstemmed | Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks |
| title_short | Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks |
| title_sort | minimum cost qos constrained deployment and routing policies for wireless relay networks |
| url | http://dx.doi.org/10.1155/2013/517846 |
| work_keys_str_mv | AT frankyeongsunglin minimumcostqosconstraineddeploymentandroutingpoliciesforwirelessrelaynetworks AT chiuhanhsiao minimumcostqosconstraineddeploymentandroutingpoliciesforwirelessrelaynetworks AT kuochungchu minimumcostqosconstraineddeploymentandroutingpoliciesforwirelessrelaynetworks AT yihengliu minimumcostqosconstraineddeploymentandroutingpoliciesforwirelessrelaynetworks |