System Level Simulation and Radio Resource Management for Distributed Antenna Systems with Cognitive Radio and Multi-Cell Cooperation

4th International Conference on Future Generation Communication Technologies (FGCT 2015), Luton, United Kingdom.The performance of wireless networks will experience a considerable improvement by the use of novel technologies such as distributed antenna systems (DASs), multi-cell cooperation (MCC), and cognitive radio (CR). These solutions have shown considerable gains at the physical-layer (PHY). However, several issues remain open in the system-level evaluation, radio resource management (RRM), and particularly in the design of billing/licensing schemes for this type of system. This paper proposes a system-level simulator (SLS) that will help in addressing these issues. The paper focuses on the description of the modules of a generic SLS that need a modification to cope with the new transmission/economic paradigms. An advanced RRM solution is proposed for a multi-cell DAS with two levels of cooperation: inside the cell (intra-cell) to coordinate the transmission of distributed nodes within the cell, and between cells (inter-cell or MCC) to adapt cell transmissions according to the collected inter-cell interference measurements. The RRM solution blends network and financial metrics using the theory of multiobjective portfolio optimization. The core of the RRM solution is an iterative weighted least squares (WLS) optimization algorithm that aims to schedule in a fair manner as many terminals as possible across all the radio resources of the available frequency bands (licensed and non-licensed), while considering different economic metrics. The RRM algorithm includes joint terminal scheduling, link adaptation, space division multiplexing, spectrum selection, and resource allocation

Joint Channel Selection and Power Control in Infrastructureless Wireless Networks: A Multi-Player Multi-Armed Bandit Framework

This paper deals with the problem of efficient resource allocation in dynamic infrastructureless wireless networks. Assuming a reactive interference-limited scenario, each transmitter is allowed to select one frequency channel (from a common pool) together with a power level at each transmission trial; hence, for all transmitters, not only the fading gain, but also the number of interfering transmissions and their transmit powers are varying over time. Due to the absence of a central controller and time-varying network characteristics, it is highly inefficient for transmitters to acquire global channel and network knowledge. Therefore a reasonable assumption is that transmitters have no knowledge of fading gains, interference, and network topology. Each transmitting node selfishly aims at maximizing its average reward (or minimizing its average cost), which is a function of the action of that specific transmitter as well as those of all other transmitters. This scenario is modeled as a multi-player multi-armed adversarial bandit game, in which multiple players receive an a priori unknown reward with an arbitrarily time-varying distribution by sequentially pulling an arm, selected from a known and finite set of arms. Since players do not know the arm with the highest average reward in advance, they attempt to minimize their so-called regret, determined by the set of players' actions, while attempting to achieve equilibrium in some sense. To this end, we design in this paper two joint power level and channel selection strategies. We prove that the gap between the average reward achieved by our approaches and that based on the best fixed strategy converges to zero asymptotically. Moreover, the empirical joint frequencies of the game converge to the set of correlated equilibria. We further characterize this set for two special cases of our designed game

Spectrum Sharing Optimization and Analysis in Cellular Networks under Target Performance and Budget Restriction

Dynamic Spectrum Sharing (DSS) aims to provide opportunistic access to under-utilised spectrum in cellular networks for secondary network operators. In this paper we propose an algorithm using stochastic and optimisation models to borrow spectrum bandwidths under the assumption that more resources exist for secondary access than the secondary network demand by considering a merchant mode. The main aim of the paper is to address the problem of spectrum borrowing in DSS environments, where a secondary network operator aims to borrow the required spectrum from multiple primary network operators to achieve a maximum profit under specific grade of service (GoS) and budget restriction. We assume that the primary network operators offer spectrum access opportunities with variable number of channels (contiguous and/or non-contiguous) at variable prices. Results obtained are then compared with results derived from an algorithm in which spectrum borrowing are random. Comparisons showed that the gain in the results obtained from our proposed stochastic-optimisation framework is significantly higher than random counterpart