A single coin monetary mechanism for distributed cooperative interference management
Abstract
We present an example, where a distributed coordinated protocol supported by a simple monetary mechanism leads to achieving optimal information theoretic degrees of freedom gains. The considered setting is that of a linear interference network, where cooperative transmission is allowed, but at no cost in terms of the overall backhaul load. We show that a simple monetary mechanism that consists only of one coin type can enable the achievability of the optimal centralized solution. The proposed greedy distributed algorithm relies on incentivizing the users to share their resources in one channel use, in return of credit they receive for maximizing their rate gains in future channel uses. This example is the first in its class and it opens the door for constructing a unified framework for monetary mechanisms for optimal interference management and spectrum sharing. This problem carries the promise of a significant impact as blockchain techniques open the door for implementing such mechanisms in practice.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Blockchain can be applied to edge computing systems to support a number of services of security and management in edge computing.
“The recent research results have demonstrated that blockchain can be applied to the edge computing systems to support a number of services of security and management in edge computing [77].”
From Blockchain for 5G and beyond networks: A state of the art survey (2020) · cites this paper as [77]
The scalability of blockchain is a critical challenge due to the constrained ledger size, throughput and latency.
“It is noting that the scalability of blockchain is a critical challenge due to the constrained ledger size, throughput and latency [77].”
From Blockchain for 5G and beyond networks: A state of the art survey (2020) · cites this paper as [77]
Cites
Gomadam, K. S., Cadambe, V. R., & Jafar, S. A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2142270 · Cited by 895 · see citing works
Shannon-theoretic approach to a Gaussian cellular multiple-access channel
Wyner, A. D. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340450 · Cited by 750 · see citing works
Coordinated Multi-Point in Mobile Communications
(2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511783029 · Cited by 304 · see citing works
Gamal, A. E., Annapureddy, V. S., & Veeravalli, V. V. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2313083 · Cited by 37 · see citing works
Interference Management in Wireless Networks
Veeravalli, V. V., & Gamal, A. E. (2018) · Cambridge University Press eBooks · doi:10.1017/9781316691410 · Cited by 28 · see citing works
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
Kühn, F. (2009) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2009.1852 · Cited by 17 · see citing works
Bande, M., Gamal, A. E., & Veeravalli, V. V. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2914462 · Cited by 12 · see citing works
Flexible backhaul design and degrees of freedom for linear interference networks
Gamal, A. E., & Veeravalli, V. V. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6875323 · Cited by 11 · see citing works
Santacruz, P. E., Aggarwal, V., & Sabharwal, A. (2014) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2365440 · Cited by 3 · see citing works
Collaboration alignment in distributed interference management in uplink cellular systems
Kananian, B., Maddah-Ali, M. A., Shariatpanahi, S. P., et al. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541540 · Cited by 3 · see citing works
Distributed Coordinated Transmission with Forward-Backward Training for 5G Radio Access
Tölli, A., Ghauch, H., Kaleva, J., et al. (2019) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700199 · Cited by 2 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Blockchain for 5G and beyond networks: A state of the art survey
Nguyen, D. C., Pathirana, P. N., Ding, M., & Seneviratne, A. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102693 · Cited by 412 · see citing works
- Authors
- El Gamal, A., & El Gamal, H.
- ORCID
- El Gamal, Aly
- Venue
- IEEE Wireless Communications Letters
- Published
- 2019-06
- Volume
- 8
- Issue
- 3
- Pages
- 757-760
- ISSN
- 2162-2337 (ISSN-L)
- 2162-2345
- OpenAlex
- W2908151696
- Cited by
- 15
- References
- 11
- Citations by year
- 2026: 1 · 2025: 1 · 2023: 1 · 2022: 2 · 2021: 4 · 2020: 4 · 2019: 2
- FWCI
- 1.08
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Wireless Communications Letters (publishedVersion)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Physical Sciences › Computer Science › Computer Networks and Communications › Cooperative Communication and Network Coding
- Physical Sciences › Computer Science › Computer Networks and Communications › Cognitive Radio Networks and Spectrum Sensing
- Keywords
- monetary mechanism, interference management, cooperative transmission, degrees of freedom, distributed coordination, incentive mechanisms, spectrum sharing, blockchain, resource sharing
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
