Abstract
It is well-known that medium access control (MAC) protocols are vulnerable to the selfish behavior of nodes, which often results in inefficient use of resources. In this work, we aim to overcome this inefficiency by constructing a class of defection-proof MAC protocols in the context of slotted multiple access communications. The operation of the proposed protocols can be divided into a review phase and a reciprocation phase. In a review phase, nodes cooperate and collect signals on the behavior of other nodes. At the end of a review phase, nodes perform a statistical test independently to determine whether there has been a defecting node in the system. In a reciprocation phase, a node cooperates if it concludes that no defection has occurred and carries out a punishment otherwise. We provide sufficient conditions for protocols to be defection-proof against a constant defection strategy and to achieve an arbitrarily small efficiency loss. We analyze an example of a statistical test based on which we can build protocols that satisfy the sufficient conditions.
| Original language | English |
|---|---|
| Title of host publication | 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010 |
| DOIs | |
| Publication status | Published - 2010 Dec 1 |
| Event | 53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States Duration: 2010 Dec 6 → 2010 Dec 10 |
Publication series
| Name | GLOBECOM - IEEE Global Telecommunications Conference |
|---|
Other
| Other | 53rd IEEE Global Communications Conference, GLOBECOM 2010 |
|---|---|
| Country | United States |
| City | Miami, FL |
| Period | 10/12/6 → 10/12/10 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Cite this
}
Design and analysis of defection-proof MAC protocols using a repeated game framework. / Phan, Khoa T.; Park, Jaeok; Van Der Schaar, Mihaela.
2010 IEEE Global Telecommunications Conference, GLOBECOM 2010. 2010. 5683740 (GLOBECOM - IEEE Global Telecommunications Conference).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Design and analysis of defection-proof MAC protocols using a repeated game framework
AU - Phan, Khoa T.
AU - Park, Jaeok
AU - Van Der Schaar, Mihaela
PY - 2010/12/1
Y1 - 2010/12/1
N2 - It is well-known that medium access control (MAC) protocols are vulnerable to the selfish behavior of nodes, which often results in inefficient use of resources. In this work, we aim to overcome this inefficiency by constructing a class of defection-proof MAC protocols in the context of slotted multiple access communications. The operation of the proposed protocols can be divided into a review phase and a reciprocation phase. In a review phase, nodes cooperate and collect signals on the behavior of other nodes. At the end of a review phase, nodes perform a statistical test independently to determine whether there has been a defecting node in the system. In a reciprocation phase, a node cooperates if it concludes that no defection has occurred and carries out a punishment otherwise. We provide sufficient conditions for protocols to be defection-proof against a constant defection strategy and to achieve an arbitrarily small efficiency loss. We analyze an example of a statistical test based on which we can build protocols that satisfy the sufficient conditions.
AB - It is well-known that medium access control (MAC) protocols are vulnerable to the selfish behavior of nodes, which often results in inefficient use of resources. In this work, we aim to overcome this inefficiency by constructing a class of defection-proof MAC protocols in the context of slotted multiple access communications. The operation of the proposed protocols can be divided into a review phase and a reciprocation phase. In a review phase, nodes cooperate and collect signals on the behavior of other nodes. At the end of a review phase, nodes perform a statistical test independently to determine whether there has been a defecting node in the system. In a reciprocation phase, a node cooperates if it concludes that no defection has occurred and carries out a punishment otherwise. We provide sufficient conditions for protocols to be defection-proof against a constant defection strategy and to achieve an arbitrarily small efficiency loss. We analyze an example of a statistical test based on which we can build protocols that satisfy the sufficient conditions.
UR - http://www.scopus.com/inward/record.url?scp=79551620033&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79551620033&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2010.5683740
DO - 10.1109/GLOCOM.2010.5683740
M3 - Conference contribution
AN - SCOPUS:79551620033
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
ER -