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

Alessandro Zocca ()
Additional contact information
Alessandro Zocca: California Institute of Technology

Queueing Systems: Theory and Applications, 2019, vol. 91, issue 3, No 3, 263 pages

Abstract: 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.

Keywords: Random-access networks; Performance evaluation; Throughput analysis; Markov process; Hitting times; Mixing times; Partial q-coloring; 60J27; 60K35; 68M10; 68M20; 90B15; 90B18 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-019-09598-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:91:y:2019:i:3:d:10.1007_s11134-019-09598-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-019-09598-y

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().