Results 1  10
of
156
Capacity Limits of MIMO Channels
 IEEE J. SELECT. AREAS COMMUN
, 2003
"... We provide an overview of the extensive recent results on the Shannon capacity of singleuser and multiuser multipleinput multipleoutput (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about t ..."
Abstract

Cited by 257 (10 self)
 Add to MetaCart
We provide an overview of the extensive recent results on the Shannon capacity of singleuser and multiuser multipleinput multipleoutput (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about the underlying timevarying channel model and how well it can be tracked at the receiver, as well as at the transmitter. More realistic assumptions can dramatically impact the potential capacity gains of MIMO techniques. For timevarying MIMO channels there are multiple Shannon theoretic capacity definitions and, for each definition, different correlation models and channel information assumptions that we consider. We first provide a comprehensive summary of ergodic and capacity versus outage results for singleuser MIMO channels. These results indicate that the capacity gain obtained from multiple antennas heavily depends
Fairness and optimal stochastic control for heterogeneous networks
 Proc. IEEE INFOCOM, March 2005. TRANSACTIONS ON NETWORKING, VOL
, 2008
"... Abstract — We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capaci ..."
Abstract

Cited by 163 (34 self)
 Add to MetaCart
(Show Context)
Abstract — We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capacity. The strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, and allows each user to make decisions independent of the actions of others. The combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events. The cost of approaching this fair operating point is an endtoend delay increase for data that is served by the network.
Optimal Power Allocation over Parallel Gaussian Broadcast Channels
, 1997
"... We consider the problem of optimal power allocation over a family of parallel Gaussian broadcast channels, each with a di#erent set of noise powers for the users, and obtain a characterization of the optimal solution as well as the resulting capacity region. The solution has a simple greedy struc ..."
Abstract

Cited by 147 (4 self)
 Add to MetaCart
We consider the problem of optimal power allocation over a family of parallel Gaussian broadcast channels, each with a di#erent set of noise powers for the users, and obtain a characterization of the optimal solution as well as the resulting capacity region. The solution has a simple greedy structure, just like the corresponding solution to the parallel Gaussian multiaccess channel. It is a generalization of the classic waterfilling solution for parallel singleuser channels. Application of the results to the problem of power control for the downlink wireless fading channel is discussed.
Simultaneous Routing and Resource Allocation via Dual Decomposition
, 2004
"... In wireless data networks the optimal routing of data depends on the link capacities which, in turn, are determined by the allocation of communications resources (such as transmit powers and bandwidths) to the links. The optimal performance of the network can only be achieved by simultaneous optimi ..."
Abstract

Cited by 118 (5 self)
 Add to MetaCart
In wireless data networks the optimal routing of data depends on the link capacities which, in turn, are determined by the allocation of communications resources (such as transmit powers and bandwidths) to the links. The optimal performance of the network can only be achieved by simultaneous optimization of routing and resource allocation. In this paper, we formulate the simultaneous routing and resource allocation problem and exploit problem structure to derive ef£cient solution methods. We use a capacitated multicommodity flow model to describe the data ¤ows in the network. We assume that the capacity of a wireless link is a concave and increasing function of the communications resources allocated to the link, and the communications resources for groups of links are limited. These assumptions allow us to formulate the simultaneous routing and resource allocation problem as a convex optimization problem over the network flow variables and the communications variables. These two sets of variables are coupled only through the link capacity constraints. We exploit this separable structure by dual decomposition. The resulting solution method attains the optimal coordination of data routing in the network layer and resource allocation in the radio control layer via pricing on the link capacities.
Energy optimal control for time varying wireless networks
 IEEE Trans. Inform. Theory
, 2006
"... Abstract — We develop a dynamic control strategy for minimizing energy expenditure in a time varying wireless network with adaptive transmission rates. The algorithm operates without knowledge of traffic rates or channel statistics, and yields average power that is arbitrarily close to the minimum p ..."
Abstract

Cited by 107 (36 self)
 Add to MetaCart
(Show Context)
Abstract — We develop a dynamic control strategy for minimizing energy expenditure in a time varying wireless network with adaptive transmission rates. The algorithm operates without knowledge of traffic rates or channel statistics, and yields average power that is arbitrarily close to the minimum possible value achieved by an algorithm optimized with complete knowledge of future events. Proximity to this optimal solution is shown to be inversely proportional to network delay. We then present a similar algorithm that solves the related problem of maximizing network throughput subject to peak and average power constraints. The techniques used in this paper are novel and establish a foundation for stochastic network optimization.
On the duality of Gaussian multipleaccess and broadcast channels
 IEEE Trans. Inf. Theory
, 2004
"... Abstract—We define a duality between Gaussian multipleaccess channels (MACs) and Gaussian broadcast channels (BCs). The dual channels we consider have the same channel gains and the same noise power at all receivers. We show that the capacity region of the BC (both constant and fading) can be writt ..."
Abstract

Cited by 80 (13 self)
 Add to MetaCart
(Show Context)
Abstract—We define a duality between Gaussian multipleaccess channels (MACs) and Gaussian broadcast channels (BCs). The dual channels we consider have the same channel gains and the same noise power at all receivers. We show that the capacity region of the BC (both constant and fading) can be written in terms of the capacity region of the dual MAC, and vice versa. We can use this result to find the capacity region of the MAC if the capacity region of only the BC is known, and vice versa. For fading channels we show duality under ergodic capacity, but duality also holds for different capacity definitions for fading channels such as outage capacity and minimumrate capacity. Using duality, many results known for only one of the two channels can be extended to the dual channel as well. Index Terms—Broadcast channel (BC), channel capacity, duality, fading channels, multipleinput multipleoutput (MIMO) systems, multipleaccess channel (MAC). I.
Secure communication over fading channels
 In Proc. Annu. Allerton Conf. Communication, Control and Computing
, 2006
"... The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from rec ..."
Abstract

Cited by 78 (13 self)
 Add to MetaCart
(Show Context)
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an informationtheoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then
Stable scheduling policies for fading wireless channels
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2005
"... We study the problem of stable scheduling for a class of wireless networks. The goal is to stabilize the queues holding information to be transmitted over a fading channel. Few assumptions are made on the arrival process statistics other than the assumption that their mean values lie within the cap ..."
Abstract

Cited by 77 (17 self)
 Add to MetaCart
(Show Context)
We study the problem of stable scheduling for a class of wireless networks. The goal is to stabilize the queues holding information to be transmitted over a fading channel. Few assumptions are made on the arrival process statistics other than the assumption that their mean values lie within the capacity region and that they satisfy a version of the law of large numbers. We prove that, for any mean arrival rate that lies in the capacity region, the queues will be stable under our policy. Moreover, we show that it is easy to incorporate imperfect queue length information and other approximations that can simplify the implementation of our policy.