Advanced Search

Show simple item record

dc.contributor.authorTanerguclu, Turker
dc.contributor.authorKarasan, Oya Ekin
dc.contributor.authorAkgun, Ibrahim
dc.contributor.authorKarasan, Ezhan
dc.date.accessioned2021-03-24T10:46:15Z
dc.date.available2021-03-24T10:46:15Z
dc.date.issued2019en_US
dc.identifier.issn1873-765X
dc.identifier.issn1873-765X
dc.identifier.urihttps://doi.org/10.1016/j.cor.2019.03.013
dc.identifier.urihttps://hdl.handle.net/20.500.12573/614
dc.descriptionThe Scientific and Technical Research Council of Turkey (TUBITAK) is acknowledged for granting Ttirker Tanergticlii an International Doctoral Research Scholarship in the framework of TUBITAK-BIDEB 2214-A grant.en_US
dc.description.abstractThe Radio Communications Interdiction Problem (RCIP) seeks to identify the locations of transmitters on the battlefield that will lead to a robust radio communications network by anticipating the effects of intentional radio jamming attacks used by an adversary during electronic warfare. RCIP is a sequential game defined between two opponents that target each other's military units in a conventional warfare. First, a defender locates a limited number of transmitters on the defender's side of the battlefield to optimize the relay of information among its units. After observing the locations of radio transmitters, an attacker locates a limited number of radio jammers on the attacker's side to disrupt the communication network of the defender. We formulate RCIP as a binary bilevel (max-min) programming problem, present the equivalent single level formulation, and propose an exact solution method using a decomposition scheme. We enhance the performance of the algorithm by utilizing dominance relations, preprocessing, and initial starting heuristics. To reflect a more realistic jamming representation, we also introduce the probabilistic version of RCIP where a jamming probability is associated at each receiver site as a function of the prevalent jamming to signal ratios leading to an expected coverage of receivers as an objective function. We approximate the nonlinearity in the jamming probability function using a piecewise linear convex function and solve this version by adapting the decomposition algorithm constructed for RCIP. Our extensive computational results on realistic scenarios show the efficacy of the solution approaches and provide valuable tactical insights. (C) 2019 Elsevier Ltd. All rights reserved.en_US
dc.description.sponsorshipTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) TUBITAK-BIDEB 2214-Aen_US
dc.language.isoengen_US
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLANDen_US
dc.relation.isversionof10.1016/j.cor.2019.03.013en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectTactical military radio communicationsen_US
dc.subjectElectronic warfareen_US
dc.subjectBilevel programmingen_US
dc.subjectInterdictionen_US
dc.subjectDefender-attacker problemen_US
dc.titleRadio Communications Interdiction Problem under deterministic and probabilistic jammingen_US
dc.typearticleen_US
dc.contributor.departmentAGÜ, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.contributor.authorID0000-0001-6325-7741en_US
dc.identifier.volumeVolume: 107en_US
dc.identifier.startpage200en_US
dc.identifier.endpage217en_US
dc.relation.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.relation.tubitakTUBITAK-BIDEB 2214-A
dc.relation.publicationcategoryMakale - Uluslararası - Editör Denetimli Dergien_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record