.png){kind=icon}
返回
Self-Organizing Hit Avoidance in Distributed Frequency Hopping Multiple Access Networks
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2774812.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we investigate the frequency hit avoidance problem in distributed frequency hopping multiple access (FHMA) networks, in which each user intends to avoid the frequency hit with others by choosing the appropriate frequency set and frequency hopping sequence. First, we define the network hit degree as the metric for the hits, and formulate the frequency hit avoidance problem as an optimization problem of the network hit degree. Second, we formulate a non-cooperative game model to solve this optimization problem, and prove the game is an exact potential game, which illustrates that the Nash equilibria (NE) point of the game is the optimal solution of the optimization problem. Finally, we propose a fragment-based distributed hit avoidance (FDHA) learning algorithm and prove that the learning algorithm can converge to the NE point. The simulation results show that the proposed algorithm can converge to the optimal solution rapidly such that the FHMA network is hit-free.
Keyword:
Distributed frequency hopping multiple access network
multiple users
hit avoidance
potential game
game-theoretic learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏Distributed Channel Selection in Time-Varying Radio Environment: Interference Mitigation Game With Uncoupled Stochastic Learning时变无线电环境中的分布式信道选择: 具有非耦合随机学习的干扰缓解游戏
PREAI
分享收藏
分享收藏
查看更多内容