WSN中引入移动节点的路由协议设计与仿真

对于节点部署不均或者节点死亡而导致的监测盲区,可通过在WSN中引入移动节点来修复。提出一种修复策略,可较为及时、准确地修复监测盲区,同时考虑节点的能量均衡问题。在LEACH-M分簇路由算法的基础上,给出了一种按节点能量分配工作量的能量均衡分簇路由算法LEACH-M-G,并运用MATLAB仿真工具进行了仿真分析。仿真结果表明,所提出的监测盲区修复策略、以及LEACH-M-G路由能有效地修复监测盲区,均衡网络能量、延长网络生命周期。     

无线传感器网络中分阶段的无需测距定位算法

为了提高无线传感器网络中基于无需测距算法定位精度,改进质心算法和DV-Hop算法,定位过程分为两个阶段:第一阶段在最佳通信半径与最佳阈值下,用基于阈值的优先质心算法定位部分节点;第二阶段在最佳通信半径与最佳指数值下用DV-Hop算法定位剩余节点。将算法应用在一种锚节点人工部署环境下,并与其他算法对比。MTLAB仿真结果表明,改进的算法在不增加泛洪次数、计算量和网络硬件成本下能提高定位精度,同时实现100%定位。     

信标节点漂移情况下的无线传感器网络节点定位机制

针对信标节点漂移情况下的节点定位问题,提出了一种分布式的信标节点漂移检测方法,采用节点自评分和协商机制,自动寻找可能发生了漂移的信标节点,同时针对大量信标节点发生漂移后的定位覆盖率下降问题,构建普通节点的定位可信度模型,并在定位盲区内使用一些较为可靠的普通节点作为临时信标节点进行定位。仿真实验表明,该算法在误检测、定位误差方面性能优于传统算法,具有较低的通信开销、较高的实用性和灵活性。     

基于可分组设计的部分重复码研究

针对最小带宽再生情形下的有效修复问题,提出了一种新型部分重复(FR,fractional repetition)码设计。该设计由外部最大距离可分(MDS,maximum distance separable)码和内部重复码组成,称为GDDBFR(group divisible design based FR)码,可以达到随机访问模式下的系统存储容量,并且能够在很大范围内选择构造参数。理论分析指出,尽管GDDBFR码采用基于表格的修复方式,但通常具有大量的节点修复选择方案。此外,实验结果表明,与传统的RS(Reed-Solomon)码和再生码相比,GDDBFR码可以显著地减少失效修复时间。     

考虑恶意节点的CRN合作频谱感知方法

基于带有恶意节点的更为实际的频谱感知环境,研究了基于合作感知的频谱共享网络模型,次级用户将会根据合作感知结果动态地调整其发射功率。为了防止恶意节点对感知系统的感知性能造成严重影响,研究了如何进行合作感知以提高感知性能。在一定的检测概率和相关功率约束下,建立了一个以最大化次级网络的吞吐量为目标函数的优化问题。仿真实验首先突出说明了恶意节点数目对频谱感知影响重大,同时还表明无论是否存在恶意节点,提出的算法均可有效地计算出最优的感知时间和发射功率,且在降低最大干扰功率限制和最大发射功率限制时,网络的吞吐量是增大的。     

一种筛选电网脆弱节点的新方法

为了快速有效的确定电网的脆弱节点,提出了一种利用多种指标综合筛选电力系统脆弱节点的方法。首先通过绘制出系统各负荷节的 PV,QV 曲线,求取各负荷节点的电压变化指标和无功功率裕度指标;随后将这两种指标进行综合,用于判断电力系统脆弱节点。通过设置不同的权重系数可以实现不同情况下的脆弱节点判断。并将此方法应用于实际电网,将得出的脆弱节点分析结果与通过传统的模态分析法得出的结果进行比较,证明了此方法在筛选系统脆弱节点方面的正确性与有效性。     

基于最小均方误差选择参考节点的RSS测距定位算法

无线传感网中的多类应用均需要准确的定位算法.为了降低定位成本,减少能量消耗,常采用基于接收信号强度RSS(Received Signal Strength)测距,并建立相应的方程,再利用线性最小二乘LLS(Linear Least Squares)法求解节点的位置,将此定位算法记为RSS+LLS算法.RSS+LLS算法随机选择参考节点,这有损定位精度,同时,LLS算法并没有考虑每个测距值的误差,这些不足降低算法的定位性能.为此,提出基于RSS+LLS的优化算法,记为RSS+WLS+OPT算法.该算法先通过RSS测距,并基于最小均方误差原则选择参考节点,从而提高定位精度,同时,给每个测距值引入权重系数,采用基于协方差矩阵的加权最小二乘法WLS(Weighted Least Squares)求解节点位置,进而降低了测量误差对定位精度的影响.仿真结果表明,与RSS+ LLS相比,提出的RSS+WLS+OPT算法的定位精度提高了约2米,并没有增加计算时间,降低对测距误差的敏感性.     

Identification of mechanisms of toxic action for skin sensitisation using a SMARTS pattern based approach

Skin sensitisation is a key endpoint under REACH as it is costly and its assessment currently has a high dependency on animal testing. In order to reduce both the cost and the numbers of animals tested, it is likely that (quantitative) structure–activity relationships ((Q)SAR) and read-across methods will be utilised as part of intelligent testing strategies. The majority of skin sensitisers elicit their effect via covalent bond formation with skin proteins. These reactions have been understood in terms of well defined nucleophilic–electrophilic reaction chemistry. Thus, a first step in (Q)SAR analysis is the assignment of a chemical's potential mechanism of action enabling it to be placed in an appropriate reactivity domain. The aim of this study was to design a series of SMARTS patterns capable of defining these reactivity domains. This was carried out using a large database of local lymph node assay (LLNA) results that had had potential mechanisms of action assigned to them using expert knowledge. A simple algorithm was written enabling the SMARTS patterns to be used to screen a database of SMILES strings. The SMARTS patterns were then evaluated using a second, smaller, test set of LLNA results which had also had potential mechanisms of action assigned by experts. The results showed that the SMARTS patterns provided an excellent method of identifying potential electrophilic mechanisms. The findings are supported, in part, by molecular orbital calculations which confirm assignment of reactive mechanism of action. The ability to define a chemical's potential reaction mechanism is likely to be of significant benefit to regulators and risk assessors as it enables category formation and subsequent read-across to be performed.     

一种基于STM32的NAND flash的块分配框架设计

STM32对大容量数据文件存储与管理问题可通过NAND flash来解决。而NAND flash的高效管理需要文件系统参与。NAND flash有特殊的块读写及擦除机制,一般的嵌入式文件系统组织结构并不完全兼容NAND flash。针对NAND flash的特点兼顾STM32的资源承受力要提出新的NAND flash块分配框架,框架通过块分配槽这种数据结构,在不使用块分配表与垃圾表的情况下,实现了NAND flash均衡负载与垃圾块的回收;同时通过节点分配栈与文件节点表的配合来提高STM32对文件的读写速度,空间利用率和系统性能。仿真实验和计算结果表明该块分配框架可有效提高NAND flash块的均衡负载与节省RAM空间。     

Non‐cooperative game‐based packet ferry forwarding for sparse mobile wireless networks

In sparse mobile wireless networks, normally, the mobile nodes are carried by people, and the moving activity of nodes always happens in a specific area, which corresponds to some specific community. Between the isolated communities, there is no stable communication link. Therefore, it is difficult to ensure the effective packet transmission among communities, which leads to the higher packet delivery delay and lower successful delivery ratio. Recently, an additional ferry node was introduced to forward packets between the isolated communities. However, most of the existing algorithms are working on how to control the trajectory of only one ferry work in the network. In this paper, we consider multiple ferries working in the network scenario and put our main focus on the optimal packet selection strategy, under the condition of mutual influence between the ferries and the buffer limitation. We introduce a non‐cooperative Bayesian game to achieve the optimal packet selection strategy. By maximizing the individual income of a ferry, we optimize the network performance on packet delivery delay and successful delivery ratio. Simulation results show that our proposed packet selection strategy improves the network performance on packet delivery delay and successful delivery ratio. Copyright © 2013 John Wiley & Sons, Ltd.