A robust decentralized control for channel sharing communication

Research output: Contribution to journalArticle

Standard

A robust decentralized control for channel sharing communication. / Blanchini, F.; Casagrande, D.; Giordano, G.; Montessoro, P.

In: IEEE Transactions on Control of Network Systems, Vol. 4, No. 2, 2017, p. 336-346.

Research output: Contribution to journalArticle

Harvard

APA

CBE

MLA

Vancouver

Author

Blanchini, F. ; Casagrande, D. ; Giordano, G. ; Montessoro, P. / A robust decentralized control for channel sharing communication. In: IEEE Transactions on Control of Network Systems. 2017 ; Vol. 4, No. 2. pp. 336-346.

RIS

TY - JOUR

T1 - A robust decentralized control for channel sharing communication

AU - Blanchini, F.

AU - Casagrande, D.

AU - Giordano, G.

AU - Montessoro, P.

PY - 2017

Y1 - 2017

N2 - We consider the problem of controlling the transmission rate in a communication network where each node adjusts its own transmission rate exclusively based on the physical medium occupation (the band occupancy of the aggregate complementary nodes). We show how to design a decentralized control for maximizing both band occupancy and fairness. If the network is fully connected, the problem admits a simple solution. Difficulties arise in the case of partially connected networks, and in the presence of time–varying network topologies and delays. General conditions are given which, by properly tuning control parameters, assure stability. These conditions are conservative and affect the system performance. However, we show that, in the case of symmetric connections, stability can be studied based on the system eigenvalues even in the presence of topology switchings. Less conservative bounds can be inferred by exploiting known properties of the eigenvalues of the adjacency matrix of a graph. We finally consider the multi–channel case, in which nodes may jump among channels: the previous scheme can be extended to this case and asymptotically ensures uniform channel exploitation.

AB - We consider the problem of controlling the transmission rate in a communication network where each node adjusts its own transmission rate exclusively based on the physical medium occupation (the band occupancy of the aggregate complementary nodes). We show how to design a decentralized control for maximizing both band occupancy and fairness. If the network is fully connected, the problem admits a simple solution. Difficulties arise in the case of partially connected networks, and in the presence of time–varying network topologies and delays. General conditions are given which, by properly tuning control parameters, assure stability. These conditions are conservative and affect the system performance. However, we show that, in the case of symmetric connections, stability can be studied based on the system eigenvalues even in the presence of topology switchings. Less conservative bounds can be inferred by exploiting known properties of the eigenvalues of the adjacency matrix of a graph. We finally consider the multi–channel case, in which nodes may jump among channels: the previous scheme can be extended to this case and asymptotically ensures uniform channel exploitation.

KW - Asymptotic stability

KW - Delays

KW - Eigenvalues and eigenfunctions

KW - Network topology

KW - Robustness

KW - Switches

KW - Distributed control

KW - Lyapunov Functions

KW - Switching

KW - Transmission control

UR - http://ieeexplore.ieee.org/document/7331623/?arnumber=7331623

U2 - 10.1109/TCNS.2015.2502025

DO - 10.1109/TCNS.2015.2502025

M3 - Article

VL - 4

SP - 336

EP - 346

JO - IEEE Transactions on Control of Network Systems

JF - IEEE Transactions on Control of Network Systems

SN - 2325-5870

IS - 2

ER -