Opportunistic Spectrum Allocation for Max-Min Rate in NC-OFDMA

被引:0
|
作者
Kumbhkar, Ratnesh [1 ]
Kuber, Tejashri [1 ]
Sridharan, Gokul [1 ]
Mandayam, Narayan B. [1 ]
Seskar, Ivan [1 ]
机构
[1] Rutgers State Univ, WINLAB, 671 Route 1, North Brunswick, NJ 08902 USA
关键词
COGNITIVE RADIO; SIDELOBE SUPPRESSION;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We envision a scenario for opportunistic spectrum access among multiple point-to-point links when the available spectrum is not contiguous due to the presence of external interference sources. Non-contiguous Orthogonal Frequency Division Multiplexing (NC-OFDM) is a promising technique to utilize such disjoint frequency bands in an efficient manner. In this paper we study the problem of fair spectrum allocation across multiple NC-OFDM-enabled, point-to-point cognitive radio links under certain practical considerations that arise from such non-contiguous access. When using NC-OFDM, the channels allocated to a cognitive radio link are spread across several disjoint frequency bands leading to a large spectrum span for that link. Increased spectrum span requires higher sampling rates, leading to increased power consumption in the ADC/DAC of the transmit/receive nodes. In this context, this paper proposes a framework for spectrum allocation that maximizes the minimum rate achieved by the cognitive radio links, under a constraint on the maximum permissible spectrum span. For constant transmit powers and orthogonal spectrum allocation, such an optimization is an integer linear program and can be solved efficiently. There exists a clear trade-off between the max-min rate achieved and the maximum permissible spectrum span. The spectrum allocation obtained from the proposed optimization framework is shown to be close to the trade-off boundary, thus showing the effectiveness of the proposed technique. We find that it is possible to limit the spectrum span without incurring a significant penalty on the max-min rate under different interference environments. We also discuss an experimental evaluation of the techniques developed here using the ORBIT radio-network testbed that consists of multiple Universal Software Radio Peripherals (USRPs).
引用
收藏
页码:385 / 391
页数:7
相关论文
共 50 条
  • [1] Constraint precedence in max-min fair rate allocation
    Tsai, WK
    Iyer, M
    [J]. ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS, 2000, : 490 - 494
  • [2] Security-Aware Max-Min Resource Allocation in Multiuser OFDMA Downlink
    Karachontzitis, Sotiris
    Timotheou, Stelios
    Krikidis, Ioannis
    Berberidis, Kostas
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2015, 10 (03) : 529 - 542
  • [3] Spatio-temporal max-min fair rate allocation
    Tsai, WK
    Iyer, M
    [J]. ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS, 2000, : 480 - 484
  • [4] Generalized max-min rate allocation: Theory and a simple implementation
    Hou, YT
    Panwar, SS
    Tzeng, H
    [J]. JOURNAL OF COMMUNICATIONS AND NETWORKS, 2000, 2 (03) : 277 - 286
  • [5] Max-min overlay multicast: Rate allocation and tree construction
    Cui, Y
    Xue, Y
    Nahrstedt, K
    [J]. 2004 TWELFTH IEEE INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE, 2004, : 221 - 231
  • [6] Online Max-min Fair Allocation
    Kawase, Yasushi
    Sumita, Hanna
    [J]. ALGORITHMIC GAME THEORY, SAGT 2022, 2022, 13584 : 526 - 543
  • [7] Resource Allocation via Max-Min Goodput Optimization for BIC-OFDMA Systems
    Andreotti, Riccardo
    Wang, Tao
    Lottici, Vincenzo
    Giannetti, Filippo
    Vandendorpe, Luc
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (06) : 2412 - 2426
  • [8] MAX-MIN RESOURCE-ALLOCATION
    MJELDE, KM
    [J]. BIT, 1983, 23 (04): : 529 - 537
  • [9] General Max-Min Fair Allocation
    Ko, Sheng-Yen
    Chen, Ho-Lin
    Cheng, Siu-Wing
    Hon, Wing-Kai
    Liao, Chung-Shou
    [J]. COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 63 - 75