Abstract
This paper describes a problem of interdicting/jamming wireless communication networks in uncertain environments. Jamming communication networks is an important problem with many applications, but has received relatively little attention in the literature. Most of the work on network interdiction is focused on preventing jamming and analyzing network vulnerabilities. Here, we consider the case where there is no information about the network to be jammed. Thus, the problem is reduced to jamming all points in the area of interest. The optimal solution will determine the locations of the minimum number of jamming devices required to suppress the network. We consider a subproblem which places jamming devices on the nodes of a uniform grid over the area of interest. The objective here is to determine the maximum grid step size. We derive upper and lower bounds for this problem and provide a convergence result. Further, we prove that due to the cumulative effect of the jamming devices, the proposed method produces better solutions than the classical technique of covering the region with uniform circles.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Commander, C., Pardalos, P., Ryabchenko, V., Uryasev, S.: The wireless network jamming problem. J. Comb. Optim. (submitted)
Cormican K., Morton D., Wood R. (1998). Stochastic network interdiction. Oper. Res. 46(2): 184–197
Farago, A.: Graph theoretic analysis of ad hoc network vulnerability. In: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt ’03) (2003)
Held H., Hemmecke R., Woodruff D. (2005). A decomposition algorithm applied to planning the interdiction of stochastic networks. Naval Res. Logistics 52(4): 321–329
Israeli E., Wood R. (2002). Shortest-path network interdiction. Networks 40(2): 97–111
Kershner R. (1939). The number of circles covering a set. Am. J. Math. 61(3): 665–671
Noubir, G.: On connectivity in ad hoc networks under jamming using directional antennas and mobility. Lecture Notes in Computer Science, vol. 2957 pp. 186–200. Springer, Berlin Heidelberg New York (2004)
Resende M., Pardalos P. (2006). Handbook of Optimization in Telecommunications. Springer, Berlin Heidelberg New York
Wood K. (1993). Deterministic network interdiction. Math. Comput. Model. 17(2): 1–18
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Commander, C.W., Pardalos, P.M., Ryabchenko, V. et al. Jamming communication networks under complete uncertainty. Optimization Letters 2, 53–70 (2008). https://doi.org/10.1007/s11590-006-0043-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-006-0043-0