A Caltech Library Service

Temporal starvation in multi-channel CSMA networks: an analytical framework

Zocca, Alessandro (2018) Temporal starvation in multi-channel CSMA networks: an analytical framework. Performance Evaluation Review, 46 (3). pp. 52-53. ISSN 0163-5999.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


In this paper we consider a stochastic model for a frequencyagile CSMA protocol for wireless networks where multiple orthogonal frequency channels are available. Even when the possible interference on the different channels is described by different conflict graphs, we show that the network dynamics can be equivalently described as that of a single-channel CSMA algorithm on an appropriate virtual network. Our focus is on the asymptotic regime in which the network nodes try to activate aggressively in order to achieve maximum throughput. Of particular interest is the scenario where the number of available channels is not sufficient for all nodes of the network to be simultaneously active and the well-studied temporal starvation issues of the single-channel CSMA dynamics persist. For most networks we expect that a larger number of available channels should alleviate these temporal starvation issues. However, we prove that the aggregate throughput is a non-increasing function of the number of available channels. To investigate this trade-off that emerges between aggregate throughput and temporal starvation phenomena, we propose an analytical framework to study the transient dynamics of multi-channel CSMA networks by means of first hitting times. Our analysis further reveals that the mixing time of the activity process does not always correctly characterize the temporal starvation in the multi-channel scenario and often leads to pessimistic performance estimates.

Item Type:Article
Related URLs:
URLURL TypeDescription ItemQueueing Systems Journal
Zocca, Alessandro0000-0001-6585-4785
Additional Information:© 2018 is held by author/owner(s). The author is supported by NWO Rubicon grant 680.50.1529 and is grateful to S.C. Borst and J.S.H. van Leeuwaarden for the precious feedback on the early stages of this work.
Funding AgencyGrant Number
Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)680.50.1529
Subject Keywords:CSMA algorithm, throughput analysis, Markov chain, hitting times, mixing times
Record Number:CaltechAUTHORS:20190128-081318359
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92488
Deposited By: Tony Diaz
Deposited On:29 Jan 2019 20:06
Last Modified:29 Jan 2019 20:06

Repository Staff Only: item control page