检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨宏宇[1] 韩越 YANG Hongyu;HAN Yue(College of Computer Science and Technology,Civil Aviation University of China,Tianjin 300300,China)
机构地区:[1]中国民航大学计算机科学与技术学院,天津300300
出 处:《通信学报》2019年第4期195-201,共7页Journal on Communications
基 金:国家自然科学基金民航联合研究基金资助项目(No.U1833107);国家科技重大专项基金资助项目(No.2012ZX03002002)~~
摘 要:针对无线Mesh网络安全路由机制匮乏、内部恶意节点在数据传输过程中容易产生分组丢失的问题,提出了一种基于动态信誉的无线Mesh网络安全路由机制(SRMDR)。首先,采用动态信誉机制评价节点行为,根据节点直接信誉值和推荐信誉值计算节点综合信誉值,整合节点历史综合信誉值与当前综合信誉值计算节点动态信誉值。然后,结合动态信誉机制和路由机制建立安全路由路径,将动态信誉值小于阈值的节点判定为恶意节点,并在路由过程中将其隔离。实验结果表明,与HWMP、SHaRP相比,SRMDR具有较高的恶意节点识别率,并能有效减小分组丢失率,提高网络吞吐量。Aiming at the problem that the wireless Mesh network (WMN) security routing mechanism was scarce and internal malicious nodes drop data packets during data transmission, a secure routing mechanism based on dynamic reputation (SRMDR) for wireless Mesh network was proposed. Firstly, the dynamic reputation mechanism was used to evaluate the node’s behavior, the node’s comprehensive reputation value was calculated according to the node’s direct reputation value and the recommended reputation value, and the node’s dynamic reputation value was calculated according to the node’s historical comprehensive reputation value and the current comprehensive reputation value. Then, the dynamic reputation was combined with the routing mechanism to establish secure routing paths, the nodes with a dynamic reputation value less than the threshold were determined to be malicious nodes, which were isolated during the routing process. Experimental results show that compared with HWMP and SHaRP, SRMDR has higher malicious node recognition rates, and SRMDR can effectively reduce packet loss rate and improve network throughput.
关 键 词:无线MESH网络 路由机制 恶意节点 主观逻辑 动态信誉
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.208