Hybrid Simplex-improved Genetic Algorithm for Global Numerical Optimization

In this paper, a hybrid simplex-improved genetic algorithm (HSIGA) which combines simplex method (SM) and genetic algorithm (GA) is proposed to solve global numerical optimization problems. In this hybrid algorithm some improved genetic mechanisms, for example, non-linear ranking selection, competition and selection among several crossover offspring, adaptive change of mutation scaling and stage evolution, are adopted; and new population is produced through three ap-proaches, i.e. elitist strategy, modified simplex strategy and improved genetic algorithm (IGA) strategy. Numerical experi-ments are included to demonstrate effectiveness of the proposed algorithm.

An Authenticated Dynamic Key Management Scheme for Clustered Sensor Networks

Secure sensor networks has received much attention in the last few years.A sensor network always works unattended possibly in a hostile environment such as a battlefield.In such environments,sensor networks are subject to node capture.Constrained energy,memory,and computational capabilities of sensor nodes mandate a clever design of security solutions to minimize overhead while maintaining secure communication over the lifespan of the network.In this paper,an authenticated dynamic key management scheme,ADKM has been proposed.It provides efficient,scalable,and survivable dynamic keying in a clustered sensor network with a large number of sensor nodes.ADKM employs a combinatorial exclusion basis system (EBS) for efficiency and one-way hash chains for authentication.Analysis of security and performance demonstrate that ADKM is efficient in security of sensor networks.

A novel maneuvering multi-target tracking algorithm based on multiple model particle filter in clutters

To solve the problem of strong nonlinear and motion model switching of maneuvering target tracking system in clutter environment, a novel maneuvering multi-target tracking algorithm based on multiple model particle filter is presented in this paper. The algorithm realizes dynamic combination of multiple model particle filter and joint probabilistic data association algorithm. The rapid expan- sion of computational complexity, caused by the simple combination of the interacting multiple model algorithm and particle filter is solved by introducing model information into the sampling process of particle state, and the effective validation and utilization of echo is accomplished by the joint proba- bilistic data association algorithm. The concrete steps of the algorithm are given, and the theory analysis and simulation results show the validity of the method.

A LOCAL DYNAMIC CLUSTER SELF-ORGANIZATION ALGORITHM IN WIRELESS SENSOR NETWORKS FOR RAINFALL MONITORING

Wireless Sensor Networks for Rainfall Monitoring (RM-WSNs) is a sensor network for the large-scale regional and moving rainfall monitoring,which could be controlled deployment. Delivery delay and cross-cluster calculation leads to information inaccuracy by the existing dynamic collabo-rative self-organization algorithm in WSNs. In this letter,a Local Dynamic Cluster Self-organization algorithm (LDCS) is proposed for the large-scale regional and moving target monitoring in RM-WSNs. The algorithm utilizes the resource-rich node in WSNs as the cluster head,which processes target information obtained by sensor nodes in cluster. The cluster head shifts with the target moving in chance and re-groups a new cluster. The target information acquisition is limited in the dynamic cluster,which can reduce information across-clusters transfer delay and improve the real-time of information acquisition. The simulation results show that,LDCS can not only relieve the problem of "too frequent leader switches" in IDSQ,also make full use of the history monitoring information of target and con-tinuous monitoring of sensor nodes that failed in DCS.

A PROVABLY SECURE PROXY SIGNATURE SCHEME FROM BILINEAR PAIRINGS

A proxy signature allows an entity, called original signer, to delegate its signing power to another entity, called proxy signer, to sign messages on its behalf. Proxy signatures have many practical applications and are very important cryptographic protocol. In this paper, we propose an efficient proxy signature scheme from bilinear pairings. We prove it secure in the random oracle model and analyze computation cost of our scheme. Our scheme satisfies all the properties required for proxy signatures.

New Multisignature Scheme Based on Bilinear Pairings

Two digital multisignature schemes based on bilinear pairings were proposed. One of them is the sequential digital multisignature, and the other is the broadcasting digital multisignature. The scheme has the same security as JI and LIs multisignature scheme, but the new scheme has the lower computation. So the new scheme is the multisignature which has high security and low computation. It has the theory meaning and extensive application under the condition of SmartCard, etc.