The DOI matches its Crossref record.
Wireless channel allocation using an auction algorithm
Abstract
We develop a novel auction-based algorithm to allow users to fairly compete for a wireless fading channel. We use the second-price auction mechanism whereby user bids for the channel, during each time slot, based on the fade state of the channel, and the user that makes the highest bid wins use of the channel by paying the second highest bid. Under the assumption that each user has a limited budget for bidding, we show the existence of a Nash equilibrium strategy, and the Nash equilibrium leads to a unique allocation for certain channel state distribution, such as the exponential distribution and the uniform distribution over [0, 1]. For uniformly distributed channel state, we establish that the aggregate throughput received by the users using the Nash equilibrium strategy is at least 3/4 of what can be obtained using an optimal centralized allocation that does not take fairness into account. We also show that the Nash equilibrium strategy leads to an allocation that is Pareto optimal (i.e., it is impossible to make some users better off without making some other users worse off). Based on the Nash equilibrium strategies of the second-price auction with money constraint, we further propose a centralized opportunistic scheduler that does not suffer the shortcomings associated with the proportional fair scheduler.
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
Cited by
Antonopoulos, I., Robu, V., Couraud, B., Kirli, D., Norbu, S., Kiprakis, A., Flynn, D., Elizondo-Gonzalez, S., & Wattam, S. (2020) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2020.109899 · Cited by 656
A survey on networking games in telecommunications
Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., & Wynter, L. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2004.06.005 · Cited by 552
Competitive spectrum sharing in cognitive radio networks: a dynamic game approach
Niyato, D., & Hossain, E. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2008.070073 · Cited by 345
Auction Approaches for Resource Allocation in Wireless Systems: A Survey
Zhang, Y., Lee, C., Niyato, D., & Wang, P. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.110112.00125 · Cited by 257
Artificial Intelligence Enabled Demand Response: Prospects and Challenges in Smart Grid Environment
Khan, M. A., Saleh, A. M., Waseem, M., & Sajjad, I. A. (2023) · IEEE Access · doi:10.1109/access.2022.3231444 · Cited by 179
Metadata
- Authors
- Sun, J., Modiano, E., & Zheng, L.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2006-05
- Volume
- 24
- Issue
- 5
- Pages
- 1085-1096
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2106144448
- Cited by
- 164
- References
- 0
- FWCI
- 16.19
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Wireless channel allocation using an auction algorithm. https://app.cochat.ai/papers/10.1109/jsac.2006.872890
- The paper
- Sun, J., Modiano, E., & Zheng, L. (2006). Wireless channel allocation using an auction algorithm. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2006.872890
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.