Topological planning and design of UMTS mobile networks: a survey

St-Hilaire, Marc

doi:10.1002/wcm.644

Cited by 15 publications

(8 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Typical works on each subproblems are listed below. For more details on each subproblem and for an extensive literature review, please refer to [15] where a survey on the planning of UMTS networks is presented.…”

Section: Figure 1: Umts Network Architecturementioning

confidence: 99%

Global planning of 3G networks using simulated annealing

Liu

St-Hilaire

2009

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wireless

Self Cite

View full text Add to dashboard Cite

In this paper, a simulated annealing algorithm is proposed and studied in order to find "good" feasible solution for the global topology planning problem of Universal Mobile Telecommunications System (UMTS) networks. The latter has been shown to be NP-hard as it is composed of three different subproblems (each one being NP-hard): the cell planning problem, the access network planning problem and the core network planning problem. As a result, we concentrate our effort on the development of an approximate algorithm based on simulated annealing. Numerical results show that quasi-optimal solutions (on average, within 5.26% of the optimal solution) can be found with a relatively short computation time compared to CPLEX.

show abstract

Section: Figure 1: Umts Network Architecturementioning

confidence: 99%

Global planning of 3G networks using simulated annealing

Liu

St-Hilaire

2009

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wireless

Self Cite

View full text Add to dashboard Cite

show abstract

“…Indeed, it is not very different from the planning problem in traditional wired networks [21]. Ricciato et al [14] handle the problem of RNC to SGSN assignment in GPRS networks, with the aim to balance the number of SGSN and RNC in order to minimize the inter-SGSN routing.…”

Section: A Network Planning Problemmentioning

confidence: 99%

“…Although the proposed model allows to obtain quite good results, it does not include the concepts of service quality and network survivability. The global planning of wireless networks has been little studied in the literature, and its applications are mainly in UMTS networks [21], [23], [24].…”

Section: A Network Planning Problemmentioning

confidence: 99%

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks

Lemamou

Galinier

Chamberland

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

In this paper, we propose a hybrid iterated local search (ILS) heuristic, named GPP4G-ILS, to solve the global planning problem of survivable wireless networks. The planning problem of wireless networks is to determine a set of sites among potential sites to install the various network devices in order to cover a given geographical area. It should also make the connections between the devices in accordance with well-defined constraints. The global planning consists in solving this problem without dividing it into several subproblems. The objective is to minimize the cost of the network while maximizing its survivability. The GPP4G-ILS algorithm is a new form of hybridization between the ILS algorithm and the integer linear programing (ILP) method. We propose a configuration that allows to reuse a previously developed ILP algorithm by integrating it in the ILS algorithm. This allows to benefit from the advantages of both methods. The ILS algorithm is used to effectively explore the search space, while the ILP algorithm is used to intensify the solutions obtained. The performance of the algorithm was evaluated using an exact method that generates optimal solutions for small instances. For larger instances, lower bounds have been calculated using a relaxation of the problem. The results show that the proposed algorithm is able to reach solutions that are, on average, within 0.06% of the optimal solutions and 2.43% from the lower bounds for the instances that cannot be solved optimally, within a reduced computation time. Index Terms-Fourth-generation (4G) networks design, global approach, hybrid methods, iterated local search (ILS), metaheuristics, reliability. 1063-6692 His research interests deal with the solution oflarge-scale instances of difficult (NP-hard) combinatorial problems by using metaheuristics, such as neighborhood search techniques and evolutionary algorithms, in particular memetic algorithms. The problems he studies include both academic problems (notably graph-related problems such as graph coloring, graph partitioning, graph matching, etc.) and various real-world applications, notably in the areas of telecommunication networks and software engineering.

show abstract

“…While wireless network planning is traditionally a very active area of the research community, the focus of research literature is mainly on mobile broadband networks and wireless local area networks, such as [2]- [5]. More importantly, the network planning formulation is aimed at "all-at-once" deployment, largely based on mathematical optimization methods and meta-heuristics like [6]- [10].…”

Section: Introductionmentioning

confidence: 99%

IncrEase: A tool for incremental planning of rural fixed Broadband Wireless Access networks

Bernardi

Marina

Talamona

et al. 2011

2011 IEEE GLOBECOM Workshops (GC Wkshps)

View full text Add to dashboard Cite

The coverage footprint of most Broadband Wireless Access (BWA) networks is not set in stone but varies over its lifetime, usually by expanding incrementally as new transmissions sites are rolled out or by adding capacity as demand changes and increases. We thus propose the incremental planning paradigm as an effective strategy for planning and deploying BWA networks, such as those operated by WISPs or community organisations. We believe incremental planning allows to anticipate return of investment and to overcome the limited network infrastructure (e.g., backhaul fibre links) in rural areas. Our IncrEase tool elaborates a varied set of operational metrics to guide the operator in identifying the regions that would benefit the most from a network upgrade, automatically suggesting the set of "moves" (e.g., new transmission sites to deploy) that leads to the best long term strategy. We benchmark the computation time of our tool and evaluate it using data from a large-scale ISP network with access to over 8,900 transmission towers.

show abstract

Topological planning and design of UMTS mobile networks: a survey

Cited by 15 publications

References 55 publications

Global planning of 3G networks using simulated annealing

Global planning of 3G networks using simulated annealing

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks

IncrEase: A tool for incremental planning of rural fixed Broadband Wireless Access networks

Contact Info

Product

Resources

About