首页> 外文期刊>Wireless Networks >User cooperation to mitigate the jamming in OFDMA networks
【24h】

User cooperation to mitigate the jamming in OFDMA networks

机译:用户合作减轻OFDMA网络中的干扰

获取原文
获取原文并翻译 | 示例

摘要

In this paper, jamming and anti-jamming in a time slotted orthogonal frequency division multiple access (OFDMA) are investigated. The users of the network cooperate to mitigate the jamming effect. Interactions among the network users and the jammer are modeled by a mixed integer non-cooperative generalized game which is a NP-hard problem. To relax the problem, a new algorithm is proposed based on channel state information (CSI) to determine the transmission channels and the partners of users in the network. To solve the proposed game, an optimization problem is solved for each player considering the best response of the other player. Another generalized game is proposed to model the cooperation among users of the network. The latter game is transformed to an equivalent Quasi Variational Inequality (QVI). Then, a new gradient based algorithm is proposed by utilizing the Karush-Kuhn-Tucker (KKT) conditions to find the solution of the equivalent QVI. Then, solving the latter game and substituting the best related response, the solution of the former generalized game is also obtained. The convergence of the proposed algorithms, and the uniqueness related to the solution of the both generalized games are proven. Finally, the simulation results confirm the effectiveness of the proposed approach.
机译:在本文中,研究了在时间开槽正交频分多访问(OFDMA)中的干扰和抗干扰。网络的用户协作以减轻干扰效果。网络用户和干扰器之间的交互由混合整数非协同广义游戏建模,这是一个NP难题。为了放松问题,基于信道状态信息(CSI)提出了一种新的算法,以确定网络中用户的传输信道和合作伙伴。为了解决所提出的游戏,考虑到其他玩家的最佳响应,每个玩家都解决了优化问题。建议另一个广义游戏模拟网络用户之间的合作。后一游戏被转换为等效的准分隔不等式(QVI)。然后,通过利用karush-kuhn-tucker(kkt)条件来寻找等效qvi的解决方案来提出一种新的基于梯度的算法。然后,解决后一游戏并代替最佳相关响应,也获得了前一般化游戏的解决方案。已证明所提出的算法的融合以及与两个广义游戏解决方案相关的唯一性。最后,仿真结果证实了所提出的方法的有效性。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号