TY - GEN

T1 - A mean field game analysis of distributed MAC in ultra-dense multichannel wireless networks

AU - Narasimha, Dheeraj

AU - Shakkottai, Srinivas

AU - Ying, Lei

N1 - Funding Information:
DN would like to express gratitude towards JN and Dorabji Tata trusts for their support. This research was supported by NSF CNS 1149458, AST 1443891, NSF-Intel CNS 1719384, NSF ECCS 1609202, NSF CNS 1813392 , and NSF CNS 1824393.

PY - 2019/7/2

Y1 - 2019/7/2

N2 - This paper analyzes the performance of distributed Medium Access Control (MAC) protocols in ultra-dense multichannel wireless networks, where N frequency bands (or channels) are shared by M = mN devices, and devices make decisions to probe and then transmit over available frequency bands. While such a system can be formulated as an M-player Bayesian game, it is often infeasible to compute the Nash equilibria of a large-scale system due to the curse of dimensionality. In this paper, we exploit the Mean Field Game (MFG) approach and analyze the system in the large population regime (N tends to ∞ and m is a constant). We consider a distributed and low complexity MAC protocol where each device probes d/k channels by following an exponential clock which ticks with rate k when it has a message to transmit, and optimizes the probing strategy to balance throughput and probing cost. We present a comprehensive analysis from the MFG perspective, including the existence and uniqueness of the Mean Field Nash Equilibrium (MFNE), convergence to the MFNE, and the price of anarchy with respect to the global optimal solution. Our analysis shows that the price of anarchy is at most one half, but is close to zero when the traffic load or the probing cost is low. Our numerical results confirm our analysis and show that the MFNE is a good approximation of the M-player system. Besides showing the efficiency of the considered MAC for emerging applications in ultra-dense multichannel wireless networks, this paper demonstrates the novelty of MFG analysis, which can be used to study other distributed MAC protocols in ultra-dense wireless networks.

AB - This paper analyzes the performance of distributed Medium Access Control (MAC) protocols in ultra-dense multichannel wireless networks, where N frequency bands (or channels) are shared by M = mN devices, and devices make decisions to probe and then transmit over available frequency bands. While such a system can be formulated as an M-player Bayesian game, it is often infeasible to compute the Nash equilibria of a large-scale system due to the curse of dimensionality. In this paper, we exploit the Mean Field Game (MFG) approach and analyze the system in the large population regime (N tends to ∞ and m is a constant). We consider a distributed and low complexity MAC protocol where each device probes d/k channels by following an exponential clock which ticks with rate k when it has a message to transmit, and optimizes the probing strategy to balance throughput and probing cost. We present a comprehensive analysis from the MFG perspective, including the existence and uniqueness of the Mean Field Nash Equilibrium (MFNE), convergence to the MFNE, and the price of anarchy with respect to the global optimal solution. Our analysis shows that the price of anarchy is at most one half, but is close to zero when the traffic load or the probing cost is low. Our numerical results confirm our analysis and show that the MFNE is a good approximation of the M-player system. Besides showing the efficiency of the considered MAC for emerging applications in ultra-dense multichannel wireless networks, this paper demonstrates the novelty of MFG analysis, which can be used to study other distributed MAC protocols in ultra-dense wireless networks.

UR - http://www.scopus.com/inward/record.url?scp=85069759574&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85069759574&partnerID=8YFLogxK

U2 - 10.1145/3323679.3326498

DO - 10.1145/3323679.3326498

M3 - Conference contribution

AN - SCOPUS:85069759574

T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

SP - 1

EP - 10

BT - Mobihoc 2019 - Proceedings of the 2019 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing

PB - Association for Computing Machinery

T2 - 20th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2019

Y2 - 2 July 2019 through 5 July 2019

ER -