Title
Randomized Resource Allocation in Decentralized Wireless Networks
Abstract
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 (η(1)) and average minimum multiplexing gain per user (η(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 η(1) and η(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.
Year
DOI
Venue
2011
10.1109/TIT.2011.2112030
IEEE Transactions on Information Theory
Keywords
Field
DocType
computational complexity,error statistics,frequency hop communication,radio networks,Gaussian signals,average minimum multiplexing gain per user,average sum multiplexing gain,codebooks,decentralized wireless communication network,differential entropy,entropy power inequality,frequency division system,maximum transmission rate per user,mixed Gaussian random vector,mutual information,noise plus interference,optimum hopping strategy,outage probability,probability mass function,random variable,randomized frequency hopping scheme,randomized resource allocation,signal-to-noise ratio values,transmitter-receiver pairs,Decentralized networks,frequency hopping (FH),mixed Gaussian interference,multiplexing gain,outage capacity,randomized signaling,spectrum sharing
Probability mass function,Entropy power inequality,Discrete mathematics,Topology,Random variable,Telecommunications,Computer science,Upper and lower bounds,Multiuser detection,Multivariate random variable,Spectral efficiency,Differential entropy
Journal
Volume
Issue
ISSN
57
4
0018-9448
Citations 
PageRank 
References 
4
0.49
54
Authors
3
Name
Order
Citations
PageRank
Moshksar, K.140.49
Bayesteh, A.240.49
Amir K. Khandani3113992.60