Accelerate processor, efficient software and pervasive connections provide sensor nodes with more powerful computation and storage ability, which can offer various services to user. Based on these atomic services, dif...Accelerate processor, efficient software and pervasive connections provide sensor nodes with more powerful computation and storage ability, which can offer various services to user. Based on these atomic services, different sensor nodes can cooperate and compose with each other to complete more complicated tasks for user. However, because of the regional characteristic of sensor nodes, merging data with different sensitivities become a primary requirement to the composite services, and information flow security should be intensively considered during service composition. In order to mitigate the great cost caused by the complexity of modeling and the heavy load of single-node verification to the energy-limited sensor node, in this paper, we propose a new distributed verification framework to enforce information flow security on composite services of smart sensor network. We analyze the information flows in composite services and specify security constraints for each service participant. Then we propose an algorithm over the distributed verification framework involving each sensor node to participate in the composite service verification based on the security constraints. The experimental results indicate that our approach can reduce the cost of verification and provide a better load balance.展开更多
Resilience against node capture is one of the main indicators of the key pre-distribution security in sensor networks.On providing the attack model and the definition of the resilience against node capture of sensor n...Resilience against node capture is one of the main indicators of the key pre-distribution security in sensor networks.On providing the attack model and the definition of the resilience against node capture of sensor networks,the resilience of basic random key pre-distribution,Q-composite random key pre-distribution and their reinforced schemes are analyzed and compared in depth.Research results show that the size of key pool,the numbers of the keys stored in nodes and the value of Q determine the resilience of random key pre-distribution.The tradeoff between the resilience,security connectivity and costs in sensor networks is presented.These researches lay a foundation on the design of the secure protocol and the algorithm in the specific application environment of sensor networks.展开更多
In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing ...In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.展开更多
基金supported in part by National Natural Science Foundation of China(61502368,61303033,U1135002 and U1405255)the National High Technology Research and Development Program(863 Program)of China(No.2015AA017203)+1 种基金the Fundamental Research Funds for the Central Universities(XJS14072,JB150308)the Aviation Science Foundation of China(No.2013ZC31003,20141931001)
文摘Accelerate processor, efficient software and pervasive connections provide sensor nodes with more powerful computation and storage ability, which can offer various services to user. Based on these atomic services, different sensor nodes can cooperate and compose with each other to complete more complicated tasks for user. However, because of the regional characteristic of sensor nodes, merging data with different sensitivities become a primary requirement to the composite services, and information flow security should be intensively considered during service composition. In order to mitigate the great cost caused by the complexity of modeling and the heavy load of single-node verification to the energy-limited sensor node, in this paper, we propose a new distributed verification framework to enforce information flow security on composite services of smart sensor network. We analyze the information flows in composite services and specify security constraints for each service participant. Then we propose an algorithm over the distributed verification framework involving each sensor node to participate in the composite service verification based on the security constraints. The experimental results indicate that our approach can reduce the cost of verification and provide a better load balance.
基金Supported by Educational Innovation Fund for Graduates of Xidian University (Program No05006)Natural Science Basic Research Plan in Shaanxi Province of China(Program No2005F28)Xi'an Key Technologies R&D Program(GG06017)
文摘Resilience against node capture is one of the main indicators of the key pre-distribution security in sensor networks.On providing the attack model and the definition of the resilience against node capture of sensor networks,the resilience of basic random key pre-distribution,Q-composite random key pre-distribution and their reinforced schemes are analyzed and compared in depth.Research results show that the size of key pool,the numbers of the keys stored in nodes and the value of Q determine the resilience of random key pre-distribution.The tradeoff between the resilience,security connectivity and costs in sensor networks is presented.These researches lay a foundation on the design of the secure protocol and the algorithm in the specific application environment of sensor networks.
基金Acknowledgements Supported by the Fundamental Research Funds for the Central Universities（72104988）, The National High Technology Research and Development Program of China （ 2009AA01 Z204, 2007AA01Z429, 2007AA01Z405）, The post doctor science foundation of China （20090451495, 20090461415） The National Natural science foundation of China （60874085, 60633020, 60803151 ）, The Natural Science Basic Research Plan in Shaanxi Province of China （Program No. SJ08F13）, The Aviation Sci- ence Foundation of China （2007ZD31003, 2008ZD31001 ）
文摘In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.
