Spatial Mean-Field Limits for CSMA Networks

被引：0

作者：

Cecchi, Fabio ^{[1
]}

Borst, Sem C. ^{[1
,2
]}

van Leeuwaarden, Johan S. H. ^{[1
]}

Whiting, Philip A. ^{[3
]}

机构：

[1] Eindhoven Univ Technol, Eindhoven, Netherlands

[2] Nokia Bell Labs, Murray Hill, NJ USA

[3] Macquarie Univ, N Ryde, NSW, Australia

来源：

2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) | 2017年

关键词：

CSMA; Random-access networks; Mean-field analysis; Measure-valued Markov processes; PERFORMANCE;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Random-access algorithms such as the CSMA protocol provide a popular mechanism for distributed medium access control in large-scale wireless networks. Mean-field analysis has emerged as a convenient approach to obtain tractable performance estimates in such networks, but a critical limitation of the classical set-up is that all nodes are assumed to belong to a finite number of classes. We consider spatial mean-field limits which do not involve such a requirement, characterized in terms of a set of partial-differential equations, and in particular examine the fixed points of these equations for some specific network configurations. We discuss how the fixed points can be used to obtain estimates for key performance metrics, and present simulation experiments to demonstrate the accuracy of these estimates.

引用

页码：502 / 509

页数：8