Randomized Resource Allocation in Decentralized Wireless Networks

被引:6
|
作者
Moshksar, Kamyar [1 ]
Bayesteh, Alireza [2 ]
Khandani, Amir K. [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[2] Res Mot, Waterloo, ON N2L 5Z5, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Decentralized networks; frequency hopping (FH); mixed Gaussian interference; multiplexing gain; outage capacity; randomized signaling; spectrum sharing; COGNITIVE RADIO; POWER-CONTROL; SCALING LAWS; CAPACITY; THROUGHPUT; COMMUNICATION; BLUETOOTH; CHANNELS;
D O I
10.1109/TIT.2011.2112030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider a decentralized wireless communication network with a fixed number u of frequency subbands to be shared among N transmitter-receiver pairs. It is assumed that the number of active users is a realization of a random variable with a given probability mass function. Moreover, users are unaware of each other's codebooks and hence, no multiuser detection is possible. We propose a randomized frequency hopping (FH) scheme in which each transmitter randomly hops over a subset of u subbands from transmission slot to transmission slot. Assuming all users transmit Gaussian signals, the distribution of the noise plus interference is mixed Gaussian, which makes calculation of the mutual information between the transmitted and received signals of each user intractable. We derive lower and upper bounds on the mutual information of each user and demonstrate that, for large signal-to-noise ratio (SNR) values, the two bounds coincide. This observation enables us to compute the sum multiplexing gain of the system and obtain the optimum hopping strategy for maximizing this quantity. We compare the performance of the FH system to that of the frequency division (FD) system in terms of the following performance measures: average sum multiplexing gain (eta((1))) and average minimum multiplexing gain per user eta((2)). We show that (depending on the probability mass function of the number of active users) the FH system can offer a significant improvement in terms of eta((1)) and eta((2)) (implying a more efficient usage of the spectrum). In the sequel, we consider a scenario where the transmitters are unaware of the number of active users in the network as well as the channel gains. Developing a new upper bound on the differential entropy of a mixed Gaussian random vector and using entropy power inequality, we obtain lower bounds on the maximum transmission rate per user to ensure a specified outage probability at a given SNR level. We demonstrate that the so-called outage capacity can be considerably higher in the FH scheme than in the FD scenario for reasonable distributions on the number of active users. This guarantees a higher spectral efficiency in FH compared to FD.
引用
收藏
页码:2115 / 2142
页数:28
相关论文
共 50 条
  • [21] A RELAXATION ALGORITHM FOR DECENTRALIZED RESOURCE ALLOCATION IN FEMTOCELL NETWORKS
    Wang, Xiaoyu
    Liu, Yuan'an
    Xie, Gang
    Deng, Panliang
    2012 IEEE 2ND INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTELLIGENT SYSTEMS (CCIS) VOLS 1-3, 2012, : 859 - 863
  • [22] Decentralized resource allocation mechanisms in networks: Realization and implementation
    Stoenescu, TM
    Teneketzis, D
    ADVANCES IN CONTROL COMMUNICATION NETWORKS, AND TRANSPORTATION SYSTEMS, 2005, : 225 - 263
  • [23] Take it or Leave it: Decentralized Resource Allocation in Mobile Networks
    Lieser, Patrick
    Richerzhagen, Nils
    Feuerbach, Tim
    Nobach, Leonhard
    Boehnstedt, Doreen
    Steinmetz, Ralf
    2017 IEEE 42ND CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN), 2017, : 409 - 417
  • [24] Cooperative Decentralized Resource Allocation in Heterogeneous Wireless Access Medium
    Ismail, Muhammad
    Abdrabou, Atef
    Zhuang, Weihua
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (02) : 714 - 724
  • [25] Rate Allocation for Decentralized Detection in Wireless Sensor Networks
    Tarighati, Alla
    Jalden, Joakim
    2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2015, : 341 - 345
  • [26] Decentralized Routing and Radio Resource Allocation in Wireless Ad Hoc Networks via Graph Reinforcement Learning
    Zhang, Xiaochen
    Zhao, Haitao
    Xiong, Jun
    Liu, Xiaoran
    Yin, Hang
    Zhou, Xuanhan
    Wei, Jibo
    IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2024, 10 (03) : 1146 - 1159
  • [27] A Decentralized Control Strategy for Joint Resource Allocation and Routing in Node-Based Wireless Data Networks
    Baromand, S.
    Nekouie, M. A.
    Navaie, K.
    IV INTERNATIONAL CONGRESS ON ULTRA MODERN TELECOMMUNICATIONS AND CONTROL SYSTEMS 2012 (ICUMT), 2012, : 71 - 75
  • [28] On the resource allocation for wireless ad hoc networks
    Yi, Chen
    Ge, Gao
    Hu Ruimin
    2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 2004 - 2007
  • [29] Generalized α-fair resource allocation in wireless networks
    Altman, Eitan
    Avrachenkov, Konstantin
    Garnaev, Andrey
    47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008), 2008, : 2414 - 2419
  • [30] Resource Allocation for Wireless Multiuser OFDM Networks
    Wang, Xin
    Giannakis, Georgios B.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (07) : 4359 - 4372