共查询到20条相似文献,搜索用时 203 毫秒
1.
基于Voronoi的无线传感器网络覆盖控制优化策略 总被引:1,自引:0,他引:1
针对无线传感器网络运行状态中存在覆盖空洞的问题,提出了一种基于Voronoi有效覆盖区域的空洞侦测修复策略。该策略以满足一定网络区域覆盖质量为前提,在空洞区域内合理增加工作节点以提高网络覆盖率为优化目标,采用几何图形向量方法对节点感知范围和Voronoi多边形的位置特性进行理论分析,力求较准确地计算出空洞面积,找寻最佳空洞修复位置,部署较少的工作节点保证整个网络的连通性。仿真结果表明,该策略能有效地减少网络总节点个数和感知重叠区域,控制网络中冗余节点的存在,同时其收敛速度较快,能够获得比现有算法更高的目标区域空洞修复率,实现网络覆盖控制优化. 相似文献
2.
覆盖作为无线传感器网络中的基础问题直接反映了网络感知服务质量.本文在分析现有无线多媒体传感器网络覆盖增强算法的基础上,构建节点三维感知模型,提出面向三维感知的多媒体传感器网络覆盖增强算法(Three-Dimensional Perception Based Coverage-Enhancing Algorithm,TDPCA).该算法将节点主感知方向划分为仰俯角和偏向角,并根据节点自身位置及监测区域计算并调整各节点最佳仰俯角,在此基础上基于粒子群优化调整节点偏向角,从而有效减少节点感知重叠区及感知盲区,最终实现监测场景的区域覆盖增强.仿真实验表明:对比已有的覆盖增强算法,TDPCA可有效降低除节点感知重叠区和盲区,最终实现网络的高效覆盖. 相似文献
3.
无线传感器网络的覆盖优化机制研究 总被引:1,自引:0,他引:1
如何实现最优覆盖是无线传感器组网的一个基本问题.文章分析了传感器覆盖问题的背景,给出了节点调度方案的主要方法和技术原理,探讨了基于网络能量高效的覆盖优化与网络连通性之间的关系,重点阐述了实现区域覆盖和点覆盖的机制.对于覆盖薄弱地区,文章提出了采用分簇方式将覆盖地区划分成许多子区域或簇,用动态移动修复机制提供细粒度的网络监测与覆盖控制.文章认为调度传感器节点在休眠和活动模式之间进行切换,是一种重要节能方法;对于资源受限且拓扑动态变化的无线传感器网络,宜采用分布式和局部化的覆盖控制协议和算法. 相似文献
4.
5.
三维水下传感器网络覆盖优化算法 总被引:1,自引:0,他引:1
针对三维水下传感器网络模型,对水下传感器网络的覆盖优化问题进行了描述,提出利用虚拟势场算法CAT(coverage-enhancing algorithm for three-dimensional sensor networks)调整水下传感器节点与浮标节点间缆绳的距离,逐渐消除网络中的感知重叠区域和覆盖盲区,进而实现整个水下传感器网络覆盖增强.在仿真实验中,通过CAT算法与ETG算法的比较,验证了CAT算法的有效性. 相似文献
6.
覆盖问题是无线传感器网络(Wireless Sensor Network, WSN)设计中的首要问题,尽可能优化区域覆盖率是提升网络感知性能的直接手段.鉴于此,提出一种基于改良型麻雀搜索算法(Reformative Sparrow Search Algorithm, RSSA)的节点部署优化方案.首先,在算法搜索阶段,... 相似文献
7.
8.
为确保无线传感器网络(WSN)覆盖和连通性最大化以及能量消耗最小化的有效监测,提出一种基于多目标生物习性激励(MOBHI)的传感器节点部署算法。首先,将传感器节点的区域(领地)根据诸如最大覆盖、最大连通性和最小能耗等多个目标,基于领地捕食者气味标记行为进行标记,并模仿气味匹配识别其监测的位置;其次,对多个目标的优化问题应用非受控Pareto最优,将其分解为多个单目标优化子问题并同时对它们进行优化,得到所需目标的解。仿真实验结果表明,本文提出算法在网络覆盖、连通性和能耗等性能指标方面都优于其他传感器节点部署的多目标和单目标优化算法。 相似文献
9.
针对移动传感器网络中热点事件监测场景,研究传感器节点的快速优化部署策略.首先假定事件随机产生,针对事件优先模型及节点感知误差函数推导基于Voronoi剖分时感知误差最小,然后定义节点有效覆盖权值,证明了当所有节点有效覆盖权值一致时,整个网络覆盖效能将达到最大.结合虚拟力及节点有效覆盖权提出一种分布式优化部署算法SDOA(Sparse Deployment Optimization Algorithm),其在保证覆盖能效最大化时保证网络连通性.最后仿真比较了本文提出部署策略能够快速有效实现对热点区域部署,并保证较高的覆盖效能. 相似文献
10.
移动传感器网络中节点部署优化直接影响到网络的能量消耗、对目标区域监控的性能及整个网络的生命周期.本文从网络覆盖和能量消耗两个方面,采用多目标优化对节点部署问题建模,并从集中式角度给出了节点部署问题的遗传算法求解过程.针对一类初始中心部署模型进行实验验证,并和基于向量的算法(VEC)、基于维诺图的算法(VOR)及基于边界扩张虚拟力算法(BEVF)进行性能对比,证明了该算法在大多数情况下可使传感器网络对目标区域的覆盖率最大化,同时保证了网络的连通和网络能耗最小,进而延长了网络的生命周期. 相似文献
11.
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method
to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep
scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined
coverage and connectivity. The scheme can activate and deactivate the three basic units of a sensor node (sensing, processing,
and communication units) independently. The paper also provides a probabilistic method to estimate how much the sensing area
of a node is covered by other active nodes in its neighborhood. The method is utilized by the proposed scheduling and routing
scheme to reduce the control message overhead while deciding the next modes (full-active, semi-active, inactive/sleeping)
of sensor nodes. We evaluated our estimation method and scheduling scheme via simulation experiments and compared our scheme
also with another scheme. The results validate our probabilistic method for coverage estimation and show that our sleep scheduling
and routing scheme can significantly increase the network lifetime while keeping the message complexity low and preserving
both connectivity and coverage. 相似文献
12.
Sensing coverage is one of fundamental problems in wireless sensor networks. In this paper, we investigate the polytype target coverage problem in heterogeneous wireless sensor networks where each sensor is equipped with multiple sensing units and each type of sensing unit can sense an attribute of multiple targets. How to schedule multiple sensing units of a sensor to cover multiple targets becomes a new challenging problem. This problem is formulated as an integer linear programming problem for maximizing the network lifetime. We propose a novel energy‐efficient target coverage algorithm to solve this problem based on clustering architecture. Being aware of the coverage capability and residual energy of sensor nodes, the clusterhead node in each cluster schedules the appropriate sensing units of sensor nodes that are in the active status to cover multiple targets in an optimal way. Extensive simulations have been carried out to validate the effectiveness of the proposed scheme. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
13.
提出了一种节点位置无关的连通性覆盖协议。协议首先利用了随机部署网络在已知监测区域大小和节点感知范围情况下,应用期望的覆盖质量与所需的工作节点数量之间的数学关系,随机选取工作节点满足应用需求;然后根据每个节点距基站最小跳数,执行Add-On规则,增加额外节点保证网络连通。实验结果表明,EECPC协议能够在较长时间内能量有效地提供满足应用要求的覆盖率,而且保证网络连通。 相似文献
14.
Richa Mishra Vivekanand Jha Rajeev K. Tripathi Ajay K. Sharma 《Wireless Personal Communications》2018,99(2):651-680
Energy consumption is one of the important issues in wireless sensor network that rely on non chargeable batteries for power. Also, the sensor network has to maintain a desired sensing coverage area along with periodically sending of the sensed data to the base station. Therefore, coverage and the lifetime are the two important issues that need to be addressed. Effective deployment of wireless sensors is a major concern as the coverage and lifetime of any wireless sensor network depends on it. In this paper, we propose the design of a Probability Density Function (PDF) targeting the desired coverage, and energy efficient node deployment scheme. The suitability of the proposed PDF based node distribution to model the network architecture considered in this work has been analyzed. The PDF divides the deployment area into concentric coronas and provides a probability of occurrence of a node within any corona. Further, the performance of the proposed PDF is evaluated in terms of the coverage, the number of transmissions of packets and the lifetime of the network. The scheme is compared with the existing node deployment schemes based on various distributions. The percentage gain of the proposed PDF based node deployment is 32\(\%\) more than that when compared with the existing schemes. Thus, the simulation results obtained confirm the schemes superiority over the other existing schemes. 相似文献
15.
We are concerned with wireless sensor networks where n sensors are independently and uniformly distributed at random in a finite plane. Events that are within a fixed distance from some sensor are assumed to be detectable and the sensor is said to cover that point. In this paper, we have formulated an exact mathematical expression for the expected area that can be covered by at least k out of n sensors. Our results are important in predicting the degree of coverage a sensor network may provide and in determining related parameters (sensory range, number of sensors, etc.) for a desired level of coverage. We demonstrate the utility of our results by presenting a node scheduling scheme that conserves energy while retaining network coverage. Additional simulation results have confirmed the accuracy of our analysis. 相似文献
16.
Mobility management is a major challenge in mobile ad hoc networks (MANETs) due in part to the dynamically changing network topologies. For mobile sensor networks that are deployed for surveillance applications, it is important to use a mobility management scheme that can empower nodes to make better decisions regarding their positions such that strategic tasks such as target tracking can benefit from node movement. In this paper, we describe a distributed mobility management scheme for mobile sensor networks. The proposed scheme considers node movement decisions as part of a distributed optimization problem which integrates mobility-enhanced improvement in the quality of target tracking data with the associated negative consequences of increased energy consumption due to locomotion, potential loss of network connectivity, and loss of sensing coverage. 相似文献
17.
Energy constraint is an important issue in wireless sensor networks. This paper proposes a distributed energy optimization method for target tracking applications. Sensor nodes are clustered by maximum entropy clustering. Then, the sensing field is divided for parallel sensor deployment optimization. For each cluster, the coverage and energy metrics are calculated by grid exclusion algorithm and Dijkstra's algorithm, respectively. Cluster heads perform parallel particle swarm optimization to maximize the coverage metric and minimize the energy metric. Particle filter is improved by combining the radial basis function network, which constructs the process model. Thus, the target position is predicted by the improved particle filter. Dynamic awakening and optimal sensing scheme are then discussed in dynamic energy management mechanism. A group of sensor nodes which are located in the vicinity of the target will be awakened up and have the opportunity to report their data. The selection of sensor node is optimized considering sensing accuracy and energy consumption. Experimental results verify that energy efficiency of wireless sensor network is enhanced by parallel particle swarm optimization, dynamic awakening approach, and sensor node selection. 相似文献
18.
19.
20.
Human-carried or vehicle-mounted sensors can be exploited to collect data ubiquitously for urban sensing. In this work, we study a new coverage problem, opportunistic coverage, to characterize the sensing quality of such people-centric sensing systems. Compared with the traditional static coverage and dynamic coverage in sensor networks, opportunistic coverage has some unique characteristics caused by the requirements of urban sensing applications and human mobility features such as spatio-temporal correlation, hotspots effects and randomness. In order to achieve good trade-off between energy consumption and coverage quality, we propose an offline node selection mechanism and an online adaptive sampling mechanism. The former can select the minimum number of nodes to achieve coverage requirements, based on the history trajectories of the given set of nodes, and the latter can help each selected node to decide whether to perform the sampling task at some time adaptively. Based on a real human mobility dataset and a taxi mobility dataset, extensive simulation results evaluate that our proposed models and mechanisms are effective and efficient in terms of energy consumption and coverage quality. 相似文献