### Abstract

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.

Original language | English |
---|---|

Title of host publication | 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 |

Publisher | Institute of Electrical and Electronics Engineers |

Pages | 502-509 |

Number of pages | 8 |

Volume | 2018-January |

ISBN (Electronic) | 9781538632666 |

DOIs | |

Publication status | Published - 17 Jan 2018 |

Event | 55th Annual Allerton Conference on Communication, Control, and Computing - Monticello, United States Duration: 3 Oct 2017 → 6 Oct 2017 |

### Conference

Conference | 55th Annual Allerton Conference on Communication, Control, and Computing |
---|---|

Country | United States |

City | Monticello |

Period | 3/10/17 → 6/10/17 |

### Fingerprint

### Keywords

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

### Cite this

*55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017*(Vol. 2018-January, pp. 502-509). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ALLERTON.2017.8262779

}

*55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017.*vol. 2018-January, Institute of Electrical and Electronics Engineers, pp. 502-509, 55th Annual Allerton Conference on Communication, Control, and Computing, Monticello, United States, 3/10/17. https://doi.org/10.1109/ALLERTON.2017.8262779

**Spatial mean-field limits for CSMA networks.** / Cecchi, Fabio; Borst, Sem C.; van Leeuwaarden, Johan S.H.; Whiting, Philip A.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Spatial mean-field limits for CSMA networks

AU - Cecchi, Fabio

AU - Borst, Sem C.

AU - van Leeuwaarden, Johan S.H.

AU - Whiting, Philip A.

PY - 2018/1/17

Y1 - 2018/1/17

N2 - 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.

AB - 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.

KW - CSMA

KW - Mean-field analysis

KW - Measure-valued Markov processes

KW - Random-access networks

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

U2 - 10.1109/ALLERTON.2017.8262779

DO - 10.1109/ALLERTON.2017.8262779

M3 - Conference contribution

AN - SCOPUS:85047902080

VL - 2018-January

SP - 502

EP - 509

BT - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017

PB - Institute of Electrical and Electronics Engineers

ER -