检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘宁[1,2] 赵中堂 管涛[1,2] LIU Ning;ZHAO Zhong-tang;GUAN Tao(School of Computer Science,Zhengzhou University of Aeronautics,Zhengzhou 450046,China;Collaborative Innovation Center for Aviation Economy Development of Henan Province,Zhengzhou 450046,China)
机构地区:[1]郑州航空工业管理学院计算机学院,郑州450046 [2]航空经济发展河南省协同创新中心,郑州450046
出 处:《光通信研究》2019年第1期59-65,共7页Study on Optical Communications
基 金:国家自然科学基金资助项目(U1504609);河南省科技厅科技计划资助项目(172102210525);河南省高等教育教学改革研究与实践资助项目(2017SJGLX400;2017SJGLX406);河南省重点研发与推广专项资助项目(182102210454)
摘 要:在移动自组织网络中节点自私性难辨,而自私节点不尽全力转发数据会降低网络的可靠性。基于此,将联合博弈论建立在动态贝叶斯框架下,形成了一种基于贝叶斯联合博弈的数据传输算法。算法首先根据各节点的信念更新值发现不良节点;然后根据不良节点预估网络环境,计算各个预估环境的联合信念概率并归一化为联合体存在概率,计算各联合体下各节点的安全效益值,得到所对应的合约;接着运用先验中期拒绝找到贝叶斯稳态合约;最后通过设置安全容量计算权值的方式惩处不良节点,保证联合体内各节点安全容量和收益最大化。仿真结果表明,与其他两种算法相比,所提算法不仅有较少的路由延迟和控制开销比,还有较高的数据包投递率,有效降低了不良节点对网络的不利影响。In self-organizing networks,nodes are less self-identical,while self-serving nodes do not do their best to forward data to reduce the reliability of the network.Based on this,the joint game theory is established in the dynamic Bayesian framework,and a data transmission algorithm based on Bayesian game is formed.The algorithm first finds out the bad nodes according to the beliefs of each node,and then calculates the joint belief probability of each predicated environment and normalizes the joint existence probability according to the prediction of the network environment by the bad nodes.Next,we calculate the security benefit values of each joint under each joint,and obtain the corresponding contract.Then we use a priori medium to refuse to find the Bayesian steady state contract.Finally,the bad nodes are punished by setting the security capacity to calculate the weights,to ensure that the security capacity and benefits of each node in the federation are maximized and the data is effectively forwarded.The simulation results show that,compared with the other two algorithms,the proposed algorithm not only has less routing delay and control overhead,but also has a higher packet delivery rate,which effectively reduces the adverse effects of the bad nodes on the network.
关 键 词:无线网络 博弈论 贝叶斯规则 纳什均衡 自私节点 惩处机制
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.16.42.17