基于预测的移动目标跟踪节点协同调度算法

节点调度是分布式传感网降低节点能耗、延长网络寿命的重要手段。针对基于传感网的目标跟踪应用,提出目标运动和节点感知模型,并在此基础上提出一种基于预测的移动目标跟踪节点协同调度算法。算法利用粒子滤波构造节点感知功效函数,利用一种均衡节点剩余能量的方法构造感知能效函数,选举出参与目标跟踪过程的感知组成员。仿真结果表明,该算法具有较高的目标跟踪和定位精度,且可有效平衡节点之间的能耗分布。     

一种无线视频传感器节点协作跟踪方法

由于网络通信带宽以及节点能量等因素限制,信息的有效获取与能耗的平衡优化是无线视频传感器网络近期研究的热点,面向目标跟踪的无线视频传感器网络实现节能的关键在于节点的高效协作;文章目的在于研究一种无线视频传感器节点协作跟踪方法,通过综合考虑目标跟踪效果和节点能耗等因素,采用自适应混合高斯算法进行背景建模,分布式均值漂移算法进行目标跟踪,并构建一种基于效能函数的最优节点选择方法;实验结果显示该方法能在真实场景下高效地进行目标跟踪。     

基于无线传感器网络的战场目标跟踪

基于无线传感器网络,对目标定位跟踪应用进行了研究。在对目标定位跟踪时,如何既保证跟踪精度又能有效降低能量消耗,针对这个问题,提出了一种简便的加权坐标质心定位方法,通过对目标的定位,给出了一种基于测量信息的跟踪方法,方法实现简单。性能分析表明:提出的定位跟踪方法能有效地降低能量消耗,延长节点和网络寿命,基本可以满足战场目标跟踪需求。     

二进制无线传感器网络目标定位跟踪算法

二进制无线传感器网络是一种新的和具有巨大潜在应用前景的目标定位跟踪平台,它具有通信负荷少,生存能力强等特点。提出一种基于网络时间的迭代算法,在目标通过一定数量的节点后,给出较为精确的目标运动参数,并在算法迭代的过程中,不断优化算法结果。最后,运用多Agent仿真思想,借助于RePAST仿真平台对算法进行了仿真验证。     

一种应用于对等网络的可信片上Agent模型

提出一种可信片上Agent模型（T-AoC）,它用于开放的、不安全的、面向网络边缘节点的对等网络环境中。为了有效保护应用Agent计算的系统中的Agent不被恶意Agent执行环境及Peer主机对Agent的攻击,T-AoC模型采用集成芯片作为硬件基础为Agent提供安全、可靠的执行环境。该芯片可安装在各需要运行Agent及其应用系统的对等网络节点主机上。基于信任关系转移的思想,增强对等网络节点之间的可信性,更有效地构建各种安全、可靠的基于Agent的P2P应用系统。具体描述了T-AoC模型的层次架构、工作原理和运行流程,以及T-AoC在P2P网络信息搜索系统的应用示范,分析了T-AoC的性能特点。     

一种基于预测策略的目标跟踪算法研究

移动目标跟踪是无线传感器网络中的一项重要应用,引起了越来越多的关注.采用静态网格网络结构,针对现有无线传感器网络目标跟踪算法不能兼顾精度和能耗的问题,提出了一种基于预测策略的目标跟踪算法.当目标进入监控区域后,节点携带的震动传感器感知到目标,簇头节点根据节点检测目标信号强度值来计算目标位置,目标位置计算采用一种基于检测...     

分布式粒子滤波实现无线传感器网络目标跟踪

为了延长无线传感器网络寿命,减小通信代价,提出一种层次型网络结构下基于粒子滤波的分布式跟踪算法.层次型网络由簇头节点和普通传感节点组成,簇头节点采用粒子滤波获得目标运动状态,联合当前时刻目标的本地估计位置、预测速度预测下一时刻的目标位置.并根据目标的预测位置判断是否转移簇首.目标离开节点探测范围后,节点进入休眠状态.实验表明,该方法能满足目标跟踪精度,并可有效的减少网络能耗,提高无线传感器网络使用寿命.     

异构无线传感器网络对移动目标的连续跟踪

针对固定节点组成的传统无线传感器网络在进行目标跟踪时存在的能耗过高和覆盖空洞问题,提出在传统传感器网络中引入少量移动性节点组成异构传感器网络进行目标跟踪的方案.基于较传统0/1监测模型更为实际的概率监测模型,提出一种协同调度移动节点和固定节点工作的算法来对移动目标进行跟踪.移动节点对目标实施近距离的移动式跟踪,减少了处于活跃状态的固定节点数量,节约了能耗.此外,移动节点可以移动进入空洞监测目标,解决了传统网络不能监测覆盖空洞中的目标的问题.基于NS2的实验结果表明所提出的跟踪方法可以大幅度减少固定节点的能耗并提高跟踪质量,证明了其有效性.     

一种无线传感网络能效性自适应稀疏测量方法

无线传感网络中无线传感节点由电池供电,能量有限.而无线传感网络目标跟踪应用中,只有部分传感节点需要执行测量任务,测量过程具有稀疏性.针对以上特性,这里提出一种新的基于声音信号的能量有效的自适应稀疏测量方法.采用径向基函数神经网络改进粒子滤波算法,对目标进行定位跟踪,提高目标跟踪精度;采用马氏距离作为判据进行网络测量节点选择;根据估计目标状态,推导预测定位精度,并利用预测定位精度设计自适应测量方法.实验结果显示,采用径向基函数神经网络改进粒子滤波算法,提高了目标定位精度和跟踪过程稳定性,自适应稀疏测量方法能有效节省网络能耗.     

基于不可靠节点序列和面感知路由的目标跟踪

目标跟踪是无线传感器网络最基本的应用之一,如何在节约能量的同时保证一定的跟踪精度一直是研究热点之一.本文提出基于不可靠节点序列和面感知路由的目标跟踪算法,采用基于不可靠节点序列的定位模式有效减少网络中数据传输量,大大节约了能量.为了解决基于节点序列的定位算法在节点数目过多时算法复杂度过高的问题,算法引入了面感知路由技术...     

GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks

In infrastructure-less opportunistic networks (Oppnets), the routing of messages is a challenging task since nodes are not aware of the network topology and they look for an opportunity to send the message by finding or predicting a best temporary path at each hop towards the destination. As nodes perform various computations for next hop selection, a lot of battery power gets consumed, which in turn reduces the network lifetime. Thus, there is a clear demand for routing protocols for such networks which are energy-efficient and consume lesser power of nodes in forwarding a message. In this paper, a novel routing protocol named genetic algorithm-based energy-efficient routing (GAER) protocol for infrastructure-less Oppnets is proposed. This protocol uses a node’s personal information, and then applies the genetic algorithm (GA) to select a better next hop among a group of neighbour nodes for the message to be routed to the destination. With the application of GA, optimal results are obtained that help in the selection of the best possible node as the next hop, which in turn, leads to prolonged battery life. Simulation results show that GAER outperforms the Epidemic, PROPHET, and Spray and Wait protocols in terms of messages delivered, overhead ratio, average residual energy, and number of dead nodes. The results obtained for average latency and average buffer time using GAER are comparable to those obtained for the aforementioned protocols.     

Localized topology control for unicast and broadcast in wireless ad hoc networks

We propose a novel localized topology-control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly such that all nodes together self-form a topology that is energy efficient simultaneously for both unicast and broadcast communications. We theoretically prove that the proposed topology is planar, which meets the requirement of certain localized routing methods to guarantee packet delivery; it is power-efficient for unicast - the energy needed to connect any pair of nodes is within a small constant factor of the minimum; it is also asymptotically optimum for broadcast - the energy consumption for broadcasting data on top of it is asymptotically the best among all structures constructed using only local information; it has a constant bounded logical degree, which will potentially save the cost of updating routing tables if used. We further prove that the expected average physical degree of all nodes is a small constant. To the best of our knowledge, this is the first localized topology-control strategy for all nodes to maintain a structure with all these desirable properties. Previously, only a centralized algorithm was reported. Moreover, by assuming that the node ID and its position can be represented in O(log n) bits for a wireless network of n nodes, the total number of messages by our methods is in the range of theoretical results are corroborated in the simulations.     

基于双簇头的WSNs非均匀分簇路由算法

无线传感器网络由大量密集部署的传感器节点组成，通过节点间的相互协作才能完成工作，因此传感器节点之间的协作非常重要。针对分簇结构无线传感器网络簇头间能耗不均衡导致的“热区”问题，提出一种基于双簇头的新型路由算法NCDH。通过将网络虚拟分区实现网络不均匀分簇，并依据节点的剩余能量、节点与基站的距离、节点度等因素，在簇内选取主、副双簇头节点负责数据处理和转发。在网络运行阶段，根据主簇头的运行状态确定是否启动副簇头，以保证网络能量均匀消耗。在数据传输阶段综合考虑节点与中转节点的距离以及中转节点的剩余能量，从而选出最佳中转节点。实验结果表明，与DEEC、MRDC、GURCP等算法相比，NCDH算法有效改善了网络的“热区”问题，延长了网络的生存时间。     

A swarm-based efficient distributed intrusion detection system for mobile ad hoc networks (MANET)

In mobile ad hoc network (MANET), the issues such as limited bandwidth availability, dynamic connectivity and so on cause the process of intrusion detection to be more complex. The nodes that monitor the malicious nodes should have necessary residual bandwidth and energy and should be trustable. In order to overcome these drawbacks, in this paper, we propose a swarm-based efficient distributed intrusion detection system for MANET. In this technique, swarm agents are utilised to select the nodes with highest trust value, residual bandwidth and residual energy as active nodes. Each active node monitors its neighbour nodes within its transmission range and collects the trust value from all monitored nodes. The active nodes adaptively change as per the trust thresholds. Upon collaborative exchange of the trust values of the monitored nodes among the active nodes, if the active node finds any node below a minimum trust threshold, then the node is marked as malicious. When the source receives alert message about the malicious node, a defence technique is deployed to filter the corresponding malicious node from the network. By simulation results, we show that the proposed approach is efficient intrusion detection mechanism for MANET.     

Energy-aware scheduling for information fusion in wireless sensor network surveillance

Effective energy control while maintaining reliable monitoring performance becomes a key issue in wireless sensor networks (WSNs) based surveillance applications. While importance difference of surveillance zone, limited energy and dynamic network topology pose great challenges to surveillance performance. It is necessary to adjust sensor nodes' awakening frequency dynamically for information fusion. Thus an energy-aware scheduling with quality guarantee method named ESQG is proposed in this paper which considers sensor nodes' residual energy, different importance degrees of the surveillance zone and network topology comprehensively. It first uses a Voronoi diagram to determine the effective scope of each sensor node and then calculates node importance according to its residual energy and the importance degree of the effective scope. Then ESQG utilizes the importance of individual sensing scope and current forwarding costs to further compute node importance and awakening frequency for information fusion. In this way, ESQG can dynamically adapts each nodes awakening frequency to its dynamic network topology and importance degree of each individual sensing scope. The nodes are then turned on stochasticlly via the node awakening probability and node importance based information fusion is conducted for target detection. Besides, an adaptive process of perception factor C is proposed to match actual situation, and automatically change according to the detected data. Experiments results demonstrate that the proposed method ESQG can reduce the number of awakening nodes to a large extent while maintaining high reliability via information fusion.     

水声传感器网络中的节能路由协议改进算法

在大规模三维水声传感器网络中,针对节点能耗和网络传输效率的问题,本文基于节点定位和LEACH算法,提出了一种适用于水声通信传感器网络路由算法,该算法采用定位、聚类、唤醒和排列的思想,首先通过定位,确定节点的位置信息,再通过聚类方法,使水下的节点分成不同的簇,形成节点休眠及唤醒的单元.在数据通信过程中,通过及时唤醒簇单元,使需要利用的簇节点及时被唤醒,处于活跃状态,而暂时不被需要的节点进行休眠,从而达到节能的效果.而在簇内传输时,考虑了节点的剩余能量信息,选择最优节点进行信息传输.仿真实验表明,该算法能够提高网络的整体寿命时间.     

协作式无线传感器网络节点定位算法的研究

提出了一种在三个锚节点的条件下基于到达角的测距方法,利用节点之间的几何关系实现传感器网络中未知节点的定位。通过仿真验证该方法能够对未知节点进行有效的定位;同时,该方法仅依赖到达角信息来确定节点的位置,从而降低了处理的复杂度、节省了节点的能量、提高了节点的寿命。     

基于移动代理具有拥塞控制的AODV路由协议

提出一种基于移动代理的AODV路由协议,来解决Ad Hoc网络的拥塞问题.在网络中引入一定数量的携带拥塞状态的移动代理,移动代理在网络中漫游时选择轻负载的节点为下一跳,并根据节点拥塞状态更新路由表,用较少的信息流量使每个节点及时了解当前网络的拓扑状况.实验结果表明这种路由算法可以有效地平衡网络负载,大大增强了链路的稳定性,降低了端到端的数据传输时延.     

Energy-aware self-organisation algorithms with heterogeneous connectivity in wireless sensor networks

Heterogeneity of node energy is a common phenomenon in wireless sensor networks. In such node energy heterogeneous sensor network, how to balance the energy consumption is the key problem on extending the lifetime of the sensor network system. An energy-efficient self-organisation algorithm with heterogeneous connectivity based on energy-awareness is proposed. Each sensor node in the network adjusts its own transmission radius based on the local energy information during the constructing and operating phase. Thus heterogeneous network topology, in which the nodes can choose different transmission radius, is formed. In contrast to the homogeneous network model, in which the node carries the same radius, simulation and analysis are conducted to explore the topology characteristics and robustness with different node energy distribution. The degree distribution shows the scale-free property in the heterogeneous model. The proposed network model enjoys higher efficiency of transmitting data, less clustering, higher robustness under node random failures and longer network lifetime than those in the homogeneous ones.     

传感器节点相互协作的广播认证

针对无线传感器网络（WSN）中基于数字签名的公钥加密体制的广播认证需要耗费大量的能量,以及传感器节点资源有限的问题,为了减少传感器节点的能量耗费和加快传感器节点的认证,提出一种传感器节点相互协作的广播认证方案。首先,用户向无线传感器网络的组网络广播其签名信息,但不广播签名信息中点的纵坐标;然后,组网络中的高能量节点依据点的横坐标和椭圆曲线方程计算得出纵坐标,并将其广播给组内的一般节点,同时利用vBNN-IBS数字签名对用户广播的签名信息进行认证,并转播有效的签名信息;最后,组网络内的一般节点收到纵坐标后,利用椭圆曲线方程验证其有效性和正确性,同时执行和高能节点相同的签名认证过程,并转播有效的签名信息。此外,该方案通过整合立即撤销和自动撤销以最大限度地减小授权撤销列表（ARL）的长度。仿真实验表明,当认证节点收到来自邻居节点的数据包达到一定数目时,该方案的能量耗费和认证总时间比利用WSN中传感器节点间的相互协作来加速vBNN-IBS的签名方案分别减少了41%和66%。