融合信誉评估与巡查机制的WSN能量高效安全成簇算法
|
摘要
无线传感网(Wireless Sensor Network,WSN)因节点众多、通信开放、资源有限,且通常部署在无人值守区域,表现出明显的安全脆弱性。提出了基于具有能量高效特征巡查机制的WSN安全应对模式,设计了一种融合信誉评估与巡查机制的WSN安全成簇算法:首先构建簇化层次式网络模型,基于节点的剩余能量和簇质心距离选取簇头节点,提升节点能量消耗的均衡性;并建立节点信誉评估模型,通过巡查机制随机检测节点的通信行为,基于节点行为对信息安全的威胁程度,利用指数函数计算并及时更新节点的信誉值,放大性地惩罚节点的异常行为,有助于节能和快速发现恶意节点。仿真测试结果表明,算法能够均衡传感器节点的能量消耗,在不明显缩短网络生命周期的情况下,对无线传感网中恶意节点具有较高的检测速率和97%的检测率。
Wireless sensor network(WSN) holds obvious vulnerabilities in security due to its large number of nodes,open communication,limited resources,and deployment in unattended areas. A secure mode for WSN characterized by efficient energy based on the patrol mechanism is initially proposed in this paper,and a WSN securely clustering algorithm which integrates reputation evaluation and patrol mechanism is designed.Firstly,a hierarchical clustered network model is built,and the cluster head node is selected according to the residual energy of the nodes and the centroid distance of cluster to improve the balance of energy consumption of the node.Then,it establishes the model of node's reputation evaluation,randomly checks the communication behavior of nodes through the patrol mechanism,and calculates and timely updates the reputation value of nodes by exponential function according to the threat level of nodes' behavior against information security to more greatly punish any node because of its abnormal behavior,which is helpful to save energy and quickly detect any malicious nodes.The simulation test results show that the proposed algorithm can balance the energy consumption of sensor nodes,and a higher detection speed and 97% detection rate of malicious nodes in wireless sensor networks can be obtained without significantly reducing the lifetime of the network.
Wireless sensor network(WSN) holds obvious vulnerabilities in security due to its large number of nodes,open communication,limited resources,and deployment in unattended areas. A secure mode for WSN characterized by efficient energy based on the patrol mechanism is initially proposed in this paper,and a WSN securely clustering algorithm which integrates reputation evaluation and patrol mechanism is designed.Firstly,a hierarchical clustered network model is built,and the cluster head node is selected according to the residual energy of the nodes and the centroid distance of cluster to improve the balance of energy consumption of the node.Then,it establishes the model of node's reputation evaluation,randomly checks the communication behavior of nodes through the patrol mechanism,and calculates and timely updates the reputation value of nodes by exponential function according to the threat level of nodes' behavior against information security to more greatly punish any node because of its abnormal behavior,which is helpful to save energy and quickly detect any malicious nodes.The simulation test results show that the proposed algorithm can balance the energy consumption of sensor nodes,and a higher detection speed and 97% detection rate of malicious nodes in wireless sensor networks can be obtained without significantly reducing the lifetime of the network.
引文
[1]胡向东,魏琴芳,向敏.物联网安全[M].北京:科学出版社,2012:208-226.
[2] GANERIWAL S,SRIVASTAVA M B. Reputation-basedframework for high integrity sensor networks[C]//Pro-ceedings of the 2nd ACM Workshop on Security of AdHoc and Sensor Networks(SASN’04). New York:ACM,2004:66-77.
[3]肖德琴,冯健昭,杨波,等.基于无线传感器网络的信誉形式化模型[J].计算机科学,2007,34(6):84-87,100.
[4]杨光,印桂生,杨武,等.WSNs基于信誉机制的恶意节点识别模型[J].哈尔滨工业大学报,2009,41(10):159-163.
[5]王江鹏,余琴,成鸿飞.基于信誉模型的无线传感网恶意节点识别方法[J].现代商贸工业,2010,15(9):338-339.
[6]曾梅梅,蒋华,王鑫,等.一种基于灰色马尔可夫模型的信誉评测模型及其安全路由协议[J].计算机应用研究,2013,30(12):3756-3761.
[7] RAED A,MAHA A.Dynamic packet beaconing for GPSRmobile ad hoc position-based routing protocol using fuzzylogic[J].Journal of Network and Computer Applications,2015,47(1):32-46.
[8]陈柯雨,林荫宇,肖智超,等.一种能耗均衡的无线传感器网络路由算法[J].电讯技术,2017,57(11):1240-1245.
[9] ELHOSENY M,YUAN X,YU Z,et al.Balancing energyconsumption in heterogeneous wireless sensor networks u-sing genetic algorithm[J].IEEE Communications Letters,2015,19(12):2194-2197.
[10]吴正一,李健.无线传感网信誉管理机制[J].网络安全技术与应用,2014(2):120-123.
[11] LEE C S.A Study on effectiveness using security routingbased on mobile ad-hoc networks[J].International Journalof Security&Its Applications,2015,9(7):141-152.
[12]王红梅,任晓芳,赵德群,等.基于被动信任反应机制的Adhoc网络恶意节点的检测和去除[J].计算机应用研究,2015:2784-2788.
[13] SUN B,SHAN X M,WU K,et al.Anomaly detection basedsecure in-network aggregation for wireless sensor networks[J].IEEE Systems Journal,2013,7(1):13-25.
[14]刘宴兵,龚雪红,冯艳芬.基于物联网节点行为检测的信任评估方法[J].通信学报,2014,35(5):8-15.
[15]邢哲源,冯秀芳.一种基于时序信誉的WSN恶意节点检测算法[J].传感器与微系统,2015,34(7):118-120.
[2] GANERIWAL S,SRIVASTAVA M B. Reputation-basedframework for high integrity sensor networks[C]//Pro-ceedings of the 2nd ACM Workshop on Security of AdHoc and Sensor Networks(SASN’04). New York:ACM,2004:66-77.
[3]肖德琴,冯健昭,杨波,等.基于无线传感器网络的信誉形式化模型[J].计算机科学,2007,34(6):84-87,100.
[4]杨光,印桂生,杨武,等.WSNs基于信誉机制的恶意节点识别模型[J].哈尔滨工业大学报,2009,41(10):159-163.
[5]王江鹏,余琴,成鸿飞.基于信誉模型的无线传感网恶意节点识别方法[J].现代商贸工业,2010,15(9):338-339.
[6]曾梅梅,蒋华,王鑫,等.一种基于灰色马尔可夫模型的信誉评测模型及其安全路由协议[J].计算机应用研究,2013,30(12):3756-3761.
[7] RAED A,MAHA A.Dynamic packet beaconing for GPSRmobile ad hoc position-based routing protocol using fuzzylogic[J].Journal of Network and Computer Applications,2015,47(1):32-46.
[8]陈柯雨,林荫宇,肖智超,等.一种能耗均衡的无线传感器网络路由算法[J].电讯技术,2017,57(11):1240-1245.
[9] ELHOSENY M,YUAN X,YU Z,et al.Balancing energyconsumption in heterogeneous wireless sensor networks u-sing genetic algorithm[J].IEEE Communications Letters,2015,19(12):2194-2197.
[10]吴正一,李健.无线传感网信誉管理机制[J].网络安全技术与应用,2014(2):120-123.
[11] LEE C S.A Study on effectiveness using security routingbased on mobile ad-hoc networks[J].International Journalof Security&Its Applications,2015,9(7):141-152.
[12]王红梅,任晓芳,赵德群,等.基于被动信任反应机制的Adhoc网络恶意节点的检测和去除[J].计算机应用研究,2015:2784-2788.
[13] SUN B,SHAN X M,WU K,et al.Anomaly detection basedsecure in-network aggregation for wireless sensor networks[J].IEEE Systems Journal,2013,7(1):13-25.
[14]刘宴兵,龚雪红,冯艳芬.基于物联网节点行为检测的信任评估方法[J].通信学报,2014,35(5):8-15.
[15]邢哲源,冯秀芳.一种基于时序信誉的WSN恶意节点检测算法[J].传感器与微系统,2015,34(7):118-120.