一种三角形网格空洞修复算法

无线传感器网络由大量传感器节点组成,在网络初始化时节点随机部署在目标区域中,导致某一区域未被覆盖而形成覆盖空洞.针对目标区域中存在覆盖空洞问题,设计了一种基于三角形网格的无需地理信息的空洞探测算法ATN和空洞修复算法TNR.利用ATN算法检测节点与其邻居形成的三角形网格是否被完全覆盖,TNR算法以ATN算法理论为基础,向三角形网格中添加节点使目标区域完全覆盖.理论与仿真实验分析表明,ANR算法能够探测出目标区域中所有空洞,TNR算法在部署密集的传感网络中能够快速完成空洞修复.     

利用移动内点来修复传感器网络空洞的算法

针对目标区域中存在感知空洞问题,提出了一种空洞修复准则。在此基础上,设计了基于移动节点无需地理信息的修复算法SOI,该算法通过计算空洞边缘可移动的最佳内点,使该边缘节点到达新的位置,实现减少目标区域中空洞面积的目的。分析与仿真实验表明,与VHR算法相比,SOI算法在部署密集的传感网络中需要移动的总距离更少。     

基于虚力的移动节点的无线传感网络空洞修复算法

由于无线传感网络WSNs的内在特性以及环境因素,兴趣区域Ro I内出现覆盖空洞是无法避免的。为此,提出基于虚力的局部移动空洞处理(VF-LMH)算法。VF-LMH算法分为空洞检测及空洞修复两个阶段。首先进入空洞检测阶段,利用网络Gabriel图局部协议识别空洞以及空洞中心位置、尺寸,随后进入空洞修复阶段,先明确空洞处理区域,然后空洞处理区域内的节点依据虚力进行局部移动,修复空洞。仿真结果表明,提出的VF-LMH算法能够有效检测并修复空洞,与同类算法相比,VF-LMH算法的修复空洞成本低廉(参与移动的节点数少、总移动距离小)。     

基于多移动节点和遗传算法的传感器网络覆盖修复策略

设计了一种基于多移动节点和路径规划的传感器网络覆盖的修复策略。该机制通过对节点消耗能量的分析,采用遗传算法计算出移动节点的合理移动路径,可以最大可能地对普通节点进行及时修复,最大程度地避免由于传感器节点死亡带来的覆盖空洞。用随机过程在数学上证明了算法的收敛性。通过仿真实验的测试证实,所设计传感器节点修复机制和对移动节点的路径规划的求解算法能有效地预防节点死亡带来的覆盖空洞问题。     

WSNs中基于粒子群优化的信宿移动路径规划算法

感测数据,再将数据传输至信宿是无线传感网络(WSNs)中节点的首要任务。传感节点由电池供电,它们的多数能量用于传输数据,越靠近信宿的节点,传输的数据量越大。因此,这些节点的能耗速度快,容易形成能量-空洞问题。而通过移动信宿收集数据能够缓解能量-空洞问题。为此,提出基于粒子群优化的信宿移动路径规划(PSO-RPS)算法。PSO-RPS算法结合数据传递时延和信息速率两项信息选择驻留点,并利用粒子群优化算法选择最优的驻留点,进而构建时延有效的信宿收集数据的路径。仿真结果表明,提出的PSO-RPS算法有效地控制路径长度,缩短了收集数据的时延。     

移动WSNs的能耗区路由

节点的移动对移动无线传感网络(MWSNs)路由设计提出了挑战.为此,提出基于接触时间的能耗区路由(CECA).CECA路由采用休眠-唤醒机制,降低了节点能耗.CECA路由利用源节点与信宿的位置信息构成圆角矩形区域,且只允许区域内的节点才能参与路由.通过节点移动信息,计算接触时间,并利用接触时间设置定时器,进而通过定时器...     

WSNs中一种基于强化学习的跟踪调度算法

目标跟踪是无线传感器网络(Wireless Sensor Networks, WSNs)中一项应用广泛的技术,旨在估计目标在监控区域内移动时的位置。为了探索网络在跟踪精度和能量效率之间的最佳权衡,结合目标的动态特性,提出了一种基于强化学习(Reinforcement Learning, RL)中Q学习框架的传感器调度算法。通过设计与能量效率和跟踪性能相关的奖励函数,网络中的传感器节点能用最小的能量开销实现对目标的高精度跟踪。仿真结果表明,所提算法相较于传统算法不仅在跟踪精度上实现至少1.1%的增益,并降低同时刻下至少34.1%的节点平均剩余能量值,对于提升目标跟踪的性能有一定指导意义。     

一种新的异构无线传感网覆盖优化算法

针对异构传感器节点在网络初期部署中产生大量覆盖面积冗余的问题,结合相关几何图形知识,以提高网络覆盖率、改善节点分布均匀度为优化目标,提出一种基于节点定向移动来减少节点两两之间覆盖冗余面积的网络覆盖优化算法。算法预先设立判定门限,通过判定两两节点之间覆盖冗余面积与设定门限的大小关系,对节点实施有向性偏移,逐一减少节点之间的覆盖冗余面积。理论分析与实验仿真证明,该算法能够有效提高异构传感器网络部署中的覆盖率,优化节点分布均匀度将近8.7,尤其在大型传感器网络的节点部署中具有极强实用性。     

基于移动锚节点的无线传感网络节点定位算法

在无线传感网络定位算法中,锚节点位置决定了节点定位精度。为此,提出基于高斯-Markov模型的移动锚节点的节点定位(GM-MAL)算法。GM-MAL算法基于高斯-Markov移动模型,提出自适应锚节点的移动路径规划,通过速度调整策略、垂直平分线策略、虚斥力策略以及虚引力策略规划路径。在定位阶段,将非凸优化问题转化为双凸形式,再利用交替最小算法(AMA)求解,进而获取更短的锚节点移动路径。实验数据表明,引入虚引力策略提高了路径规划精度,覆盖了更多的监测区域。此外,相比于线性算法,GM-MAL的定位精度得到提高。     

WSNs中优化移动信宿路径的数据收集算法

收集数据是部署无线传感网络(WSNs)的根本目的。采用移动信宿策略可有效缓解WSNs的能耗问题,信宿的移动路径是该策略的关键。为此,提出基于伪驻留点的数据收集(VRDC)算法。VRDC算法先依据驻留点规划信宿路径,再依据路径选择伪驻留点(VRPs)。VRPs可通过一跳直接向移动信宿传输数据,而其他的节点则将数据传输至最近的VRPs,进而减少传输跳数,降低能耗。仿真结果表明,提出的VRDC算法能有效降低能耗,并平衡节点间的能耗。     

一种基于覆盖表融合的移动群智感知协作算法

在集中性较高的感知区域中,移动群智感知网络节点在无控制的模式下,容易产生感知数据冗余度大幅升高的问题,降低了网络感知质量。针对这种情况,首先对感知区域进行时空域划分,并对感知过程进行建模;然后引入单元格充足感知覆盖概念,设计了一种基于覆盖表信息融合的移动节点协作感知数据收集算法。实验仿真表明,相较于原始感知模式和本地控制模式,该算法能大幅消除感知冗余数据,从而提高感知网络的数据质量,同时节约移动节点代价。     

一种新的基于MR的移动网络越区覆盖判别算法

针对移动网络系统中普遍存在的越区覆盖问题,提出了一种新的低成本的越区覆盖判别的新算法,从而提高网络的性能指标.该算法通过在Iub接口中实时采集信令MR帧,并对其MR帧进行同步解析获取其帧结构中的相关数据,在考虑用户切换掉话的多种场景下提出了基于邻区判别的越区覆盖侦测方案.实验结果显示该方法可以有效解决越区覆盖问题.     

A distributed self-deployment algorithm for the coverage of mobile wireless sensor networks

This letter addresses a coverage problem through the use of a self-deployed mobile wireless sensor network. We propose a distributed motion coordination algorithm for the mobile sensors to autonomously form a sensor barrier between two given landmarks to achieve the barrier coverage. The algorithm is developed based on some simple rules that are computationally efficient and require less communication overhead.     

无线传感器网络中覆盖算法研究综述

覆盖问题是无线传感器网络中的重要问题.覆盖问题的解决对于传感器网络中的数据收集、数据聚集、数据查询、数据挖掘等应用具有重要的意义.近年来,研究者们针对不同拓扑结构的无线传感器网络中的不同类型的覆盖问题展开了研究.本文将针对现有覆盖问题的算法进行总结,并对现存算法所存在的问题进行分析.     

Decentralized and energy‐balanced algorithms for maintaining temporal full‐coverage in mobile WSNs

Coverage is one of the most important issues in Wireless Sensor Networks (WSNs). However, full coverage only can be achieved when surplus mobile sensors contribute a coverage area larger than the hole size. When there is no surplus mobile sensor to cover a big hole, previous studies have utilized mobile sensors by moving the hole from one location to another, therefore achieving temporal full‐coverage, where each location on the monitoring region has been ever covered by mobile sensors during a fixed time interval. However, with only some mobile sensors participating in the hole‐movement task, this results in an energy‐imbalance WSN. This paper considers a mobile WSN that contains a big hole where there exists no redundant mobile sensor to heal the hole. Three distributed algorithms, called Basic, Forward‐Only, and Any‐Direction movement mechanisms, are proposed to achieve the purpose of temporal full‐coverage in a way that the total energy consumption is minimized or that the energy consumption of all mobile sensors that participate in the hole‐movement task are balanced. Simulation results reveal that the proposed hole‐movement mechanisms enhance the coverage of WSNs and balance the energy consumption of mobile sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd.     

An energy efficient hole repair node scheduling algorithm for WSN

A sensor node in the wireless sensor network has limited energy and it normally cannot be replaced due to the random deployment, so how to prolong the network life time with limited energy while satisfying the coverage quality simultaneously becomes a crucial problem to solve for wireless sensor networks (WSN). In this work, we propose an energy efficient algorithm based on the sentinel scheme to reduce the sleeping node detection density by defining a new deep sleeping state for each sensor node. The average energy consumed by probing neighboring nodes is introduced as a factor to calculate the detection rate. In addition, after some theoretical analysis of the existence of coverage holes in WSN, a triangle coverage repair procedure is defined to repair coverage holes. Simulation results show that our proposed algorithm obtained better performance in terms of the coverage quality and network life time compared with some existing algorithms in the literature.     

An energy-balanced swept-coverage mechanism for mobile WSNs

Coverage is one of the most important issues in Wireless Sensor Networks (WSNs). In literature, many coverage mechanisms have been proposed and employed mobile sensors to cover (heal) the coverage holes in the monitoring region. Consider that there are no redundant mobile sensors in a monitoring region. Some studies presented hole-movement mechanisms which used a mobile sensor to move a hole from one location to another, achieving the swept coverage of the monitoring region. However, in these studies, there are only some mobile sensors that participate in the hole-movement task, leading to an energy-unbalanced WSN. This paper considers a mobile WSN that contains holes and has no redundant mobile sensors to reach the spatial full coverage of the given monitoring region. To meet the swept coverage of the given monitoring region and balance the energies of mobile sensors, a distributed energy-balanced hole-movement mechanism, called EBHMM, is proposed. Theoretical analysis and performance evaluation reveal that the proposed EBHMM has better performance than existing hole-movement mechanisms in terms of the network lifetime and energy-balanced degree of mobile sensors.