Results 1  10
of
76
Sum capacity of the vector Gaussian broadcast channel and uplinkdownlink duality
 IEEE TRANS. ON INFORM. THEORY
, 2003
"... We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate fourway connection between the vector broadcast channel, the corresponding pointtopo ..."
Abstract

Cited by 319 (2 self)
 Add to MetaCart
We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate fourway connection between the vector broadcast channel, the corresponding pointtopoint channel (where the receivers can cooperate), the multiple access channel (where the role of transmitters and receivers are reversed), and the corresponding pointtopoint channel (where the transmitters can cooperate).
Energyefficient packet transmission over a wireless link
 IEEE/ACM TRANS. NETWORKING
, 2002
"... The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit a packe ..."
Abstract

Cited by 147 (5 self)
 Add to MetaCart
The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission power and code rate, and therefore transmitting the packet over a longer period of time. However, information is often timecritical or delaysensitive and transmission times cannot be made arbitrarily long. We therefore consider packet transmission schedules that minimize energy subject to a deadline or a delay constraint. Specifically, we obtain an optimal offline schedule for a node operating under a deadline constraint. An inspection of the form of this schedule naturally leads us to an online schedule which is shown, through simulations, to perform closely to the optimal offline schedule. Taking the deadline to infinity, we provide an exact probabilistic analysis of our offline scheduling algorithm. The results of this analysis enable us to devise a lazy online algorithm that varies transmission times according to backlog. We show that this lazy schedule is significantly more energyefficient compared to a deterministic (fixed transmission time) schedule that guarantees queue stability for the same range of arrival rates.
Energyefficient Transmission over a Wireless Link via Lazy Packet Scheduling
 in Proceedings of IEEE INFOCOM
, 2001
"... The paper considers the problem of m'mimizing the energy used to transmit packets over a wireless link via/azy schedules that judiciously vary packet transmission times. The problem is motivated by the following key observation: In many channel coding schemes, the energy required to transmit a ..."
Abstract

Cited by 137 (3 self)
 Add to MetaCart
The paper considers the problem of m'mimizing the energy used to transmit packets over a wireless link via/azy schedules that judiciously vary packet transmission times. The problem is motivated by the following key observation: In many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission power and transmitting the packet over a longer period of time. However, information is often timecritical or delaysensitive and transmission times cannot be made arbitrarily long. We therefore consider packet transmission schedules that minimize energy subject to a deadline or a delay constraint. Specifically, we obtain an optimal offiine schedule for a node operating under a deadline constraint. An inspection of the form of this schedule naturally leads us to an online schedule which is shown, through simulations, to be energyefficient. Finally, we relax the deadline constraint and provide an exact probabilistic analysis of our oilline scheduling algoritlun. We then devise a lazy online algoritlun that varies transmission times according to backlog and show that it is more energy efficient than a deterministic schedule that guarantees stability for the same range of arrival rates.
A Framework for Crosslayer Design of EnergyEfficient Communication With . . .
, 2004
"... Efficient use of energy while providing an adequate level of connection to individual sessions is of paramount importance in multihop wireless networks. Energy efficiency and connection quality depend on mechanisms that span several communication layers due to the existing cochannel interference a ..."
Abstract

Cited by 72 (0 self)
 Add to MetaCart
Efficient use of energy while providing an adequate level of connection to individual sessions is of paramount importance in multihop wireless networks. Energy efficiency and connection quality depend on mechanisms that span several communication layers due to the existing cochannel interference among competing flows that must reuse the limited radio spectrum. Although independent consideration of these layers simplifies the system design, it is often insufficient for wireless networks when the overall system performance is examined carefully. The multihop wireless extensions and the need for routing users' sessions from source to the destination only intensify this point of view. In this work, we present a framework for crosslayer design towards energyefficient communication. Our approach is characterized by a synergy between the physical and the medium access control (MAC) layers with a view towards inclusion of higher layers as well. More specifically, we address the joint problem of power control and scheduling with the objective of minimizing the total transmit power subject to the endtoend quality of service (QoS) guarantees for sessions in terms of their bandwidth and bit error rate guarantees. Bearing to the NPhardness of this combinatorial optimization problem, we propose our heuristic solutions that follow greedy approaches.
Output MAI Distributions of Linear MMSE Multiuser Receivers in DSCDMA Systems
 IEEE TRANS. INFORM. THEORY
, 2001
"... Multipleaccess interference (MAI) in a codedivision multipleaccess (CDMA) system plays an important role in performance analysis and characterization of fundamental system limits. In this paper, we study the behavior of the output MAI of the minimum meansquare error (MMSE) receiver employed in t ..."
Abstract

Cited by 64 (8 self)
 Add to MetaCart
(Show Context)
Multipleaccess interference (MAI) in a codedivision multipleaccess (CDMA) system plays an important role in performance analysis and characterization of fundamental system limits. In this paper, we study the behavior of the output MAI of the minimum meansquare error (MMSE) receiver employed in the uplink of a directsequence (DS)CDMA system. We focus on imperfect powercontrolled systems with random spreading, and establish that in a synchronous system 1) the output MAI of the MMSE receiver is asymptotically Gaussian, and 2) for almost every realization of the signatures and received powers, the conditional distribution of the output MAI converges weakly to the same Gaussian distribution as in the unconditional case. We also extend our study to asynchronous systems and establish the Gaussian nature of the output interference. These results indicate that in a large system the output interference is approximately Gaussian, and the performance of the MMSE receiver is robust to the randomness of the signatures and received powers. The Gaussianity justifies the use of singleuser Gaussian codes for CDMA systems with linear MMSE receivers, and implies that from the viewpoints of detection and channel capacity, signaltointerference ratio (SIR) is the key parameter that governs the performance of the MMSE receiver in a CDMA system.
Resource Pooling and Effective Bandwidths in CDMA Networks with Multiuser Receivers and Spatial Diversity
 IEEE Trans. Inform. Theory
, 1999
"... Much of the performance analysis on multiuser receivers for directsequence codedivision multipleaccess (CDMA) systems is focused on worst case nearfar scenarios. The user capacity of powercontrolled networks with multiuser receivers are less wellunderstood. In [1], it was shown that under som ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
(Show Context)
Much of the performance analysis on multiuser receivers for directsequence codedivision multipleaccess (CDMA) systems is focused on worst case nearfar scenarios. The user capacity of powercontrolled networks with multiuser receivers are less wellunderstood. In [1], it was shown that under some conditions, the user capacity of an uplink powercontrolled CDMA cell for several important linear receivers can be very simply characterized via a notion of effective bandwidth. In the present paper, we show that these results extend to the case of antenna arrays. We consider a CDMA system consisting of users transmitting to an antenna array with a multiuser receiver, and obtain the limiting signaltointerference (SIR) performance in a large system using random spreading sequences. Using this result, we show that the SIR requirements of all the users can be met if and only if the sum of the effective bandwidths of the users is less than the total number of degrees of freedom in the system. The effective bandwidth of a user depends only on its own requirement. Our results show that the total number of degrees of freedom of the whole system is the product of the spreading gain and the number of antennas. In the case when the fading distributions to the antennas are identical, we show that a curious phenomenon of "resource pooling" arises: the multiantenna system behaves like a system with only one antenna but with the processing gain the product of the processing gain of the original system and the number of antennas, and the received power of each user the sum of the received powers at the individual antennas.
Energyefficient resource allocation in wireless networks: An overview of gametheoretic approaches
 IEEE Signal Process. Magazine
, 2007
"... A gametheoretic model is proposed to study the crosslayer problem of joint power and rate control with quality of service (QoS) constraints in multipleaccess networks. In the proposed game, each user seeks to choose its transmit power and rate in a distributed manner in order to maximize its own ..."
Abstract

Cited by 52 (8 self)
 Add to MetaCart
A gametheoretic model is proposed to study the crosslayer problem of joint power and rate control with quality of service (QoS) constraints in multipleaccess networks. In the proposed game, each user seeks to choose its transmit power and rate in a distributed manner in order to maximize its own utility while satisfying its QoS requirements. The user’s QoS constraints are specified in terms of the average source rate and an upper bound on the average delay where the delay includes both transmission and queuing delays. The utility function considered here measures energy efficiency and is particularly suitable for wireless networks with energy constraints. The Nash equilibrium solution for the proposed noncooperative game is derived and a closedform expression for the utility achieved at equilibrium is obtained. It is shown that the QoS requirements of a user translate into a “size ” for the user which is an indication of the amount of network resources consumed by the user. Using this competitive multiuser framework, the tradeoffs among throughput, delay, network capacity and energy efficiency are studied. In addition, analytical expressions are given for users ’ delay profiles and the delay performance of the users at Nash equilibrium is quantified.
Sum Capacity of the Multiple Antenna Gaussian Broadcast Channel And UplinkDownlink Duality
 IEEE Transactions on Information Theory
, 2002
"... We characterize the sum capacity of the multiple antenna Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate fourway connection between the multiple antenna broadcast channel, the corre ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
(Show Context)
We characterize the sum capacity of the multiple antenna Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate fourway connection between the multiple antenna broadcast channel, the corresponding pointtopoint channel (where the receivers can cooperate), the multiple access channel (where the role of transmitters and receivers are reversed), and the corresponding pointtopoint channel (where the transmitters can cooperate).
On the Capacity of the Multiple Antenna Broadcast Channel
 DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
"... The capacity region of the multiple antenna (transmit and receive) broadcast channel is considered. We propose an outer bound to the capacity region by converting this nondegraded broadcast channel into a degraded one with users privy to the signals of users ordered below them. We extend our proof ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
The capacity region of the multiple antenna (transmit and receive) broadcast channel is considered. We propose an outer bound to the capacity region by converting this nondegraded broadcast channel into a degraded one with users privy to the signals of users ordered below them. We extend our proof techniques in the characterization of the sum capacity of the multiple antenna broadcast channel to evaluate this outer bound with Gaussian inputs. Our main result is the observation that if Gaussian inputs are optimal to the constructed degraded channel, then the capacity region of the multiple antenna broadcast channel is characterized.
Stability and capacity of regular wireless networks
 IEEE TRANS. INF. THEORY
, 2005
"... We study the stability and capacity problems in regular wireless networks. In the first part of the paper, we provide a general approach to characterizing the capacity region of arbitrary networks, find an outer bound to the capacity region in terms of the transport capacity, and discuss connection ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
We study the stability and capacity problems in regular wireless networks. In the first part of the paper, we provide a general approach to characterizing the capacity region of arbitrary networks, find an outer bound to the capacity region in terms of the transport capacity, and discuss connections between the capacity formulation and the stability of node buffers. In the second part of the paper, we obtain closedform expressions for the capacity of Manhattan (twodimensional grid) and ring networks (circular array of nodes). We also find the optimal (i.e., capacityachieving) medium access and routing policies. Our objective in analyzing regular networks is to provide insights and design guidelines for general networks. The knowledge of the exact capacity enables us to quantify the loss incurred by suboptimal protocols such as slotted ALOHA medium access and randomwalkbased routing. Optimal connectivity and the effects of link fading on network capacity are also investigated.