RDF(S) repository privacy protection via inference control

The privacy protection of resource description framework （schema） （RDF（S） ） repository is an emerging topic in database security area. In this paper, entailment rules are investigated based on RDF（S） repository firstly. Then, an idea that uses reasoning closure to judge whether the privacy disclosure caused by inference is existed is proposed. Furthermore, the definitions of impli- cation conditions and information measure of triple statements which gains data hiding algorithm with combining proposition logic reasoning theory are introduced. Meanwhile, a conversion method from conjunctive normal form to disjunctive normal form based minimal hitting sets of set cluster is aiso proposed. Finally, the experimental results show that our algorithm can prevent privacy disclosure of RDF（S） repository effectively.

Integrated dominating and hit set-inspired unequal clusteringbased data aggregation in wireless sensor networks

Purpose-In wireless sensor networks,improving the network lifetime is considered as the prime objective that needs to be significantly addressed during data aggregation.Among the traditional data aggregation techniques,cluster-based dominating set algorithms are identified as more effective in aggregating data through cluster heads.But,the existing cluster-based dominating set algorithms suffer from a major drawback of energy deficiency when a large number of communicating nodes need to collaborate for transferring the aggregated data.Further,due to this reason,the energy of each communicating node is gradually decreased and the network lifetime is also decreased.To increase the lifetime of the network,the proposed algorithm uses two sets:Dominating set and hit set.Design/methodology/approach-The proposed algorithm uses two sets:Dominating set and hit set.The dominating set constructs an unequal clustering,and the hit set minimizes the number of communicating nodes by selecting the optimized cluster head for transferring the aggregated data to the base station.The simulation results also infer that the proposed optimized unequal clustering algorithm(OUCA)is greater in improving the network lifetime to a maximum amount of 22%than the existing cluster head selection approach considered for examination.Findings-In this paper,lifetime of the network is prolonged by constructing an unequal cluster using the dominating set and electing an optimized cluster head using hit set.The dominator set chooses the dominator based on the remaining energy and its node degree of each node.The optimized cluster head is chosen by the hit set to minimize the number of communicating nodes in the network.The proposed algorithm effectively constructs the clusters with a minimum number of communicating nodes using the dominating and hit set.The simulation result confirms that the proposed algorithm prolonging the lifetime of the network efficiently when compared with the existing algorithms.Originality/value-The proposed algorithm effectively constructs the clusters with a minimum number of communicating nodes using the dominating and hit sets.The simulation result confirms that the proposed algorithm is prolonging the lifetime of the network efficiently when compared with the existing algorithms.