由于移动节点间的相遇机会的不确定性,容迟网络采用机会转发机制完成分组的转发。这一机制要求节点以自愿合作的方式来完成消息转发。然而,在现实中,绝大多数的节点表现出自私行为。针对节点的自私行为,提出了基于信任蚁群的自组织路由...由于移动节点间的相遇机会的不确定性,容迟网络采用机会转发机制完成分组的转发。这一机制要求节点以自愿合作的方式来完成消息转发。然而,在现实中,绝大多数的节点表现出自私行为。针对节点的自私行为,提出了基于信任蚁群的自组织路由算法TrACO(Trust Ant Clone Optimization)。该算法利用蚁群算法基于群空间的搜索能力和快速的自适应学习特性,能够适应容迟网络动态复杂多变的网络环境。最后对TrACO进行性能仿真分析,仿真结果表明TrACO能够在较低的消息冗余度和丢弃数下获得较高的分组转发率和较低的消息传输时延,表现出较强的挫败节点自私行为的能力。展开更多
由于基于距离的位置辅助路由算法无法抵御恶意节点拒绝服务攻击(denial of service,DoS)的安全漏洞,引入信任度量,将信任模型加载到路由发现中以解决恶意节点对路由的DoS攻击.改进的基于信任的安全位置辅助路由利用节点的直接信任度和...由于基于距离的位置辅助路由算法无法抵御恶意节点拒绝服务攻击(denial of service,DoS)的安全漏洞,引入信任度量,将信任模型加载到路由发现中以解决恶意节点对路由的DoS攻击.改进的基于信任的安全位置辅助路由利用节点的直接信任度和推荐信任度来避免信任值低的恶意节点加入路由转发工作.仿真结果表明,ST-LAR(secure trust location-aided routing)能更有效地抵御恶意节点的DoS攻击,并在平均端到端时延、分组成功投递率、吞吐量等方面优于DBLAR.展开更多
With the rapid development of Internet of Things (IoT),the issue of trust in distributed routing systems has attracted more research attention.The existing trust management frameworks,however,suffer from some possible...With the rapid development of Internet of Things (IoT),the issue of trust in distributed routing systems has attracted more research attention.The existing trust management frameworks,however,suffer from some possible attacks in hostile environments,such as false accusation,collusion,on-off,and conflicting behavior.Therefore,more comprehensive models should be proposed to predict the trust level of nodes on potential routes more precisely,and to defeat several kinds of possible attacks.This paper makes an attempt to design an attack-resistant trust management model based on beta function for distributed routing strategy in IoT.Our model can evaluate and propagate reputation in distributed routing systems.We first describe possible attacks on existing systems.Our model is then proposed to establish reliable trust relations between self-organized nodes and defeat possible attacks in distributed routing systems.We also propose a theoretical basis and skeleton of our model.Finally,some performance evaluations and security analyses are provided to show the effectiveness and robustness of our model compared with the existing systems.展开更多
This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor ne...This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor networks. To reduce the influence of conflict evidences caused by malicious nods, the consistent intensity is introduced to preprocess conflict evidences before using the D-S combination rule to improve the reliability of the D-S based trust evaluation. The nodes with high trust values will be selected as the routing nodes to insure the routing security, and the trust values are used as heuristic functions of the ant colony routing algorithm. The simulation tests are conducted by using the network simulator NS2 to observe the outcomes of performance metrics of packets loss rate and average end-to-end delay etc. to indirectly evaluate the security issue under the attack of inside malicious nodes. The simulation results show that the proposed trust routing algorithm can efficiently resist malicious attacks in terms of keeping performances of the average end-to-end delay, the throughtput and the routing packet overhead under attacking from malicious nodes.展开更多
文摘由于移动节点间的相遇机会的不确定性,容迟网络采用机会转发机制完成分组的转发。这一机制要求节点以自愿合作的方式来完成消息转发。然而,在现实中,绝大多数的节点表现出自私行为。针对节点的自私行为,提出了基于信任蚁群的自组织路由算法TrACO(Trust Ant Clone Optimization)。该算法利用蚁群算法基于群空间的搜索能力和快速的自适应学习特性,能够适应容迟网络动态复杂多变的网络环境。最后对TrACO进行性能仿真分析,仿真结果表明TrACO能够在较低的消息冗余度和丢弃数下获得较高的分组转发率和较低的消息传输时延,表现出较强的挫败节点自私行为的能力。
基金supported by the National Natural Science Foundation of China under Grant No.61100219the Fundamental Research Funds for the Central Universities under Grant No.2012JBM010the Key Program of National Natural Science Foundation of China under Grant No.60833002
文摘With the rapid development of Internet of Things (IoT),the issue of trust in distributed routing systems has attracted more research attention.The existing trust management frameworks,however,suffer from some possible attacks in hostile environments,such as false accusation,collusion,on-off,and conflicting behavior.Therefore,more comprehensive models should be proposed to predict the trust level of nodes on potential routes more precisely,and to defeat several kinds of possible attacks.This paper makes an attempt to design an attack-resistant trust management model based on beta function for distributed routing strategy in IoT.Our model can evaluate and propagate reputation in distributed routing systems.We first describe possible attacks on existing systems.Our model is then proposed to establish reliable trust relations between self-organized nodes and defeat possible attacks in distributed routing systems.We also propose a theoretical basis and skeleton of our model.Finally,some performance evaluations and security analyses are provided to show the effectiveness and robustness of our model compared with the existing systems.
基金supported by the National Natural Science Foundation of China(NSFC)under Grant No.61373126the Natural Science Foundation of Jiangsu Province of China under Grant No.BK20131107the Fundamental Research Funds for the Central Universities under Grant No.JUSRP51510
文摘This paper proposes a trust ant colony routing algorithm by introducing a node trust evaluation model based on the D-S evidence theory into the ant colony routing protocol to improve the security of wireless sensor networks. To reduce the influence of conflict evidences caused by malicious nods, the consistent intensity is introduced to preprocess conflict evidences before using the D-S combination rule to improve the reliability of the D-S based trust evaluation. The nodes with high trust values will be selected as the routing nodes to insure the routing security, and the trust values are used as heuristic functions of the ant colony routing algorithm. The simulation tests are conducted by using the network simulator NS2 to observe the outcomes of performance metrics of packets loss rate and average end-to-end delay etc. to indirectly evaluate the security issue under the attack of inside malicious nodes. The simulation results show that the proposed trust routing algorithm can efficiently resist malicious attacks in terms of keeping performances of the average end-to-end delay, the throughtput and the routing packet overhead under attacking from malicious nodes.
