Return to search

Stability analysis of multiple state-based schedulers with CSMA

In this paper, we identify sufficient conditions for Lyapunov Mean Square Stability (LMSS) of a contention-based network of first-order systems, with state-based schedulers. The stability analysis helps us to choose policies for adapting the scheduler threshold to the delay from the network and scheduler. We show that three scheduling laws can result in LMSS: constant-probability laws and additively increasing or decreasing probability laws. Our results counter the notions that increasing probability scheduling laws alone can guarantee stability of the closed-loop system, or that decreasing probability scheduling laws are required to mitigate congestion in the network. / <p>QC 20130116</p>

Identiferoai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-111461
Date January 2012
CreatorsRamesh, Chithrupa, Sandberg, Henrik, Johansson, Karl Henrik
PublisherKTH, Reglerteknik, KTH, ACCESS Linnaeus Centre, KTH, Reglerteknik, KTH, ACCESS Linnaeus Centre, KTH, Reglerteknik, KTH, ACCESS Linnaeus Centre
Source SetsDiVA Archive at Upsalla University
LanguageEnglish
Detected LanguageEnglish
TypeConference paper, info:eu-repo/semantics/conferenceObject, text
Formatapplication/pdf
Rightsinfo:eu-repo/semantics/openAccess
RelationDecision and Control (CDC), 2012 IEEE 51st Annual Conference on, p. 7205-7211

Page generated in 0.0017 seconds