The wireless network jamming problem

Clayton W. Commander; Panos M. Pardalos; Valeriy Ryabchenko; Stan Uryasev; Grigoriy Zrazhevsky

doi:10.1007/s10878-007-9071-7

The wireless network jamming problem

Clayton W. Commander
, Panos M. Pardalos
, Valeriy Ryabchenko
, Stan Uryasev
, Grigoriy Zrazhevsky

Applied Mathematics and Statistics

University of Florida

Research output: Contribution to journal › Article › peer-review

65 Scopus citations

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.

Original language	English
Pages (from-to)	481-498
Number of pages	18
Journal	Journal of Combinatorial Optimization
Volume	14
Issue number	4
DOIs	https://doi.org/10.1007/s10878-007-9071-7
State	Published - Nov 2007

Keywords

Integer programming
Jamming
Network interdiction
NP-hard
Percentile constraints

Access to Document

10.1007/s10878-007-9071-7

Cite this

@article{5ab6423e7be8447e85b37790a1c7ed9a,

title = "The wireless network jamming problem",

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 = "Integer programming, Jamming, Network interdiction, NP-hard, Percentile constraints",

author = "Commander, \{Clayton W.\} and Pardalos, \{Panos M.\} and Valeriy Ryabchenko and Stan Uryasev and Grigoriy Zrazhevsky",

year = "2007",

month = nov,

doi = "10.1007/s10878-007-9071-7",

language = "English",

volume = "14",

pages = "481--498",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

number = "4",

}

TY - JOUR

T1 - The wireless network jamming problem

AU - Commander, Clayton W.

AU - Pardalos, Panos M.

AU - Ryabchenko, Valeriy

AU - Uryasev, Stan

AU - Zrazhevsky, Grigoriy

PY - 2007/11

Y1 - 2007/11

N2 - 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.

AB - 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.

KW - Integer programming

KW - Jamming

KW - Network interdiction

KW - NP-hard

KW - Percentile constraints

UR - https://www.scopus.com/pages/publications/34848876390

U2 - 10.1007/s10878-007-9071-7

DO - 10.1007/s10878-007-9071-7

M3 - Article

AN - SCOPUS:34848876390

SN - 1382-6905

VL - 14

SP - 481

EP - 498

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 4

ER -

The wireless network jamming problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this