Search

A novel attribute reduction approach of rough set based on immune clone selection is proposed. In this method, the approximation quality and attribute set were adopted as evolution object and antibody, respectively. On the basis of the inherent distribution within the immune response, the global optimization of the antibody was realized through parallel local optimization. Moreover, the diversity of the antibody population was maintained with the affinity maturation and renewal of the antibody. Thus, the stable multi-optimal solutions can be preserved. In addition, the machinery fault data were analyzed by this method, and the attribute reduction sets were obtained further to satisfy the demand of feature selection in machinery diagnosis.

In the application of wireless sensor networks (WSN), the balance of energy consumption plays an important role in extending the life cycle of WSN. Aim at energy consumption of Wireless sensors network, a dynamic cluster-based routing protocol based on the greedy algorithm (GDCRP). In the protocol, nodes run for the cluster head according to the energy and location. The elected cluster head has optimal value of energy and location. When the cluster is formed, the sink node initiates the request of routing establishment; the cluster heads choose the nodes that send it the packet as the upper nodes according to energy and hops count to the sink node. After a period of the network operating, then choose nodes according to the energy value and distance as the cluster head once again in order to avoid network failure because of one node failure. The protocol balances energy consumption of the network effectively, and extends the life cycle of the entire network.

The topology in the application of WSN (wireless sensor networks) is complex. In order to meet the need of wireless data transmission in the coal mine working environment, we propose a distance-aware routing protocol. The basis of the establishment of topology is the distance between nodes; it establishes the hierarchical relationship for each node, the data among nodes is transmitted to the sink node in the optimal path. When the structure of the network is changed, the protocol can reconstruct the routing in a short time according to the hierarchical relationship between nodes. The simulation results show that the protocol has a better convergence, and it shortens the time of local routing reconstruction. The novel protocol provides a programmer for the application of wireless sensor networks in the coal mine environment.

The environmental monitoring and management, such as the measurement of harmful gases in the atmosphere, needs the wireless sensor networks to do the real-time data acquisition. Propose a clustering routing protocol based on the R-tree structure. First establish cluster using location information of leaf nodes, then organize all the clusters in the region of the R- tree in group and establish the routing. Apportion the pressure of network transmission with the way of adjusting cluster nodes dynamically. The simulation results show that the clustering routing protocol based on R-tree has a good three-dimensional characteristic, improves the transmission efficiency of the network, and increases the life cycle of network.