基于能量预测的无线传感器网络节点覆盖调度算法

针对无线传感器网络中存在的热区问题,采用非均匀部署方案,并在此基础上提出基于能量预测的无线传感器网络节点覆盖调度算法。并对算法进行了仿真实验和性能分析。结果表明该算法可以延长的网络生命周期并在较长的时间里保持较高的网络覆盖率,能够达到网络内大多数节点能耗均衡的设计目标。     

基于分簇的水下传感器网络覆盖保持路由算法

在基于分簇架构的水下传感器网络（Underwater Sensor Networks ,UWSNs）中,当簇首以单跳或多跳的通信方式将数据传输至Sink节点时,由于簇首转发大量数据而负载过重,会过早耗尽能量而死亡,这将导致提前出现对监测区域的覆盖盲区。以改善覆盖效果为目标的LEACH-Coverage-U算法由于选举簇首的分簇方法具有随机性,也无法很好解决该问题。本文提出了一种水下传感器网络单跳覆盖保持路由算法（Single-hop Coverage-Preserving Routing Algo-rithm ,SCPR）,首先定义了覆盖冗余度（Coverage Redundancy ,CR）,然后根据该度量来选举簇首,最终以单跳方式直接将数据传送至Sink节点。为减少簇首能耗并获得更高的网络覆盖率,本文还提出一种多跳覆盖保持路由算法（Multi-hop Coverage-Preserving Routing Algorithm ,MCPR ）,簇首之间通信时优先考虑父节点中CR较高的簇首作为其下一跳路由,以多跳路由将数据传送至Sink节点。仿真结果表明,与LEACH-Coverage-U算法相比,SCPR、MCPR算法避免了其选举簇首时的随机性,提高了网络覆盖率,降低了网络能耗,延长了网络生命周期。     

基于改进微粒群算法的WSN节点调度

为了降低无线传感器网络监测区域节点能耗和延长网络生命周期,设计了一种基于改进微粒群算法的节点调度方法.首先,以网络覆盖率和休眠工作节点数为目标建立了系统的数学模型,然后设计了粒子的编码方式、适应度函数以及自适应动态惯性权重,并定义了使用改进的微粒群算法对传感器网络节点调度的具体算法.仿真实验表明,该方法能正确地实现无线传感器网络监测区域的节点调度,在迭代次数较少时,就能以较少的节点获得较高的网络覆盖率,且与其他方法相比,具有收敛速度快和全局寻优能力强的优点.     

基于混沌鱼群改进算法的无线传感网覆盖优化

针对无线传感器节点覆盖分布极不均匀,冗余度高,导致网络覆盖率低、成本高的问题,提出一种改进人工鱼群算法进行优化的覆盖方法。采用以节点的有效覆盖率、利用率和功耗作为优化目标,建立相应的数学模型,然后通过引入混沌初始化和自适应步长、视野的搜索机制对算法进行改进,并使用改进后鱼群算法对模型进行求解,得到优化的无线传感器网络覆盖方案。通过与原始鱼群算法的对比仿真,得出结果表明改进后的算法提高了节点的覆盖率,在一定程度减少了冗余度,使网络的有效生存时间得到了延长。     

网络分层的水下传感器网络覆盖保持路由算法

在以监测为目的的水下传感器网络中,较好的网络覆盖率和连通率是完成监测任务的重要保证.以改善覆盖效果为目标的水下覆盖保持路由算法NCPR算法相对比LEACH-Coverage-U算法有效的延长了网络覆盖时间,但是该算法连通性表现较差,同时存在靠近SINK节点的簇首由于需要转发大量数据而过早死亡的问题.本文提出一种分布式的网络不均匀分层的覆盖保持路由(Network Unevenly Layered Coverage Preserving Routing,NULCPR)算法,由SINK节点开始逐层向下建立网络,同时每层网络节点通信半径也随层号增加而逐渐增大.每层网络独立运行NCPR算法以使该层节点成簇,并通过簇首向上建立连通链路以保证网络连通.仿真结果表明,与NCPR算法相比,NULCPR算法提高了网络连通率以及覆盖率,并且降低了网络能耗,证明了该算法的有效性.     

基于混合机制算法的WSN节能优化策略

在WSN(无线传感器网络)节能优化过程中,覆盖模型复杂、抽象难以求解.部分节点利用率与覆盖率存在差异性,从而制约无线传感器网络,使能耗降低.针对此问题,提出一种基于混合机制的算法,利用分治思想将节点分为活跃节点和非活跃节点;将部分覆盖算法和唤醒机制算法相结合,建立最优覆盖模型,然后进行求解,得到最优节能方案.该方法能够充分利用节点的不同特点降低算法复杂度,避免不必要的运算消耗.实验表明:混合机制算法分别降低了活跃节点与非活跃的节点能耗;与单一算法相比较效果显著,网络生命周期得到延长.     

无线传感器网络冗余节点休眠调度算法

提出一种冗余节点休眠调度算法来延长网络生命周期。调度过程中重点考虑两方面问题：一是采取策略防止大量节点同时从工作状态转入休眠状态以防止大量盲区同时产生;二是根据邻居表中节点的工作邻居数量,判定节点是否处于网络边界,对边界节点和内部节点采用不同的调度策略,防止边界收缩。仿真结果表明,算法能有效延长无线传感器网络的生命周期。     

基于辅助圆覆盖盲区的WSN节点调度算法

文章设计了一种无线传感器冗余节点判定机制(ARCBA,Auxiliary round cover blind area),通过判定高度密集的随机部署无线传感器网络中的冗余节点,在保证覆盖率不变的前提下,通过减少活跃节点数,降低传感器网络的通信能耗。并通过仿真验证,ARCB算法在保证网络完全覆盖的前提下,能有效的延长网络的生命周期,减少节点的能量消耗。     

基于半径可调的三维无线传感器网络覆盖控制

针对三维空间下的无线传感器网络覆盖问题,考虑在满足最优覆盖节点集的基础上,同时减少网络能耗,提出了一种半径可调的三维无线传感器网络的低能耗覆盖方法。根据节点具有可调节传感半径的属性,在三维空间中利用遗传算法动态优化节点布局。仿真结果表明,节点的部署能够在达到较高的覆盖率和节点休眠率的同时,有效降低网络能耗,从而延长网络的生存时间。     

基于进化优化的移动感知节点部署算法

 移动传感器网络中节点部署优化直接影响到网络的能量消耗、对目标区域监控的性能及整个网络的生命周期.本文从网络覆盖和能量消耗两个方面,采用多目标优化对节点部署问题建模,并从集中式角度给出了节点部署问题的遗传算法求解过程.针对一类初始中心部署模型进行实验验证,并和基于向量的算法(VEC)、基于维诺图的算法(VOR)及基于边界扩张虚拟力算法(BEVF)进行性能对比,证明了该算法在大多数情况下可使传感器网络对目标区域的覆盖率最大化,同时保证了网络的连通和网络能耗最小,进而延长了网络的生命周期.     

CASMOC: a novel complex alliance strategy with multi-objective optimization of coverage in wireless sensor networks

Coverage is a significant performance indicator of wireless sensor networks. Data redundancy in k-coverage raises a set of issues including network congestion, coverage reduction, energy inefficiency, among others. To address these issues, this paper proposes a novel algorithm called complex alliance strategy with multi-objective optimization of coverage (CASMOC) which could improve node coverage effectively. This paper also gives the proportional relationship of the energy conversion function between the working node and its neighbors, and applies this relationship in scheduling low energy mobile nodes, thus achieving energy balance of the whole network, and optimizing network resources. The extensive simulation results demonstrate that CASMOC could not only improve the quality of network coverage, but also mitigate rapid node energy consumption effectively, thereby extending the life cycle of the network significantly.     

射频能量捕获传感网移动能量源的布置策略研究

射频能量捕获传感网（RF Energy Harvesting Wireless Sensor Network,RFEH-WSN）由专用射频能量源设备（Energy Transmitter,ET）和具有射频能量捕获功能的传感器节点（Energy Harvesting Recevier,简称EHR）组成.该网络解决了传感器网络中电池不易更换与节点能量容易耗尽的问题,使得RFEH-WSN应用前景更加广阔.RFEH-WSN应用中一个值得研究的问题是如何布置ET的充电位置,降低ET能耗且提高覆盖率.已有的工作主要考虑ET布置中单目标优化问题,如最小充电时间、最小功耗、最大覆盖率等.本文以时间最小和覆盖率最大为目标建立多目标优化模型,并提出利用粒子群算法（Particle Swarm Optimization,PSO）求解多目标函数（Multiple Object Program,MOP）的低复杂度近似算法,获得了最优Pareto解集.仿真结果表明,多目标优化可以满足不同情况的需求,提高充电效用.     

基于多目标生物习性激励的WSN传感器节点部署

为确保无线传感器网络(WSN)覆盖和连通性最大化以及能量消耗最小化的有效监测,提出一种基于多目标生物习性激励(MOBHI)的传感器节点部署算法。首先,将传感器节点的区域(领地)根据诸如最大覆盖、最大连通性和最小能耗等多个目标,基于领地捕食者气味标记行为进行标记,并模仿气味匹配识别其监测的位置;其次,对多个目标的优化问题应用非受控Pareto最优,将其分解为多个单目标优化子问题并同时对它们进行优化,得到所需目标的解。仿真实验结果表明,本文提出算法在网络覆盖、连通性和能耗等性能指标方面都优于其他传感器节点部署的多目标和单目标优化算法。     

Research on WSN lifetime optimization game algorithm combined power and channel

Due to the problem of shortening the network lifetime which was caused by the big energy consumption for wireless sensor network (WSN) whose energy and computing power was limit,a lifetime optimization game algorithm combined power control and channel allocation (LOAPC) was proposed.The influence of node power and residual energy on the node interference was explored to construct an interference affection measurement model.Then,expected transmission times was introduced to establish a novel node lifetime model.Finally,LOAPC aimed at reducing interference and prolonging lifetime,and the node power was limited by an optional power set which ensured the network connectivity and economized energy consumption,so as to prolong the network lifetime effectively.At the same time,the simulation results show that the algorithm has the characteristics of low interference,low energy consumption and effectively prolonging the lifetime of the network.     

Secure coverage-preserving node scheduling scheme using energy prediction for wireless sensor networks

With the fast development of the micro-electro-mechanical systems(MEMS),wireless sensor networks(WSNs)have been extensively studied.Most of the studies focus on saving energy consumption because of restricted energy supply in WSNs.Cluster-based node scheduling scheme is commonly considered as one of the most energy-efficient approaches.However,it is not always so efficient especially when there exist hot spot and network attacks in WSNs.In this article,a secure coverage-preserved node scheduling scheme for WSNs based on energy prediction is proposed in an uneven deployment environment.The scheme is comprised of an uneven clustering algorithm based on arithmetic progression,a cover set partition algorithm based on trust and a node scheduling algorithm based on energy prediction.Simulation results show that network lifetime of the scheme is 350 rounds longer than that of other scheduling algorithms.Furthermore,the scheme can keep a high network coverage ratio during the network lifetime and achieve the designed objective which makes energy dissipation of most nodes in WSNs balanced.     

移动WSNs中一种覆盖空洞的修复算法

基于无线传感网络的应用依赖于节点对监测区域的可靠覆盖.由于能耗殆尽或故障,节点感测能力可能失效,形成覆盖空洞区域.为此,提出基于模糊推理系统(FIS)的修复节点选取(FISS)算法.FISS算法采用自适应感测半径调整策略,利用节点的移动修复覆盖空洞.将节点的剩余能量和覆盖重叠率作为FIS的输入,并由FIS估计节点成为修...     

Multi mobile agent itinerary planning based on network coverage and multi-objective discrete social spider optimization algorithm

The multi mobile agent collaboration planning model was constructed based on the mobile agent load balancing and total network energy consumption index.In order to prolong the network lifetime,the network node dormancy mechanism based on WSN network coverage was put forward,using fewer worked nodes to meet the requirements of network coverage.According to the multi mobile agent collaborative planning technical features,the multi-objective discrete social spider optimization algorithm (MDSSO) with Pareto optimal solutions was designed.The interpolation learning and exchange variations particle updating strategy was redefined,and the optimal set size was adjusted dynamically,which helps to improve the accuracy of MDSSO.Simulation results show that the proposed algorithm can quickly give the WSN multi mobile agent path planning scheme,and compared with other schemes,the network total energy consumption has reduced by 15%,and the network lifetime has increased by 23%.     

A Greedy Approach for Coverage Hole Detection and Restoration in Wireless Sensor Networks

Wireless sensor network contains several small sensor nodes that are designed to work autonomously. Coverage preservation is an underlying requirement to efficiently deliver certain services in WSNs. During network operation, some sensor nodes die because of several reasons like energy exhaustion, link failure, node failure etc. We refer it as coverage hole problem of WSNs. In this paper, a new decentralized, node based, localized algorithm called Coverage Hole Detection and Restoration is proposed for detection as well as restoration of coverage holes. Our proposed algorithm is expected to outperform existing algorithms on the parameters of energy and time consumption for convex and non-convex holes.     

Adaptive directed evolved NSGA2 based node placement optimization for wireless sensor networks

Wireless sensor network (WSN) is a wireless network composed of a large number of static or mobile sensors in a self-organizing and multi-hop manner. In WSN research, node placement is one of the basic problems. In view of the coverage, energy consumption and the distance of node movement, an improved multi-objective optimization algorithm based on NSGA2 is proposed in this paper. The proposed algorithm is used to optimize the node placement of WSN. The proposed algorithm can optimize both the node coverage and lifetime of WSN while also considering the moving distance of nodes, so as to optimize the node placement of WSN. The experiments show that the improved NSGA2 has improvements in both searching performance and convergence speed when solving the node placement problem.