检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张玲玲 吴军 印新棋 白光伟 ZHANG Ling-ling;WU Jun;YIN Xin-qi;BAI Guang-wei(College of Computer Science and Technology,Nanjing Tech University,Nanjing 211816,China)
机构地区:[1]南京工业大学计算机科学与技术学院
出 处:《计算机工程与设计》2019年第10期2757-2764,共8页Computer Engineering and Design
基 金:国家自然科学基金项目(60673185、61073197)
摘 要:在保证网络安全的前提下,对无线Mesh网络机会路由下弱可信节点的共存问题进行研究,提出一种基于举报机制和马尔科夫预测的弱可信节点共存机制(RM-CM)。基于信任模型,引入举报机制,举报节点的信任值,形成节点信任度,筛选出弱可信节点。使用马尔科夫预测方法预测其行为趋势,形成节点共存度,研判节点共存参与路由传输。实验结果表明,该机制可以明显提高弱可信节点的共存度和网络的通信流量、降低网络时延、减少路由传输跳数等。On the premise of ensuring network security,the coexistence of weak-trusted nodes under opportunistic routing in wireless mesh networks was studied,and the coexistence mechanism of weak-trusted nodes(RM-CM)based on reporting mechanism and Markov prediction was proposed.Based on the trust model,the reporting mechanism was introduced to report the trust value of the node,which formed the node reliability and filtered out the weak-trusted nodes.The Markov prediction method was used to predict the behavior trend,and the node coexistence degree was formed to judge whether the nodes could be used in routing transmission or not.The results show that the proposed mechanism can significantly improve the coexistence degree of weak-trusted nodes,increase network traffic,reduce network delay,and reduce the number of routing transmission hops.
关 键 词:无线MESH网络 机会路由 举报机制 弱可信节点 节点信任度 节点共存度 马尔科夫预测 共存机制
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49