Resource allocation in shared spectrum access communications for operators with diverse service requirements

In this paper, we study inter-operator spectrum sharing and intra-operator resource allocation in shared spectrum access communication systems and propose efficient dynamic solutions to address both inter-operator and intra-operator resource allocation optimization problems. For inter-operator spect...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:EURASIP journal on advances in signal processing Ročník 2016; číslo 1; s. 1 - 15
Hlavní autoři: Kibria, Mirza Golam, Villardi, Gabriel Porto, Ishizu, Kentaro, Kojima, Fumihide, Yano, Hiroyuki
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 29.07.2016
Springer
Springer Nature B.V
Témata:
Engineering
Fragmentation
Mathematical analysis
Mathematical models
Nonlinearity
Operators
Quantum Information Technology
Resource allocation
Signal,Image and Speech Processing
Spintronics
Subcarriers
User requirements
Delay constraint service
Shared spectrum access
NLP relaxation
Linear approximation
Resource allocation
ISSN:1687-6180, 1687-6172, 1687-6180
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we study inter-operator spectrum sharing and intra-operator resource allocation in shared spectrum access communication systems and propose efficient dynamic solutions to address both inter-operator and intra-operator resource allocation optimization problems. For inter-operator spectrum sharing, we present two competent approaches, namely the subcarrier gain-based sharing and fragmentation-based sharing, which carry out fair and flexible allocation of the available shareable spectrum among the operators subject to certain well-defined sharing rules, traffic demands, and channel propagation characteristics. The subcarrier gain-based spectrum sharing scheme has been found to be more efficient in terms of achieved throughput. However, the fragmentation-based sharing is more attractive in terms of computational complexity. For intra-operator resource allocation, we consider resource allocation problem with users’ dissimilar service requirements, where the operator supports users with delay constraint and non-delay constraint service requirements, simultaneously. This optimization problem is a mixed-integer non-linear programming problem and non-convex, which is computationally very expensive, and the complexity grows exponentially with the number of integer variables. We propose less-complex and efficient suboptimal solution based on formulating exact linearization, linear approximation, and convexification techniques for the non-linear and/or non-convex objective functions and constraints. Extensive simulation performance analysis has been carried out that validates the efficiency of the proposed solution.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1687-6180
1687-6172
1687-6180
DOI:10.1186/s13634-016-0381-8