Paper Info
Title
Distributed network topology reconstruction in presence of anonymous nodes
Abstract
This paper concerns problem of reconstructing the network topology from data propagated through the network by means of an average consensus protocol. The proposed method is based on the distributed estimation of graph Laplacian spectral properties. Precisely, the identification of the network topology is implemented by estimating both eigenvalues and eigenvectors of the consensus matrix, which is related to the graph Laplacian matrix. In this paper, we focus the exposition on the estimation of the eigenvectors since the eigenvalues estimation can be achieved based on recent results of the literature using the same kind of data. We show how the topology can be reconstructed in presence of anonymous nodes, i.e. nodes that do not disclose their ID.
Year
Venue
Keywords
2015
European Signal Processing Conference
Network topology Reconstruction,Graph Laplacian spectrum,Eigenvectors,Anonymous nodes,Average Consensus
DocType
ISSN
Citations 
Conference
2076-1465
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
Thi-Minh-Dung Tran170.94
Alain Y. Kibangou29512.01