The wireless network jamming problem

Clayton W. Commander(clayton.commandergmail.com)
Panos M. Pardalos(pardalosufl.edu)
Valeriy Ryabchenko(valeriyufl.edu)
Stan Uryasev(uryasevufl.edu)
Grigoriy Zrazhevsky(zgrigmechmat.univ.kiev.ua)

Abstract: In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for a set of jamming devices in order to neutralize a wireless communication network. This problem is known as the WIRELESS NETWORK JAMMING PROBLEM. We develop several mathematical programming formulations based on covering the communication nodes and limiting the connectivity index of the nodes. Two case studies are presented comparing the formulations with the addition of various percentile constraints. Finally, directions of further research are addressed.

Keywords: wireless networks, network jamming, integer programming, NP-hard, combinatorial optimization

Category 1: Applications -- OR and Management Sciences (Telecommunications )

Category 2: Combinatorial Optimization

Category 3: Integer Programming

Citation: Air Force Research Laboratory Technical Report # 07-11-06-332. Journal of Combinatorial Optimization, accepted February 2007.

Download: [PDF]

Entry Submitted: 02/06/2007
Entry Accepted: 02/06/2007
Entry Last Modified: 02/06/2007

Modify/Update this entry