Optimal information propagation in sensor networks

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2006, Issue , 2006, Pages 3122-3127

  Yang, Peng ^a   Freeman, Randy A ^a   Lynch, Kevin M ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; INTELLIGENT AGENTS; OPTIMIZATION; PROBLEM SOLVING; SENSORS; TELECOMMUNICATION LINKS;

COMMUNICATION DELAYS; COMMUNICATION LINK WEIGHTING; CONSENSUS CONVERGENCE TIME; SENSOR NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 33845654507     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2006.1642176     Document Type: Conference Paper

References (9)

1. M. Fiedler. Algebraic connectivity of graphs. Czech. Math. J., 23, 1973.
2. R. A. Freeman, P. Yang, and K. M. Lynch. Distributed estimation and control of swarm formation statistics. In American Control Conference, 2006. To appear.
3. R. M. Gray. Toeplitz and Circulant Matrices: A Review. Available at http://ee.stanford.edu/~gray/toeplitz.pdf, 1971, revised 2002.
4. M. E. J. Newman and D. J. Watts. Renormalization group analysis of the small-world network model. Physics Letters A, 263:341, 1999.
5. R. Olfati-Saber. Ultrafast consensus in small-world networks. In American Control Conference, 2005.
6. R. Olfati-Saber and R. Murray. Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control, 49(9):1520-1533, Sep 2004.
7. F. Viger and M. Latapy. Fast generation of random connected graphs with prescribed degrees. Available at http://www.citebase.org/cgi-bin/citations?id= oai:arXiv.org:cs/0502085, 2005.
8. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-42, 1998.
9. L. Xiao and S. Boyd. Fast linear iterations for distributed averaging. Systems and Control Letters, 53:6578, Sept 2004.