Telecommunications Network Planning and Maintenance

Telecommunications network operators are on a constant challenge to provide new services which require ubiquitous broadband access. In an attempt to do so, they are faced with many problems such as the network coverage or providing the guaranteed Quality of Service (QoS). Network planning is a multi-objective optimization problem which involves clustering the area of interest by minimizing a cost function which includes relevant parameters, such as installation cost, distance between user and base station, supported traffic, quality of received signal, etc. On the other hand, service assurance deals with the disorders that occur in hardware or software of the managed network. This paper presents a large number of multicriteria techniques that have been developed to deal with different kinds of problems regarding network planning and service assurance. The state of the art presented will help the reader to develop a broader understanding of the problems in the domain

A Socio-inspired CALM Approach to Channel Assignment Performance Prediction and WMN Capacity Estimation

A significant amount of research literature is dedicated to interference mitigation in Wireless Mesh Networks (WMNs), with a special emphasis on designing channel allocation (CA) schemes which alleviate the impact of interference on WMN performance. But having countless CA schemes at one's disposal makes the task of choosing a suitable CA for a given WMN extremely tedious and time consuming. In this work, we propose a new interference estimation and CA performance prediction algorithm called CALM, which is inspired by social theory. We borrow the sociological idea of a "sui generis" social reality, and apply it to WMNs with significant success. To achieve this, we devise a novel Sociological Idea Borrowing Mechanism that facilitates easy operationalization of sociological concepts in other domains. Further, we formulate a heuristic Mixed Integer Programming (MIP) model called NETCAP which makes use of link quality estimates generated by CALM to offer a reliable framework for network capacity prediction. We demonstrate the efficacy of CALM by evaluating its theoretical estimates against experimental data obtained through exhaustive simulations on ns-3 802.11g environment, for a comprehensive CA test-set of forty CA schemes. We compare CALM with three existing interference estimation metrics, and demonstrate that it is consistently more reliable. CALM boasts of accuracy of over 90% in performance testing, and in stress testing too it achieves an accuracy of 88%, while the accuracy of other metrics drops to under 75%. It reduces errors in CA performance prediction by as much as 75% when compared to other metrics. Finally, we validate the expected network capacity estimates generated by NETCAP, and show that they are quite accurate, deviating by as low as 6.4% on an average when compared to experimentally recorded results in performance testing

Best Upgrade Plans for Single and Multiple Source-Destination Pairs

In this paper, we study Resource Constrained Best Upgrade Plan (BUP) com-putation in road network databases. Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. In the single-pair version of BUP, the input includes a source and a destination in G, and a budget B (resource constraint). The goal is to identify which upgradable edges should be upgraded so that the shortest path distance between source and destination (in the updated network) is minimized, without exceeding the available budget for the upgrade. In the multiple-pair version of BUP, a set Q of source-destination pairs is given, and the problem is to choose for upgrade those edges that lead to the smallest sum of shortest path distances across all pairs in Q, subject to budget constraint B. In addition to transportation networks, the BUP query arises in other domains too, such as telecommunications. We propose a framework for BUP processing and evaluate it with experiments on large, real road networks

Strategic Location Planning for Broadband Access Networks under Cooperative Transmission

To achieve a cost-effective network deployment, employing state-of-art technical advances provides a practical and effective way to enhance system performance and quality of service provisioning. Cooperative transmission has been recognized as one of the most effective paradigms to achieve higher system performance in terms of lower bit-error rate, higher throughput, larger coverage, more efficient energy utilization, and higher network reliability. This dissertation studies the location planning for the deployment of broadband access networks and explores the great potential of cooperative transmission in the context of single-cell cooperative relaying and multi-cell cooperative transmission, respectively. The placement problem is investigated in two categories of network deployment environment, i.e., an existing wireless access network and a perspective broadband access network, respectively. In an existing wireless access network, to solve some practical problems such as the requirements of capacity enhancement and coverage extension, relay stations (RSs) are introduced in the network architecture. We propose two optimization frameworks with the design objectives of maximizing cell capacity and minimizing number of RSs for deployment, respectively. Mathematical formulations are provided to precisely capture the characteristics of the placement problems. The corresponding solution algorithms are developed to obtain the optimal (or near-optimal) results in polynomial time. Numerical analysis and case studies are conducted to validate the performance benefits due to RS placement and the computation efficiency of the proposed algorithms. To deploy a new metropolitan-area broadband access network, we explore the integration of passive optical network (PON) and wireless cooperative networks (WCN) under the multi-cell cooperative transmission technology. An optimization framework is provided to solve the problem of dimensioning and site planning. The issues of node placement, BS-user association, wireless bandwidth and power breakdown assignment are jointly considered in a single stage to achieve better performance. We also propose a solution to the complex optimization problem based on decomposition and linear approximation. Numerical analysis and case studies are conducted to verify the proposed framework. The results demonstrate the performance gains and economic benefits. Given a set of network parameters, the proposed optimization frameworks and solutions proposed in this dissertation can provide design guidelines for practical network deployment and cost estimations. And the constructed broadband access networks show a more cost-effective deployment by taking advantage of the cooperative transmission technology

Optimization Models for the Radio Planning of Wireless Mesh Networks

The classical approach of radio planning in wireless access networks is often tailored as a set covering problem. Such approach is no longer suited for Wireless Mesh Networks (WMNs), where, beside the problem of covering clients, also the wireless network topology must be planned and the tra±c must be routed on wireless links towards mesh access points. In this paper we propose novel optimization models for the planning of WMNs whose objective is to minimize the network installation cost, while providing full coverage to wireless mesh clients. Our mixed integer linear programming models aim at selecting the number and positions of mesh routers and access points, while taking into account in an ac- curate way tra±c routing, interference, rate adaptation, and channel assignment. We provide the optimal solutions of the proposed problem formulations on a set of realistic-size instances and discuss the e®ect of di®erent parameters on the characteristics of the planned networks