Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity
- Additional Document Info
- View All
This article addresses a problem of synthesizing robust networks in the presence of constraints which limit the maximum number of links that connect any two nodes in the network. This problem arises in surveillance and monitoring applications where wireless sensor networks have to be deployed to collect and exchange time sensitive information among the vehicles. This network synthesis problem is formulated as a mixed-integer, semi-definite program, and an algorithm for finding the optimal solution is developed based on cutting plane and bisection methods. Computational results are presented to corroborate the performance of the proposed algorithm. © Springer Science+Business Media New York 2012.
author list (cited authors)
Nagarajan, H., Rathinam, S., Darbha, S., & Rajagopal, K.