The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?
Abstract
In this paper; we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the conventional cooperative schemes. The proposed scheme considersrelayselectionvia the available partial channel state information (CSI) at the source and the relays. In particular, we discuss the multi-node decode-and-forward cooperative scenarios, where arbitrary N relays are available. The source determines when it needs to cooperate with one relay only, and which relay to cooperate with in case of cooperation, i.e., "Whentocooperate?" and "Whomtocooperatewith?". An optimal relay is the one which has the maximum instantaneous scaled harmonic mean functionof its source-relay and relay-destination channel gains. For the symmetric scenario, we derive an approximate expression of the bandwidth efficiency and obtain an upper bound on the symbol error rate (SER) performance. We show that full diversity is guaranteed and that a significant increase of the bandwidth efficiency is achieved. Moreover, we present the tradeoff between the achievable bandwidth efficiency and the corresponding SER. Finally, the obtained analytical results are verified through computer simulations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Table of Integrals, Series, and Products
(1980) · Elsevier eBooks · doi:10.1016/c2013-0-10754-4 · Cited by 18,782
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
Owen, D. B., Abramowitz, M., & Stegun, I. A. (1965) · Technometrics · doi:10.2307/1266136 · Cited by 16,138
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
Tables of Integrals, Series, and Products.
Bello, A. L., Gradshteyn, I. S., Ryzhik, I. M., & Jeffrey, A. (1995) · The Statistician · doi:10.2307/2348458 · Cited by 5,860
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
Christopoulos, C., & Wright, A. (1999) · Electrical Power System Protection · doi:10.1007/978-1-4757-5065-2_13 · Cited by 2,748
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
Simon, M. K., & Alouini, M. (1998) · Proceedings of the IEEE · doi:10.1109/5.705532 · Cited by 824
Linear diversity combining techniques
Brennan, D. G. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2002.808163 · Cited by 817
Cooperative Communications and Networking
Liu, K. J. R., Sadek, A. K., Su, W., & Kwasinski, A. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511754524 · Cited by 604
Self-citation
Cited by
Power-Domain Non-Orthogonal Multiple Access (NOMA) in 5G Systems: Potentials and Challenges
Islam, S. M. R., Avazov, N., Dobre, O. A., & Kwak, K.-S. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2621116 · Cited by 2,458
Metadata
- Authors
- Ibrahim, A. S., Sadek, A. K., Su, W., & Liu, K. J.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2008-07
- Volume
- 7
- Issue
- 7
- Pages
- 2814-2827
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2127531738
- Cited by
- 528
- References
- 12
- FWCI
- 76.82
- Type
- journal article
- Language
- en
- Open access
- closed
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.