基于DIJKSTRA的无线传感器网络分簇路由算法

为加快无线传感器网络最优路径搜索速度、减少路径寻优能量消耗和延长网络寿命,提出了基于改进的DIJKSTRA算法的无线传感器网络分簇路由算法;运用DIJKSTRA算法在无线传感器网络内以多跳接力的方式来搜寻从源节点到目的节点的最短路径;结合能耗优化策略,避免网络能耗热点问题,实现网络能耗均衡;通过与基于蚁群算法的路由算法对比分析,基于Dijkstra的网络分簇路由算法能优化网络分簇并建立较优传输路径,其快速收敛性能减缓了网络中簇头节点的能耗,延长了网络寿命,提高了网络鲁棒性。     

一种能量有效的WSN分簇路由算法

针对无线传感器网络(WSN)中的热区问题,提出一种能量有效的WSN分簇路由算法EERA。以基站为圆心将整个感知区域划分为大小不等的圆环,依据节点剩余能量和相对位置选择簇首。簇间采用多跳路由传输数据,路由构建时考虑节点接收和发送数据能耗,将发送距离限制在阈值之内且尽量减少中转次数,簇首节点在稳定传输阶段动态改变转发路径。仿真结果表明,EERA能有效降低网络能耗,均衡网络节点的能耗,延长网络生命周期。     

基于博弈理论的农田能量异构网络节点协同资源利用

针对无线传感器网络中耗能不均问题,以及可再生能源节点在农田无线传感器网络中应用的具体情况,将博弈理论引入无线传感器网络能耗问题研究中,建立了基于博弈理论的节点成簇方法,实现提高可再生能源利用率、均衡非可再生能源节点能耗的目标。方法首先建立簇收益与簇内节点收益评估模型,进行簇收益计算、簇内的两类能量异构节点个体收益的计算。在计算簇收益和节点收益的基础上进行节点成簇博弈,使得成簇方案向收益更高的策略空间进行跳转,最终达到博弈中的均衡状态。仿真实验表明,通过博弈进行无线传感器网络成簇,能够充分利用可再生能源节点能量,降低和均衡非可再生能源节点能耗,最终达到延长网络寿命的目标。     

基于多反应节点下WSANs路由协议研究

针对多个反应节点环境中现有无线传感器网络路由协议不能完全满足无线传感反应网络（WSANs）对能耗和实时性需求的问题,利用J-Sim对WSANs的仿真功能,设计并实现适应单反应节点选择模式的WSANs路由协议BHOER,给出仿真数据及性能分析,实验结果表明,BHOER较好地满足WSANs的应用需求。     

基于协作传输的大范围WSNs能耗均衡分簇算法

由于大范围无线传感器网络（WSNs）节点的数量巨大,网络的能量消耗极不均,提出一种基于协作传输的分簇算法—EBBMCC—LS算法。该算法在保证网络均匀分簇的前提下,能保证网络中簇头节点的均匀分布,在簇间通信时加入协作传输策略,传感器节点之间通过协作传输构成虚拟多天线系统,改善系统性能,解决了大范围WSNs中的能耗不均现象。实验验证：该算法能够均衡大范围WSNs中的能耗,延长网络寿命,可促进大范围WSNs应用的推广。     

能量负载均衡的无线传感网分组成簇协议

针对无线传感网（WSN）中分簇路由协议在簇首分布及节点能耗不均问题,提出了一种节点能量负载均衡的分组成簇算法。根据节点能量分组,并随着节点能量的减少动态调整分组个数,组内根据能量重心进行簇首选举,利用簇首轮转和簇间多跳路由进一步均衡节点能耗。仿真结果表明,该算法有效实现了负载均衡,并显著延长了网络的稳定期。     

一种适用于煤矿井下无线传感网的能量均衡路由协议

矿井无线传感网的拓扑呈长距离带状,节点间能耗不均问题十分严重。非均匀分簇策略能从全局均衡节点能量负载,在矿井中具有良好的适用性。针对矿井传感网的带状特性提出了一个簇规模自适应调节的能量均衡分簇路由协议。协议根据节点离汇聚点的距离、剩余能量及分布密度来构造规模不等的簇。簇首的竞选以节点相对于周围候选者的能量水平为依据,避免了低能量节点被当选为簇首。簇间多跳路由算法依簇首近似线型的分布特点设计,不但考虑链路能耗最优,亦注重转发节点间的能量均衡。模拟实验结果表明,该路由协议显著平衡了网中节点能耗,延长了网络生存时间。     

带有重叠区域的多跳非均匀分簇路由算法

能耗作为衡量无线传感器网络性能的一项重要指标,通常将延长生命周期、均衡能耗作为网络协议重要的设计目标.针对静态、异构、非均匀分布的网络模型,设计带有重叠区域的分簇及簇内单跳、簇间多跳的路由算法 ----- OMU分簇路由算法,该算法中簇头不再作为数据转发节点,而主要用于簇内数据的接收与融合.通过综合考虑节点剩余能量、节点密度及与基站的距离进行簇头选举并进行分簇,形成簇间重叠区域,产生用于数据转发的中继节点.同时,建立簇头与中继节点轮换机制以达到节点能耗均衡的目的,并为每个节点建立能量最省的多跳数据传输路径.仿真结果表明,所设计的分簇路由算法,特别是在大规模部署的无线传感器网络中,能有效减少和均衡能量消耗.     

大规模无线传感网基于CFSFDP和泊松混合模型的分簇路由算法

针对无线传感网随规模的扩大其节点能量利用率较低的问题,提出了一种适用于大规模无线传感网的基于CFSFDP和泊松混合模型的分簇路由算法(CRCPMM).其核心思想是:在基站利用改进的CFSFDP算法自动估计簇的数目K值并选取聚类中心,然后运用泊松混合模型将节点合理聚类,以保证聚类效果最优;簇间采用多跳传输方式,综合考虑簇首等效剩余能量、簇首之间的距离以及多跳路径与理想最优路径之间的角度.仿真结果表明:与低功耗自适应集簇(LEACH)协议、分布式能量有效非均匀成簇(DEBUC)协议相比,CRCPMM协议在大规模网络中具有明显的优势,能够有效均衡节点能耗,延长网络生命周期.     

一种基于无线传感器网络的分簇线形拓扑结构

针对无线传感器网络的线形拓扑结构节点能量消耗较大、能量不均衡的缺点,构建适用于分布式实时监测系统的无线传感器网络模型,改进线形随机放置节点的自组网方式,采用分布式的分簇线形拓扑结构置放传感器节点,簇内成员可等概率竞争成为簇首,使用数据融合完成簇内、簇间的通信.仿真结果表明:分簇线形拓扑结构与线形自组网拓扑结构相比,明显地降低了节点的能耗,有效延长了网络的生存时间.     

无线传感器/执行器网络中能量有效的实时分簇路由协议

无线传感器/执行器网络(WSANs)主要应用于自动控制领域,实时性问题是其面临的首要挑战.根据实际环境中的节点部署情况,建立了系统模型;研究了分簇策略与功率控制技术对于自组织网络实时性的影响,提出了一种可适用于WSANs的能量有效的实时分簇路由协议--RECRP协议.该协议采用二级成簇策略使网络中的各类节点稳定分簇.分簇后的各类节点具有不同发射功率,利用执行器节点的强大通信能力有效降低网络延时.采用能量有效性算法使网络中的传感器节点轮换担任簇首,从而使网络能量均匀消耗,延长网络的生存时间.实验结果证明,在WSANs中RECRP协议可使网络稳定分簇,并且在网络的实时性与能量有效性方面与现有典型路由协议相比具有更优越的性能.     

分布式融合算法在WSANs中的性能分析

在无线传感器执行器中,执行器节点接收传感器节点传来的信息并执行相应的动作。为了满足执行器节点及时地采取行动,无线传感器执行器网络对时延有严格的限制。构建了一种一般性的分布式融合算法并与集中式融合算法比较。通过从网络传输时延、节点能量消耗、网络寿命、有效传输次数等方面分析了这种算法在无线传感器执行器网络中的特性。在三种典型拓扑结构下的仿真实验表明,在相同条件下,分布式融合算法比集中式融合算法具有更小的网络传输时延,更长的网络寿命,同时节点的能量消耗更加均匀。     

Dynamic Coverage with Wireless Sensor and Actor Networks in Underwater Environment

This paper studies the problem of dynamic coverage with wireless sensor and actor networks (WSANs) in underwater environment. Different from most existing works, the WSANs consist of two kinds of nodes, i.e., sensor nodes (SNs) which cannot move autonomously and actor nodes (ANs) which can move autonomously according to the performance requirement. The problem of how to coordinate two kinds of nodes to facilitate dynamic coverage in underwater environment is challenging due to their heterogeneous capabilities. To reduce redundancy of communication links and improve connectivity between ANs and SNs in underwater WSANs, a min-weighted rigid graph based topology optimization scheme is first developed, such that the underwater communication energy consumption can be saved. With the optimized topology, a dynamic coverage strategy is proposed to improve the coverage among SNs and ANs for underwater WSAN where underwater fluid motions are considered. Furthermore, it is proved that the network coverage area is connected by using the min-weighted rigid graph. Finally, simulation results are presented to show the effectiveness of the main results.      

TSLBS: A Time-Sensitive and Load Balanced Scheduling Approach to Wireless Sensor Actor Networks

Existing works on scheduling in Wireless Sensor Actor Networks (WSANs) are mostly concerned with energy savings and ignore time constraints and thus increase the make-span of the network. Moreover, these algorithms usually do not consider balance of workloads on the actor nodes and hence, sometimes some of the actors are busy when some others are idle. These problem causes the actors are not utilized properly and the actors’ lifetime is reduced. In this paper we take both time awareness and balance of workloads on the actor in WSANs into account and propose a convex optimization model (TAMMs) to minimize make-span. We also propose a protocol called LIBP to improve load balancing that allocates tasks to actors according to their measured capabilities in such a way to enhance balances of workloads on the actors. Finally, by combination of TAMMs and LIBP, a time-sensitive and load balanced scheduling approach (TSLBS) is proposed. TSLBS considers both local and global tasks and the distribution requirements of WSANs (i.e. WSANs with hybrid architecture). The results of simulations on typical scenarios shows that TSLBs is more efficient in terms of both the make-span and load balancing compared to stochastic task scheduling algorithm (STSA). We also show that TSLBs performs significantly better than STSA in terms of actor’s lifetime.     

传感反应网络中单反应节点任务分配问题的研究

无线传感反应网络由大量资源受限的传感节点和少量资源丰富的反应节点通过无线通信自主形成的。其中,传感节点负责收集外界的事件信息,而反应节点依据传感节点探测到的信息做出决策,并对外界做出响应。本文主要研究WSANs中单反应节点任务分配的问题,并提出集中式和分布式两种算法,最后用J-Sim评估两种算法的性能。     

Clustering of wireless sensor and actor networks based on sensor distribution and connectivity

Wireless Sensor and Actor Networks (WSANs) employ significantly more capable actor nodes that can collect data from sensors and perform application specific actions. To take these actions collaboratively at any spot in the monitored regions, maximal actor coverage along with inter-actor connectivity is desirable. In this paper, we propose a distributed actor positioning and clustering algorithm which employs actors as cluster-heads and places them in such a way that the coverage of actors is maximized and the data gathering and acting times are minimized. Such placement of actors is done by determining the k-hop Independent Dominating Set (IDS) of the underlying sensor network. Basically, before the actors are placed, the sensors pick the cluster-heads based on IDS. The actors are then placed at the locations of such cluster-heads. We further derive conditions to guarantee inter-actor connectivity after the clustering is performed. If inter-connectivity does not exist, the actors coordinate through the underlying sensors in their clusters to adjust their locations so that connectivity can be established. The performances of the proposed approaches are validated through simulations.     

Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks

Recent years have witnessed a growing interest in applications of wireless sensor and actor networks (WSANs). In these applications, a set of mobile actor nodes are deployed in addition to sensors in order to collect sensors' data and perform specific tasks in response to detected events/objects. In most scenarios, actors have to respond collectively, which requires interactor coordination. Therefore, maintaining a connected interactor network is critical to the effectiveness of WSANs. However, WSANs often operate unattended in harsh environments where actors can easily fail or get damaged. An actor failure may lead to partitioning the interactor network and thus hinder the fulfillment of the application requirements. In this paper, we present DARA, a Distributed Actor Recovery Algorithm, which opts to efficiently restore the connectivity of the interactor network that has been affected by the failure of an actor. Two variants of the algorithm are developed to address 1- and 2-connectivity requirements. The idea is to identify the least set of actors that should be repositioned in order to reestablish a particular level of connectivity. DARA strives to localize the scope of the recovery process and minimize the movement overhead imposed on the involved actors. The effectiveness of DARA is validated through simulation experiments.     

Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks

Wireless sensor and actor networks (WSANs) have recently emerged with the idea of combining wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. This requires that the actors should be placed carefully prior to network operation in order to maximize the coverage and maintain the inter-actor connectivity. In this paper, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. The approach applies repelling forces between neighboring actors and from the sensors that sit on the boundaries in order to spread them in the region. The spreading of the nodes is done using a tree of actors which can provide more freedom for the movement of the nodes but at the same time maintain the required connectivity among the nodes. We present two techniques for creation of such an actor tree which are based on local pruning of the actor links and spanning tree of the inter-actor network. The performance of our approach is validated both analytically and experimentally.     

无线传感器网络动态节点选择优化策略

无线传感器网络的能耗和有效覆盖率是衡量其性能的两个重要指标.无线传感器网络动态节点选择优化策略通过合理配置各无线传感器节点状态,平衡网络能耗和有效覆盖率,提高网络能效性,延长网络寿命.提出一种结合了Hopfield网络与遗传算法的动态节点选择优化策略,简称为HN-GA.该策略通过遗传算法实现全局搜索,采用Hopfield网络缩小遗传算法的搜索范围,保证遗传算法中每个基因对应待选解的有效性,并针对动态节点选择优化提出一种基于无线传感器网络能耗、寿命和有效覆盖率的综合指标.仿真实验表明,HN-GA算法能有效完成无线传感器网络动态节点选择优化,并在确保网络有效覆盖率的前提下,通过动态配置各无线传感器节点状态,降低网络能耗,延长网络寿命.与遗传算法和Hopfield网络相比,HN-GA算法不仅全局搜索能力强,且收敛速度快、耗时少.     

无线传感器/执行器网络多目标任务调度策略略

针对多任务在多执行器节点的协作问题,提出一种多目标任务调度策略.该策略以执行任务的最大完成时间、能耗均衡指标和存储成本为目标,将任务调度建模成多目标优化问题,并运用理想点法解决不同目标量纲的差异性,进而转化为单目标优化问题求解,从而得到各任务在执行器节点上的局部最优执行方案.仿真结果表明,3个优化指标均得到一定程度的改善.