WSN中基于节点地理位置信息分簇算法的研究

针对无线传感器网络的特点,提出了一种新的分簇算法.在选择簇头时,节点根据自己的地理位置与能量决定是否成为簇头,使得簇头在网络中均匀分布;在数据传输阶段根据节点的权重来选择中间节点进行数据传输,减少网络消耗的能量从而延长网络的生存时间.仿真结果表明该算法可以显著延长网络寿命,提高网络的业务容量.     

一种基于K-means的WSN移动汇聚路由算法

无线传感网络(Wireless Sensor Network,WSN)作为一种资源受限的网络,网络中节点的能耗直接影响了网络的性能。因此,均衡网络中的能耗,延长网络的生命周期,成为设计WSN路由算法的重要目标。于是,在LEACH-C协议的基础上提出了一种移动汇聚路由算法。分簇阶段由Sink节点计算最优簇首个数,通过K-means聚类将网络中的节点划分至不同的集群,选择通信成本最低的节点作为各集群的簇首。稳定传输阶段通过移动Sink进行数据采集,针对不同的延迟分别规划Sink节点的移动轨迹。MATLAB仿真结果表明,与LEACH和LEAHC-C算法相比簇首的分布更合理,结合Sink节点的移动策略能有效均衡网络能耗,延长网络的寿命。     

基于天牛须搜索的无线传感网分簇路由协议

针对无线传感器网络中的能耗不均衡问题,提出一种基于天牛须搜索算法的负载均衡分簇路由协议算法(LEACH-BAS)。该算法引入候选簇首选举机制,使用天牛须搜索算法对簇首分布进行搜索优化,形成合理分簇。此外,在簇间路由通信时,考虑剩余能量因子和传输能耗因子来选择中继节点。仿真结果表明,LEACH-BAS算法的网络生命周期相比LEACH、EAMMH、LEACH-GA和LEACH-PSO算法分别延长了39%、22%、15%和8%。LEACH-BAS算法应用在WSN监测场景,能有效解决WSN中能量不足的问题,优化簇首节点分布,降低节点能耗,有效地延长网络生命周期。     

无线传感器网络能量均衡分簇路由协议

LEACH是无线传感器网络(Wireless Sensor Network,WSN)中一种经典的分层式路由协议,在此基础上通过对LEACH成簇算法及簇间路由的改进,提出了一种新的均衡能量消耗分簇路由协议。该协议在无线传感器网络成簇过程中充分考虑了传感器节点的能量状态,同时簇首向基站的通信采用基于能量的簇间路由。理论分析及仿真结果表明,改进的协议能够均衡传感器节点的能量消耗,有效地延长网络寿命。     

无线传感器网络动态分簇路由BWAS的算法研究

为加快无线传感器网络(WSN)路径搜索速度,减少了路径寻优能量消耗,提出了基于最优-最差蚂蚁系统(BWAS)算法的无线传感器网络动态分簇路由算法。该算法是基于WSN动态分簇能量管理模式,在簇头节点间运用BWAS算法搜寻从簇头节点到汇聚节点的多跳最优路径,以多跳接力方式将数据发送至汇聚节点。BWAS算法在路径搜寻过程中评价出最优-最差蚂蚁,引入奖惩机制,加强搜寻过程的指导性。结合动态分簇能量管理,避免网络连续过度使用某个节点,均衡了网络节点能量消耗。通过与基于蚁群算法(ACS)路由算法仿真比较,本算法减缓了网络节点的能量消耗,延长了网络寿命,在相同时间里具有较少的死亡节点,具有较强的鲁棒性。     

一种新的无线可充电传感器网络分簇算法

为了弥补现有无线可充电传感器网络充电效率低下和节点能量冗余并存的问题,提出了一种基于节点信息的分簇算法。首先,根据传感器节点的剩余能量状态,选择候选簇首。其次,计算候选簇首集合中节点之间的距离,并与基于节点密度的距离阈值比较,最终筛选出合适的簇首。其他节点根据就近原则选择簇首,形成对应的簇。该算法由于同时考虑节点剩余能量和簇首之间的距离,可以使得具有较多剩余能量的节点成为簇首,且簇首均匀分布整个网络中。仿真结果表明,提出的算法可以提高充电效率,减少节点的能量冗余或节点能量消耗过快而死亡的现象,从而有效延长整个网络的寿命。     

一种基于ARMA的WSN非均衡分簇路由算法

 针对无线传感器网络中分簇路由算法中存在的“热区”问题,提出了一种基于虚拟区域划分的非均衡簇路由算法。算法将簇划分的任务交由能量无限制的汇聚节点完成,使得靠近汇聚节点的内层簇的规模小于外层簇的规模。在簇的结构中引入了主、从簇头节点,从而实现了分布式簇头选举工作,同时在分簇过程中避免了每个阶段的能量消耗。将ARMA预测模型引入到主簇头节点的更换过程中,从而避免了主簇头因为能量完全消耗而死亡,也避免了因为主簇头死亡而造成网络分割,降低网络的生存时间,利用NS2.31仿真平台对基于虚拟区域划分的非均衡簇路由算法进行了仿真验证,结果表明与传统路由算法相比,该算法延长了WSN的生存时间,有效提高了WSN网络健壮度。     

基于感应数据值的无线传感器网络分簇算法

提出了一种无线传感器网络的分簇算法,用于协助基于簇的入侵检测方案检测网络中的各种恶意攻击行为.它将整个网络划分成若干个簇,使得簇内各传感器节点物理位置临近,并且采集的数据值接近.这一特性使得识别异常节点非常容易,并且保证入侵检测方案具有较高的检测精度和较低的误报率.该算法也使得网内数据处理变得异常简单,从而能够有效节省传感器节点的能量,延长网络的寿命.     

WSN中能量有效分簇多跳路由算法

针对现有无线传感器网络(WSN)分簇路由算法存在的能耗不均衡问题,提出一种能量有效分簇多跳路由算法,该算法包括两个方面:一是选举簇首时引入簇内平均剩余能量因子,根据上一轮结束后簇内各节点剩余能量和簇内节点的平均剩余能量的比值更新簇首在所有节点中所占的百分比;二是要求簇首根据MTE多跳路由协议与基站通信,从而均衡WSN整...     

一种误差可控传输均衡的WSN数据融合算法

如何有效降低WSN(Wiretess Sensor Net work)网内数据传输量,延长WSN的寿命,是WSN领域的研究热点.在分簇WSN基础上,实现了一种误差实时可控的数据融合算法.通过该算法,节点可自行根据近期采集的历史数据实时调整传输阈值,不同节点可保持接近的数据传输率,实现均匀耗电;自适应的阈值可以有效控制数据融合的误差.理论分析与仿真实验表明,该算法能够保证不同节点数据传输的公平性;在数据传输率相同的情况下,其求和查询及均值查询的平均绝对误差均远低于当前优秀的基于伯努利采样的数据融合方法.此算法无需先验知识,在多种WSN应用场景中具有较强的可用性与适应性.     

一种分簇无线传感器网络中的分布式信源编码算法

针对密集型无线传感器网络中信息存在大量冗余的问题,该文提出了一种适用于分簇无线传感网络的分布式信源编码算法.该算法以边信息作为初始参考信源,利用信源间的相关性来决定各信源的编码顺序和参考信源,然后由各信源相对于参考信源进行相关编码,接收端则根据编码顺序和参考信源进行相关译码.该文同时针对模值编码的方式,给出了一种低复杂度的译码算法.理论分析和仿真结果表明,将该算法应用于分簇路由协议中可以有效地降低节点的发送比特数,从而降低网络的能耗以延长网络寿命.     

基于混合CS的WSN六边形格状优化分簇路由算法研究

建立基于混合CS的六边形格状WSN分簇模型,定量分析网络数据传输次数与数据压缩比例和分簇大小的关系,并求解最优网络分簇个数。提出基于混合CS的WSN六边形格状优化分簇路由算法,均衡网络通信开销的同时减少数据传输次数。通过仿真实验验证所提出的优化分簇模型与算法优于传统分簇模型,能有效降低网络数据传输次数。建立基于混合CS的六边形格状WSN分簇模型,定量分析网络数据传输次数与数据压缩比例和分簇大小的关系,并求解最优网络分簇个数。提出基于混合CS的WSN六边形格状优化分簇路由算法,均衡网络通信开销的同时减少数据传输次数。通过仿真实验验证所提出的优化分簇模型与算法优于传统分簇模型,能有效降低网络数据传输次数。     

A grid based clustering and routing algorithm for solving hot spot problem in wireless sensor networks

Energy conservation of the sensor nodes is the most important issue that has been studied extensively in the design of wireless sensor networks (WSNs). In many applications, the nodes closer to the sink are overburdened with huge traffic load as the data from the entire region are forwarded through them to reach the sink. As a result, their energy gets exhausted quickly and the network is partitioned. This is commonly known as hot spot problem. Moreover, sensor nodes are prone to failure due to several factors such as environmental hazards, battery exhaustion, hardware damage and so on. However, failure of cluster heads (CHs) in a two tire WSN is more perilous. Therefore, apart from energy efficiency, any clustering or routing algorithm has to cope with fault tolerance of CHs. In this paper, we address the hot spot problem and propose grid based clustering and routing algorithms, combinedly called GFTCRA (grid based fault tolerant clustering and routing algorithms) which takes care the failure of the CHs. The algorithms follow distributed approach. We also present a distributed run time management for all member sensor nodes of any cluster in case of failure of their CHs. The routing algorithm is also shown to tolerate the sudden failure of the CHs. The algorithms are tested through simulation with various scenarios of WSN and the simulation results show that the proposed method performs better than two other grid based algorithms in terms of network lifetime, energy consumption and number of dead sensor nodes.     

基于遗传聚类的无线传感器负载均衡路由算法

通常的无线传感器分簇网络存在节点负载不均衡的问题。为均衡各节点能量消耗,延长网络生存周期,将K均值算法与遗传算法相结合,提出一种负载均衡的无线传感器网络路由算法,算法利用遗传算法的全局寻优能力以克服传统K均值算法的局部性和对初始中心的敏感性,实现了传感器网络节点自适应成簇与各节点负载均衡。仿真实验表明,该算法显著延长了网络寿命,相对于其他分簇路由算法,其网络生存时间延长了约43%。     

An Adaptive Fuzzy C Means with Seagull Optimization Algorithm for Analysis of WSNs in Agricultural Field with IoT

In recent years, the environmental monitoring in agriculture field is an essential required application. To achieve the environmental monitoring of agriculture fields, the wireless sense networks (WSN) and internet of things is utilized. In the WSN, the energy consumption is a main issue to access the medium and transfer the networks. Hence, in this paper, adaptive fuzzy C means clustering and seagull optimization algorithm is developed for monitoring environmental conditions in agriculture field. Two main objective functions are utilized to empower the presentation of the WSN such as load balancing and energy efficient operation. The proposed method is a combination of fuzzy C means clustering and seagull optimization algorithm (SOA). The energy efficient and load balancing is achieved by optimal routing scheme by proposed method. The fuzzy C-means clustering is utilized to empower the energy efficient operation and load balancing. In the fuzzy C-means clustering, the SOA is utilized to select the optimal path selection. The proposed method is executed by NS2 simulator and performances are compared with existing methods such as atom search optimization and emperor penguin optimization respectively. The performance metrics are delay, drop, throughput, energy consumption, network lifetime, overhead and delivery ratio.

     

基于动态集群和DKF的协作式目标跟踪

针对具有有限感知范围的无线传感器网络中的动态目标跟踪问题,提出了一种将卡尔曼一致滤波和动态集群自组织相结合的协作式动态目标跟踪算法。首先,算法采用一个由群头挑选阶段和集群重新配置阶段构成的动态集群协议来限制参与目标状态估计过程中节点间的信息交换,然后用一个分布式加权估计预测算法即卡尔曼一致滤波来估计目标状态并预测其下一个位置,这样有助于唤醒最合适的节点来进行目标跟踪并最恰当地组织网络通信,而其他节点保持在睡眠状态。仿真结果表明,提出的算法相比于集中式和其他2种常用的分布式动态目标跟踪算法,不仅能够降低网络的平均能耗,而且能够明显提高跟踪过程中的误差估计质量。     

Game theory based distributed energy efficient access point selection for wireless sensor network

In this paper, the distributed energy consumption optimization of sensors in wireless sensor network (WSN) is studied. The access point selection for sensors is critical to the energy consumption because of the limited scope of wireless communication. Due to the high complexity of the central optimization, the desired approach of optimization is the distributed one with lower computation complexity. A game model is proposed for the energy efficient AP selection problem, which is proved to be an exact potential game. Also, a distributed learning algorithm is proposed to achieve the globally optimum in a distributed manner. Simulation results show that the proposed would improve the energy efficiency in the WSN.     

基于遗传聚类的无线传感器负载均衡路由算法

通常的无线传感器分簇网络存在节点负载不均衡的问题。为均衡各节点能量消耗,延长网络生存周期,将K均值算法与遗传算法相结合,提出一种负载均衡的无线传感器网络路由算法,算法利用遗传算法的全局寻优能力以克服传统K均值算法的局部性和对初始中心的敏感性,实现了传感器网络节点自适应成簇与各节点负载均衡。仿真实验表明,该算法显著延长了网络寿命,相对于其他分簇路由算法,其网络生存时间延长了约43%。     

无线传感器网络中基于小波变换的分布式压缩感知技术

Wireless Sensor Networks (WSN ) are mainly characterized by a potentially large number of distributed sensor nodes which collectively transmit information about sensed events to the sink. In this paper, we present a Distributed Wavelet Basis Generation (DWBG) algorithm performing at the sink to obtain the distributed wavelet basis in WSN. And on this basis, a Wavelet Transform-based Distributed Compressed Sensing (WTDCS ) algorithm is proposed to compress and reconstruct the sensed data with spatial correlation. Finally, we make a detailed analysis of relationship between reconstruction performance and WTDCS algorithm parameters such as the compression ratio, the channel Signal-to-Noise Ratio (SNR), the observation noise power and the correlation decay parameter by simulation. The simulation results show that WTDCS can achieve high performance in terms of energy and reconstruction accuracy, as compared to the conventional distributed wavelet transform algorithm.     

WSN中引入移动节点的路由协议设计与仿真

对于节点部署不均或者节点死亡而导致的监测盲区,可通过在WSN中引入移动节点来修复。提出一种修复策略,可较为及时、准确地修复监测盲区,同时考虑节点的能量均衡问题。在LEACH-M分簇路由算法的基础上,给出了一种按节点能量分配工作量的能量均衡分簇路由算法LEACH-M-G,并运用MATLAB仿真工具进行了仿真分析。仿真结果表明,所提出的监测盲区修复策略、以及LEACH-M-G路由能有效地修复监测盲区,均衡网络能量、延长网络生命周期。