共查询到15条相似文献,搜索用时 218 毫秒
1.
2.
3.
栅栏覆盖是无线传感器网络中的研究热点,鉴于移动节点的高昂造价以及在移动过程中的巨大能耗,针对高效节能的修复栅栏漏洞问题进行研究.建立静止节点的权重图,并利用迪杰斯特拉算法(Dijkstra)寻找所需最少数目的移动节点和构建栅栏覆盖的最短路径.根据构建栅栏覆盖的最短路径和基于路径上的每个栅栏漏洞所需的最少移动节点,将栅栏漏洞划分为简单情况和一般情况,借助于最大权匹配算法(Kuhn-Munkres)求解移动节点的最短移动距离.仿真实验表明,所提出算法明显减少了移动节点的移动距离,实现了栅栏覆盖. 相似文献
4.
在栅栏覆盖研究中,针对节点部署区域存在无法被监测到的穿越路径的问题,将[Voronoi]图引入栅栏覆盖,划分整个部署区域,提出了基于[Voronoi]图的无线传感器网络栅栏覆盖策略,并监测部署区域是否存在栅栏覆盖空洞,以决定节点是否通过有限移动重新部署空洞区域,实现了对栅栏部署区域的有效覆盖。仿真实验结果表明,该算法提高了对监测区域的覆盖质量,以较低能耗和较少节点构建栅栏,达到预期覆盖要求。 相似文献
5.
6.
针对无线传感器网络中栅栏构建的问题,提出了一种基于监测区域Voronoi图划分的无线节点栅栏构建算法。仿真结果显示,网络中无线节点部署地越多,栅栏形成的可能性和组建栅栏的节点平均数量也会随之增加。该算法能够在无线传感器网络节点覆盖密度较低且不均,已经形成了少量栅栏空洞的情况下快速实现监测区域的栅栏覆盖,但空洞修复还需要进一步研究。 相似文献
7.
传感网感知节点部署的随机性以及节点能耗殆尽、损坏退出等问题使网络中存在覆盖洞, 利用移动节点来修补覆盖空洞是当前较为可行的方法. 假定网络在静态节点和移动节点处混合, 并且在节点感知半径异构的情况下,研究如何通过移动节点重定位来修复感知覆盖洞, 同时兼顾移动距离或能耗最小以及修复后的感知覆盖率最大化来优化感知覆盖性能. 针对移动节点覆盖洞修补规划的NP-hard 问题, 结合遗传算法, 提出一种覆盖洞修补算法来求解最优解. 仿真实验结果表明, 所提出的算法相比于同类算法能够更有效地修补漏洞并兼顾节点能耗以及感知覆盖率.
相似文献8.
9.
目前大多数传感器网络部署研究主要集中在二维平面和三维全空间区域,然而,许多现实世界的应用领域是一个复杂的三维空间曲面,现有的覆盖方法不能取得较好的结果。本文研究三维空间曲面传感器网络部署方法,提出一种三维曲面多移动节点的传感器网络部署算法,采用静态节点和动态节点组成的混合传感器网络,由静态节点估算覆盖空洞的位置和面积,再通过移动节点对覆盖空洞进行依次修复。仿真结果表明,该算法的最终网络覆盖率达到了99%,比3DGA算法提高了6个百分点,比Delaunay算法提高了8.5个百分点,同时降低了网络整体能耗。 相似文献
10.
K-栅栏覆盖是无线传感器网络覆盖控制的研究热点之一。本文构建了强栅栏覆盖模型,提出了分区强K-栅栏覆盖构建算法PMNSB,用最少的节点形成强栅栏。首先把监控区域分成多个子区域,通过匈牙利算法选用移动距离之和最少的网格集合为基准1-栅栏覆盖,缺少移动节点的子区域,选择附近区域的剩余移动节点修补形成1-栅栏覆盖。水平相邻的两个子区域之间构建竖直栅栏,这些1-栅栏合起来构成强K-栅栏覆盖。仿真结果证明了该方法的有效性,本文的研究对提升无线传感器网络的性能具有重要的理论与实际意义。 相似文献
11.
Xiao-Yang Liu Kai-Liang Wu Yanmin Zhu Linghe Kong Min-You Wu 《Computer Networks》2013,57(11):2348-2363
Coverage is a fundamental issue in sensor networks, which usually dictates the overall network performance. Previous studies on coverage issues mainly focused on sensor networks deployed on a 2D plane or in 3D space. However, in many real world applications, the target fields can be complex 3D surfaces where the existing coverage analysis methodology cannot be applied. This paper investigates the coverage of mobile sensor networks deployed over convex 3D surfaces. This setting is highly challenging because this dynamic type of coverage depends on not only sensors’ movement but also the characteristics of the target field. Specifically, we have made three major contributions. First, we generalize the previous analysis of coverage in the 2D plane case. Second, we derive the coverage characterization for the sphere case. Finally, we consider the general convex 3D surface case and derive the coverage ratio as a function of sensor mobility, sensor density and surface features. Our work timely fills the blank of coverage characterization for sensor networks and provides insights into the essence of the coverage hole problem. Numerical simulation and real-world evaluation verify our theoretical results. The results can serve as basic guidelines for mobile sensor network deployment in applications concerning complex sensing fields. 相似文献
12.
针对水下环境的三维传感器网络节点随机部署时存在覆盖率低的问题,设计一种基于垂直采样的水下三维传感网络覆盖算法,用于提高水下三维传感器网络覆盖率和连通性.垂直采样算法首先对三维监测区域进行垂直平面采样,然后再对该平面进行直线采样,把三维空间的覆盖问题转化为多平面内的直线覆盖优化问题,达到对整个三维网络覆盖优化的目的.仿真结果表明,在100 m×100 m×100 m的三维监测水域,垂直采样算法比三维随机部署策略可提高约4%~28%的覆盖率,在节点数为40时对覆盖率的提升程度最大. 相似文献
13.
14.
韩雨涝 《计算机工程与应用》2020,56(12):87-92
针对无线传感器网络覆盖空洞影响网络服务质量问题,提出非并行二分法的分布式覆盖空洞修复算法CHRND,算法采用非并行方式选择具有劣弧的空洞边界节点作为覆盖空洞修复的驱动节点,采用基于弧二分法确定移动节点最佳目标位置。仿真实验结果表明,移动节点引入使得空洞不被分割基础上,CHRND算法能以较少数量移动节点实现覆盖空洞的完全修复。 相似文献
15.
Mohsen Eftekhari Evangelos Kranakis Danny Krizanc Oscar Morales-Ponce Lata Narayanan Jaroslav Opatrny Sunil Shende 《Distributed Computing》2016,29(5):361-376
We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the barrier and can move along the barrier. The goal is to find final positions for sensors so that the entire barrier is covered. In recent years, the problem has been studied extensively in the centralized setting. In this paper, we study a barrier coverage problem in the distributed and discrete setting. We assume that we have n identical sensors located at grid positions on the barrier, and that each sensor repeatedly executes a Look-Compute-Move cycle: based on what it sees in its vicinity, it makes a decision on where to move, and moves to its next position. We make two strong but realistic restrictions on the capabilities of sensors: they have a constant visibility range and can move only a constant distance in every cycle. In this model, we give the first two distributed algorithms that achieve barrier coverage for a line segment barrier when there are enough nodes in the network to cover the entire barrier. Our algorithms are synchronous, and local in the sense that sensors make their decisions independently based only on what they see within their constant visibility range. One of our algorithms is oblivious whereas the other uses two bits of memory at each sensor to store the type of move made in the previous step. We show that our oblivious algorithm terminates within \(\varTheta (n^2)\) steps with the barrier fully covered, while the constant-memory algorithm is shown to take \(\varTheta (n)\) steps to terminate in the worst case. Since any algorithm in which a sensor can only move a constant distance in one step requires \(\varOmega (n)\) steps on some inputs, our second algorithm is asymptotically optimal. 相似文献