视角受限传感器网络强栅栏覆盖判定算法

栅栏覆盖研究如何分配网络时空资源来确保移动目标穿越监控区域时被监测．本文通过视角受限节点传感方向的调整,设计一种分布式算法以判定网络能否提供强栅栏覆盖．算法主要思想是利用节点及邻居节点的物理位置关系构建强／弱栅栏对．另外,本文设计贪心策略优先选择邻居节点数多的候选节点构建强栅栏路径．仿真实验证明：本算法可以较小代价判定并改善网络强栅栏覆盖性能．     

Power-Aware Anycast Routing in Wireless Sensor Network Exploiting Small World Effect

By considering energy-efficient anycast routing in wireless sensor network (WSN), and combining small world characteristics of WSN with the properties of the ant algorithm, a power-aware anycast routing algorithm (SWPAR) with multi-sink nodes is proposed and evaluated. By SWPAR, the optimal sink node is found and the problem of routing path is effectively solved. Simulation results show that compared with the sink-based anycast routing protocol (SARP) and the hierarchy-based anycast routing protocol (HARP), the proposed algorithm improves network lifetime and reduces power consumption.     

基于移动基站的动态无线传感器网络

针对无线传感器网络(WSN)中的“路由热点”问题,提出了在簇头移动的前提下基于事件驱动的基站簇头混合移动策略BS-CH HMS(base station-cluster head hybrid mobile strategy).该策略根据CH(cluster head)移动时的能量损耗确定CH的移动轨迹,制定基站的协作...     

��ͨ��Ϣ�ɼ���WSN�ִ��㷨�о�

无线传感网是采集实时交通信息的重要工具.因其节点能量有限,必须设计高能效的分簇路由算法以延长网络周期.本文通过建立一种智能交通中无线传感器网络的应用模型,根据其特点和要求分析LEACH协议的优缺点并提出一种能量负载均衡的分簇算法.该算法对LEACH协议当中的簇首机制进行改进,综合考虑候选节点的剩余能量和簇首节点的分布位置;建立簇间多跳路由机制以避免单跳通信的大能量消耗;创造一种簇重构方法,避免过于频繁的簇重构引起的不必要能量消耗.仿真结果表明,能量均衡算法可有效平衡节点能量消耗分布,延长网络生命周期,可很好的应用于基于WSN的ITS当中.     

A Distributed Virtual Backbone Formation for Wireless Ad Hoc and Sensor Networks

The virtual backbone is an approach for solving routing problems in wireless ad hoc and sensor networks. A connected dominating set (CDS) was proposed as a virtual backbone to improve the performance of wireless networks. The quality of a virtual backbone is measured not only by approximation factor, which is the ratio of its size to that of minimum CDS, but also time complexity and message complexity. In this paper, a distributed algorithm is presented to construct a minimum CDS for ad hoc and sensor networks. By destroying triangular loops in the virtual backbone, the proposed algorithm can effectively construct a CDS with smaller size. Moreover, our algorithm, which is fully localized, has a constant approximation ratio, linear message and time complexity, and low implementation complexity. The simulation results and theoretical analysis show that our algorithm has better efficiency and performance than conventional approaches.     

一种新的异类多传感器系统误差融合估计算法

为解决由测向测时差无源被动传感器与主动传感器组网探测时异类多传感器系统误差估计问题,提出了一种新的异类多传感器系统误差融合估计算法.首先,通过对主被动传感器进行组合并构建异类传感器系统误差量测模型,实现了各组合传感器系统误差的实时估计;其次,通过建立多传感器融合估计结构,对多传感器系统误差的组合估计信息进行融合并反馈,获得了各传感器系统误差的全局融合估计.蒙特卡罗仿真结果表明:该算法能够对组网探测系统中各主、被动传感器的测向测时差及测距系统误差进行有效的融合估计,具有较高的工程应用价值.     

Two States CBR Modeling of Data Source in Dynamic Traffic Monitoring Sensor Networks

Real traffic information was analyzed in the statistical characteristics and approximated as a Gaussian time series. A data source model, called two states constant bit rate (TSCBR), was proposed in dynamic traffic monitoring sensor networks. Analysis of autocorrelation of the models shows that the proposed TSCBR model matches with the statistical characteristics of real data source closely. To further verify the validity of the TSCBR data source model, the performance metrics of power consumption and network lifetime was studied in the evaluation of sensor media access control (SMAC) algorithm. The simulation results show that compared with traditional data source models, TSCBR model can significantly improve accuracy of the algorithm evaluation.     

An improved ring signature scheme without trusted key generation center for wireless sensor network

Security of wireless sensor network (WSN) is a considerable challenge, because of limitation in energy, communication bandwidth and storage. ID-based cryptosystem without checking and storing certificate is a suitable way used in WSN. But key escrow is an inherent disadvantage for traditional ID-based cryptosystem, i.e., the dishonest key generation center (KGC) can forge the signature of any node and on the other hand the node can deny the signature actually signed by him/herself. To solving this problem, we propose an ID-based ring signature scheme without trusted KGC. We also present the accurate secure proof to prove that our scheme is secure against existential forgery on adaptively chosen message and ID attacks assuming the complexity of computational Diffie-Hellman (CDH) problem. Compared with other ring signature schemes, we think proposed scheme is more efficient.     

Joint Tomlinson-Harashima source and linear relay precoder design in amplify-and-forward multiple-input multiple-output two-way relay systems

Existing minimum-mean-squared-error (MMSE) transceiver designs in amplified-and-forward (AF) multiple-input multiple-output (MIMO) two-way relay systems all assume a linear precoder at the sources. Nonlinear source precoders in such a system have not been considered yet. In this paper, we study the joint design of source Tomlinson-Harashima precoders (THPs), relay linear precoder and MMSE receivers in two-way relay systems. This joint design problem is a highly nonconvex optimization problem. By dividing the original problem into three sub-problems, we propose an iterative algorithm to optimize precoders and receivers. The convergence of the algorithm is ensured since the updated solution is optimal to each sub-problem. Numerical simulation results show that the proposed iterative algorithm outperforms other algorithms in the high signal-to-noise ratio (SNR) region.     

Can the Polynomial Based Key Predistribution Scheme Be Used Many Times in One Wireless Sensor Network Key Establishment Protocol？

Key establishment is the basic step for the wireless sensor network (WSN) security. The polynomial based key predistribution scheme of Blom and Blundo et al. has been the basic ingredient for the key establishment for WSNs. It is tempting to use many random and different instances of polynomial based key predistribution scheme for various parts of the WSN to enhance the efficiency of WSN key establishment protocols. This paper indicates that it is not secured in general to use many instances of Blom-Blundo et al. polynomial based key predistribution scheme in a WSN key establishment protocol. Thus the previously constructed group-based type WSN key predistribution schemes using polynomial based key predistribution scheme are insecure. We propose new generalized Blom-Blundo et al. key predistribution schemes. These new generalized Blom-Blundo et al. key predistribution schemes can be used many times in one WSN key establishment protocol with only a small increase of cost. The application to group-based WSN key predistribution schemes is given.     

基于差分模型的无控制DEM差异探测方法

为了提高现有方法的性能，提出了基于差分模型的无控制数字高程模型（DEM）差异探测的新方法，并成功地用于普歪沟泥石流地区地表变形探测（该区变形面积超过50％）．该方法在LZD算法（最小高差法）的基础上引入差分模型，兼顾了观测值的数值及其相互关系的影响，显著提了高算法的差异探测性能．结果表明，新方法的匹配精度比目前代表性的采用肌估计的LZD算法（M-LZD）和采用最小平方中位数的LZD算法（LMSLZD）的精度高．     

Support vector regression based color image restoration in YUV color space

A support vector regression(SVR) based color image restoration algorithm is proposed.The test color images are firstly mapped into the YUV color space,and then SVR is applied to build up a theoretical model between the degraded images and the original one.Performance comparisons of the proposed algorithm versus traditional filtering algorithms are given.Experimental results show that the proposed algorithm has better performance than traditional filtering algorithms and has less computation time than iterat...     

Ship appearance optimal design on RCS reduction using response surface method and genetic algorithms

Radar cross section (RCS) reduction technologies are very important in survivability of the militarynaval vessels. Ship appearance shaping as an effective countermeasure of RCS reduction redirects the scatteredenergy from one angular region of interest in space to another region of little interest. To decrease the scatteringelectromagnetic signals from ship scientifically, optimization methods should be introduced in shaping design.Based on the assumption of the characteristic section design method, mathematical formulations for optimalshaping design were established. Because of the computation-intensive analysis and singularity in shapingoptimization, the response surface method (RSM) combined genetic algorithm (GA) was proposed. The poly-nomial response surface method was adopted in model approximation. Then genetic algorithms were employedto solve the surrogate optimization problem. By comparison RCS of the conventional and the optimal design,the superiority and effectiveness of proposed design methodology were verified.Ky words: radar cross section (RCS); characteristic section design method; response surface method; genetic algorithm (GA) was proposed. The polynomial response surface method was adopted in model approximation. Then genetic algorithms were employed to solve the surrogate optimization problem. By comparison RCS of the conventional and the optimal design, the superiority and effectiveness of proposed design methodology were verified.     

Optimal Sensor Decision Based on Particle Filter

Introduction Multi-sensor tracking technique has receivedmuch attention in recent years. Many tracking sys-tems involve basically active (radar) and passive(infrared tracking) subsystems. The main disad-vantage of infrared search and tracking is the prob-lem of observability and filtering divergence. Actu-ally, quite a lot of research activities have beendone in this field and some researchers more thanonce simulated the feasibility of the approach[1,2].The main idea of the methods is as foll…     

基于无线传感网络技术的门式起重机无线应力监测系统设计

通过对起重机结构与应力分析,确定了影响作业安全的主要应力监测点;提出了基于无线传感网络技术的应力监测系统总体设计原则和方案;选用了Crossbow公司的IRIS系统作为无线传感网络平台,设计了应变监测节点相关电路与节点程序,开发了用于门式起重机应力监测的LABVIEW软件。该系统可实现对起重机结构的应力实时监测、超限自...     

An Iterative Power Allocation Algorithm for Group-wise Space-Time Block Coding Systems

An iterative transmit power allocation (PA) algorithm was proposed for group-wise space-time block coding (G-STBC) systems with group-wise successive interference cancellation (GSIC) receivers. Group-wise interference suppression (GIS) filters are employed to separate each group's transmit signals from other interferences and noise. While the total power on all transmit symbols is constrained, all transmit PA coefficients are updated jointly according to the channel information at each iteration. Through PA, each detection symbol has the same post-detection signal to interference-and-noise ratio (SINR). The simulation results verify that the proposed PA algorithm converges at the equilibrium quickly after few iterations, and it achieves much lower bit error rates than the previous single symbol SIC PA and the fixed ratio PA algorithms for G-STBC systems with GSIC receivers .     

移动无线传感器网络节点定位算法研究

文章针对移动无线传感器网络中节点定位的问题,提出利用一个移动锚节点结合DV-Hop算法来对节点进行定位的方法,该算法与静态网络中DV-Hop定位算法相比节约了网络成本,仿真实验表明,该算法的定位误差和定位覆盖率可以满足大多数应用。     

基于图的频繁闭项集挖掘算法

为了提高数据挖掘效率，提出了一种基于图的频繁闭项集挖掘算法GFCG(graph—based frequent closed itemset generation)．该算法采用位矢量技术构造有向图，表示项与项之间的频繁关系，并在有向图的基础上递归产生频繁闭项集，从而只需扫描数据库2次，不产生候选集；引入扩展频繁项集的概念，大大减小了检查频繁项集是否闭的搜索空间．用1个真实数据库和2个合成数据库对GFCG进行了测试，并与A-close和CLOSET算法的结果进行了比较，结果表明，该算法具有良好的速度和可伸缩性性能．     

Mean shift registration algorithm for dissimilar sensors

The mean shift registration (MSR) algorithm is proposed to accurately estimate the biases for multiple dissimilar sensors. The new algorithm is a batch optimization procedure. The maximum likelihood estimator is used to estimate the target states, and then the mean shift algorithm is implemented to estimate the sensor biases. Monte Carlo simulations show that the MSR algorithm has significant improvement in performance with reducing the standard deviation and mean of sensor biased estimation error compared with the maximum likelihood registration algorithm. The quantitative analysis and the qualitative analysis show that the MSR algorithm has less computation than the maximum likelihood registration method.     

基于半马尔科夫链的中小堤坝WSN节点能耗研究

无线传感器网络技术的引入,为中小型堤坝监测技术的发展提供了新思路。由于无线传感器网络节点采用电池供电,而堤坝环境中的数据监测条件比较苛刻,电源更换相对困难,无线传感器网络节点能耗的优化在延长整个无线传感器网络生命周期过程中显得尤为重要。本文介绍了无线传感器网络中节点能耗的主要分布,并提出了降低节点能量消耗的策略。借助半马尔可夫链理论建立了节点能耗的数学模型,分析了WSN节点的能耗情况,在保证正常数据通信的情况下,通过对节点状态的管理,延长节点的睡眠时间,从而达到降低整个网络能耗的目的。