Eavesdropping (or Jamming) of Communication Networks

Abstract

This report presents research on optimization formulations for jamming wireless communication networks. The first chapter addresses deterministic situations which were the focus of the first research year. In particular, several formulations of the deterministic Wireless Network Jamming Problem were derived and theoretical proof of problem statements equivalences were obtained. The second year addressed situations in which a network is to be jammed, but no apriori information (i.e., topology, number of nodes, etc.) were assumed known. Proofs of upper and lower bounds on the required number of jamming devices as well as convergence results were derived. A heuristic for this setup was also proposed, During the third year the robust optimization formulation were researched. Information such as the number and placement of the communication nodes and other parameters were considered subject to some uncertainty.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 2007
Accession Number
ADA484184

Entities

People

  • Stanislav Uryasev

Organizations

  • University of Florida

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Case Studies
  • Communication Networks
  • Communication Systems
  • Computations
  • Improvised Explosive Devices
  • Integer Programming
  • Linear Programming
  • Mathematical Models
  • Mathematical Programming
  • Omnidirectional Antennas
  • Operating Systems
  • Optimization
  • Probability
  • Random Variables
  • Wireless Communications
  • Wireless Networks

Readers

  • Computer Networking
  • Radio communications and signal processing.
  • Statistical inference.