Distributed Estimation in Sensor Networks with Repetition Coding

This paper considers the distributed estimation of a source parameter using quantized sensor observations in a wireless sensor network with noisy channels. Repetition codes are used to transmit quantization bits of sensor observations and a quasi best linear unbiased estimate is constructed to estimate the source parameter. Simulations show that the estimation scheme achieves a better power and spectral efficiency than the previous scheme.     

Distributed Estimation for Sensor Networks with Channel Estimation Errors

This paper describes the effect of channel estimation error (CEE) on the performance of distributed estimations of an unknown parameter in a wireless sensor network. Both the classical and Bayesian estimators are derived to mitigate the adverse effects caused by the CEE. Power scheduling among sensors and the power ratio between the training and data transmission at each individual node are optimized by directly minimizing the final average mean squared error to compensate for the CEE. A closed-form power scheduling policy is given for a homogeneous environment, which shows that more than 50% of the power should be allocated to sensor observation transmissions. For an inhomogeneous environment, a multilevel waterfilling type solution is developed for the power scheduling among sensors for only the sum power constraint with a "cave" waterfilling solution for both the sum and individual power constraints. Simulations show that the proposed power scheduling schemes achieve better performance than the equal power scheduling scheme.     

采用S-MAC协议的无线传感器网络可用带宽估计算法

提出一种利用串扰来估计采用了S-MAC的无线传感器网络中可用带宽的方法。传感器节点在使能串扰避免机制后,将收集到邻居节点的RTS/CTS/DATA/ACK分组中的网络分配矢量以表的形式记录在自己的缓存中,经过计算得到节点的可用带宽。仿真数值结果表明,所使用的可用带宽估计方法能够较为准确的预测S-MAC中节点周围的负载情况,竞争程度,为路由选择、负载均衡、多sink布置、优先级传输等策略提供参考。     

具有前向安全的Ad Hoc密钥管理方案

在完全分布式CA模型的基础上,结合信任度动态评估策略,提出了一种具有前向安全的密钥管理方案。使用NS-2仿真软件进行仿真实验,结果表明,当网络中节点数目的不同时,节点的认证成功率和节点延迟均保持稳定,提高了Ad Hoc网络的安全性与可用性,降低了系统开销。     

用于无线移动网中的密钥协商方案

ad hoc网是一种新型无线移动网络，内部节点相互合作信任，但是没有中心控制节点，且节点的计算资源非常受限。针对如何在这种自组织群体中进行密钥协商，实现安全通信，提出了一种适合ad hoc网的认证密钥协商方案，每个节点仅需2n-2次模乘法运算，且仅需一轮通信，其中n是ad hoc网中的节点数。经对比该方案的效率远远高于现有方案。     

一种用于无线传感网中的能量自适应分布式分簇算法

通过综合考虑节点分布和剩余能量水平,并对簇的形成过程进行优化,引入机制保证簇的能量消耗均衡,以改进网络生存时间和覆盖率. 所提出的分布式分簇算法经过仿真结果表明,新算法相对于现有的多种算法在能量均衡性和网络生存时间上有较大改进,半数节点生存时间延长一倍以上,而负载均衡性仍保持在相同水平上.     

基于无线传感器网络的分布式山体滑坡预警监测

设计了一种采用无线传感器网络作为主要技术手段的山体滑坡预警监测系统.研究核心是滑坡体应力数据的统计模型以及相应的分布式监测算法.应力数据通过高斯变量平均过程(VMGP)来建模.在滑坡预报中,漏报率是衡量监测系统性能好坏的标准.把分布式监测算法和传统的中心监测算法作了对比分析,实验从滑坡漏报率分析得到前者的性能优于后者,从而验证了分布式监测算法的可行性.     

自组网中基于簇的入侵检测方案

基于补图团的着色思想提出了分布式分簇算法,并在此基础上给出了一种基于簇的入侵检测方案.     

Distributed Aggregation Algorithms for Mobile Sensor Networks with Group Mobility Model

In many applications of mobile sensor networks, such as water flow monitoring and disaster rescue, the nodes in the network can move together or separate temporarily. The dynamic network topology makes traditional spanning-tree-based aggregation algorithms invalid in mobile sensor networks. In this paper, we first present a distributed clustering algorithm which divides mobile sensor nodes into several groups, and then propose two distributed aggregation algorithms, Distance-AGG (Aggregation based on Distance), and Probability-AGG (Aggregation based on Probability). Both of these two algorithms conduct an aggregation query in three phases: query dissemination, intra-group aggregation, and inter-group aggregation. These two algorithms are efficient especially in mobile networks. We evaluate the performance of the proposed algorithms in terms of aggregation accuracy, energy efficiency, and query delay through ns-2 simulations. The results show that Distance-AGG and Probability-AGG can obtain higher accuracy with lower transmission and query delay than the existing aggregation algorithms.     

Distributed Plume Source Localization Using Hierarchical Sensor Networks

A hierarchical wireless sensor networks (WSN) was proposed to estimate the plume source location. Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident. The entire surveillant field is divided into several small sub-regions. In each sub-region, the localization algorithm based on the improved particle filter (IPF) was performed to estimate the location. Some improved methods such as weighted centroid, residual resampling were introduced to the IPF algorithm to increase the localization performance. This distributed estimation method elirninates many drawbacks inherent with the traditional centralized optimization method. Simulation results show that localization algorithm is efficient far estimating the plume source location.     

电力系统状态估计的分布式并行处理

基于传统的状态估计算法，结合等式约束优化问题，提出了在计算速度、数值精度上显著提高的分布式并行算法，且以PVM为软件平台对验证系统进行了模拟计算。结果表明了该算法的有效性。     

LaConf:A Localized Address Autoconfiguration Scheme for Wireless Ad Hoc Networks

We propose a localized address autoconfiguration (LaConf) scheme for wireless ad hoc networks.Address allocation information is maintained on the network border nodes,called addressing agents (AAs),which are locally identified by a geographic routing protocol GFG (Greedy-FACE-Greedy).When a node joins the network,it acquires an address from a neighboring AA (if any exists) by local communication or from the head AA (a geographic extreme AA) by GFG-based multi-hop communication.A Geographic Hash Table (GHT) ...     

面向服务访问控制的Ad Hoc网群密钥分配

Ad Hoe网络的面向服务的访问控制是个敏感的安全问题,而现有的群密钥分配方案存在抗授权侵犯能力弱的问题,通过引人角色授权约束,提出一种基于面向服务访问控制的群密钥分配方案,减少群在授权侵犯下的安全威胁,经与其他群密钥分配方案比较,显示该方案具有安全性和可用性．     

Robust Sensor Bias Estimation for Ill-Conditioned Scenarios

Sensor bias estimation is an inherent problem in multi-sensor data fusion systems. Classical methods such as the Generalized Least Squares (GLS) method can have numerical problems with ill-conditioned sets which are common in practical applications. This paper describes an azimuth-GLS method that provides a solution to the ill-conditioning problem while maintaining reasonable accuracy compared with the classical GLS method. The mean square error is given for both methods as a criterion to determine when to use this azimuth-GLS method. Furthermore, the separation boundary between the azimuth-GLS favorable region and that of the GLS method is explicitly plotted. Extensive simulations show that the azimuth-GLS approach is preferable in most scenarios.     

一种基于自适应退避策略的无线传感器网络分簇算法

证明了LEACH算法的不确定特性将会导致某些节点过快耗尽电池能量而缩短系统寿命.提出了一种基于退避策略的负载均衡的分簇算法,通过自适应地调整每个节点的退避等待时间,从而保证拥有较多电池能量的节点有更大的机会成为簇首,并引入信道竞争的机制来保证簇首的均匀分布.仿真实验表明,该算法有效延长了系统寿命,提高了网络的能耗效率.     

Topology Adaptation for Robust Ad Hoc Cyberphysical Networks under Puncture-Style Attacks

Many cyber physical networks will involve ad hoc deployments utilizing peer-to-peer communications.Examples include transportation systems where a group of moving cars communicate in order to avoid collisions,teams of robotic agents that work together in support of disaster recovery, and sensor networks deployed for health-care monitoring, monitoring the operation of a factory plant or to coordinate and actuate mechanisms for energy conservation in a building. These networks may face a variety of threats that puncture their connectivity and, should their performance degrade, the result could be catastrophic. Consider, for example, a vehicular ad hoc network where communication assists collision avoidance. In such a case, degradation could lead to vehicle accidents. Therefore, in order to overcome network performance degradations and the puncture of a network(such as blackhole or jamming) which is under attack, we propose an algorithm called the Fiedler Value Power Adjustment Topology Adaption(FVPATA). FVPATA aims to dynamically adapt an ad hoc network's topology, even if the attacker varies its location and in the case of an interference-style attack by increasing the interference power. The algorithm utilizes the formulation from the graph theory which works with the Fiedler value to guide each node in wireless ad hoc network utilizing power adjustments to enhance the network's overall robustness. The advantage of the proposed mechanism is that it is a light-weight approach which is totally distributed, based on topology updates inherent in the Optimized Link State Routing(OLSR) protocol and, hence, it is unnecessary to introduce additional messages. Additionally, an algorithm was developed to resolve problems involving asymmetric links that arise in ad hoc networks by eliminating unnecessary energy consumption of Fiedler nodes. Simulation results using NS3 show that the proposed mechanism successfully decreases the average amount of hops used by 50% and the delay of flows when nodes are migrating at a modest rate below 60 m/min.     

基于分布式的无线传感器节点定位算法研究

本文分析了无线传感器网络的特点和目前己有的各类定位算法的基本思想及性能,并对现有的几种无线传感器网络分布式节点定位算法进行了深入的研究,从而确定了有效的定位算法对每个节点的位置具有重要的理论意义与实用价值。     

一种时分复用光纤传感器阵列信号处理方案的设计与实现

通过对被测信号与光纤传感器输出信号频率、频谱的分析,设计了一种时分干涉型光纤传感器阵列信号处理与信号解调的处理方案,并给出了实验结果。     

分布式自组织网络动态功率控制机制的研究与实现

针对自组织网络的功率控制机制,提出了一种适用于自组织网络的分布式动态功率控制机制.源节点首先向目的节点申请保护时隙作为专用数据通信时隙,申请成功后源节点根据接收到的响应报文的发送功率和接收信号强度指示器,计算出源节点到目的节点的最优发送功率,减少发送功率从而节省节点能耗.基于CC2430无线模块开发了实验验证平台对该机...     

一个分布式园区网络安全防御系统模型

首先针对园区网络的特点提出了一种树形结构的分布式防御模型．该模型包括中央控制台、网络安全防御器、主机安全防御器3部分．然后描述了各个部件的具体的设计方案，以及整个防御系统的协同工作机制．最后分析了模型的优势和缺陷，并提出了弥补缺陷的解决措施．