Planning and dynamic spectrum management in heterogeneous mobile networks with QoE optimization

The radio and network planning and optimisation are continuous processes that do not end after the network has been launched. To achieve the best trade-offs, especially between quality and costs, operators make use of several coverage and capacity enhancement methods. The research from this thesis proposes methods such as the implementation of cell zooming and Relay Stations (RSs) with dynamic sleep modes and Carrier Aggregation (CA) for coverage and capacity enhancements. Initially, a survey is presented on ubiquitous mesh networks implementation scenarios and an updated characterization of requirements for services and applications is proposed. The performance targets for the key parameters, delay, delay variation, information loss and throughput have been addressed for all types of services. Furthermore, with the increased competition, mobile operator’s success does not only depend on how good the offered Quality of Service (QoS) is, but also if it meets the end user’s expectations, i.e., Quality of Experience (QoE). In this context, a model for the mapping between QoS parameters and QoE has been proposed for multimedia traffic. The planning and optimization of fixed Worldwide Interoperability for Microwave Access (WiMAX) networks with RSs in conjunction with cell zooming has been addressed. The challenging case of a propagation measurement-based scenario in the hilly region of Covilhã has been considered. A cost/revenue function has been developed by taking into account the cost of building and maintaining the infrastructure with the use of RSs. This part of the work also investigates the energy efficiency and economic implications of the use of power saving modes for RSs in conjunction with cell zooming. Assuming that the RSs can be switched-off or zoomed out to zero in periods when the traffic exchange is low, such as nights and weekends, it has been shown that energy consumption may be reduced whereas cellular coverage and capacity, as well as economic performance may be improved. An integrated Common Radio Resource Management (iCRRM) entity is proposed that implements inter-band CA by performing scheduling between two Long Term Evolution – Advanced (LTE-A) Component Carriers (CCs). Considering the bandwidths available in Portugal, the 800 MHz and 2.6 GHz CCs have been considered whilst mobile video traffic is addressed. Through extensive simulations it has been found that the proposed multi-band schedulers overcome the capacity of LTE systems without CA. Result shown a clear improvement of the QoS, QoE and economic trade-off with CA

Design, Analysis and Computation in Wireless and Optical Networks

abstract: In the realm of network science, many topics can be abstracted as graph problems, such as routing, connectivity enhancement, resource/frequency allocation and so on. Though most of them are NP-hard to solve, heuristics as well as approximation algorithms are proposed to achieve reasonably good results. Accordingly, this dissertation studies graph related problems encountered in real applications. Two problems studied in this dissertation are derived from wireless network, two more problems studied are under scenarios of FIWI and optical network, one more problem is in Radio- Frequency Identification (RFID) domain and the last problem is inspired by satellite deployment. The objective of most of relay nodes placement problems, is to place the fewest number of relay nodes in the deployment area so that the network, formed by the sensors and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the network connected, may exceed the budget. In this dissertation, we study a family of problems whose goal is to design a network with “maximal connectedness” or “minimal disconnectedness”, subject to a fixed budget constraint. Apart from “connectivity”, we also study relay node problem in which degree constraint is considered. The balance of reducing the degree of the network while maximizing communication forms the basis of our d-degree minimum arrangement(d-MA) problem. In this dissertation, we look at several approaches to solving the generalized d-MA problem where we embed a graph onto a subgraph of a given degree. In recent years, considerable research has been conducted on optical and FIWI networks. Utilizing a recently proposed concept “candidate trees” in optical network, this dissertation studies counting problem on complete graphs. Closed form expressions are given for certain cases and a polynomial counting algorithm for general cases is also presented. Routing plays a major role in FiWi networks. Accordingly to a novel path length metric which emphasizes on “heaviest edge”, this dissertation proposes a polynomial algorithm on single path computation. NP-completeness proof as well as approximation algorithm are presented for multi-path routing. Radio-frequency identification (RFID) technology is extensively used at present for identification and tracking of a multitude of objects. In many configurations, simultaneous activation of two readers may cause a “reader collision” when tags are present in the intersection of the sensing ranges of both readers. This dissertation ad- dresses slotted time access for Readers and tries to provide a collision-free scheduling scheme while minimizing total reading time. Finally, this dissertation studies a monitoring problem on the surface of the earth for significant environmental, social/political and extreme events using satellites as sensors. It is assumed that the impact of a significant event spills into neighboring regions and there will be corresponding indicators. Careful deployment of sensors, utilizing “Identifying Codes”, can ensure that even though the number of deployed sensors is fewer than the number of regions, it may be possible to uniquely identify the region where the event has taken place.Dissertation/ThesisDoctoral Dissertation Computer Science 201

Quality of service differentiation for multimedia delivery in wireless LANs

Delivering multimedia content to heterogeneous devices over a variable networking environment while maintaining high quality levels involves many technical challenges. The research reported in this thesis presents a solution for Quality of Service (QoS)-based service differentiation when delivering multimedia content over the wireless LANs. This thesis has three major contributions outlined below: 1. A Model-based Bandwidth Estimation algorithm (MBE), which estimates the available bandwidth based on novel TCP and UDP throughput models over IEEE 802.11 WLANs. MBE has been modelled, implemented, and tested through simulations and real life testing. In comparison with other bandwidth estimation techniques, MBE shows better performance in terms of error rate, overhead, and loss. 2. An intelligent Prioritized Adaptive Scheme (iPAS), which provides QoS service differentiation for multimedia delivery in wireless networks. iPAS assigns dynamic priorities to various streams and determines their bandwidth share by employing a probabilistic approach-which makes use of stereotypes. The total bandwidth to be allocated is estimated using MBE. The priority level of individual stream is variable and dependent on stream-related characteristics and delivery QoS parameters. iPAS can be deployed seamlessly over the original IEEE 802.11 protocols and can be included in the IEEE 802.21 framework in order to optimize the control signal communication. iPAS has been modelled, implemented, and evaluated via simulations. The results demonstrate that iPAS achieves better performance than the equal channel access mechanism over IEEE 802.11 DCF and a service differentiation scheme on top of IEEE 802.11e EDCA, in terms of fairness, throughput, delay, loss, and estimated PSNR. Additionally, both objective and subjective video quality assessment have been performed using a prototype system. 3. A QoS-based Downlink/Uplink Fairness Scheme, which uses the stereotypes-based structure to balance the QoS parameters (i.e. throughput, delay, and loss) between downlink and uplink VoIP traffic. The proposed scheme has been modelled and tested through simulations. The results show that, in comparison with other downlink/uplink fairness-oriented solutions, the proposed scheme performs better in terms of VoIP capacity and fairness level between downlink and uplink traffic