Skip to main navigation Skip to search Skip to main content

Robust wireless network jamming problems

  • Clayton W. Commander
  • , Panos M. Pardalos
  • , Valeriy Ryabchenko
  • , Sergey Sarykalin
  • , Timofey Turko
  • , Stan Uryasev
  • Air Force Research Laboratory
  • University of Florida

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We extend the results presented in a previous paper which focused on deterministic formulations of the wireless network jamming problem. This problem seeks to determine the optimal number and placement locations for a set of wireless jamming devices to sufficiently suppress a communication network according to some specified criterion. We now introduce robust variants of those formulations which account for the fact that the exact topology of the network to be jammed may not be known entirely. Particularly, we consider instances in which several topologies are considered likely, and develop robust scenarios for placing jamming devices which are able to suppress the network regardless of which candidate topology is realized. We derive several formulations and include percentile constraints to account for a variety of scenarios. Case studies are presented and the results are analyzed. We conclude with directions of future research.

Original languageEnglish
Title of host publicationOptimization and Cooperative Control Strategies
Subtitle of host publicationProceedings of the 8th International Conference on Cooperative Control and Optimization
EditorsMichael Hirsch, Clayton Commander, Panos Pardalos, Robert Murphey
Pages399-416
Number of pages18
DOIs
StatePublished - 2009

Publication series

NameLecture Notes in Control and Information Sciences
Volume381
ISSN (Print)0170-8643

Fingerprint

Dive into the research topics of 'Robust wireless network jamming problems'. Together they form a unique fingerprint.

Cite this