A robust decentralized control for channel sharing communication
(2017) In IEEE Transactions on Control of Network Systems 4(2). p.336-346- Abstract
- 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... (More)
- 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.
(Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/a4636094-99d2-4dd9-a8cf-7caad9ac527d
- author
- Blanchini, F. ; Casagrande, D. ; Giordano, G. LU and Montessoro, P.
- publishing date
- 2017
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Asymptotic stability, Delays, Eigenvalues and eigenfunctions, Network topology, Robustness, Switches, Distributed control, Lyapunov Functions, Switching, Transmission control
- in
- IEEE Transactions on Control of Network Systems
- volume
- 4
- issue
- 2
- pages
- 11 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- scopus:85027519036
- ISSN
- 2325-5870
- DOI
- 10.1109/TCNS.2015.2502025
- language
- English
- LU publication?
- no
- id
- a4636094-99d2-4dd9-a8cf-7caad9ac527d
- date added to LUP
- 2016-11-26 14:46:00
- date last changed
- 2022-02-14 06:59:00
@article{a4636094-99d2-4dd9-a8cf-7caad9ac527d,
abstract = {{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.<br/>}},
author = {{Blanchini, F. and Casagrande, D. and Giordano, G. and Montessoro, P.}},
issn = {{2325-5870}},
keywords = {{Asymptotic stability; Delays; Eigenvalues and eigenfunctions; Network topology; Robustness; Switches; Distributed control; Lyapunov Functions; Switching; Transmission control}},
language = {{eng}},
number = {{2}},
pages = {{336--346}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
series = {{IEEE Transactions on Control of Network Systems}},
title = {{A robust decentralized control for channel sharing communication}},
url = {{http://dx.doi.org/10.1109/TCNS.2015.2502025}},
doi = {{10.1109/TCNS.2015.2502025}},
volume = {{4}},
year = {{2017}},
}