Optimal topological design for distributed estimation over sensor networks
From MaRDI portal
Publication:497910
DOI10.1016/j.ins.2013.07.012zbMath1337.68030MaRDI QIDQ497910
Chunguang Li, Cuili Yang, Ying Liu, Wallace Kit-Sang Tang
Publication date: 25 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.07.012
optimization; tabu search; greedy algorithm; network topology; sensor network; distributed estimation
68M10: Network design and communication in computer systems
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Distributed parameter estimation in unreliable WSNs: quantized communication and asynchronous intermittent observation, Quantitative function and algorithm for community detection in bipartite networks, An efficient local search framework for the minimum weighted vertex cover problem, Convergence rate on periodic gossiping
Cites Work
- Unnamed Item
- Distributed estimation over complex networks
- Ramanujan graphs
- Emergence of Scaling in Random Networks
- Eigenvalues of the Laplacian of a graph∗
- Tabu Search—Part I
- Tabu Search—Part II
- Incremental Adaptive Strategies Over Distributed Networks
- Diffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance Analysis
- Sensor Networks With Random Links: Topology Design for Distributed Consensus
- Diffusion Least-Mean Squares With Adaptive Combiners: Formulation and Performance Analysis
- Diffusion LMS Strategies for Distributed Estimation
- Diffusion Sparse Least-Mean Squares Over Networks
- Diffusion Information Theoretic Learning for Distributed Estimation Over Network
- Characterizing the Synchronizability of Small-World Dynamical Networks
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Efficient rewirings for enhancing synchronizability of dynamical networks
- Collective dynamics of ‘small-world’ networks
