CaltechAUTHORS
  A Caltech Library Service

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

Zocca, Alessandro (2019) Temporal starvation in multi-channel CSMA networks: an analytical framework. Queueing Systems, 91 (3-4). pp. 241-263. ISSN 0257-0130 . https://resolver.caltech.edu/CaltechAUTHORS:20190114-132610158

[img] PDF - Accepted Version
See Usage Policy.

507Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190114-132610158

Abstract

In this paper, we consider a stochastic model for a frequency-agile 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 analytic 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
https://doi.org/10.1007/s11134-019-09598-yDOIArticle
https://arxiv.org/abs/1808.03602arXivDiscussion Paper
https://rdcu.be/bpJeXPublisherFree ReadCube access
ORCID:
AuthorORCID
Zocca, Alessandro0000-0001-6585-4785
Additional Information:© 2019 Springer Science+Business Media, LLC, part of Springer Nature. Received: 10 November 2018; First Online: 14 January 2019. The author acknowledges the NWO Rubicon Grant 680.50.1529 and the Resnick Sustainability Institute at Caltech for the support and is grateful to Sem Borst for the discussions at the early stages of this work.
Group:Resnick Sustainability Institute
Funders:
Funding AgencyGrant Number
Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)680.50.1529
Resnick Sustainability InstituteUNSPECIFIED
Subject Keywords:Random-access networks; Performance evaluation; Throughput analysis; Markov process; Hitting times; Mixing times; Partial q-coloring
Issue or Number:3-4
Classification Code:MSC: 60J27; 60K35; 68M10; 68M20; 90B15; 90B18
Record Number:CaltechAUTHORS:20190114-132610158
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20190114-132610158
Official Citation:Zocca, A. Queueing Syst (2019) 91: 241. https://doi.org/10.1007/s11134-019-09598-y
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92253
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:22 Jan 2019 23:01
Last Modified:03 Oct 2019 20:42

Repository Staff Only: item control page