Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/152098
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMeng, Minen_US
dc.contributor.authorLi, Xiuxianen_US
dc.contributor.authorXiao, Gaoxien_US
dc.date.accessioned2021-09-08T01:48:13Z-
dc.date.available2021-09-08T01:48:13Z-
dc.date.issued2020-
dc.identifier.citationMeng, M., Li, X. & Xiao, G. (2020). Synchronization of networks over finite fields. Automatica, 115, 108877-. https://dx.doi.org/10.1016/j.automatica.2020.108877en_US
dc.identifier.issn0005-1098en_US
dc.identifier.urihttps://hdl.handle.net/10356/152098-
dc.description.abstractIn this paper, the synchronization problem for networks over finite fields is investigated, which is a generalization of consensus and provides a new perspective for networks of agents with limited capacities of memory and communication. It is assumed that the states and communication weights can only attain values from a finite alphabet equipped with a prime number of integers, termed finite fields, and operations are processed relying on modular arithmetic. For this synchronization problem, necessary and sufficient conditions are derived based on the transition graph of the studied network. The large number of nodes in the transition graph, dependent on the numbers of integers in finite fields and the agents, may lead to high computational cost and difficulties in verifying synchronization. To avoid this, an equivalent condition for synchronization of networks is provided by the characteristic polynomial of the studied network matrix. Furthermore, in a synchronized network over finite fields, the periodic behavior can be determined by the network matrix and the initial state.en_US
dc.description.sponsorshipMinistry of Education (MOE)en_US
dc.language.isoenen_US
dc.relationMOE2016-T2-1-119en_US
dc.relation.ispartofAutomaticaen_US
dc.rights© 2020 Elsevier Ltd. All rights reserved.en_US
dc.subjectEngineering::Electrical and electronic engineeringen_US
dc.titleSynchronization of networks over finite fieldsen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.identifier.doi10.1016/j.automatica.2020.108877-
dc.identifier.scopus2-s2.0-85079033324-
dc.identifier.volume115en_US
dc.identifier.spage108877en_US
dc.subject.keywordsSynchronizationen_US
dc.subject.keywordsNetworksen_US
dc.description.acknowledgementThe work was partially supported by Ministry of Education, Singapore under contract of MOE2016-T2-1-119.en_US
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:EEE Journal Articles

Page view(s)

97
Updated on May 17, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.