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.展开更多
In software-defined networking,the separation of control plane from forwarding plane introduces new challenges to network reliability.This paper proposes a fault-tolerant routing mechanism to improve survivability by ...In software-defined networking,the separation of control plane from forwarding plane introduces new challenges to network reliability.This paper proposes a fault-tolerant routing mechanism to improve survivability by converting the survivability problem into two sub-problems:constructing an elastic-aware routing tree and controller selection.Based on the shortest path tree,this scheme continuously attempts to prune the routing tree to enhance network survivability.After a certain number of iterations,elastic-aware routing continues to improve network resiliency by increasing the number of edges in this tree.Simulation results demonstrate this fault-tolerant mechanism performs better than the traditional method in terms of the number of protected nodes and network fragility indicator.展开更多
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.展开更多
基金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.
基金supported by the Key Laboratory of Universal Wireless Communications(Beijing University of Posts and Telecommunications)Ministry of Education,P.R.China(KFKT-2013104)+6 种基金the National Natural Science Foundation of China(61501105,61471109,61302071)the China Postdoctoral Science Foundation(2013M541243)the Doctoral Scientific Research Foundation of Liaoning Province(20141014)the Fundamental Research Funds for the Central Universities(N150404018,N130304001,N150401002,N150404015)the National 973 Advance Research Program(2014CB360509)the Postdoctoral Science Foundation of Northeast University(20140319)Ministry of Education-China Mobile Research Foundation(MCM20130131)
文摘In software-defined networking,the separation of control plane from forwarding plane introduces new challenges to network reliability.This paper proposes a fault-tolerant routing mechanism to improve survivability by converting the survivability problem into two sub-problems:constructing an elastic-aware routing tree and controller selection.Based on the shortest path tree,this scheme continuously attempts to prune the routing tree to enhance network survivability.After a certain number of iterations,elastic-aware routing continues to improve network resiliency by increasing the number of edges in this tree.Simulation results demonstrate this fault-tolerant mechanism performs better than the traditional method in terms of the number of protected nodes and network fragility indicator.
基金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.
