Fraud or cheating of malicious nodes were restrained by reducing the trust value of malicious nodes in the past trust model, but few recommendation nodes for cooperation cheating are punished, so it has had only limit...
详细信息
Cloud computing is a hot topic of current research, for anonymous authentication is required in many applications scenarios of e-business based on cloud computing, users do not want to expose their identity, users jus...
详细信息
network security policy and the automated refinement of its hierarchies aims to simplify the administration of security services in complex network environments. The semantic gap between the policy hierarchies reflect...
详细信息
network security policy and the automated refinement of its hierarchies aims to simplify the administration of security services in complex network environments. The semantic gap between the policy hierarchies reflects the validity of the policy hierarchies yielded by the automated policy refinement process. However, little attention has been paid to the evaluation of the compliance between the derived lower level policy and the higher level policy. We present an ontology based on Ontology Web Language （OWL） to describe the semantics of security policy and their implementation. We also propose a method of estimating the semantic similarity between a given
A good clustering algorithm can provide the basis for forming a good network topology and target location, improve routing efficiency and greatly reduce energy consumption. For the lack of GAF algorithm, an improved a...
详细信息
A good clustering algorithm can provide the basis for forming a good network topology and target location, improve routing efficiency and greatly reduce energy consumption. For the lack of GAF algorithm, an improved algorithm is putted forward. First of all, the monitored area is divided into many sections according to the intersecting circle structure. Then the nodes which meet specific criteria will be elected as cluster heads. Finally, some nodes in overlapping area of intersecting circles will be elected as the Mid Nodes to achieve multi-hops routing. As is shown in the experiment, the improved algorithm can greatly save energy consumption of nodes, and extend the lifetime of wireless sensor networks.
Localization is one of the key technologies in wireless sensor networks,and the existing PSO-based localization methods are based on standard PSO,which cannot guarantee the global *** the sensor network deployed in a ...
详细信息
Localization is one of the key technologies in wireless sensor networks,and the existing PSO-based localization methods are based on standard PSO,which cannot guarantee the global *** the sensor network deployed in a three-dimensional region,this paper proposes a localization method using stochastic particle swarm *** measuring the distances between sensor nodes,the sensor nodes estimate their locations using stochastic particle swarm optimization,which guarantees the global convergence of the *** simulation results show that the localization error of the proposed method is almost 40% of that of multilateration,and it uses about 120 iterations to reach the optimizing value,which is 80 less than the standard particle swarm optimization.
While thinking of the different participants and their behaviors, the information hiding can be taken all over the whole transmissions. The process of the information was analyzed based on this. The analysis suggests ...
详细信息
While thinking of the different participants and their behaviors, the information hiding can be taken all over the whole transmissions. The process of the information was analyzed based on this. The analysis suggests a new idea that the behavior of "record the information or not" is a kind of information that can be used for hiding. To prove this idea, a new hiding algorithm was proposed, the "deformation" and "quantitative-change" occurred in some special carriers with many key points. The result and the character analyzing show that the behavior of recording can be well used to carry secrets in covert communication.
Considering that intravenous in blood infusion, usually applied without a proper control of the progress and velocity under unreliable manual monitoring practice, is the most popular and frequent clinical activity thr...
详细信息
Most of algorithms based on bit vector for mining frequent pattern always produce candidate itemsets and scan the same data repeatedly;this increases the running time and the space consumption. In this paper, an algor...
详细信息
Most of algorithms based on bit vector for mining frequent pattern always produce candidate itemsets and scan the same data repeatedly;this increases the running time and the space consumption. In this paper, an algorithm BVDAHL based on bit vector decomposition and hash linklist for mining frequent patterns on data streams which solves the above issues, is proposed. The itemsets (transactions) whose corresponding number of 1 is k, denoted as k-one itemsets (k-one transactions). The arrival transactions are converted into bit vectors, and permutations and combinations are used to decompose converted results, then the decomposed itemsets are stored in the hash linklist. In hash function, according to the position of 1 of bit vector to compute the address, if the transaction has same address and same content that already exists in data domain, then the value adds one in count domain, otherwise the pointer in pointer domain points to the next node directly, it is no need to deal with conflict. Afterwards the property of anti-monotonic will be used to prune the k+1-one transactions in bit vector table if there exists infrequent k-one itemsets that decomposed by such k+1-one transactions. Then the algorithm repeats the above processes until the transaction in bit vector table can not be decomposed. Finally we will receive the frequent itemsets by comparing the obtained value of count domain in hash linklist with minSup. Experiment results show that BVDAHL is very efficiency and scalable.
Fuzzy identity based encryption (FIBE), proposed by Sahai and Waters, is a new kind of identity based encryption. It allows users with identity w can decrypt ciphertext for w' if and only if w is close enough to w...
详细信息
暂无评论