In the harsh environment where n ode density is sparse, the slow-moving nodes cannot effectively utilize the encountering opportunities to realize the self-organized identity authentications, and do not have the chanc...In the harsh environment where n ode density is sparse, the slow-moving nodes cannot effectively utilize the encountering opportunities to realize the self-organized identity authentications, and do not have the chance to join the network routing. However, considering m ost of the communications in opportunistic networks are caused by forwarding operations, there is no need to establish the complete mutual authentications for each conversation. Accordingly, a novel trust management scheme is presented based on the information of behavior feedback, in order to complement the insufficiency of identity authentications. By utilizing the certificate chains based on social attributes, the mobile nodes build the local certificate graphs gradually to realize the web of "Identity Trust" relationship. Meanwhile, the successors generate Verified Feedback Packets for each positive behavior, and consequently the "Behavior Trust" relationship is formed for slow-moving nodes. Simulation result shows that, by implementing our trust scheme, the d elivery probability and trust reconstruction ratio can be effectively improved when there are large numbers of compromised nodes, and it means that our trust management scheme can efficiently explore and filter the trust nodes for secure forwarding in opportunistic networks.展开更多
Wireless sensor network nodes （WSN nodes） have limited computing power, storage ca-pacity, conmmunication capabilities and energy and WSN nodes are easy to be paralyzed by Sybil at- tack. In order to prevent Sybil a...Wireless sensor network nodes （WSN nodes） have limited computing power, storage ca-pacity, conmmunication capabilities and energy and WSN nodes are easy to be paralyzed by Sybil at- tack. In order to prevent Sybil attacks, a new key distribution scheme for wireless sensor networks is presented. In this scheme, the key inforrmtion and node ID are associated, and then the attacker is dif-ficult to forge identity ID and the key inforrmtion corresponding to ID can not be forged. This scheme can use low-power to resist the Syhil attack and give full play to the resource advantages of the cluster head. The computing, storage and corrn^ni- cation is rminly undertaken by the cluster head o- verhead to achieve the lowest energy consumption and resist against nodes capture attack. Theoretical analysis and experimental results show that com- pared with the traditional scheme presented in Ref. [14], the capture rate of general nodes of cluster re-duces 40%, and the capture rate of cluster heads reduces 50%. So the scheme presented in this pa-per can improve resilience against nodes capture at- tack and reduce node power consumption.展开更多
The special characteristics of the mobile environment, such as limited bandwidth, dynamic topology, heterogeneity of peers, and limited power, pose additional challenges on mobile peer-to-peer （MP2P） networks. Trust...The special characteristics of the mobile environment, such as limited bandwidth, dynamic topology, heterogeneity of peers, and limited power, pose additional challenges on mobile peer-to-peer （MP2P） networks. Trust management becomes an essential component of MP2P networks to promote peer transactions. However, in an MP2P network, peers frequently join and leave the network, which dynamically changes the network topology. Thus, it is difficult to establish long-term and effective trust relationships among peers. In this paper, we propose a dynamic grouping based trust model （DGTM） to classify peers. A group is formed according to the peers＇ interests. Within a group, mobile peers share resources and tend to keep stable trust relationships. We propose three peer roles （super peers, relay peers, and ordinary peers） and two novel trust metrics （intragroup trust and intergroup trust）. The two metrics are used to accurately measure the trust between two peers from the same group or from different groups. Simulations illustrate that our proposed DGTM always achieves the highest successful transaction rate and the best communication overhead under different circumstances.展开更多
基金supported by the Program for Changjiang Scholars and Innovative Research Team in University (IRT1078)the Key Program of NSFC-Guangdong Union Foundation (U1135002)+3 种基金the Major national S&T program(2012ZX03002003)the Fundamental Research Funds for the Central Universities(JY10000903001)the National Natural Sci ence Foundation of China (Grant No. 61363068, 61100233)the Natural Science Foundation of Shaanxi Province (Grant No. 2012JM8030, 2011JQ8003)
文摘In the harsh environment where n ode density is sparse, the slow-moving nodes cannot effectively utilize the encountering opportunities to realize the self-organized identity authentications, and do not have the chance to join the network routing. However, considering m ost of the communications in opportunistic networks are caused by forwarding operations, there is no need to establish the complete mutual authentications for each conversation. Accordingly, a novel trust management scheme is presented based on the information of behavior feedback, in order to complement the insufficiency of identity authentications. By utilizing the certificate chains based on social attributes, the mobile nodes build the local certificate graphs gradually to realize the web of "Identity Trust" relationship. Meanwhile, the successors generate Verified Feedback Packets for each positive behavior, and consequently the "Behavior Trust" relationship is formed for slow-moving nodes. Simulation result shows that, by implementing our trust scheme, the d elivery probability and trust reconstruction ratio can be effectively improved when there are large numbers of compromised nodes, and it means that our trust management scheme can efficiently explore and filter the trust nodes for secure forwarding in opportunistic networks.
基金This paper was supported by the National Science Foundation for Young Scholars of China under Crant No.61001091 .
文摘Wireless sensor network nodes （WSN nodes） have limited computing power, storage ca-pacity, conmmunication capabilities and energy and WSN nodes are easy to be paralyzed by Sybil at- tack. In order to prevent Sybil attacks, a new key distribution scheme for wireless sensor networks is presented. In this scheme, the key inforrmtion and node ID are associated, and then the attacker is dif-ficult to forge identity ID and the key inforrmtion corresponding to ID can not be forged. This scheme can use low-power to resist the Syhil attack and give full play to the resource advantages of the cluster head. The computing, storage and corrn^ni- cation is rminly undertaken by the cluster head o- verhead to achieve the lowest energy consumption and resist against nodes capture attack. Theoretical analysis and experimental results show that com- pared with the traditional scheme presented in Ref. [14], the capture rate of general nodes of cluster re-duces 40%, and the capture rate of cluster heads reduces 50%. So the scheme presented in this pa-per can improve resilience against nodes capture at- tack and reduce node power consumption.
基金Project supported by the National Natural Science Foundation of China （Nos. 61502118, 61370212, and 61402127） and the Nat- ural Science Foundation of Heilongjiang Province, China （Nos. F2015029 and QC2015070）
文摘The special characteristics of the mobile environment, such as limited bandwidth, dynamic topology, heterogeneity of peers, and limited power, pose additional challenges on mobile peer-to-peer （MP2P） networks. Trust management becomes an essential component of MP2P networks to promote peer transactions. However, in an MP2P network, peers frequently join and leave the network, which dynamically changes the network topology. Thus, it is difficult to establish long-term and effective trust relationships among peers. In this paper, we propose a dynamic grouping based trust model （DGTM） to classify peers. A group is formed according to the peers＇ interests. Within a group, mobile peers share resources and tend to keep stable trust relationships. We propose three peer roles （super peers, relay peers, and ordinary peers） and two novel trust metrics （intragroup trust and intergroup trust）. The two metrics are used to accurately measure the trust between two peers from the same group or from different groups. Simulations illustrate that our proposed DGTM always achieves the highest successful transaction rate and the best communication overhead under different circumstances.
