Papers by Author: E Xu

Abstract: Traffic attack and false data aggregation attack are serious to wireless sensor networks. How to detect the two kinds of attack is a difficult problem. An energy-efficient attack detection protocol is proposed in this paper. The detection protocol uses linear prediction to establish easy ARMA(2,1) model for sensor nodes. In the detection protocol, different nodes play different roles, and use different monitor schemes. Virtual cluster head and monitor nodes are elected. Monitor nodes monitor cluster head, and member nodes are monitored by their cluster head. At the same time, secure data aggregation schemes are added to the protocol. Simulation shows that, the detection protocol can real-time predict traffic attacks, and insure correct data aggregation, but consume less energy.

Abstract: In directed diffusion rooting protocol, interest and exploratory data are disseminated by flooding, which will bring broadcast storm resulting in substantial energy consumption of wireless sensor networks. Grid-based directed diffusion rooting protocol can improve energy efficiency where geographic grids are constructed by self-organization of nodes using location information. Flooding of interest and exploratory data is limited in grid head nodes. But grid-based directed diffusion rooting protocol considers less about security. To adapt to environments with high security requirements, traffic attack detection and secure data aggregation schemes are added to grid-based directed diffusion rooting protocol. Simulation shows that the proposed schemes can real-time predict traffic attacks and improve accuracy of data aggregation results when networks are under attacks. At the same time, the protocol consumes less energy and extends lifetime of networks.

Abstract: A security node-based key management protocol is proposed for cluster-based sensor networks. Member nodes and cluster heads are responsible for data collection and transmission. Security nodes are responsible for key management. Security nodes restrain key management function of cluster heads, and reduce damage of captured cluster heads. Generation of security nodes and different kinds of keys is described. Performance analysis and simulation show that the proposed key management protocol consumes less energy, and its delay time of key generation is short. At the same time, the protocol can provide more collaborative authentication security for keys. It has strong resilience against node capture, and can support large scale network.

Abstract: In this paper, we present a solution developed at rough set theory and weight value to make multiattribute decision with incomplete information. The paper defined the concepst of breaking points and recovered the incomplete information system according to the relationship between the condition attributes and decision attributes. And introduced OWGA(ordered weight geometric averaging) operators to calculate the aggregation value of each project. Finally, selected the project with the maximum aggregation value as the best decision making. The illustration and experiments were implemented and the results indicate that the method is effective and efficient.

Abstract: To attribute reduction in an uncertain information system, this paper proposed a method of attribute reduction based on rough set theory. This reduction method gives the concepts of tolerance relationship, attribute significance and tolerance relationship similar matrix to deal with the inconsistency problem of in the information table. And then obtains the core attributes of incomplete information systems via the tolerance relationship similar matrix. Finally, according to attribute frequency in the tolerance relationship similar matrix, as the heuristic knowledge, makes use of binsearch heuristic algorithm to calculate the candidate attribute expansion so that it can reduce the expansion times to speed up reduction. Experiment results show that the algorithm is simple and effective.