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 International Journal of Electronic Commerce Studies 182Cover 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.

Optimization of the Deployment of Relay Nodes in Cellular Networks

“…A relationship is established between the eRNs and the number of users by checking the links received at each user from all the eRNs in (7). Thus, we introduce a user station matrix where each row represents the user number and each column represents the eRN number.…”

“…The papers of [5], [6], [7], and [8] belong to a group of researchers that have contributed to this area, and their contributions shall be described hereinafter. In [5], the authors proposed an enhanced tree (E-tree) algorithm to place the eNB and relay stations (RSs) at the location with the lowest construction cost compared with the tree algorithm; while in [6], a super-graph tree algorithm was proposed to place base stations (BSs) and relay stations at the lowest cost positions, and then the authors proposed another interference aware algorithm (IA) that considers the interference between BSs in the network.…”

“…In [5], the authors proposed an enhanced tree (E-tree) algorithm to place the eNB and relay stations (RSs) at the location with the lowest construction cost compared with the tree algorithm; while in [6], a super-graph tree algorithm was proposed to place base stations (BSs) and relay stations at the lowest cost positions, and then the authors proposed another interference aware algorithm (IA) that considers the interference between BSs in the network. In [7], the authors suggested a set covering algorithm to achieve better network coverage and performance for LTE-Advanced relay networks. This algorithm reduced the number of uncovered users, but it had a higher construction cost generated from the S-tree algorithm and IA.…”

Network planning for Type 1 and Type 1a relay nodes in LTE‐Advanced networks

“…The literatures most related to this work are references [25,26], and [27]. In [25], the authors proposed tree and enhanced-tree algorithm to minimize construction cost.…”

“…The two-hop relaying limitation is similar to this work, but they aim to decrease construction cost, whereas we focus on average throughput. The authors in [26] and [27] proposed the set covering algorithm to solve the defined set cover problem. However, they aim to maximize network capacity, which is also unlike the average throughput maximization in this work.…”