Radio resource allocation for OFDM-based dynamic spectrum sharing : duality gap and time averaging

Khoshkholgh, Mohammad G. and Mokari, Nader and Navaie, Keivan and Yanikomeroglu, Halim and C. M. Leung, Victor and Shin, K. G. (2015) Radio resource allocation for OFDM-based dynamic spectrum sharing : duality gap and time averaging. IEEE Journal on Selected Areas in Communications, 33 (5). pp. 848-864. ISSN 0733-8716

Abstract

This paper considers radio resource allocation (RRA) in the downlink of an OFDM-based spectrum-sharing network. The objective of RRA is to maximize the average achievable throughput subject to the primary service interference threshold and the secondary service transmit power constraint. RRA is usually implemented based on a time window T over which system parameters are averaged and checked against resource constraints. We use short (T = 1 time slot) and long (T À 1 slots) term averaging as approximations to instantaneous and average constraints, respectively. RRA is also investigated for this system with long-term interference threshold (TIC) and short-term interference threshold (IC) constraints. RRA optimization is a non-convex optimization problem in which the duality principle is adopted to obtain approximate solutions. The duality gap indicates the degree of approximation in the thusobtained solution. We prove that the duality gap corresponding to each resource allocation asymptotically decays at least with an exponential rate of T.We further show that orthogonal frequency division multiple access is asymptotically the optimal subcarrier assignment. We also propose a practically implementable, on-line power and subcarrier allocation with on-the-fly Channel State Information (CSI) measurement. An extensive simulation study has been conducted to verify the theoretically-predicted duality gap behavior and to investigate the impact of different system parameters on the secondary service performance. The developed algorithms are also validated to be robust in practical settings and converge fast to theoretical bounds, and thus practically implementable.