Capacity bounds for Cooperative diversity

Høst-Madsen, A.

doi:10.1109/tit.2006.871576

Cited by 285 publications

(278 citation statements)

References 43 publications

Supporting

Mentioning

275

Contrasting

Unclassified

Order By: Relevance

“…A first work in [27] considers cooperative relaying in a network with two sources and two destinations, and evaluates the channel capacity. Differently 6 from [27], our study is characterized by the consideration of arbitrary ad hoc network topologies and the focus on the evaluation of network capacity.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Capone

Gualandi

Yuan³

2011

Ad Hoc Networks

View full text Add to dashboard Cite

Cooperation schemes form a key aspect of infrastructure-less wireless networks that allow nodes that cannot directly communicate to exchange information through the help of intermediate nodes. The most widely adopted approach is based on hop-by-hop forwarding at the network layer along a path to destination. Cooperative relaying brings cooperation to the physical layer in order to fully exploit wireless resources. The concept exploits channel diversity by using multiple radio units to transmit the same message. The underlying fundamentals of cooperative relaying have been quite well-studied from a transmission efficiency point of view, in particular with a single pair of source and destination. Results of its performance gain in a multi-hop networking context with multiple sources and destinations are, however, less available. In this paper, we provide an optimization approach to assess the performance gain of cooperative relaying vis-a-vis conventional multi-hop forwarding under arbitrary network topology. The approach joint optimizes packet routing and transmission scheduling, and generalizes classical optimization schemes for non-cooperative networks. We provide numerical results demonstrating that the gain of cooperative relaying in networking scenarios is in general rather small and decreases when network connectivity and the number of traffic flows increase, due to interference and resource reuse limitations. In addition to quantifying the performance gain, our approach leads to a new framework for optimizing routing and scheduling in cooperative networks under a generalized Spacial Time Division Multiple Access (STDMA) scheme.Original Publication: Antonio Capone, Stefano Gualandi and Di Yuan, Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding, 2011, Ad hoc networks, (9), 7, 1256-1269. http://dx.doi.org/10.1016/j.adhoc.2011.02.002 Copyright: Elsevier Science B. V., Amsterdam http://www.elsevier.com

show abstract

Section: Related Workmentioning

confidence: 99%

“…Differently 6 from [27], our study is characterized by the consideration of arbitrary ad hoc network topologies and the focus on the evaluation of network capacity.…”

Section: Related Workmentioning

confidence: 99%

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Capone

Gualandi

Yuan³

2011

Ad Hoc Networks

View full text Add to dashboard Cite

show abstract

“…and only node 0 needs to decode x 2 , the link 1 → 0, can be regarded as a virtual MAC and the channel capacity is bound by |D Note that, for each destination, say node 2, to recover the desired packet D 0 from D 02 and D 0 , a coding method for Gaussian parallel channel should be employed [16].…”

Section: A Achievable Rate Region For Superimposed Xor Theorem 1 (4smentioning

confidence: 99%

Superimposed XOR: A New Physical Layer Network Coding Scheme for Two-Way Relay Channels

Liu

Tao

et al. 2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-We present a new physical layer network coding (PLNC) scheme, called superimposed XOR, for two-way relay channels. The new scheme specifically takes into account the channel as well as information asymmetry in the broadcast phase of two-way relaying. It is based upon both bitwise XOR and symbol-level superposition coding. We first derive its achievable rate regions when integrated with two known time control protocols over Gaussian channels. We then demonstrate its average maximum sum-rate and service delay performance over fading channels. Compared with the existing bitwise XOR and symbol-level superposition coding, the proposed superimposed XOR scheme achieves larger rate region in asymmetric channels. As a result, it performs much better in terms of averaged maximum sum-rate and service delay over fading channels. Numerical results also show that the proposed practical PLNC closely approaches the capacity bound given by the informationtheoretic random binning.

show abstract

“…Thus, we have Note that, for each destination, say node 2, to recover the desired packet D 0 from D 02 and D 0 , a coding method for Gaussian parallel channel should be employed [15].…”

Section: (A)mentioning

confidence: 99%

Rate regions of a two-way Gaussian relay channel

Liu

Tao

2009

2009 Fourth International Conference on Communications and Networking in China

View full text Add to dashboard Cite

Abstract-We study two-way communications over a threenode Gaussian relay channel. Several practical relaying strategies are considered, including bitwise XOR-based decode-andforward (DF), superposition-based DF, and amplify-and-forward (AF). For each considered two-way relay scheme, we show that its achievable rate pair is governed by a set of linear inequalities. As a result, we obtain explicit, analytical expressions as well as geometrical shapes of the rate regions for each scheme. Our analytical results provide a convenient and efficient way to evaluate the performance of two-way relaying at any channel conditions. Numerical examples are also presented to demonstrate and compare the rate regions and maximum sumrates of the considered schemes at different relay locations.

show abstract

Capacity bounds for Cooperative diversity

Cited by 285 publications

References 43 publications

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding

Superimposed XOR: A New Physical Layer Network Coding Scheme for Two-Way Relay Channels

Rate regions of a two-way Gaussian relay channel

Contact Info

Product

Resources

About