Spectrum optimization in multi-user multi-carrier systems with iterative convex and nonconvex approximation methods

Several practical multi-user multi-carrier communication systems are characterized by a multi-carrier interference channel system model where the interference is treated as noise. For these systems, spectrum optimization is a promising means to mitigate interference. This however corresponds to a challenging nonconvex optimization problem. Existing iterative convex approximation (ICA) methods consist in solving a series of improving convex approximations and are typically implemented in a per-user iterative approach. However they do not take this typical iterative implementation into account in their design. This paper proposes a novel class of iterative approximation methods that focuses explicitly on the per-user iterative implementation, which allows to relax the problem significantly, dropping joint convexity and even convexity requirements for the approximations. A systematic design framework is proposed to construct instances of this novel class, where several new iterative approximation methods are developed with improved per-user convex and nonconvex approximations that are both tighter and simpler to solve (in closed-form). As a result, these novel methods display a much faster convergence speed and require a significantly lower computational cost. Furthermore, a majority of the proposed methods can tackle the issue of getting stuck in bad locally optimal solutions, and hence improve solution quality compared to existing ICA methods.Comment: 33 pages, 7 figures. This work has been submitted for possible publicatio

Internet of Things-aided Smart Grid: Technologies, Architectures, Applications, Prototypes, and Future Research Directions

Traditional power grids are being transformed into Smart Grids (SGs) to address the issues in existing power system due to uni-directional information flow, energy wastage, growing energy demand, reliability and security. SGs offer bi-directional energy flow between service providers and consumers, involving power generation, transmission, distribution and utilization systems. SGs employ various devices for the monitoring, analysis and control of the grid, deployed at power plants, distribution centers and in consumers' premises in a very large number. Hence, an SG requires connectivity, automation and the tracking of such devices. This is achieved with the help of Internet of Things (IoT). IoT helps SG systems to support various network functions throughout the generation, transmission, distribution and consumption of energy by incorporating IoT devices (such as sensors, actuators and smart meters), as well as by providing the connectivity, automation and tracking for such devices. In this paper, we provide a comprehensive survey on IoT-aided SG systems, which includes the existing architectures, applications and prototypes of IoT-aided SG systems. This survey also highlights the open issues, challenges and future research directions for IoT-aided SG systems

Green and fast DSL via joint processing of multiple lines and time–frequency packed modulation

In this paper, strategies to enhance the performance, in terms of available data-rate per user, energy efficiency, and spectral efficiency, of current digital subscriber lines (DSL) are proposed. In particular, a system wherein a group of copper wires is jointly processed at both ends of the communication link is considered. For such a scenario, a resource allocation scheme aimed at energy efficiency maximization is proposed, and, moreover, time–frequency packed modulation schemes are investigated for increased spectral efficiency. Results show that a joint processing of even a limited number of wires at both ends of the communication links brings remarkable performance improvements with respect to the case of individual point-to-point DSL connections; moreover, the considered solution does represent a viable means to increase, in the short term, the data-rate of the wired access network, without an intensive (and expensive) deployment of optical links

Wi-Fi Offload: Tragedy of the Commons or Land of Milk and Honey?

Fueled by its recent success in provisioning on-site wireless Internet access, Wi-Fi is currently perceived as the best positioned technology for pervasive mobile macro network offloading. However, the broad transitions of multiple collocated operators towards this new paradigm may result in fierce competition for the common unlicensed spectrum at hand. In this light, our paper game-theoretically dissects market convergence scenarios by assessing the competition between providers in terms of network performance, capacity constraints, cost reductions, and revenue prospects. We will closely compare the prospects and strategic positioning of fixed line operators offering Wi-Fi services with respect to competing mobile network operators utilizing unlicensed spectrum. Our results highlight important dependencies upon inter-operator collaboration models, and more importantly, upon the ratio between backhaul and Wi-Fi access bit-rates. Furthermore, our investigation of medium- to long-term convergence scenarios indicates that a rethinking of control measures targeting the large-scale monetization of unlicensed spectrum may be required, as otherwise the used free bands may become subject to tragedy-of-commons type of problems.Comment: Workshop on Spectrum Sharing Strategies for Wireless Broadband Services, IEEE PIMRC'13, to appear 201

Joint User-Association and Resource-Allocation in Virtualized Wireless Networks

In this paper, we consider a down-link transmission of multicell virtualized wireless networks (VWNs) where users of different service providers (slices) within a specific region are served by a set of base stations (BSs) through orthogonal frequency division multiple access (OFDMA). In particular, we develop a joint BS assignment, sub-carrier and power allocation algorithm to maximize the network throughput, while satisfying the minimum required rate of each slice. Under the assumption that each user at each transmission instance can connect to no more than one BS, we introduce the user-association factor (UAF) to represent the joint sub-carrier and BS assignment as the optimization variable vector in the mathematical problem formulation. Sub-carrier reuse is allowed in different cells, but not within one cell. As the proposed optimization problem is inherently non-convex and NP-hard, by applying the successive convex approximation (SCA) and complementary geometric programming (CGP), we develop an efficient two-step iterative approach with low computational complexity to solve the proposed problem. For a given power-allocation, Step 1 derives the optimum userassociation and subsequently, for an obtained user-association, Step 2 find the optimum power-allocation. Simulation results demonstrate that the proposed iterative algorithm outperforms the traditional approach in which each user is assigned to the BS with the largest average value of signal strength, and then, joint sub-carrier and power allocation is obtained for the assigned users of each cell. Especially, for the cell-edge users, simulation results reveal a coverage improvement up to 57% and 71% for uniform and non-uniform users distribution, respectively leading to more reliable transmission and higher spectrum efficiency for VWN

Heterogeneous Wireless Networks: Traffic Offloading, Resource Allocation and Coverage Analysis

Unlike 2G systems where the radius of macro base station (MBS) could reach several kilometers, the cell radius of LTE-Advanced and next generation wireless networks (NGWNs) such as 5G networks would be random and up to a few hundred meters in order to overcome the radio signal propagation impairments. Heterogeneous wireless networks (HetNets) are becoming an integral part of the NGWNs especially 5G networks, where small cell base stations (SBSs), wireless-fidelity (WiFi) access points (APs), cellular BSs and device-to-device (D2D) enabled links coexist together. HetNets represent novel approaches for the mobile data offloading, resource allocation and coverage probability problems that help to optimize the network traffic. However, heterogeneity and interworking among different radio access technologies bring new challenges such as bandwidth resource allocation, user/cell association, traffic offloading based on the user activity and coverage probability in HetNets. This dissertation attempts to address three key research areas: traffic offloading, bandwidth resource allocation and coverage probability problems in HetNets. In the first part of this dissertation, we derive the mathematical framework to calculate the required active user population factor (AUPF) of small cells based on the probabilistic traffic models. The number of total mobile users and number of active mobile users have different probabilistic distributions such as different combinations of Binomial and Poisson distributions. Furthermore, AUPF is utilized to investigate the downlink BS and backhaul power consumption of HetNets. In the second part, we investigate two different traffic offloading (TO) schemes (a) Path loss (PL) and (b) Signal-to-Interference ratio (SIR) based strategies. In this context, a comparative study on two techniques to offload the traffic from macrocell to small cell is studied. Additionally, the AUPF, small cell access scheme and traffic type are included into a PL based TO strategy to minimize the congested macrocell traffic. In the third part, the joint user assignment and bandwidth resource allocation problem is formulated as a mixed integer non-linear programming (MINLP). Due to its intractability and computational complexity, the MINLP problem is transformed into a convex optimization problem via a binary variable relaxation approach. Based on the mathematical analysis of the problem, a heuristic algorithm for joint user assignment and bandwidth allocation is presented. The proposed solution achieves a near optimal user assignment and bandwidth allocation at reduced computational complexity. Lastly, we investigate the transition between traditional hexagonal BS deployment to random BS placement in HetNets. Independent Poisson Point Processes (PPPs) are used to model the random locations of BSs. Lloyds algorithm is investigated for analyzing the coverage probability in a network which functions as a bridge between random and structural BS deployments. The link distance distribution is obtained by using the Expectation-Maximization (EM) algorithm which is further utilized for calculating the coverage probability