2017 IEEE International Conference on Communications (ICC) 2017
DOI: 10.1109/icc.2017.7997468
|View full text |Cite
|
Sign up to set email alerts
|

Fast algorithms for jammer placement to partition a wireless network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 20 publications
0
3
0
Order By: Relevance
“…Let g i ∶ R → R, 1 ≤ i ≤ M , be convex functions with the set of critical points C gi , ∀i. 3 Function q = min(g 1 , ⋯, g M ) is a piecewise convex function, for which the set of critical points C q is given by:…”
Section: Jammer Placement In Dual-hop Settingmentioning
confidence: 99%
See 2 more Smart Citations
“…Let g i ∶ R → R, 1 ≤ i ≤ M , be convex functions with the set of critical points C gi , ∀i. 3 Function q = min(g 1 , ⋯, g M ) is a piecewise convex function, for which the set of critical points C q is given by:…”
Section: Jammer Placement In Dual-hop Settingmentioning
confidence: 99%
“…Optimal jammer placement has been studied in the context of network partitioning in wireless networks, e.g., [2], [3]. In these works, the authors investigate the effective jammer positioning to partition a wireless network into multiple residual sub-networks with a constraint on the number of jammers.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation