English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we investigate the problem of allocating spectrum among radionodes under SINR requirements. This problem is of special interest in dynamicspectrum access networks where topology and spectral resources differ with timeand location. The problem is to determine the number of radio nodes that cantransmit simultaneously while still achieving their SINR requirements and thendecide which channels these nodes should transmit on. Previous work have shownhow this can be done for a large spectrum pool where nodes allocate multiplechannels from that pool which renders a linear programming approach feasiblewhen the pool is large enough. In this paper we extend their work byconsidering arbitrary individual pool sizes and allow nodes to only transmit onone channel. Due to the accumulative nature of interference this problem is anon-convex integer problem which is NP-hard. However, we introduce a constrainttransformation that transforms the problem to a binary quadratic constraintproblem. Although this problem is still NP-hard, well known heuristicalgorithms for solving this problem are known in the literature. We implement aheuristic algorithm based on Lagrange relaxation which bounds the solutionvalue of the heuristic to the optimal value of the constraint transformedproblem. Simulation results show that this approach provides solutions withinan average gap of 10% of solutions obtained by a genetic algorithm for theoriginal non-convex integer problem.

Secondary Access to Spectrum with SINR Requirements Through Constraint Transformation