Randomized Resource Allocaion in Decentralized Wireless Networks
MetadataShow full item record
Ad hoc networks and bluetooth systems operating over the unlicensed ISM band are in-stances of decentralized wireless networks. By definition, a decentralized network is com-posed of separate transmitter-receiver pairs where there is no central controller to assign the resources to the users. As such, resource allocation must be performed locally at each node. Users are anonymous to each other, i.e., they are not aware of each other's code-books. This implies that multiuser detection is not possible and users treat each other as noise. Multiuser interference is known to be the main factor that limits the achievable rates in such networks particularly in the high Signal-to-Noise Ratio (SNR) regime. Therefore, all users must follow a distributed signaling scheme such that the destructive effect of interference on each user is minimized, while the resources are fairly shared. In chapter 2 we consider a decentralized wireless communication network with a fixed number of frequency sub-bands to be shared among several 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 sub-bands 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 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 with that of the Frequency Division (FD) system in terms of the following performance measures: average sum multiplexing gain and average minimum multiplexing gain per user. 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 the aforementioned measures. 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. Chapter 3 addresses spectral efficiency in decentralized wireless networks of separate transmitter-receiver pairs by generalizing the ideas developed in chapter 2. Motivated by random spreading in Code Division Multiple Access (CDMA), a signaling scheme is introduced where each user's code-book consists of two groups of codewords, referred to as signal codewords and signature codewords. Each signal codeword is a sequence of independent Gaussian random variables and each signature codeword is a sequence of independent random vectors constructed over a globally known alphabet. Using a conditional entropy power inequality and a key upper bound on the differential entropy of a mixed Gaussian random vector, we develop an inner bound on the capacity region of the decentralized network. To guarantee consistency and fairness, each user designs its signature codewords based on maximizing the average (with respect to a globally known distribution on the channel gains) of the achievable rate per user. It is demonstrated how the Sum Multiplexing Gain (SMG) in the network (regardless of the number of users) can be made arbitrarily close to the SMG of a centralized network with an orthogonal scheme such as Time Division (TD). An interesting observation is that in general the elements of the vectors in a signature codeword must not be equiprobable over the underlying alphabet in contrast to the use of binary Pseudo-random Noise (PN) signatures in randomly spread CDMA where the chip elements are +1 or -1 with equal probability. The main reason for this phenomenon is the interplay between two factors appearing in the expression of the achievable rate, i.e., multiplexing gain and the so-called interference entropy factor. In the sequel, invoking an information theoretic extremal inequality, we present an optimality result by showing that in randomized frequency hopping which is the main idea in the prevailing bluetooth devices in decentralized networks, transmission of independent signals in consecutive transmission slots is in general suboptimal regardless of the distribution of the signals. Finally, chapter 4 addresses a decentralized Gaussian interference channel consisting of two block-asynchronous transmitter-receiver pairs. We consider a scenario where the rate of data arrival at the encoders is considerably low and codewords of each user are transmitted at random instants depending on the availability of enough data for transmission. This makes the transmitted signals by each user look like scattered bursts along the time axis. Users are block-asynchronous meaning there exists a delay between their transmitted signal bursts. The proposed model for asynchrony assumes the starting point of an interference burst is uniformly distributed along the transmitted codeword of any user. There is also the possibility that each user does not experience interference on a transmitted codeword at all. Due to the randomness of delay, the channels are non-ergodic in the sense that the transmitters are unaware of the location of interference bursts along their transmitted codewords. In the proposed scheme, upon availability of enough data in its queue, each user follows a locally Randomized Masking (RM) strategy where the transmitter quits transmitting the Gaussian symbols in its codeword independently from symbol interval to symbol interval. An upper bound on the probability of outage per user is developed using entropy power inequality and a key upper bound on the differential entropy of a mixed Gaussian random variable. It is shown that by adopting the RM scheme, the probability of outage is considerably less than the case where both users transmit the Gaussian symbols in their codewords in consecutive symbol intervals, referred to as Continuous Transmission (CT).