The wireless network jamming problem

DOI10.1007/S10878-007-9071-7zbMATH Open1149.90124OpenAlexW2037102865MaRDI QIDQ2426656FDOQ2426656

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

Publication date: 23 April 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9071-7

Recommendations

• The wireless network jamming problem subject to protocol interference
• Robust wireless network jamming problems
• Wireless LAN transmitter location under the threat of jamming attacks
• scientific article; zbMATH DE number 1756641
• Countermeasures against radio jamming attacks in wireless sensor networks
• Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization
• Interference in large wireless networks
• scientific article; zbMATH DE number 5639847

zbMATH Keywords

NP-hardInteger programmingJammingNetwork interdictionPercentile constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• Introduction to the theory of probabilistic functions and percentiles (value-at-risk)
• Title not available (Why is that?)
• Three Problems in Search of a Measure

Cited In (27)

• Time-Varying Semidefinite Programs
• Solving the Distance-Based Critical Node Problem
• A representation of risk measures
• Some applications of polynomial optimization in operations research and real-time decision making
• Component-cardinality-constrained critical node problem in graphs
• Wireless LAN transmitter location under the threat of jamming attacks
• Optimal detection of critical nodes: improvements to model structure and performance
• Duopoly signal jamming
• Complexity of the critical node problem over trees
• Detecting critical nodes in sparse graphs
• The wireless network jamming problem subject to protocol interference
• Mathematical programming techniques for sensor networks
• Robust critical node selection by Benders decomposition
• Title not available (Why is that?)
• Title not available (Why is that?)
• A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
• Radio communications interdiction problem under deterministic and probabilistic jamming
• Conditional value‐at‐risk beyond finance: a survey
• Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization
• A Lagrangean-based heuristics for the target covering problem in wireless sensor network
• Jamming communication networks under complete uncertainty
• The critical node game
• Robust wireless network jamming problems
• Polynomial-time identification of robust network flows under uncertain arc failures
• Obtaining approximately optimal and diverse solutions via dispersion
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
• The critical node detection problem in networks: a survey

This page was built for publication: The wireless network jamming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2426656)