Results 1 - 10
of
669
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.
A simple cooperative diversity method based on network path selection
- IEEE J. SELECT. AREAS COMMUN
, 2006
"... Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investi ..."
Abstract
-
Cited by 452 (14 self)
- Add to MetaCart
(Show Context)
Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of available relays and then uses this “best ” relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space–time coding for relay nodes is required, such as those proposed by Laneman and Wornell (2003). The simplicity of the technique allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability, and efficiency in future 4G wireless systems.
Fading relay channels: Performance limits and space-time signal design
- IEEE J. SELECT. AREAS COMMUN
, 2004
"... Cooperative diversity is a transmission technique where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of cooperative diversity systems, a simple fading relay ch ..."
Abstract
-
Cited by 445 (4 self)
- Add to MetaCart
(Show Context)
Cooperative diversity is a transmission technique where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of cooperative diversity systems, a simple fading relay channel where the source, destination and relay terminals are each equipped with single antenna transceivers. We consider three different TDMA-based cooperative protocols that vary the degree of broadcasting and receive collision. The relay terminal operates in either the amplify-and-forward (AF) or decode-and-forward (DF) modes. For each protocol, we study the ergodic and outage capacity behavior (assuming Gaussian code books) under the AF and DF modes of relaying. We analyze the spatial diversity performance of the various protocols and find that full spatial diversity (second-order in this case) is achieved by certain protocols provided that appropriate power control is employed. Our analysis unifies previous results reported in the literature and establishes the superiority (both from a capacity as well as a diversity point-of-view) of a new protocol proposed in this paper. The second part of the paper is devoted to (distributed) space-time code design for fading relay channels operating in the AF mode. We show that the corresponding code design criteria consist of the traditional rank and determinant criteria for the case of co-located antennas as well as appropriate power control rules. Consequently space-time codes designed for the case of co-located multi-antenna channels can be used to realize cooperative diversity provided that appropriate power control is employed.
Cooperative sensing among cognitive radios
- In Proc. of the IEEE International Conference on Communications (ICC
, 2006
"... Abstract — Cognitive Radios have been advanced as a technology for the opportunistic use of under-utilized spectrum since they are able to sense the spectrum and use frequency bands if no Primary user is detected. However, the required sensitivity is very demanding since any individual Radio might f ..."
Abstract
-
Cited by 289 (15 self)
- Add to MetaCart
(Show Context)
Abstract — Cognitive Radios have been advanced as a technology for the opportunistic use of under-utilized spectrum since they are able to sense the spectrum and use frequency bands if no Primary user is detected. However, the required sensitivity is very demanding since any individual Radio might face a deep fade. We propose light-weight cooperation in sensing based on hard decisions to mitigate the sensitivity requirements on individual radios. We show that the “link budget ” that system designers have to reserve for fading is a significant function of the required probability of detection. Even a few cooperating users (∼10-20) facing independent fades are enough to achieve practical threshold levels by drastically reducing the individual detection requirements. Hard decisions perform almost as well as soft decisions in achieving these gains. Shadowing correlation limits these gains and hence a few independent users perform better than many correlated users. Unfortunately, cooperative gain is very sensitive to adversarial/failing Cognitive Radios. Radios that fail in a known way (always report the presence/absence of a Primary user) can be compensated for by censoring them. On the other hand, radios that fail in unknown ways or may be malicious, introduce a bound on achievable sensitivity reductions. As a rule of thumb, if we believe that 1
Distributed space-time coding in wireless relay networks,”IEEE Trans.
- on Wireless Communications,
, 2006
"... Abstract In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver or relays. The coding scheme uses distributed space-time coding, that is, the relay nodes cooperate to encode the transmitted signal ..."
Abstract
-
Cited by 225 (16 self)
- Add to MetaCart
Abstract In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver or relays. The coding scheme uses distributed space-time coding, that is, the relay nodes cooperate to encode the transmitted signal so that the receiver senses a space-time codeword. It is inspired by noncoherent differential techniques. The proposed strategy is available for any number of relays nodes. It is analyzed, and shown to yield a diversity linear in the number of relays. We also study the resistance of the scheme to relay node failures, and show that a network with R relay nodes and d of them down behaves, as far as diversity is concerned, as a network with R − d nodes. Finally, our construction can be easily generalized to the case where the transmitter and receiver nodes have several antennas.
The relay-eavesdropper channel: Cooperation for secrecy
- IEEE Trans. on Inf. Theory
, 2006
"... This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and ..."
Abstract
-
Cited by 158 (7 self)
- Add to MetaCart
This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is the novel Noise-Forwarding (NF) strategy, where the relay node sends codewords independent of the source message to confuse the eavesdropper. This strategy is used to illustrate the deaf helper phenomenon, where the relay is able to facilitate secure communications while being totally ignorant of the transmitted messages. Furthermore, NF is shown to increase the secrecy capacity in the reversely degraded scenario, where the relay node fails to offer performance gains in the classical setting. The gain offered by the proposed cooperation strategies is then proved theoretically and validated numerically in the additive White Gaussian Noise (AWGN) channel. I.
Symbol Error Probabilities For General Cooperative Links
- IEEE IEEE WIRELESS COMMUNICATIONS
, 2005
"... Cooperative diversity (CD) networks have been receiving a lot of attention recently as a distributed means of improving error performance and capacity. For sufficiently large signal-to-noise ratio (SNR), this paper derives the average symbol error probability (SEP) for analog forwarding CD links. T ..."
Abstract
-
Cited by 146 (3 self)
- Add to MetaCart
Cooperative diversity (CD) networks have been receiving a lot of attention recently as a distributed means of improving error performance and capacity. For sufficiently large signal-to-noise ratio (SNR), this paper derives the average symbol error probability (SEP) for analog forwarding CD links. The resulting expressions are general as they hold for an arbitrary number of cooperating branches, arbitrary number of cooperating hops per branch, and various channel fading models. Their simplicity provides valuable insights to the performance of CD networks and suggests means of optimizing them. Besides revealing the diversity, they clearly show from where this advantage comes from and prove that presence of diversity does not depend on the specific (e.g., Rayleigh) fading distribution. Finally, they explain how diversity is improved in multihop CD networks.
Modulation and demodulation for cooperative diversity in wireless systems
- IEEE Trans. Wireless Commun
, 2006
"... Abstract — This paper develops a general framework for maximum likelihood (ML) demodulation in cooperative wireless communication systems. Demodulators with piecewise-linear combining are proposed as an accurate approximation of the nonlinear ML detectors for coherent and noncoherent decode-and-forw ..."
Abstract
-
Cited by 109 (5 self)
- Add to MetaCart
Abstract — This paper develops a general framework for maximum likelihood (ML) demodulation in cooperative wireless communication systems. Demodulators with piecewise-linear combining are proposed as an accurate approximation of the nonlinear ML detectors for coherent and noncoherent decode-and-forward (DF). The detectors with piecewise-linear combiner not only have certain implementation advantages over the nonlinear ML detectors, but also can lead to tight closed-form approximations for their error probabilities. High SNR approximations are derived based on the closed-form BER expressions. For noncoherent DF, the approximation suggests a different optimal location for the relay in DF than for the relay in amplify-and-forward (AF). A set of tight bounds of diversity order for coherent and noncoherent DF with multiple relays is also provided, and comparison between DF and AF suggests that DF with more than one relay loses about half of the diversity order of AF. Index Terms — Modulation, cooperative diversity, fading, biterror rate (BER), relay channel.
Joint optimization of relay strategies and resource allocations in cooperative cellular networks
- in Proceedings of the Conference on Information Sciences and Systems (CISS
, 2006
"... Abstract — This paper considers a wireless cooperative cellular data network with a base station and many subscribers in which the subscribers have the ability to relay information for each other to improve the overall network performance. For a wireless network operating in a frequency-selective fa ..."
Abstract
-
Cited by 103 (2 self)
- Add to MetaCart
Abstract — This paper considers a wireless cooperative cellular data network with a base station and many subscribers in which the subscribers have the ability to relay information for each other to improve the overall network performance. For a wireless network operating in a frequency-selective fading environment, the choices of relay node, relay strategy, and the allocation of power and bandwidth for each user are important design parameters. The design challenge is compounded further by the need to take user traffic demands into consideration. This paper proposes a utility maximization framework for such a network. We show that for a cellular system employing orthogonal frequency-division multiple-access (OFDMA), the optimization of physical-layer transmission strategies can be done efficiently by introducing a set of pricing variables. The proposed solution incorporates both user traffic demand and the physical channel realization in a cross-layer design that not only allocates power and bandwidth optimally for each user, but also selects the best relay node and best relay strategy (i.e. decode-and-forward vs. amplify-and-forward) for each source-destination pair. I.
Distributed relay selection and power Control for multiuser cooperative communication networks using stackelberg game
- IEEE Trans. on Mobile Computing
, 2009
"... Abstract — The performances in cooperative communications depend on careful resource allocation such as relay selection and power control, but traditional centralized resource allocation needs considerable overhead and signaling to exchange the information for channel estimations. In this paper, we ..."
Abstract
-
Cited by 72 (10 self)
- Add to MetaCart
(Show Context)
Abstract — The performances in cooperative communications depend on careful resource allocation such as relay selection and power control, but traditional centralized resource allocation needs considerable overhead and signaling to exchange the information for channel estimations. In this paper, we propose a distributed buyer/seller game theoretic framework over multiuser cooperative communication networks to stimulate cooperation and improve the system performance. By employing a two-level game to jointly consider the benefits of source nodes as buyers and relay nodes as sellers, the proposed approach not only helps the source smartly find the relays at relatively better locations and buy optimal amount of power from them, but also helps the competing relays maximize their own utilities by asking the reasonable prices. The game is proved to converge to a unique optimal equilibrium. From the simulation results, the relays in good locations can play more important roles in increasing source node’s utility, so the source would like to buy more power from these preferred relays. On the other hand, the relays have to set the proper prices to attract the source’s buying because of competition from other relays and selections from the source. Moreover, the distributed game resource allocation can achieve comparable performance compared with the centralized one. I.
