The wireless network jamming problem

详细信息    查看全文

• 作者：Clayton W. Commander ; Panos M. Pardalos ; Valeriy Ryabchenko ; Stan Uryasev and Grigoriy Zrazhevsky
• 关键词：Network interdiction ; Integer programming ; Jamming ; NP ; hard ; Percentile constraints
• 刊名：Journal of Combinatorial Optimization
• 出版年：2007
• 出版时间：November, 2007
• 年：2007
• 卷：14
• 期：4
• 页码：481-498
• 全文大小：798 KB
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Combinatorics
  Convex and Discrete Geometry
  Mathematical Modeling and IndustrialMathematics
  Theory of Computation
  Optimization
  Operation Research and Decision Theory
  
• 出版者：Springer Netherlands
• ISSN：1573-2886

文摘

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.