Detecting and Jamming Dynamic Communication Networks in Anti-Access Environments
Stan Uryasev, Pãnos M. Pardalos · 2011
Abstract : Three chapters present methods for handling various optimization problems related to sensors networks. The first chapter investigates mathematical programming techniques for solving a class of multi-sensor scheduling problems. We conducted several case studies and investigated the performance of robust optimization solvers for considered 0-1 linear programming problems. The second chapter presents a survey describing recent developments in the area of mathematical programming techniques for various types of sensor network applications. The corresponding mathematical programming formulations and solving methods are discussed. The third chapter considers several classes of problems that deal with optimizing the performance of dynamic sensor networks used for area surveillance under uncertainty with robust radio connectivity constraints. Various formulations of optimization problems and computational results are presented.