共查询到19条相似文献,搜索用时 500 毫秒
1.
已有的无线多媒体传感器网络(WMSNs)研究针对传感器放置在目标区域内的情况进行,且没有考虑节点通过云台的转动获得的整个可能感知区域对覆盖率的影响。本文首先针对节点放置点高于目标区域的应用进行研究,综合考虑节点感知区域和可能感知区域,建立了延时和无延时感知模型,并针对不同的感知模型提出了传感器网络部署控制算法(IVPDCA),算法中改进了虚拟势场算法,定义了节点质量的概念来表示节点间覆盖重叠的大小,建立受力模型,使得节点在合力作用下进行重新部署,同时关闭冗余节点,既延长了网络寿命,又提高了区域覆盖率。仿真结果验证了算法的有效性。 相似文献
2.
3.
4.
覆盖作为无线传感器网络中的基础问题直接反映了网络感知服务质量.本文在分析现有无线多媒体传感器网络覆盖增强算法的基础上,构建节点三维感知模型,提出面向三维感知的多媒体传感器网络覆盖增强算法(Three-Dimensional Perception Based Coverage-Enhancing Algorithm,TDPCA).该算法将节点主感知方向划分为仰俯角和偏向角,并根据节点自身位置及监测区域计算并调整各节点最佳仰俯角,在此基础上基于粒子群优化调整节点偏向角,从而有效减少节点感知重叠区及感知盲区,最终实现监测场景的区域覆盖增强.仿真实验表明:对比已有的覆盖增强算法,TDPCA可有效降低除节点感知重叠区和盲区,最终实现网络的高效覆盖. 相似文献
5.
对无线多媒体传感器网络(WMSNs)的覆盖增强问题进行了研究.在WMSNs网络中,视频、图像节点的视角范围有限,只能监控周围的部分区域.由于节点数量众多、部署方式受限等原因,网络中往往存在大量的监测重叠与监控盲区,需要对各节点的感知方向进行优化,以提高网络的监控质量.文中基于有向感知模型,提出了一种覆盖增强算法MCE.MCE对各节点的感知方向进行调整,并使用了改进的PSO算法来计算求解.仿真实验表明,MCE算法能够有效地提高网络的覆盖率. 相似文献
6.
基于感知距离调节的无线传感器网络节能区域覆盖 总被引:4,自引:1,他引:3
传感器节点能够感知的物理世界的最远距离称为节点的感知距离。该文研究了基于节点感知距离调节的无线传感器网络节能区域覆盖方案,该方案通过设定合理的节点感知距离,使得传感器网络在满足区域覆盖要求的同时,能量消耗最低。首先将区域覆盖性能和网络能量消耗模化成网络节点感知距离的函数,然后将节能覆盖问题模化成带约束条件的优化问题,最后给出了基于网络区域划分的优化模型求解方法。仿真结果表明,与传统覆盖方案比较,所提方案在满足覆盖要求的同时,有效降低了网络能量消耗。 相似文献
7.
基于当前无线传感器网络二维覆盖的研究成果,针对实际的立体空间应用性较弱的困难,给出感知节点覆盖三维复杂场景(CTDCT)的解决方案。强调以立体感知模型刻画三维复杂场景下节点感知质量,结合视距与非视距场景下感知盲区的判定,解决遮蔽覆盖的误判问题;引入点集到场景可行域的映射,初筛节点分布与减小冗余的双增益网络;利用全迭代周期内非线性调整节点位置,前期提升网络多样性,后期优化局部拓扑结构;设计节点移动步长,使其受冗余节点的激励,提升网络与现有环境间的耦合程度。仿真结果表明,CTDCT算法在视距与非视距场景联合作用下,通过减小覆盖误判概率,优化调整节点的坐标位置,可有效降低节点感知重叠区和盲区,最终实现三维复杂场景下区域覆盖质量的增强。 相似文献
8.
在无线感知网络节点部署中,目标区域的覆盖率大小对信号检测的效果具有重要的意义,通过智能优化算法来提高区域覆盖率已成为当前无线感知网络节点部署领域的研究热点之一。为了提高分布式无线感知网络对目标区域内的重点区域的覆盖率和减少冗余感知节点的投放,论文提出了一种分布式无线感知网络节点部署算法。该算法首先通过随机部署满足连通性的少量感知节点后初次工作来定位和估计出重点区域,然后将估计出的重点区域融入到粒子群算法的目标函数和粒子更新方程中实现对感知节点的重新部署,从而更好的优化了重点区域的覆盖率和减少冗余感知节点数量。仿真结果表明,与标准粒子群算法及其他优化算法相比,论文所研究的算法有更高的覆盖率和更低的迭代次数。 相似文献
9.
10.
11.
针对异构传感器节点在网络初期部署中产生大量覆盖面积冗余的问题,结合相关几何图形知识,以提高网络覆盖率、改善节点分布均匀度为优化目标,提出一种基于节点定向移动来减少节点两两之间覆盖冗余面积的网络覆盖优化算法。算法预先设立判定门限,通过判定两两节点之间覆盖冗余面积与设定门限的大小关系,对节点实施有向性偏移,逐一减少节点之间的覆盖冗余面积。理论分析与实验仿真证明,该算法能够有效提高异构传感器网络部署中的覆盖率,优化节点分布均匀度将近8.7,尤其在大型传感器网络的节点部署中具有极强实用性。 相似文献
12.
针对节点感知半径不均衡的移动传感网络节点的部署问题,论文提出一种基于VL(Voronoi Laguerre)图分割的节点自主部署算法(Autonomous Deployment Algorithm, ADA)。ADA先对目标区域做VL图划分,将目标区域的覆盖任务在各个传感器节点之间进行分配。分配到覆盖子区间任务的节点通过构造VL受控多边形来确定下一轮候选目标位置。未分配到覆盖子区间的节点则根据自身与邻居节点感知圆及目标区域边界的几何位置关系计算所受虚拟力,最终确定下一轮目标点坐标。网络各个节点通过逐轮更新自身位置,从而提高网络覆盖。仿真结果表明,ADA算法在网络覆盖率、节点部署速度和节点分布均匀性等方面具有明显的优势。 相似文献
13.
In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain long system lifetime. Low cost of sensors enables us to randomly deploy a large number of sensor nodes. Thus, a potential approach to solve lifetime problem arises. That is to let sensors work alternatively by identifying redundant nodes in high-density networks and assigning them an off-duty operation mode that has lower energy consumption than the normal on-duty mode. In a single wireless sensor network, sensors are performing two operations: sensing and communication. Therefore, there might exist two kinds of redundancy in the network. Most of the previous work addressed only one kind of redundancy: sensing or communication alone. Wang et al. [Intergrated Coverage and Connectivity Configuration in Wireless Sensor Networks, in: Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys 2003), Los Angeles, November 2003] and Zhang and Hou [Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Technical report UIUCDCS-R-2003-2351, June 2003] first discussed how to combine consideration of coverage and connectivity maintenance in a single activity scheduling. They provided a sufficient condition for safe scheduling integration in those fully covered networks. However, random node deployment often makes initial sensing holes inside the deployed area inevitable even in an extremely high-density network. Therefore, in this paper, we enhance their work to support general wireless sensor networks by proving another conclusion: “the communication range is twice of the sensing range” is the sufficient condition and the tight lower bound to ensure that complete coverage preservation implies connectivity among active nodes if the original network topology (consisting of all the deployed nodes) is connected. Also, we extend the result to k-degree network connectivity and k-degree coverage preservation. 相似文献
14.
15.
In order to better solve the contradiction between precision of localization and the number of anchor nodes in wireless sensor network,a mobile anchor node localization technology based on connectivity was proposed.First,the coverage characteristic of the network nodes was analyzed,and a critical value was found between the mobile step and the anchor node communication radius,mobile anchor nodes' coverage characteristic would change when near this critical value.Second,a mobile anchor node followed a planning path to form a positioning area seamless coverage was used.Finally,when there was no need for high-precision technology,node position would been estimated according with the connectivity of the network and the receiving information of the node.The simulation results show that the proposed algorithm can realize coarse-grained localization,and paths perform complete localization. 相似文献
16.
A routing algorithm, based on a dual cluster head redundant mechanism combined with compressive sensing data fusion algorithm, is proposed to improve reliability and reduce data redundancy of the industrial wireless sensor networks. The Dual cluster head alternation mechanism is adopted to balance the energy consumption of cluster head nodes. Through the compressive sensing data fusion technology to eliminate redundancy, effectively improve the network throughput of the sensor network. The simulation results show that the proposed algorithm is able to enhance the networks performance, significantly reduces the number of lost packets and extend the network’s lifetime. 相似文献
17.
Muralitharan Krishnan Vishnuvarthan Rajagopal Sakthivel Rathinasamy 《Wireless Networks》2018,24(3):683-693
In the wireless sensor networks, sensor deployment and coverage are the vital parameter that impacts the network lifetime. Network lifetime can be increased by optimal placement of sensor nodes and optimizing the coverage with the scheduling approach. For sensor deployment, heuristic algorithm is proposed which automatically adjusts the sensing range with overlapping sensing area without affecting the high degree of coverage. In order to demonstrate the network lifetime, we propose a new heuristic algorithm for scheduling which increases the network lifetime in the wireless sensor network. Further, the proposed heuristic algorithm is compared with the existing algorithms such as ant colony optimization, artificial bee colony algorithm and particle swarm optimization. The result reveals that the proposed heuristic algorithm with adjustable sensing range for sensor deployment and scheduling algorithm significantly increases the network lifetime. 相似文献
18.
In recent years, wireless sensor networks (WSN’s) have gained much attention due to its various applications in military, environmental monitoring, industries and in many others. All these applications require some target field to be monitored by a group of sensor nodes. Hence, coverage becomes an important issue in WSN’s. This paper focuses on full coverage issue of WSN’s. Based on the idea of some existing and derived theorems, Position and Hop-count Assisted (PHA) algorithm is proposed. This algorithm provides full coverage of the target field, maintains network connectivity and tries to minimize the number of working sensor nodes. Algorithm works for communication range less than root three times of sensing range and it can be extended for arbitrary relation between communication range and sensing range. By using hop-count value, three-connectivity in the network is maintained. Also, neighbors information is used to create logical tree structure which can be utilized in routing, redundant data removal and in other areas. Simulation results show that PHA algorithm outperforms layered diffusion-based coverage control algorithm by providing better area coverage and activating fewer nodes. 相似文献
19.
无人移动平台无线ad hoc网络在实际应用中经常会出现由于电磁环境、干扰等因素导致通信质量不稳定的情况,在上述条件下传统的基于节点覆盖度的最小主控集(MCS)生成算法难以获得具有较好稳定性、健壮性的最小主控集.为此,提出了一种考虑通信质量的网络最小主控集生成算法,将链路的通信质量纳入网络最小主控集构造的考虑因素,使网络拓扑与链路通信质量特性保持一致;并通过对候选节点集及拟覆盖节点集的压缩,有效控制了网络最小主控集的节点数目.仿真表明,对敏感于通信质量的应用,该算法较基于节点覆盖度算法能取得更好效果. 相似文献