Plug-and-Play Network Reconfiguration Algorithms to Maintain Regularity and Low Network Reconfiguration Needs

Sonja Studli; Yamin Yan; Maria M. Seron; Richard H. Middleton

doi:10.1109/LCSYS.2022.3185676

Plug-and-Play Network Reconfiguration Algorithms to Maintain Regularity and Low Network Reconfiguration Needs

Sonja Studli^*, Yamin Yan, Maria M. Seron, Richard H. Middleton

^*Corresponding author for this work

Department of Electronic and Computer Engineering

Research output: Contribution to journal › Journal Article › peer-review

3 Citations (Scopus)

Abstract

In this letter we propose algorithms to connect and disconnect nodes to/from an existing graph, which are able to maintain the regularity of a graph while requiring minimal reconfiguration of the network. Further, simulations suggest that the algorithms maintain a minimum bound on the algebraic connectivity of the graph. These properties of the algorithms suit their use in plug-and-play networks.

Original language	English
Pages (from-to)	3451-3456
Number of pages	6
Journal	IEEE Control Systems Letters
Volume	6
DOIs	https://doi.org/10.1109/LCSYS.2022.3185676
Publication status	Published - 2022

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Keywords

Control of networks
Networked control systems

Access to Document

10.1109/LCSYS.2022.3185676

Cite this

@article{05d1b592df2841cab6b11b456dc648b4,

title = "Plug-and-Play Network Reconfiguration Algorithms to Maintain Regularity and Low Network Reconfiguration Needs",

abstract = "In this letter we propose algorithms to connect and disconnect nodes to/from an existing graph, which are able to maintain the regularity of a graph while requiring minimal reconfiguration of the network. Further, simulations suggest that the algorithms maintain a minimum bound on the algebraic connectivity of the graph. These properties of the algorithms suit their use in plug-and-play networks.",

keywords = "Control of networks, Networked control systems",

author = "Sonja Studli and Yamin Yan and Seron, \{Maria M.\} and Middleton, \{Richard H.\}",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.",

year = "2022",

doi = "10.1109/LCSYS.2022.3185676",

language = "English",

volume = "6",

pages = "3451--3456",

journal = "IEEE Control Systems Letters",

issn = "2475-1456",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Plug-and-Play Network Reconfiguration Algorithms to Maintain Regularity and Low Network Reconfiguration Needs

AU - Studli, Sonja

AU - Yan, Yamin

AU - Seron, Maria M.

AU - Middleton, Richard H.

PY - 2022

Y1 - 2022

N2 - In this letter we propose algorithms to connect and disconnect nodes to/from an existing graph, which are able to maintain the regularity of a graph while requiring minimal reconfiguration of the network. Further, simulations suggest that the algorithms maintain a minimum bound on the algebraic connectivity of the graph. These properties of the algorithms suit their use in plug-and-play networks.

AB - In this letter we propose algorithms to connect and disconnect nodes to/from an existing graph, which are able to maintain the regularity of a graph while requiring minimal reconfiguration of the network. Further, simulations suggest that the algorithms maintain a minimum bound on the algebraic connectivity of the graph. These properties of the algorithms suit their use in plug-and-play networks.

KW - Control of networks

KW - Networked control systems

UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000821496100002

UR - https://openalex.org/W4285232751

UR - https://www.scopus.com/pages/publications/85133651565

U2 - 10.1109/LCSYS.2022.3185676

DO - 10.1109/LCSYS.2022.3185676

M3 - Journal Article

SN - 2475-1456

VL - 6

SP - 3451

EP - 3456

JO - IEEE Control Systems Letters

JF - IEEE Control Systems Letters

ER -

Plug-and-Play Network Reconfiguration Algorithms to Maintain Regularity and Low Network Reconfiguration Needs

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this