Transmitter cooperation in ad-hoc wireless networks: does dirty-paper coding beat relaying?
- 6 April 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 277-282
- https://doi.org/10.1109/itw.2004.1405314
Abstract
We investigate capacity and achievable rates for transmitter cooperation schemes in ad-hoc wireless networks. In addition to cooperative dirty paper coding, we propose two new cooperative transmission techniques: time-division successive broadcasting and time-division relaying. We show that transmitter cooperation can significantly increase capacity, even if one of the cooperating nodes is halfway between the transmit and receive node clusters. However, the best form of cooperation depends on the relative geometry of the transmit and receive clusters. When the transmitters are close together, cooperative dirty paper coding achieves the highest rates. However, if one of the transmitters is relatively close to the receive cluster, cooperative broadcasting or relaying achieves higher rates than dirty paper coding. That is because, at large separations, the exchange of messages between the transmitters required for dirty paper coding consumes a substantial amount of power. We show that in most cases transmitter cooperation provides a substantial capacity improvement over noncooperative techniques, especially under an equal rate constraint.Keywords
This publication has 15 references indexed in Scilit:
- The capacity region of the gaussian MIMO broadcast channelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Improved achievable rates for user cooperation and relay channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Energy-Efficiency of MIMO and Cooperative MIMO Techniques in Sensor NetworksIEEE Journal on Selected Areas in Communications, 2004
- User cooperation diversity-part I: system descriptionIEEE Transactions on Communications, 2003
- Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channelsIEEE Transactions on Information Theory, 2003
- Elements of Information TheoryPublished by Wiley ,2001
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983
- The capacity of the Gaussian interference channel under strong interference (Corresp.)IEEE Transactions on Information Theory, 1981
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- Interference channelsIEEE Transactions on Information Theory, 1978