Efficient and robust communication topologies for distributed decision making in networked systems

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2009, Pages 3751-3756

  Baras, John S ^a   Hovareshti, Pedram ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; DECISION MAKING; ROBUSTNESS (CONTROL SYSTEMS); TREES (MATHEMATICS);

AGENT-TO-AGENT COMMUNICATIONS; COMBINATORIAL PROBLEM; COMMUNICATION STRUCTURES; COMMUNICATION TOPOLOGIES; CONNECTIVITY CONSTRAINTS; CONVEX OPTIMIZATION PROBLEMS; DISTRIBUTED DECISION MAKING; NUMBER OF SPANNING TREES;

TOPOLOGY;

EID: 77950845948     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2009.5400448     Document Type: Conference Paper

References (28)

1. D. Babic, D. J. Klein, I. Lukovits, S. Nikolic, and N. Trinajstic. Resistance-distance matrix: a computational algorithm and its application. International Journal of Quantum Chemistry, 90:166-176, 2002.
2. J. S. Baras and P. Hovareshti. Effects of topology in networked systems: Stochastic methods and small worlds. Proceedings of 47th IEEE Conference on Decision and Control, pages 2973-2978, 2008.
3. J. S. Baras and P. Hovareshti. Efficient and robust communication topologies for distributed decision making in networked systems. Technical report, ISR, University of Maryland, Available at http://www.lib.umd.edu/drum/ handle/1903/4376, 2009.
4. J. S. Baras and T. Jiang. Cooperative games, phase transitions on graphs and distributed trust in manet. Proceedings of 43rd IEEE Conference on Decision and Control, 1:93-98, 2004.
5. D. Bertsekas. Nonlinear programming. Athena scientific, 1999.
6. F. R. K. Chung. Spectral graph theory. American mathematical society, 1997.
7. C. J. Colbourn. The combinatorics of network reliability. Oxford University Press, 1987.
8. A. K. Das and M. Mesbahi. K-node connected power efficient topologies in wireless networks: asemidifinite programming approach. Proceedings of the IEEE Global Telecommunications Conference, Globecom, 1:CD-ROM, 2005.
9. A. Ghosh and S. Boyd. Growing well-connected graphs. Proceedings of the 45th IEEE Conference on Decision and Control, pages 6605-6611, 2006.
10. A. Ghosh, S. Boyd, and A. Saberi. Minimizing effective resistance of a graph. Proceedings of the 17th International symposium on the Mathematical Theory of Networks and Systems(MTNS), pages 1185-1196, 2006.
11. C. Godsil and G. Royle. Algebraic graph theory. Springer Graduate texts in Mathematics, Newyork, 2001.
12. N. Goyal, L. Rademacher, and S. Vempala. Expanders via random spanning trees. Proceedings of SODA 2009, pages 576-585, 2009.
13. D. J. Higham. A matrix perturbation view of the small world phenomenon. Siam Journal on Matrix Analysis and Applications, 25(2):429-444, 2003.
14. S. Hoory, N. Linial, and A. Widgerson. Expander graphs and their applications. Bulletin Of the AMS, 43(4):439-561, 2006.
15. P. Hovareshti, J. S. Baras, and V. Gupta. Average consensus over small world networks: A probabilistic framework. Proceedings of 48th IEEE Conference on Decision and Control, pages 375-380, 2008.
16. D. Jakobson and I. Rivin. Extremal metrics on graphs i. Forum Math, 14(1):147-163, 2002.
17. A. K. Kelmans. Comparison of graphs by their number of spanning trees. Discrete Mathematics, 16:241-261, 1976.
18. A. K. Kelmans. On graphs with maximum number of spanning trees. Random structures and Algorithms, 9:177-192, 1996.
19. A.K. Kelmans. Transformations of a graph increasing its laplacian polynomial and number of spanning trees. European Journal of Combinatorics, 18:35-48, 1997.
20. G. Mahoney, W. J. Myrvold, and G. C. Shoja. Generic reliability trust model. Proc. of the 3rd conf. on privacy, security and trust, 2005.
21. R. Olfati-Saber. Ultrafast consensus in small-world networks. Proceedings of American Control Conference, 4:2371-2378, 2005.
22. D. P. Spanos and R.M. Murray. Robust connectivity of networked vehicles. Proceedings of the 43rd IEEE Conference on Decision and Control, 3:2893-2898, 2004.
23. A. Tahbaz-Salehi and A. Jadbabaie. Small world phenomenon, rapidly changing markov chains, and average consensus algorithm. Proc. of 46th IEEE Conference on Decision and Control, pages 276-281, 2007.
24. G. Theodorakopoulos and J. S. Baras. On trust models and trust evaluation metrics for ad-hoc networks. IEEE Journal on Selected Areas in Communications (JSAC), 24:318-328, 2006.
25. F. P. Tsen, T. Sung, M. Lin, L. Hsu, and W. Myrvold. Finding the most vital edges with respect to the number of spanning trees. IEEE Transactions on Reliability, 43:600-602, 1994.
26. D.J. Watts and S.H. Strogatz. Collective dynamics of small-world networks. Nature, 393:440-442, 1998.
27. G. Weichenberg, V. W. S. Chan, and M. Medard. Highly-reliable topological architecture for networks under stress. IEEE Journal on Selected Areas in Communication, 22:1830-1845, 2004.
28. M. M. Zavlanos and G. J. Papas. Controlling connectivity of dynamic graphs. Proceedings of the 44th IEEE Conference on Decision and Control, pages 6388-6393, 2005.