33446676
Voronoi Tessellation Based Rapid Coverage Decision Algorithm for Wireless Sensor Networks
The coverage problem is a fundamental issue in the research of sensor network. A novel Voronoi tessellation based rapid coverage decision algorithm is proposed, in which the region of interest is partitioned into some square grids firstly, and then the complex area coverage problem is transformed into simple vertices coverage problem, on the basis of the good characteristics of Voronoi tessellation such as being able to divide the planner area into a set of simple geometric simplexes. Theoretical analysis and simulation results show that, the new algorithm can decrease the computation complexity of networks, especially for sensor networks with n different sensors, it can solve the coverage problem correctly for any given region of interest with time costs of O(nlogn) only.
16518214
Key Distribution for Group-based Sensor Deployment Using a Novel Interconnection Graph
In this paper, we propose a pairwise key distribution scheme based on a novel interconnection graph termed Hierarchical Hypercube. Motivated by the fact that sensor nodes are often deployed in groups (for example, dropped from an airplane at different locations) and hence the whole network is composed of multiple such groups, we design Hierarchical Hypercube as a two layer topology, where each group is modeled by an inner hypercube and connections between the groups are modeled using an outer hypercube. we propose a topology termed Hierarchy Hypercube. While retaining the desirable properties already shown by existing pairwise schemes, by using Hierarchical Hypercube, direct communication from a node to any other nodes is not required, either within a group or among groups, and hence this topology can effectively and realistically reflect the connectivity of the physical sensor network deployed in groups. Furthermore, we propose key pre-distribution scheme based on this novel topology and show that the new scheme possesses high probability of direct key establishment, low memory overhead, and resilience in the presence of broken communication links and compromised nodes, and thus still retain the desirable properties even when the ideal logical connection are distorted in the real deployment.
58312072
A distributed tokens-based distance-vector routing algorithm for mobile ad-hoc networks
A mobile ad-hoc network is a multi-hop wireless network in which mobile hosts communicate over a shared, scarce wireless channel. In this paper, an innovative distance vector routing algorithm TDVRA based on tokens for mobile ad-hoc networks is proposed, which is proved to be loop-free and of no problem of counting-to-infinity existed in those traditional distance-vector routing algorithms such as RIP and BF. Furthermore, compared with the algorithm DSDV, the new algorithm TDVRA can overcome the drawback of routing fluctuations existed in DSDV and can spread the bad news as quickly as the good news.
41889531
Research on Pairwise Key Establishment Model and Algorithm for Sensor Networks
Security schemes of pairwise key establishment, which enable sensors to communicate with each other securely, play a fundamental role in research on security issue in wireless sensor networks. A new kind of pairwise key pre-distribution model for sensor networks is proposed. And in addition, based on which, an efficient dynamic key path establishment algorithm is designed. Theoretic analysis and experimental figures show that the new algorithm has better performance than those previous related works.
34094601
DNA-Based Algorithm for 0-1 Planning Problem
Biochemical reaction theory based DNA computation is of much better performance in solving a class of intractable computational problems such as NP-complete problems, it is important to study the DNA computation. A novel algorithm based on DNA computation is proposed, which solves a special category of 0-1 planning problem by using the surface-based fluorescence labeling technique. The analysis show that our new algorithm is of significant advantages such as simple encoding, low cost and short operating time, etc.
6464793
Ringed Petersen spheres connected hypercube interconnection networks
On the basis of the short diameter of Petersen graph, and high connectivity of hypercube, a novel interconnection networks, RPSCH(n) (ringed Petersen spheres connected hypercube) is proposed, and whose characteristics are studied simultaneously. It is proved that RPSCH(n) is not only of regularity and good extensibility, but also of shorter diameter and better connectivity than those previous well-known interconnection networks such as Q/sub n/, RP(n) and HP(n). In addition, the unicasting and broadcasting routing algorithms are designed for RPSCH(n), whose communication efficiency are proved to be n-2 and n-2 respectively.
16645940
Discovering Prediction Model for Environmental Distribution Maps
Currently environmental distribution maps, such as for soil fertility, rainfall and foliage, are widely used in the natural resource management and policy making. One typical example is to predict the grazing capacity in particular geographical regions. This paper uses a discovering approach to choose a prediction model for real-world environmental data. The approach consists of two steps: (1) model selection which determines the type of prediction model, such as linear or non-linear; (2) model optimisation which aims at using less environmental data for prediction but without any loss on accuracy. The latter step is achieved by automatically selecting non-redundant features without using specific models. Various experimental results on real-world data illustrate that using specific linear model can work pretty well and fewer environment distribution maps can quickly make better/comparable prediction with the benefit of lower cost of data collection and computation.
14879086
The Algorithm of Obtaining Best Rules Based on Rough Set
With the fast development of the technology in Database and Internet, excessive information has become a problem that decision makers engage in electronic commerce have to affront. This paper firstly establishes the decision table for excessive data, then reduces knowledge of the decision table, and obtains the best rules. This can reduce the redundancy of the data, and improve the efficiency of knowledge obtaining. Because of the high time complexity and spatial complexity the general algorithm has, this paper proposed a new algorithm based on analogical matrix, and carried out the algorithm. The practice proves that the algorithm can improve the efficiency of knowledge obtaining, and the rules is tidy and best.
119959033
Breast mass segmentation based on information theory
In this study, an information-based algorithm, called c-shells based deterministic annealing (CSDA), is proposed for breast mass segmentation on digital mammograms. CSDA recasts the fuzzy clustering concept into the probability framework and offers two improved features over existing clustering algorithms. First, it is a global minimization algorithm through mass constrained deterministic annealing rather than a local minimization method in the original fuzzy c-shells (FCS) approach. Second, the prototype in this algorithm is shell, which is more effective in segmentation with compact or hollow spherical shells compared to the standard deterministic annealing (DA) algorithm. Experimental results show that the information based CSDA clustering algorithm is a promising image segmentation technique for digital mammographic mass detection.
15192522
A layered design methodology of cluster system stack
The application range of cluster has expanded beyond scientific computing, but the present cluster system software fails to provide a flexible architecture to promote code reuse and facilitate building cluster system software for different computing contexts, most of which are developed from scratch case by case, or integrated or packaged with ldquothe best practicerdquo. In this paper, we have proposed a layered design methodology to build cluster system stack with different layers concentrating on different functions, and developed common sets of core service as reusing framework for different computing context. Following this methodology, we have built Phoenix-a complete cluster system stack for both scientific and business computing, which is verified and deployed on Dawning 4000 A super computer for scientific computing and other cluster systems for business computing. The qualitative evaluation and our practices show the design methodology of Phoenix has advantages over other methodologies.
14688887
Data Compression Algorithm Based on Hierarchical Cluster Model for Sensor Networks
A new distributed algorithm of data compression based on hierarchical cluster model for sensor networks is proposed, in which, the whole sensor network is mapped into a kind of hierarchical clusters model firstly, and then different wavelet transform models are used to commit data compression in inner and super clusters respectively. Theoretical analyses and simulation results show that, the above new methods have good performance of approximation, and can compress data and reduce the amount of data efficiently.