Abstract
Coordination is a central problem whenever stations (or nodes or users) share resources across a network. In the absence of coordination, there will be collision, congestion or interference, with concomitant loss of performance. This paper proposes new protocols, which we call perfect coordination (PC) protocols, that solve the coordination problem. PC protocols are completely distributed (requiring neither central control nor the exchange of any control messages), fast (with speeds comparable to those of any existing protocols), fully efficient (achieving perfect coordination, with no collisions and no gaps) and require minimal feedback. PC protocols rely heavily on learning, exploiting the possibility to use both actions and silence as messages and the ability of stations to learn from their own histories while simultaneously enabling the learning of other stations. PC protocols can be formulated as finite automata and implemented using currently existing technology (e.g., wireless cards). Simulations show that, in a variety of deployment scenarios, PC protocols outperform existing state-of-the-art protocols - despite requiring much less feedback.
| Original language | English (US) |
|---|---|
| Title of host publication | GLOBECOM - IEEE Global Telecommunications Conference |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 3861-3866 |
| Number of pages | 6 |
| ISBN (Print) | 9781479913534 |
| DOIs | |
| State | Published - 2013 |
| Externally published | Yes |
| Event | 2013 IEEE Global Communications Conference, GLOBECOM 2013 - Atlanta, GA, United States Duration: Dec 9 2013 → Dec 13 2013 |
Other
| Other | 2013 IEEE Global Communications Conference, GLOBECOM 2013 |
|---|---|
| Country | United States |
| City | Atlanta, GA |
| Period | 12/9/13 → 12/13/13 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Learning perfect coordination with minimal feedback in wireless multi-access communications. / Zame, William; Xu, Jie; Van Der Schaar, Mihaela.
GLOBECOM - IEEE Global Telecommunications Conference. Institute of Electrical and Electronics Engineers Inc., 2013. p. 3861-3866 6831675.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Learning perfect coordination with minimal feedback in wireless multi-access communications
AU - Zame, William
AU - Xu, Jie
AU - Van Der Schaar, Mihaela
PY - 2013
Y1 - 2013
N2 - Coordination is a central problem whenever stations (or nodes or users) share resources across a network. In the absence of coordination, there will be collision, congestion or interference, with concomitant loss of performance. This paper proposes new protocols, which we call perfect coordination (PC) protocols, that solve the coordination problem. PC protocols are completely distributed (requiring neither central control nor the exchange of any control messages), fast (with speeds comparable to those of any existing protocols), fully efficient (achieving perfect coordination, with no collisions and no gaps) and require minimal feedback. PC protocols rely heavily on learning, exploiting the possibility to use both actions and silence as messages and the ability of stations to learn from their own histories while simultaneously enabling the learning of other stations. PC protocols can be formulated as finite automata and implemented using currently existing technology (e.g., wireless cards). Simulations show that, in a variety of deployment scenarios, PC protocols outperform existing state-of-the-art protocols - despite requiring much less feedback.
AB - Coordination is a central problem whenever stations (or nodes or users) share resources across a network. In the absence of coordination, there will be collision, congestion or interference, with concomitant loss of performance. This paper proposes new protocols, which we call perfect coordination (PC) protocols, that solve the coordination problem. PC protocols are completely distributed (requiring neither central control nor the exchange of any control messages), fast (with speeds comparable to those of any existing protocols), fully efficient (achieving perfect coordination, with no collisions and no gaps) and require minimal feedback. PC protocols rely heavily on learning, exploiting the possibility to use both actions and silence as messages and the ability of stations to learn from their own histories while simultaneously enabling the learning of other stations. PC protocols can be formulated as finite automata and implemented using currently existing technology (e.g., wireless cards). Simulations show that, in a variety of deployment scenarios, PC protocols outperform existing state-of-the-art protocols - despite requiring much less feedback.
UR - http://www.scopus.com/inward/record.url?scp=84904130165&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904130165&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2013.6831675
DO - 10.1109/GLOCOM.2013.6831675
M3 - Conference contribution
SN - 9781479913534
SP - 3861
EP - 3866
BT - GLOBECOM - IEEE Global Telecommunications Conference
PB - Institute of Electrical and Electronics Engineers Inc.
ER -