2020
DOI: 10.1109/tvt.2020.3018121
|View full text |Cite
|
Sign up to set email alerts
|

Convert Harm Into Benefit: A Coordination-Learning Based Dynamic Spectrum Anti-Jamming Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
2

Relationship

4
4

Authors

Journals

citations
Cited by 29 publications
(20 citation statements)
references
References 36 publications
0
20
0
Order By: Relevance
“…The proposed optimization problem is a joint optimization problem in decentralized scenario, in which there exists a huge strategy space. Game theory has been widely used in resource optimizations of distributed wireless networks due to its low computational complexity and well effectiveness [47]- [52]. Hence, the offloading game model is formulated as (24) in which M is the set of coalitions, N is the set of UAV members and U m,i is the utility function of n m,i .…”
Section: A Game Modelmentioning
confidence: 99%
“…The proposed optimization problem is a joint optimization problem in decentralized scenario, in which there exists a huge strategy space. Game theory has been widely used in resource optimizations of distributed wireless networks due to its low computational complexity and well effectiveness [47]- [52]. Hence, the offloading game model is formulated as (24) in which M is the set of coalitions, N is the set of UAV members and U m,i is the utility function of n m,i .…”
Section: A Game Modelmentioning
confidence: 99%
“…Proof The proof by contradiction is applied for the multi-leader sub-game [26]. Assume that strategy combination (A * 1 , • • • A * H ) is not the NE, which means ∃h ∈ H that satisfies U h (A * h , A j ) < U h (A h , A j ).…”
Section: Definition 2 the Strategy Combinationmentioning
confidence: 99%
“…Note that there are some existing works that investigated the anti-jamming problem using game-theoretic framework [17,26]. The main differences are summarized as follows: As mentioned in Section I, the authors in [17]proposed a one-leader multi-follower Bayesian Stackelberg game, and the closed-form of the SE was derived.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…And the optimization problem in these works is often difficult to resolve with traditional optimization methods. Hence, to solve the above problem, we exploit secure channel access by channel switching [27][28][29][30] and propose a two-stage task and resource assignment method that exploits convex optimization theory [31] and fading memory joint strategy fictitious play with inertia (FM-JSFP) [32] to formulate the problem and resolve it.…”
Section: Researchmentioning
confidence: 99%