Title :
Single-tone spectrum allocation under SINR requirements
Author :
Ellingsaeter, B.
Author_Institution :
UNIK-Univ. Grad. Center at Kjeller, Univ. of Oslo, Oslo, Norway
Abstract :
In this paper we investigate the problem of allocating spectrum among radio nodes under SINR requirements. This problem is of special interest in dynamic spectrum access networks where topology and spectral resources differ with time and location. The problem is to determine the number of radio nodes that can transmit simultaneously while still achieving their SINR requirements and then decide which channels these nodes should transmit on. Previous work have shown how this can be done for a large spectrum pool where nodes allocate multiple channels from that pool which renders a linear programming approach feasible when the pool is large enough. In this paper we extend their work by considering arbitrary individual pool sizes and allow nodes to only transmit on one channel. Due to the accumulative nature of interference this problem is a non-convex integer problem which is NP-hard. However, we introduce a constraint transformation that transforms the problem to a binary quadratic constraint problem. Although this problem is still NP-hard, well known heuristic algorithms for solving this problem are known in the literature. We implement a heuristic algorithm which yields both good solutions and can be implemented in a distributed manner. Simulation results show that this approach provides solutions within an average gap of 10% of solutions obtained by a genetic algorithm for the original non-convex integer problem.
Keywords :
channel allocation; cognitive radio; concave programming; genetic algorithms; interference suppression; linear programming; quadratic programming; radio access networks; radio spectrum management; telecommunication network topology; NP-hard problem; SINR requirement; binary quadratic constraint problem; channel allocation; constraint transformation; distributed algorithms; dynamic spectrum access network; genetic algorithm; heuristic algorithms; interference suppression; linear programming approach; network topology; nonconvex integer problem; radio node; spectral resource; spectrum allocation; spectrum pool; Heuristic algorithms; Interference; Linear approximation; Linear programming; Optimization; Resource management; Signal to noise ratio;
Conference_Titel :
Dynamic Spectrum Access Networks (DYSPAN), 2012 IEEE International Symposium on
Conference_Location :
Bellevue, WA
Print_ISBN :
978-1-4673-4447-0
Electronic_ISBN :
978-1-4673-4446-3
DOI :
10.1109/DYSPAN.2012.6478180