The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A simple Cooperative diversity method based on network path selection
Open accessAbstract
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 M 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 M 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
A simple transmit diversity technique for wireless communications
Alamouti, S. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.730453 · Cited by 12,784
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
User cooperation diversity-part I: system description
Sendonaris, A., Erkip, E., & Aazhang, B. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.818096 · Cited by 6,285
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
Zheng, L., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810646 · Cited by 4,258
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
Laneman, J. N., & Wornell, G. W. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817829 · Cited by 4,002
Geographic random forwarding (geraf) for ad hoc and sensor networks: multihop performance
Zorzi, M., & Rao, R. R. (2003) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2003.1255648 · Cited by 877
MIMO systems with antenna selection
Molisch, A. F., & Win, M. Z. (2004) · IEEE Microwave Magazine · doi:10.1109/mmw.2004.1284943 · Cited by 843
Win, M. Z., & Winters, J. H. (2001) · IEEE Transactions on Communications · doi:10.1109/26.966069 · Cited by 268
Cited by
Optimal Relay Selection for Physical-Layer Security in Cooperative Wireless Networks
Zou, Y., Wang, X., & Shen, W. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.131011 · Cited by 513
Harvest-Then-Cooperate: Wireless-Powered Cooperative Communications
Chen, H., Li, Y., Luiz Rebelatto, J., Uchoa-Filho, B. F., & Vucetic, B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2396009 · Cited by 425
Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection
Madan, R., Mehta, N., Molisch, A., & Zhang, J. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2008.06090 · Cited by 380
Voluntary Energy Harvesting Relays and Selection in Cooperative Wireless Networks
Medepally, B., & Mehta, N. B. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.091510.100447 · Cited by 335
Subcarrier-pair based resource allocation for cooperative multi-relay OFDM systems
Dang, W., Tao, M., Mu, H., & Huang, J. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.05.090102 · Cited by 323
Metadata
- Authors
- Bletsas, A., Khisti, A., Reed, D. P., & Lippman, A.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2006-03
- Volume
- 24
- Issue
- 3
- Pages
- 659-672
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2128295617
- Cited by
- 2,538
- References
- 10
- FWCI
- 164.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.