一种基于移动性的无线传感器网络分簇路由协议

近年来,包含移动节点的无线传感器网络逐渐得到了广泛应用,传统的无线传感器网络路由协议已不能适用于节点移动的场景。LEACH-Mobile协议是一种较适用于移动无线传感器网络的路由协议,它在LEACH协议基础上对节点移动的处理进行了优化。本文针对移动的场景提出了一种基于移动性的无线传感器网络分簇路由协议MCR,该协议包含了一个基于移动性的簇头选举算法MCE和一个自适应LEACH-Mobile算法ALM,保证了簇头尽可能地在相对移动性最小的节点中选择,充分考虑了节点的移动性因素和剩余能量。仿真实验结果显示,MCR协议能够有效提高在移动环境下的吞吐量。     

无线传感器网络备份路径分簇算法

在路由协议中利用分簇技术可以提高无线传感器网络的可扩展性。针对无线传感器网络(WSN)中分簇算法的不足,提出了基于备份节点策略的EDC算法,传感器节点在其簇头失效后仍可以通过其备份路径传输数据。通过OMNeT++平台上的仿真实验表明,EDC在网络重建时间、失效节点数量较其他WSN协议有明显的改善。     

基于改进蚁群算法的WSN分簇路由机制研究

针对现有的用于无线传感器网络(WSN)的分簇路由协议,存在着所有簇头直接与汇聚节点通信、远离汇聚节点的簇头能量消耗过快等一系列的问题,根据蚁群算法(ACA)及WSN分簇路由算法的特点,对ACA进行改进并引入到WSN分簇路由机制中,提出一种基于改进蚁群算法的WSN分簇路由算法;该算法将到汇聚节点的距离设定为启发函数以找到簇头下沉的最佳路径和提高蚁群算法的效率,同时,在选择节点概率公式时将该节点的剩余能量考虑在内,在数据传输过程中,减少了簇头节点的能量消耗,进而实现节点能量的高效利用,增强网络的使用寿命。以实现网络通信的高效;通过仿真,结果表明,该算法是可行的、有效的。     

基于能量均衡高效WSN的分簇路由算法

针对无线传感器网络(WSN)节点能耗不均衡导致网络生存时期短的问题,提出一种基于改进人工蜂群算法(CTABC)和模糊C均值(FCM)聚类的分簇路由算法(AFCR).簇构建阶段,基站采用由CTABC优化的FCM对网络节点聚类分簇;每个簇内,节点基于自身状态分布式竞选簇首;簇间路由阶段,通过引入经济学中的基尼系数对蚁群优化(ACO)进行改进,提出一种基于改进ACO的簇间路由算法;簇内通信阶段,引入区分忙闲节点的轮询控制机制.在不同的场景中对所提协议进行仿真,实验结果表明,与FIGWO和GAFCMCR算法相比,AFCR能够有效地均衡网络能耗,延长网络生存期,提高网络吞吐量.     

低冗余度WSN非均匀分簇算法应用研究

将传统非均匀分簇算法应用于低冗余度的无线传感器网络(WSN)中时,存在传感器节点早衰和簇间多跳通信传输能量开销不均衡的问题。为此,针对低冗余度WSN,提出基于粒子群和最短路由树的非均匀分簇路由算法。利用粒子群算法优化非均匀分簇过程,通过建立最短路由树搜索簇间多跳传输最优路径,实现数据从传感器节点到基站的高效传输。仿真结果表明,相比于EECS和EEUC算法,该算法可有效延长低冗余度WSN的网络生命时间,均衡簇间通信能量消耗。     

无线传感器网络分簇路由协议的改进研究

针对无线传感器网络(WSN)中分簇路由协议LEACH算法中簇首分配不均以及簇首与Sink节点直接通信问题进行研究,提出一种基于LEACH成簇思想的分簇路由协议。该算法基于节点剩余能耗和已担任簇首时间选举簇头。簇头间采用贪婪算法形成一条链,在该链中又选出一个簇头,将整个网络的数据融合后转发给基站。MatLab仿真结果显示,改进后的算法在均衡网络节点能耗和网络的生存时间上比LEACH算法有很大提高。     

无线传感器网络分簇路由协议的改进研究

针对无线传感器网络（WSN）中分簇路由协议LEACH算法中簇首分配不均以及簇首与Sink节点直接通信问题进行研究．提出一种基于LEACH成簇思想的分簇路由协议。该算法基于节点剩余能耗和已担任簇首时间选举簇头。簇头间采用贪婪算法形成一条链,在该链中又选出一个簇头,将整个网络的数据融合后转发给基站。MatLab仿真结果显示,改进后的算法在均衡网络节点能耗和网络的生存时间上比LEACH算法有很大提高。     

WSN自适应负载均衡集簇分层路由协议

结合考虑传统无线传感器网络(wireless sensor networks,WSN)路由协议特点以及实际应用中节点的不对等性,提出了一种自适应负载均衡集簇分层路由协议——ALBCH.该协议在簇头选举时引入剩余能量等相关因子,将贪婪算法成链机制分别引入分层路由协议的簇内通信和簇头间通信,对贪婪算法成链机制进行了一些改进.仿真结果表明,ALBCH能更有效地均衡网络负载,具有更好的健壮性和更高的实时性能,同时解决了传统协议在处理异构网络时的局限性.     

一种事件驱动型WSN状态监测信息路由协议

为了均衡无线传感器网络(WSN)中各节点的能量消耗,提出了一种基于分簇路由算法思想的网络自身健康状态信息传输路由协议——事件驱动型状态监测信息路由协议（ED-SMIR）。在ED-SMIR协议中,簇内节点根据能量消耗速度的大小,采用单跳和多跳轮换的方式,簇头到sink节点的路由,采用多跳的方式。仿真实验表明,与LEACH和EDBCM协议相比,ED-SMIR消耗的能量更少,可以均衡整个网络的能量并有效延长网络的生存时间。     

基于分簇的无线传感器网络路由协议的分析与优化

无线传感器网络（WSN）中的传感器节点由于受到成本、体积等因素的限制,处理能力、无线带宽,以及电池容量等资源都非常有限。由于WSN是一种资源受限网络,尤其是能量的受限,因此路由协议必须维持较小的路由信息并尽可能的减少能耗。基于分簇的层次路由协议是目前解决此类问题的主要方法。在对传感器网络路由协议作了充分了解的基础上深入研究了经典的簇类路由算法一LEACH（Low Energy Adaptive Clustering Hierarchy）,并针对其不足对其进行改进与优化。     

基于可预测移动汇聚节点的无线传感网分簇算法研究

在汇聚节点移动可预测情况下,提出一种无线传感网分簇算法。该算法将subsink节点引入到HEED分簇算法中,以较快感知移动路径变化,快速形成分簇拓扑;采用sink节点注册机制,实现汇聚节点移动过程中的信息交互。实例分析表明,该算法能快速形成合理网络拓扑,延长无线传感网的生存期。     

移动传感器网络中能量均衡分簇及移动策略

无线传感器网络各节点能量有限,如果数据收集节点（Sink）能够移动,则可以大大节约节点能量,从而延长网络的寿命。首先提出一种能量均衡的分簇算法,根据节点地理信息进行分簇,使得节点耗费总能量尽可能小的同时,使各簇能量消耗基本平衡;在此基础上提出一种Sink 移动策略,Sink 优先选择能量较充足的簇收集信息。仿真结果表明,与传统的随机移动算法相比,提出的算法能够显著平衡各族之间的能量消耗,并减少总的网络能量消耗,从而提高网络的寿命。     

Fault-resilient sensing in wireless sensor networks

Research on wireless sensor networks (WSNs) has received tremendous attention in the past few years due to their potential applications and advances in the VLSI design. In WSNs with tiny sensors, mobility of a sink may provide an energy efficient way for data dissemination. Having a mobile sink in WSN, however, creates new challenges to routing and sensor distribution modeling in the network. In this paper, based on clustering and routing optimization algorithms, we propose a new scheme called K-means and TSP-based mobility (KAT mobility). After clustering the sensor nodes, the proposed method navigates the mobile sink to traverse through the cluster centers according to the trajectory of an optimized route. The mobile sink then collects the data from sensors at the visited clusters. Simulation results have demonstrated that the proposed scheme can provide not only better energy efficiency as compared to those obtained by conventional methods which assume random waypoint for the mobile sink, but also fault-resilience in case of malfunctions of some sensors due to attacks.     

基于移动无线传感器网络的定位研究概论

近来,在无线传感器网络的研究已经集中到了移动无线传感器网络,已经出现了可以控制自我移动的微小传感嚣装置了.尽管移动性加强了传感器网络的覆盖和连接之间的联系,但是仍然存在着很多问题.在这些问题中,最主要的可能就是传感器节点的位置估计了.定位不仅需要知道传感器所在空间环境的数据,也需要知道移动传感器导航的关键特征.对移动无...     

基于分簇机制的移动无线传感器网络数据采集协议*

为了均衡无线传感器网络的能量消耗,提出了一种基于分簇机制的移动无线传感器网络数据采集协议。该协议中,整个网络使用网格均匀分簇,节点根据加权能量—邻居规则选出分布在簇中间区域的簇头,簇头负责收集簇内兴趣事件并进行数据融合,移动sink依次运动到簇的中心点位置收集簇内兴趣事件。仿真结果表明,该协议有效地均衡了网络的能量消耗,延长了网络的生存时间。     

An enhanced real-time routing protocol with load distribution for mobile wireless sensor networks

Mobile wireless sensor network (MWSN) is a wireless ad hoc network that consists of a very large number of tiny sensor nodes communicating with each other in which sensor nodes are either equipped with motors for active mobility or attached to mobile objects for passive mobility. A real-time routing protocol for MWSN is an exciting area of research because messages in the network are delivered according to their end-to-end deadlines (packet lifetime) while sensor nodes are mobile. This paper proposes an enhanced real-time with load distribution (ERTLD) routing protocol for MWSN which is based on our previous routing protocol RTLD. ERTLD utilized corona mechanism and optimal forwarding metrics to forward the data packet in MWSN. It computes the optimal forwarding node based on RSSI, remaining battery level of sensor nodes and packet delay over one-hop. ERTLD ensures high packet delivery ratio and experiences minimum end-to-end delay in WSN and MWSN compared to baseline routing protocol. In this paper we consider a highly dynamic wireless sensor network system in which the sensor nodes and the base station (sink) are mobile. ERTLD has been successfully studied and verified through simulation experiment.     

A smart node architecture for adding mobility to wireless sensor networks

Adding a few mobile nodes into the conventional wireless sensor networks can greatly improve the sensing and control capabilities of the networks and can help researchers solve many challenges such as network deployment and repair. This paper presents an enhanced node architecture for adding controlled mobility to wireless sensor networks. The structural model, the power model and the networking model of the proposed mobile node have been built respectively for better node control. And it provides a novel robotic platform for experimental research in hybrid sensor networks or other distributed measurement and control systems. A testbed has finally been created for validating the basic functions of the proposed mobile sensor node. The results of a coverage experiment show that the mobile node can provide additional support for network coverage and can ensure that the sensor network will work properly in undesirable environments.     

Distributed clustering algorithms for data-gathering in wireless mobile sensor networks

One critical issue in wireless sensor networks is how to gather sensed information in an energy-efficient way since the energy is a scarce resource in a sensor node. Cluster-based architecture is an effective architecture for data-gathering in wireless sensor networks. However, in a mobile environment, the dynamic topology poses the challenge to design an energy-efficient data-gathering protocol. In this paper, we consider the cluster-based architecture and provide distributed clustering algorithms for mobile sensor nodes which minimize the energy dissipation for data-gathering in a wireless mobile sensor network. There are two steps in the clustering algorithm: cluster-head election step and cluster formation step. We first propose two distributed algorithms for cluster-head election. Then, by considering the impact of node mobility, we provide a mechanism to have a sensor node select a proper cluster-head to join for cluster formation. Our clustering algorithms will achieve the following three objectives: (1) there is at least one cluster-head elected, (2) the number of cluster-heads generated is uniform, and (3) all the generated clusters have the same cluster size. Last, we validate our algorithms through an extensive experimental analysis with Random Walk Mobility (RWM) model, Random Direction Mobility (RDM) model, and a Simple Mobility (SM) model as well as present our findings.     

能耗均衡的移动传感器节点派遣算法

在混合无线传感器网络中,移动传感器节点最耗能的操作是移动,如何减少移动传感器节点的移动距离同时能让其完成任务是一个富有挑战性的研究课题。本文提出了一个移动传感器节点的派遣算法,旨在均衡各个移动传感器节点的移动负载,并且能按优先级响应事件地点,适用于任意数量的移动传感器节点和事件地点的情况。当移动传感器节点数量大于事件地点数量时,将其转化为一个带权完全二分图上的最大匹配问题。当事件地点数量大于移动传感器节点的数量时,本文提出的算法先将事件地点聚类分簇,然后派遣移动传感器节点到各个簇中分别完成访问任务。为了减少传感器节点之间的消息传输量,本文在集中式算法的基础上又提出了一个分布式算法。仿真实验结果表明本文提出的分布式算法能有效降低传感器节点之间的消息传输量,算法能够使得整个混合无线传感器网络的生存寿命延长20%左右。