The DOI matches its Crossref record; 14 of the 14 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. Due to asymmetries and selfish system behavior, unfair and inefficient situations may arise. We investigate whether efficiency and fairness can be obtained with self-enforcing spectrum sharing rules. These rules have the advantage of not requiring a central authority that verifies compliance to the protocol. Any self-enforcing protocol must correspond to an equilibrium of a game. We first analyze the possible outcomes of a one shot game, and observe that in many cases an inefficient solution results. However, systems often coexist for long periods and a repeated game is more appropriate to model their interaction. In this repeated game the possibility of building reputations and applying punishments allows for a larger set of self-enforcing outcomes. When this set includes the optimal operating point, efficient, fair, and incentive compatible spectrum sharing becomes possible. We present examples that illustrate that in many cases the performance loss due to selfish behavior is small. We also prove 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
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
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
A Non-cooperative Equilibrium for Supergames
Friedman, J. W. (1971) · The Review of Economic Studies · doi:10.2307/2296617 · Cited by 1,778
A new achievable rate region for the interference channel
Han, T., & Kobayashi, K. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056307 · Cited by 1,588
Dual methods for nonconvex spectrum optimization of multicarrier systems
Yu, W., & Lui, R. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2006.877962 · Cited by 1,572
Power Control By Geometric Programming
Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05960 · Cited by 886
Distributed multiuser power control for digital subscriber lines
Yu, W., Ginis, G., & Cioffi, J. M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.1007390 · Cited by 855
Oligopoly and the Theory of Games.
Binmore, K. G., & Friedman, J. W. (1978) · Economica · doi:10.2307/2553264 · Cited by 740
Distributed interference compensation for wireless networks
Huang, J., Berry, R. A., & Honig, M. L. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.872889 · Cited by 726
Spectrum sharing for unlicensed bands
Etkin, R., Parekh, A., & Tse, D. (2005) · First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005. · doi:10.1109/dyspan.2005.1542641 · Cited by 205
Self-citationAnalysis of Iterative Waterfilling Algorithm for Multiuser Power Control in Digital Subscriber Lines
Luo, Z.-Q., & Pang, J.-S. (2006) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/asp/2006/24012 · Cited by 199
Intelligent power allocation strategies in an unlicensed spectrum
Clemens, N., & Rose, C. (2005) · IEEE International Symposium on Dynamic Spectrum Access Networks · doi:10.1109/dyspan.2005.1542615 · Cited by 70
Cited by
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
Advances in cognitive radio networks: A survey
Wang, B., & Liu, K. J. R. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2093210 · Cited by 1,404
CRAHNs: Cognitive radio ad hoc networks
Akyildiz, I. F., Lee, W.-Y., & Chowdhury, K. R. (2009) · Ad Hoc Networks · doi:10.1016/j.adhoc.2009.01.001 · Cited by 1,345
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
Gomadam, K., Cadambe, V. R., & Jafar, S. A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2142270 · Cited by 871
Metadata
- Authors
- Etkin, R., Parekh, A., & Tse, D.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2007-04
- Volume
- 25
- Issue
- 3
- Pages
- 517-528
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2002937495
- Cited by
- 859
- References
- 14
- FWCI
- 154.09
- 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.