The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Spectrum sharing for unlicensed bands
Abstract
We study a spectrum sharing problem in an unlicensed band where multiple systems coexist and interfere with each other. We first analyze a cooperative setting where all the systems collaborate to achieve a common goal. Under the assumptions that the systems communicate with Gaussian signals and treat interference as noise, we study the structure of the optimal power allocations. We show that any Pareto efficient vector of rates can be achieved with piece-wise constant power allocations. Moreover, if a strong interference condition among all the systems is satisfied, we show that frequency division multiplexing is optimal. We then consider a non-cooperative situation, where the systems act in a selfish and rational way, and investigate how the lack of cooperation can affect performance. Using game theory, we first analyze the possible outcomes of a one shot game, and observe that in many cases an inefficient solution results. We show that by extending the game definition to that of a repeated game, the possibility of building reputations and applying punishments allows to enlarge the set of achievable rates. We present examples that show that in many cases, the performance loss due to lack of cooperation is small. We also provide a converse theorem that proves that our results are tight and quantify the best achievable performance in a non-cooperative scenario
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
The Folk Theorem in Repeated Games with Discounting or with Incomplete Information
Fudenberg, D., & Maskin, E. (1986) · Econometrica · doi:10.2307/1911307 · Cited by 2,395
Cited by
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey
Akyildiz, I. F., Lee, W.-Y., Vuran, M. C., & Mohanty, S. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.05.001 · Cited by 6,356
A Survey of Dynamic Spectrum Access
Zhao, Q., & Sadler, B. M. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.361604 · Cited by 2,698
Cooperative Communications for Cognitive Radio Networks
Ben Letaief, K., & Zhang, W. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2015716 · Cited by 1,153
Dynamic Spectrum Management: Complexity and Duality
Luo, Z.-Q., & Zhang, S. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.914876 · Cited by 929
Cooperative Spectrum Sensing in Cognitive Radio, Part II: Multiuser Networks
Ganesan, G., & Ye, L. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05776 · Cited by 873
Metadata
- Authors
- Etkin, R., Parekh, A., & Tse, D.
- Venue
- First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005.
- Publisher
- IEEE
- Published
- 2005-12-10
- Pages
- 251-258
- OpenAlex
- W2153344215
- Cited by
- 205
- References
- 1
- FWCI
- 17.71
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Spectrum sharing for unlicensed bands. https://app.cochat.ai/papers/10.1109/dyspan.2005.1542641
- The paper
- Etkin, R., Parekh, A., & Tse, D. (2005). Spectrum sharing for unlicensed bands. First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005. https://doi.org/10.1109/dyspan.2005.1542641
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.