SET COVER PROBLEM OF COVERAGE PLANNING IN LTE-ADVANCED RELAY NETWORKS

Abstract

Various mobile devices are developing rapidly in contemporary society, such as smart phones and tablet PCs. Users are able to acquire different multimedia services through wireless communication anytime and anywhere. However, the increased demand also gives rise to a problem of insufficient bandwidth. Therefore, a fourth generation mobile telecommunications (4G) technology was proposed and widely investigated. One of the popular technologies is Long Term Evolution Advanced (LTE-Advanced), which was proposed by the Third Generation Project Partnership (3GPP). The Evolved Node B (eNB) and Relay Node (RN) are the major components in an LTE-Advanced network. How best to deploy these two components to extend network coverage and expand performance is a vital issue. In this paper, we utilize an integer linear programming model (ILP) to formulate the coverage problem, and refer to a well-known problem called the Set Cover problem. Then we propose a heuristic algorithm named as the Set Covering algorithm to solve it. The ultimate object is achieving the highest network coverage and capacity with the least uncovered mobile user. In the simulation result, we use MATLAB to simulate a network deployment, and evaluate the planning results. According to the simulation results, we accomplished better network capacity and a higher number of covered users.

To cite this document: Fan-Hsun Tseng, Li-Der Chou, Han-Chieh Chao, and Wei-Jen Yu, "Set cover problem of coverage planning in LTE-advanced relay networks", International Journal of Electronic Commerce Studies, Vol.5, No.2, pp. 181-198, 2014.

Permanent link to this document:
http://dx.doi.org/10.7903/ijecs.1159