Results 1 - 10
of
89
Cooperative diversity in wireless networks: efficient protocols and outage behavior
- IEEE TRANS. INFORM. THEORY
, 2004
"... We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies ..."
Abstract
-
Cited by 2009 (31 self)
- Add to MetaCart
(Show Context)
We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies employed by the cooperating radios, including fixed relaying schemes such as amplify-and-forward and decode-and-forward, selection relaying schemes that adapt based upon channel measurements between the cooperating terminals, and incremental relaying schemes that adapt based upon limited feedback from the destination terminal. We develop performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading, focusing on the high signal-to-noise ratio (SNR) regime. Except for fixed decode-and-forward, all of our cooperative diversity protocols are efficient in the sense that they achieve full diversity (i.e., second-order diversity in the case of two terminals), and, moreover, are close to optimum (within 1.5 dB) in certain regimes. Thus, using distributed antennas, we can provide the powerful benefits of space diversity without need for physical arrays, though at a loss of spectral efficiency due to half-duplex operation and possibly at the cost of additional receive hardware. Applicable to any wireless setting, including cellular or ad hoc networks—wherever space constraints preclude the use of physical arrays—the performance characterizations reveal that large power or energy savings result from the use of these protocols.
Communication over fading channels with delay constraints
- IEEE Transactions on Information Theory
, 2002
"... We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state info ..."
Abstract
-
Cited by 252 (7 self)
- Add to MetaCart
(Show Context)
We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state information as well as the buffer occupancy; the objectives are to regulate both the long-term average transmission power and the average buffer delay incurred by the traffic. Two models for this situation are discussed; one corresponding to fixed-length/variable-rate codewords and one corresponding to variable-length codewords. The trade-off between the average delay and the average transmission power required for reliable communication is analyzed. A dynamic programming formulation is given to find all Pareto optimal power/delay operating points. We then quantify the behavior of this tradeoff in the regime of asymptotically large delay. In this regime we characterize simple buffer control policies which exhibit optimal characteristics. Connections to the delay-limited capacity and the expected capacity of fading channels are also discussed.
Effective Capacity: A Wireless Link Model for Support of Quality of Service
"... To facilitate the efficient support of quality of service (QoS) in next-generation wireless networks, it is essential to model a wireless channel in terms of connection-level QoS metrics such as data rate, delay and delay-violation probability. However, the existing wireless channel models, i.e., ph ..."
Abstract
-
Cited by 197 (17 self)
- Add to MetaCart
To facilitate the efficient support of quality of service (QoS) in next-generation wireless networks, it is essential to model a wireless channel in terms of connection-level QoS metrics such as data rate, delay and delay-violation probability. However, the existing wireless channel models, i.e., physical-layer channel models, do not explicitly characterize a wireless channel in terms of these QoS metrics. In this paper, we propose and develop a link-layer channel model termed eective capacity (EC). In this approach, we first model a wireless link by two EC functions, namely, the probability of non-empty buer, and the QoS exponent of a connection. Then, we propose a simple and efficient algorithm to estimate these EC functions. The physical-layer analogs of these two link-layer EC functions are the marginal distribution (e.g., Rayleigh/Ricean distribution) and the Doppler spectrum, respectively. The key advantages of the EC link-layer modeling and estimation are (1) ease of translation into QoS guarantees, such as delay bounds, (2) simplicity of implementation, (3) accuracy, and hence, efficiency in admission control and resource reservation. We illustrate the advantage of our approach with a set of simulation experiments, which show that the actual QoS metric is closely approximated by the QoS metric predicted by the EC link-layer model, under a wide range of conditions.
Capacity and Optimal Resource Allocation for Fading Broadcast Channels: Part I: Ergodic Capacity
"... ..."
Capacity and power allocation for fading MIMO channels with channel estimation error
- IEEE Transactions on Information Theory
, 2006
"... Abstract—In this correspondence, we investigate the effect of channel estimation error on the capacity of multiple-input–multiple-output (MIMO) fading channels. We study lower and upper bounds of mutual information under channel estimation error, and show that the two bounds are tight for Gaussian i ..."
Abstract
-
Cited by 105 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In this correspondence, we investigate the effect of channel estimation error on the capacity of multiple-input–multiple-output (MIMO) fading channels. We study lower and upper bounds of mutual information under channel estimation error, and show that the two bounds are tight for Gaussian inputs. Assuming Gaussian inputs we also derive tight lower bounds of ergodic and outage capacities and optimal transmitter power allocation strategies that achieve the bounds under perfect feedback. For the ergodic capacity, the optimal strategy is a modified waterfilling over the spatial (antenna) and temporal (fading) domains. This strategy is close to optimum under small feedback delays, but when the delay is large, equal powers should be allocated across spatial dimensions. For the outage capacity, the optimal scheme is a spatial waterfilling and temporal truncated channel inversion. Numerical results show that some capacity gain is obtained by spatial power allocation. Temporal power adaptation, on the other hand, gives negligible gain in terms of ergodic capacity, but greatly enhances outage performance. Index Terms—Capacity, channel estimation error, feedback delay, multiple-input–multiple-output (MIMO), mutual information, outage capacity, power allocation, waterfilling. I.
Exploiting Decentralized Channel State Information for Random Access
, 2002
"... We study the use of channel state information for random access in fading channels. Traditionally, random access protocols have been designed by assuming simple models for the physical layer where all users are symmetric and there is no notion of channel state. We introduce a reception model that ta ..."
Abstract
-
Cited by 82 (18 self)
- Add to MetaCart
We study the use of channel state information for random access in fading channels. Traditionally, random access protocols have been designed by assuming simple models for the physical layer where all users are symmetric and there is no notion of channel state. We introduce a reception model that takes into account the channel states of various users. Under the assumption that each user has access to his channel state information (CSI), we propose a variant of Slotted ALOHA protocol for medium access control, where the transmission probability is allowed to be a function of the CSL The function is called the transmission control scheme. Assuming the finite user infinite buffer model we derive expressions for the maximum stable throughput of the system. We introduce the notion of asymptotic stable throughput (AST) that is the maximum stable throughput as the number of users goes to infinity. We consider two types of transmission control namely population independent transmission control (PITC) where the transmission control is not a function of the size of the network and population dependent transmission control where the transmission control is a function of the size of the network. We obtain expressions for the AST achievable with PITC. For population dependent transmission control, we introduce a particular transmission control that can potentially lead to significant gains in AST. For both PITC and PDTC, we show that the effect of transmission control is equivalent to changing the probability distribution of the channel state. The theory is then applied to CDMA networks with Linear Minimum Mean Square Error (LMMSE) receivers and Matched Filters (MF) to illustrate the effectiveness of utilizing channel state. It is shown that through the use of channel state, with an...
Power Control and Capacity of Spread Spectrum Wireless Networks
- Automatica
, 1999
"... Transmit power control is a central technique for resource allocation and interference management in spread-spectrum wireless networks. With the increasing popularity of spread-spectrum as a multiple access technique, there has been significant research in the area in recent years. While power contr ..."
Abstract
-
Cited by 77 (5 self)
- Add to MetaCart
(Show Context)
Transmit power control is a central technique for resource allocation and interference management in spread-spectrum wireless networks. With the increasing popularity of spread-spectrum as a multiple access technique, there has been significant research in the area in recent years. While power control has been considered traditionally as a means to counteract the harmful effect of channel fading, the more general emerging view is that it is a flexible mechanism to provide Quality-of-Service to individual users. In this paper, we will review the main threads of ideas and results in the recent development of this area, with a bias towards issues that have been the focus of our own research. For different receivers of varying complexity, we study both questions about optimal power control as well as the problem of characterizing the resulting network capacity. Although spread-spectrum communications has been traditionally viewed as a physical-layer subject, we argue that by suitable abstr...
Opportunistic cooperation by dynamic resource allocation
- IEEE TRANS. WIRELESS COMMUN
, 2007
"... We consider a Rayleigh fading wireless relay channel where communication is constrained by delay and average power limitations. Assuming partial channel state information at the transmitters and perfect channel state information at the receivers, we first study the delay-limited capacity of this sy ..."
Abstract
-
Cited by 68 (4 self)
- Add to MetaCart
We consider a Rayleigh fading wireless relay channel where communication is constrained by delay and average power limitations. Assuming partial channel state information at the transmitters and perfect channel state information at the receivers, we first study the delay-limited capacity of this system and show that, contrary to a single source-single destination case, a non-zero delay-limited capacity is achievable. We introduce opportunistic decode-and-forward (ODF) protocol which utilizes the relay depending on the channel state. Opportunistic cooperation significantly improves the delay-limited capacity of the system and performs very close to the cut-set bound. We also consider the system performance in terms of minimum outage probability. We show that ODF provides performance close to the cut-set bound from the outage probability perspective as well. Our results emphasize the importance of feedback for cooperative systems that have delay sensitive applications.
Gamal, “On adaptive transmission for energy efficiency in wireless data networks
- IEEE Transactions on Information Theory
, 2004
"... Abstract—This paper investigates the problem of energy-efficient transmission of data packets in a wireless network by jointly adapting to backlog and channel condition. Specifically, we consider minimum-energy scheduling problems over multiple-access channels, broadcast channels, and channels with ..."
Abstract
-
Cited by 47 (3 self)
- Add to MetaCart
Abstract—This paper investigates the problem of energy-efficient transmission of data packets in a wireless network by jointly adapting to backlog and channel condition. Specifically, we consider minimum-energy scheduling problems over multiple-access channels, broadcast channels, and channels with fading, when packets of all users need to be transmitted before a deadline. Earlier work has considered a similar setup and demonstrated significant transmission energy saving by adapting to backlog for channels that are time invariant and when transmission is restricted to time-division. For concreteness, throughout the paper, rates and powers corresponding to optimal coding over discrete-time additive white Gaussian noise (AWGN) channels are assumed. The results, however, hold for more general channels and coding schemes where the total transmitted power is convex in the transmission rates. The offline scheduling problems for all the channels considered are shown to reduce to convex optimization problems with linear constraints. An iterative algorithm, referred to as FlowRight, that finds optimal offline schedules is presented. A heuristic online algorithm that we call look-ahead water-filling, which jointly adapts to both channel fading state and backlog is described. By the use of a small buffer which introduces an almost fixed delay, this algorithm achieves a considerable reduction in energy relative to water filling solely on channel states. Index Terms—Adaptive transmission, broadcast, energy-efficient transmission, iterative algorithm, multiple-access, power