Distributed Synchronization on Weakly Connected Networks

Distributed synchronization for wireless networks is based on the mutual exchange of the same chirp-signature by nodes. Collisions of these signatures drive the system toward time and (carrier) frequency synchronization using distributed consensus algorithms. This letter investigates the convergence...

Full description

Saved in:
Bibliographic Details
Published in:IEEE Communications Letters Vol. 21; no. 7; pp. 1577 - 1580
Main Authors: Denic, Stojan, Georgiou, Orestis, Spagnolini, Umberto
Format: Journal Article
Language:English
Japanese
Published: New York IEEE 01.07.2017
Institute of Electrical and Electronics Engineers (IEEE)
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algebraic connectivity
Algebraic connectivity; consensus methods; distributed inference; distributed synchronization; laplacian spectrum; Modeling and Simulation; Computer Science Applications1707 Computer Vision and Pattern Recognition; Electrical and Electronic Engineering
Asymptotic properties
Bridges
Chirp
Clusters
Collisions
consensus methods
Convergence
Distortion
distributed inference
distributed synchronization
Eigenvalues and eigenfunctions
Frequency synchronization
Laplace equations
laplacian spectrum
Links
Mean square values
Signatures
Symmetric matrices
Synchronization
Time synchronization
Topology optimization
Wireless networks
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Distributed synchronization for wireless networks is based on the mutual exchange of the same chirp-signature by nodes. Collisions of these signatures drive the system toward time and (carrier) frequency synchronization using distributed consensus algorithms. This letter investigates the convergence and the asymptotic distortion properties on noisy networks when neighboring clusters of nodes are weakly connected to each other only through a subset of nodes and bridging links. These heavily connected clusters act as macroagents, and the consensus properties of the ensemble depend on the number of bridge links between them. The convergence rate and mean square synchronization deviation are derived as functions of the number of bridge links for different examples of weakly connected noisy networks via the analytic calculation of Laplacian spectra. Our approach facilitates the study of network topology optimization for distributed synchronization.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2017.2690284