基于概率模型的无线传感器网络优化覆盖算法

为了更好地解决无线传感器网络在覆盖过程中出现大量冗余信息及节点能量消耗不均衡等现象,提出了一种节点能量均衡的最优覆盖算法。该算法利用监测区域内传感器节点与目标节点的从属关系建立网络模型,给出传感器节点与目标节点之间的从属关系;通过从属关系和概率理论,求解传感器节点对目标节点的覆盖期望值,然后计算出覆盖监测区域所需最少传感器节点数量。实验结果表明,该算法不仅可以使用最少传感器节点完成对监测区域的有效覆盖,而且抵制了冗余信息数据的产生,提高了网络生存周期。     

一种带有可控动态参数的优化覆盖算法

能耗与覆盖问题是无线传感器网络研究领域的基本问题,也是一个重点问题。针对传感器节点所呈现的同构性特点,提出了一种带有可控动态参数的优化覆盖算法（OCCDP）。该算法首先给出了3节点联合覆盖时,最大无缝覆盖率的求解过程;其次,给出了在监测区域内存在传感器节点覆盖时,覆盖质量期望值求解方法以及与邻居节点进行覆盖比对时覆盖率的判定方法;当存在冗余覆盖时,给出了任意传感器节点处于冗余节点覆盖时的覆盖率的计算过程;最后,通过仿真实验与其他算法在覆盖质量和网络生存周期等方面进行对比,其性能指标平均提升了11.02%和13.27%,从而验证了提出算法的有效性和可行性。     

无线传感器网络的动态部分覆盖算法

为了实现较好的监测质量,无线传感器网络往往全覆盖监测区域.然而,由于单个节点的带电量有限,全覆盖的无线传感器网络并不能持续工作较长时间.文中提出了一种监测应用的动态部分覆盖算法.通过算法仿真,得出网络的生命时间可以提高到无穷大,而侵入物从开始移动到被任意节点监测出的时间仅为算法周期的三分之二.     

基于节点调度策略的能量有效覆盖算法

对监测区域进行有效地覆盖以及最大限度延长网络生存周期是无线传感器网络研究的重点课题之一。为此,提出了一种基于节点调度策略的能量有效覆盖算法,该算法通过泊松分布模型构造节点概率密度公式,依照节点密度公式对所关注的目标进行有效覆盖;另一方面,通过节点自身状态调度机制更新以及对邻居节点进行匹配调度的动态转换,使得传感器节点剩余能量与节点消耗能量趋于平衡,从而达到延长网络生存周期。仿真实验结果表明,该算法可实现对监测区域的有效覆盖,同时优化了网络资源的配置,延长了网络生存周期。     

一种面向三维感知的无线多媒体传感器网络覆盖增强算法

 覆盖作为无线传感器网络中的基础问题直接反映了网络感知服务质量.本文在分析现有无线多媒体传感器网络覆盖增强算法的基础上,构建节点三维感知模型,提出面向三维感知的多媒体传感器网络覆盖增强算法(Three-Dimensional Perception Based Coverage-Enhancing Algorithm,TDPCA).该算法将节点主感知方向划分为仰俯角和偏向角,并根据节点自身位置及监测区域计算并调整各节点最佳仰俯角,在此基础上基于粒子群优化调整节点偏向角,从而有效减少节点感知重叠区及感知盲区,最终实现监测场景的区域覆盖增强.仿真实验表明:对比已有的覆盖增强算法,TDPCA可有效降低除节点感知重叠区和盲区,最终实现网络的高效覆盖.     

无线传感器网络中基于区域通信覆盖的节点定位投放算法

针对无线传感器网络中传感器节点投放分布对投放区域有效通信信号覆盖的影响,该文提出了一种基于通信覆盖的分布式投放概率覆盖(DDCP)算法。在保证投放精度的前提下,该算法根据传感器节点在投放区域中位置的不确定性以及信号衰减特性,建立信号覆盖模型,并通过概率优化获取传感器节点的最佳投放位置和投放数目。这样改善了区域通信覆盖,同时提高了投放效率和节省网络资源。通过仿真比较了在不同定位投放方法下的各相关性数据,验证了该算法实现高效投放的优越性和正确性。     

一种混沌萤火虫算法的WSN节点分布优化研究

针对无线传感器网络节点分布优化问题,提出了一种有效的混沌萤火虫优化算法。在保证节点相互连通的前提下,建立了无线传感器网络对目标区域覆盖的数学模型,并将节点分布优化问题转换为求解函数最大值问题;利用萤火虫算法优越的寻优能力来实现最优的网络节点分布,并引入立方映射混沌算子来提高算法的局部搜索能力和保持种群的多样性。通过标准函数测试与无线网络覆盖优化仿真对所提算法进行了验证,结果表明:与其他算法相比,所提算法能够较好地跳出局部最优的束缚,具有优化效果佳、稳定性好、鲁棒性强的优点,能够满足无线传感器网络节点分布优化的要求。     

基于模糊规划的无线传感器网络节点选择方法

针对无线传感器网络区域重构问题,提出了一种新的基于模糊规划算法的传感器选择方法。算法利用反距离加权插值法对插值点的数据进行预测,并且使用容斥原理计算每个节点的正常工作概率。以传感器正常工作概率,误差精度为约束条件,以传感器数量最少化为目标函数,求解0-1整数规划。进一步,考虑误差阈值和工作概率模糊的情况,将节点选择问题公式化为模糊规划求解。利用传感器温度数据对0-1整数规划和模糊规划算法进行分析评估,结果证明模糊规划算法在相同约束情况下,相较于0-1整数规划约能减少35%的传感器节点数量。     

基于Voronoi图的无线传感器网络覆盖算法研究

覆盖问题在无线传感器网络研究中具有很重要的地位,用最少的节点获得最大的覆盖面积是研究目标。Voronoi图,又叫泰森多边形或Dirichlet图,它是由一组由连接两邻点直线的垂直平分线组成的连续多边形组成。在一对邻近节点间,垂直平分线上的每个点被感知到的概率最小。文章中,作者提出一种基于Voronoi图的无线传感器网络覆盖算法,算法中先找出最大可能盲点,然后重新部署节点,以达到用最少的节点获得最大的监测面积。仿真实验证明了算法有效性。     

无线传感器网络分布式概率覆盖保持协议

覆盖配置能有效缓解无线传感器网络中节点能量受限的问题,但现有的研究多是基于物理覆盖,这与实际的信号传播特点不符.针对这一问题,提出了分布式传感器网络概率覆盖保持协议(DPCCP),该协议基于概率探测模型,利用Voronoi划分在节点本地执行概率覆盖判断算法.仿真实验中,将DPCCP嵌入LEACH路由协议,形成LEACHE协议,验证算法效率.仿真结果表明,DPCCP在保持网络覆盖度的同时,可关闭大量冗余节点,有效地延长了网络寿命.     

Effective sensor deployment based on field information coverage in precision agriculture

Coverage is an importance issue in wireless sensor networks. In this work, we first propose a novel notion of information coverage, which refers to the coverage efficiency of field information covered by deployed sensor nodes. On the basis of information coverage, we consider an optimization problem of how to partition the given field into multiple parcels and to deploy sensor nodes in some selected parcels such that the field information covered by the deployed sensor nodes meets the requirement. First, we develop two effective polynomial‐time algorithms to determine the deployed locations of source nodes for information 1‐coverage and q‐coverage of the field, respectively, without consideration of communication, where information q‐coverage implies that the field information in terms of information point is covered by at least q source nodes. Also, we prove the upper bound in the theoretical for the approximate solution derived by our proposed method. Second, another polynomial‐time algorithm is presented for deriving the deployed locations of relay nodes. In the theoretical, this proposed algorithm can achieve the minimized number of relay nodes. Further, the related information 1‐coverage algorithms are applied in our wireless sensor network‐based automatic irrigation project in precision agriculture. Experimental results show the major trade‐offs of impact factors in sensor deployment and significant performance improvements achieved by our proposed method. Copyright © 2013 John Wiley & Sons, Ltd.     

基于Voronoi的无线传感器网络覆盖控制优化策略

针对无线传感器网络运行状态中存在覆盖空洞的问题,提出了一种基于Voronoi有效覆盖区域的空洞侦测修复策略。该策略以满足一定网络区域覆盖质量为前提,在空洞区域内合理增加工作节点以提高网络覆盖率为优化目标,采用几何图形向量方法对节点感知范围和Voronoi多边形的位置特性进行理论分析,力求较准确地计算出空洞面积,找寻最佳空洞修复位置,部署较少的工作节点保证整个网络的连通性。仿真结果表明,该策略能有效地减少网络总节点个数和感知重叠区域,控制网络中冗余节点的存在,同时其收敛速度较快,能够获得比现有算法更高的目标区域空洞修复率,实现网络覆盖控制优化.     

A distributed reinforcement learning based sensor node scheduling algorithm for coverage and connectivity maintenance in wireless sensor network

The fundamental challenge for randomly deployed resource-constrained wireless sensor network is to enhance the network lifetime without compromising its performance metrics such as coverage rate and network connectivity. One way is to schedule the activities of sensor nodes and form scheduling rounds autonomously in such a way that each spatial point is covered by at least one sensor node and there must be at least one communication path from the sensor nodes to base station. This autonomous activity scheduling of the sensor nodes can be efficiently done with Reinforcement Learning (RL), a technique of machine learning because it does not require prior environment modeling. In this paper, a Nash Q-Learning based node scheduling algorithm for coverage and connectivity maintenance (CCM-RL) is proposed where each node autonomously learns its optimal action (active/hibernate/sleep/customize the sensing range) to maximize the coverage rate and maintain network connectivity. The learning algorithm resides inside each sensor node. The main objective of this algorithm is to enable the sensor nodes to learn their optimal action so that the total number of activated nodes in each scheduling round becomes minimum and preserves the criteria of coverage rate and network connectivity. The comparison of CCM-RL protocol with other protocols proves its accuracy and reliability. The simulative comparison shows that CCM-RL performs better in terms of an average number of active sensor nodes in one scheduling round, coverage rate, and energy consumption.

     

Method for optimal allocation of network resources based on discrete probability model

The method for optimal allocation of network resources based on discrete probability model is proposed. In order to take into account multiple coverage of the monitored points, the method constructs the discrete probability perception model of the network nodes. The model is introduced into the solution of the node coverage area, and the optimized parameters of the sensor optimization arrangement are used to optimize the layout of the multimedia sensor nodes. After setting the node scheduling standard, the interaction force between the sensor nodes and the points on the curve path is analyzed by the virtual force analysis method based on the discrete probability model At the same time On this basis, the path coverage algorithm based on the moving target is used to optimize the coverage of the wireless sensor network node in order to achieve optimal configuration of network resources. The experimental results show that the proposed method has good convergence and can complete the node coverage process in a short time. The introduction of the node selection criteria and the adoption of the dormant scheduling mechanism greatly improve the energy saving effect and enhance the network resource optimization effect.

     

基于量子遗传算法的无线视频传感网络优化覆盖算法

针对智慧城市无线视频传感网络建设需要,提出一种基于量子遗传算法的网络优化覆盖算法。算法面向复杂的监视区场景,监视区中存在形状各异的障碍物,各区域的重要程度不同。以二维离散网格模型描述监视区场景,用编码描述矩阵表示监视区域,用七元组描述有向无线视频传感器。通过严格的数学推导得出了问题的数学规划模型。优化覆盖算法由IntialDeployment算法和OptimizedDeployment算法2部分组成,以获得最大有效覆盖率的网络部署方案为求解目标。采用量子遗传算法搜索解空间,通过合理编码染色体,优化量子旋转门参数,使算法的运算速度快,收敛性好。引入理想覆盖率和理想加权覆盖率2个极限值,采用相对比较法评判算法优劣。仿真实验和数据分析表明,算法获得的方案能很好地逼近理想极限值。在传感器节点数给定的情况下,算法能获得最大的覆盖率。     

考虑通信质量的网络最小主控集生成算法

无人移动平台无线ad hoc网络在实际应用中经常会出现由于电磁环境、干扰等因素导致通信质量不稳定的情况,在上述条件下传统的基于节点覆盖度的最小主控集(MCS)生成算法难以获得具有较好稳定性、健壮性的最小主控集.为此,提出了一种考虑通信质量的网络最小主控集生成算法,将链路的通信质量纳入网络最小主控集构造的考虑因素,使网络拓扑与链路通信质量特性保持一致;并通过对候选节点集及拟覆盖节点集的压缩,有效控制了网络最小主控集的节点数目.仿真表明,对敏感于通信质量的应用,该算法较基于节点覆盖度算法能取得更好效果.     

人工鱼群优化的方向传感器覆盖增强

为提高无线多媒体传感器网络区域覆盖率,提出了人工鱼群优化的覆盖增强算法,算法基于三维方向传感器感知模型,优化网络传感器方向角度值,减少重叠覆盖以提升网络覆盖率。仿真实验表明该方法能有效增强网络覆盖率,并就传感器参数对覆盖率影响进行分析,分析结果表明优化后的网络覆盖率更加接近理想覆盖率。     

Connected sensor cover for area information coverage in wireless sensor networks

Coverage is an important issue in wireless sensor networks (WSNs) and is often used to measure how well a sensor field is monitored by the deployed sensors. If the area covered by a sensor can also be covered by some other sensors, this sensor can go into an energy‐saving sleep state without sacrificing the coverage requirement. In this paper, we study the problem of how to select active sensors with the constraints that the selected active sensors can provide complete field coverage and are completely connected. We propose to use the notion of information coverage, which is based on estimation theory to exploit the collaborative nature of WSNs, instead of using the conventional definition of coverage. Owing to the use of information coverage, a point that is not within the sensing disk of any sensor can still be considered to be covered without loss of estimation reliability. We propose a heuristic to approximately solve our problem. The basic idea is to grow a connected sensor tree to maximize the profit from the covered points of the selected sensors in each step. Simulations are used to validate the effectiveness of the proposed algorithm and the results illustrate that the number of active sensors to provide area coverage can be greatly reduced by using the notion of information coverage compared with that by using the conventional definition of coverage. Copyright © 2008 John Wiley & Sons, Ltd.