基于贝叶斯联盟博弈的无线通信物理层安全研究

发布时间：2018-10-24 16:03

【摘要】：在多窃听节点存在的无线通信中,协作通信有效改善物理层数据的安全传输。然而,由于无线网络中节点的移动特性,联盟内节点的行为表现为完全协作节点和不完全协作节点。在联盟形成中,无线网络节点对潜在协作者的行为不完全可知。在节点行为不确定的情况下,为了形成稳定的联盟结构,本文引入基于可能存在的网络环境进行信息分割的贝叶斯联盟博弈理论,基于网络环境进行信息分割,节点之间通过订制合同,来处理不完全信息下的安全收益。本文提出贝叶斯联盟形成算法,得到满足纳什稳定和公正条件的贝叶斯核。建立信念更新机制,估测节点的协作行为和可能无线网络环境的存在概率。引入离散马尔科夫链模型,验证联盟结构的稳定性。仿真结果表明,运用贝叶斯联盟形成算法,分析得到的不完全信息下的联盟结构与完全信息下的联盟结构相同,有效地实现了在移动节点行为和节点自私行为未知的条件下,实时估测节点行为,动态调整联盟结构,最大化联盟内节点的安全效益。联盟中的协作中继帮助其他成员转发接收到的信息,即使在有窃听节点的网络环境中,也能改善联盟的安全性能。然而,自私中继会拒绝或者使用部分功率转发联盟内其他成员的数据,降低联盟的安全性能。并且节点的自私行为是不确定的。该论文提出的贝叶斯联盟形成算法可以估测潜在协作者的自私行为,分析联盟形成。节点的自私行为通过自私度来表征,直接影响联盟的总体收益。仿真结果发现了导致联盟结构动态调整的自私门限。
[Abstract]:In wireless communication with multiple eavesdropping nodes, cooperative communication can effectively improve the secure transmission of physical layer data. However, due to the mobility of nodes in wireless networks, the behavior of nodes in the alliance is expressed as full cooperative nodes and incomplete cooperative nodes. In the formation of alliance, the behavior of wireless network nodes to potential collaborators is not fully known. In order to form a stable alliance structure under the uncertain behavior of nodes, this paper introduces Bayesian game theory of information segmentation based on the possible network environment, and carries out information segmentation based on the network environment. The security benefits under incomplete information are handled by custom contracts between nodes. In this paper, a Bayesian alliance formation algorithm is proposed, and the Bayesian kernel satisfying Nash stability and fairness conditions is obtained. A belief updating mechanism is established to estimate the cooperative behavior of nodes and the probability of existence of possible wireless network environments. The discrete Markov chain model is introduced to verify the stability of the alliance structure. The simulation results show that the alliance structure under incomplete information is the same as that under complete information by using Bayesian alliance formation algorithm, and it can be effectively realized under the condition that the mobile node behavior and the selfish behavior of the node are unknown. Real-time estimation of node behavior, dynamic adjustment of the alliance structure to maximize the security benefits of the nodes in the alliance. The cooperative relay in the alliance helps other members forward the received information. Even in the network environment with eavesdropping nodes, the security performance of the alliance can be improved. However, selfish relay may reject or use partial power to transmit the data of other members of the alliance, which reduces the security performance of the alliance. And the selfish behavior of nodes is uncertain. The Bayesian alliance formation algorithm proposed in this paper can estimate the selfish behavior of potential collaborators and analyze alliance formation. The selfish behavior of nodes is characterized by selfishness, which directly affects the overall income of the alliance. The simulation results show the selfish threshold which leads to the dynamic adjustment of the alliance structure.
【学位授予单位】：天津大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN918;O225

【相似文献】