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>
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-111461 |
| Date | January 2012 |
| Creators | Ramesh, Chithrupa, Sandberg, Henrik, Johansson, Karl Henrik |
| Publisher | KTH, Reglerteknik, KTH, ACCESS Linnaeus Centre, KTH, Reglerteknik, KTH, ACCESS Linnaeus Centre, KTH, Reglerteknik, KTH, ACCESS Linnaeus Centre |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Conference paper, info:eu-repo/semantics/conferenceObject, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | Decision and Control (CDC), 2012 IEEE 51st Annual Conference on, p. 7205-7211 |
Page generated in 0.0021 seconds