Adaptive decentralized re-clustering protocol for wireless sensor networks

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this paper, we introduce an adaptive clustering protocol for wireless sensor networks, which is called Adaptive Decentralized Re-Clustering Protocol (ADRP) for Wireless Sensor Networks. In ADRP, the cluster heads and next heads are elected based on residual energy of each node and the average energy of each cluster. The simulation results show that ADRP achieves longer lifetime and more data messages transmissions than current important clustering protocol in wireless sensor networks.     

一种解决GEAR路由空洞问题的新方案

无线传感器网络中的GEAR路由协议在解决路由空洞问题时,会出现短暂路由环现象,使分组转发跳数增大,浪费更多的网络能量.基于反馈避免的思想提出一种改进的GEAR路由算法,当转发节点发现自身为空洞节点时,便向其邻节点广播hole信息,在分组转发时,邻节点将该节点标记为空洞节点,转发节点修改自身的综合代价,从而绕开该空洞节点...     

PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks

The main goal of this research is concerning clustering protocols to minimize the energy consumption of each node, and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols consume large amounts of energy, incurred by cluster formation overhead and fixed-level clustering, particularly when sensor nodes are densely deployed in wireless sensor networks. In this paper, we propose PEACH protocol, which is a power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks. By using overhearing characteristics of wireless communication, PEACH forms clusters without additional overhead and supports adaptive multi-level clustering. In addition, PEACH can be used for both location-unaware and location-aware wireless sensor networks. The simulation results demonstrate that PEACH significantly minimizes energy consumption of each node and extends the network lifetime, compared with existing clustering protocols. The performance of PEACH is less affected by the distribution of sensor nodes than other clustering protocols.     

一种面向移动监控型网络的分簇路由协议

传统的无线传感器网络(wireless sensor network,WSN)中节点是基本保持静止的,使网络中的节点具有移动性可以改善WSN功能;针对移动监控型无线传感器网络中拓扑结构改变频繁,传统的路由协议不能适用的问题,提出了一种基于分簇的移动性路由协议(mobile cluster routing protocol,MCR);该协议包含一个分布式分簇算法(distributed cluster algorithm,DCB),此算法充分考虑了节点移动性和剩余能量,通信复杂度比较低,分簇效率很高;同时,针对节点移动,协议中提出了一种注册机制,通过这种机制可以实现在移动过程中的信息交互;实验表明,MCR协议能够有效提高在移动环境下的网络性能。     

EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks

In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient clustering protocol. Hierarchical clustering algorithms are very important in increasing the network’s life time. Each clustering algorithm is composed of two phases, the setup phase and steady state phase. The hot point in these algorithms is the cluster head selection. In this paper, we study the impact of heterogeneity of nodes in terms of their energy in wireless sensor networks that are hierarchically clustered. We assume that a percentage of the population of sensor nodes is equipped with the additional energy resources. We also assume that the sensor nodes are randomly distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. Homogeneous clustering protocols assume that all the sensor nodes are equipped with the same amount of energy and as a result, they cannot take the advantage of the presence of node heterogeneity. Adapting this approach, we introduce an energy efficient heterogeneous clustered scheme for wireless sensor networks based on weighted election probabilities of each node to become a cluster head according to the residual energy in each node. Finally, the simulation results demonstrate that our proposed heterogeneous clustering approach is more effective in prolonging the network lifetime compared with LEACH.     

无线传感器网络中一种节点负载均衡的分簇算法

无线传感器网络节点的能量有限,而分簇算法能有效解决节点能耗受限与不同节点能量开销不平衡问题。在网络路由分簇的基础上,提出了一种节点负载均衡的分簇算法。该算法对经典的分簇协议LEACH的簇头选择机制进行了改进,应用量子粒子群对簇头选取进行优化。为解决算法后期易陷入局部极小的问题,采用了基于群体适应值方差的早熟判断机制,结合模拟退火算法进行局部优化。仿真结果表明:该算法使网络节点负载更均衡,有效提高了无线传感器网络的性能。     

基于非均匀成簇的无线传感器网络多跳路由算法

针对复杂、不规则场景下无线传感网络的高效能组网问题,提出了一种基于非均匀成簇的无线传感器网络多跳路由算法MRAUC。根据应用场景形状不规则、汇聚节点远离检测区域等特点,首先将检测区域近似成汇聚节点位于扇心的扇环,建立了扇型场景下无线传感器网络的非均匀成簇模型;通过等间隔划分扇环,以第一扇环能耗最小为原则确定各扇环的簇首数目,进一步推导出各扇环内的最佳簇首比例;通过簇首发射功率的自适应调整实现非均匀分簇;同时,以MTE原则竞选出最佳中继簇首,有效解决了簇首间的路由中继问题。仿真结果表明,与传统算法相比,在不同应用场景下所提MRAUC算法在均衡网络节点能耗、延长网络生命周期方面具有显著优势,更适用于工程实际。     

一种基于LEACH协议改进的簇间多跳路由协议

为了均衡无线传感器网络的能量消耗,延长网络的生存时间,在研究几种基于均匀分簇和非均匀分簇的路由协议基础上,提出一种基于LEACH协议改进的簇间多跳路由协议。该协议引入能量因子和距离因子修正了LEACH协议的阈值函数。在簇间通信过程,簇头节点与Sink节点之间采用多跳通信方式,簇头与簇头之间形成一条通向Sink节点的优化路径。实验结果表明,相比于LEACH协议和EEUC协议,本文提出的新协议能够有效的均衡网络的能量消耗,延长无线传感器网络的寿命。     

带状无线传感器网络能量高效的节点部署策略

带状无线传感器网络具有特殊的拓扑结构,满足很多重要领域的应用需求。针对带状网络中的能量消耗不均衡问题,分析了带状无线传感器网络在多跳通信时的拓扑结构和能耗模型,在对带状网络进行分簇的基础上,提出一种非均匀的节点部署策略,该策略量化了带状传感器网络中簇内节点的数目关系,并设计了相应的路由协议。仿真结果表明,非均匀的节点部署策略可以缓解带状网络的能量空洞问题,使网络能耗趋于均衡,延长整个网络的生命周期。     

基于分簇的无线传感器网络编码算法

通过均衡网络能量消耗和延长网络生命周期,以提高无线传感器网络的能量利用率,提出了在无线传感器网络动态成簇算法中对簇头节点进行网络编码的路由算法.在簇的建立阶段,采用节点剩余能量和接收信号强度来完成分簇,解决了部分节点因能耗过度而过早失效的问题;在数据采集阶段,采用基于簇头进行随机线性网络编码的方法,有效降低了传输到网关节点数据包的数量,减少了网络能量的耗用.仿真实验结果表明,该算法与标准协议AODV相比,有效的均衡了节点能量消耗,提高了能量使用效率,改善了网络吞吐量和端到端延迟.     

一种基于团体的无线传感器网络服务发现协议

服务发现能力是有效应用无线传感器网络的基本要求.提出基于团体的无线传感器网络服务发现协议GSDP,根据传感器节点的运动特性将网络划分为多个团体,每个团体由一个团体头节点和多个成员节点组成.团体头节点构成一个分布式服务目录,负责处理服务注册信息和服务请求信息,避免在网络范围内产生大量的广播信息.仿真实验表明,在具有团体移动特性的传感器网络中,GSDP在保证服务发现性能的同时,能够有效地减少服务发现过程的消息开销.     

异构传感器网络的分布式能量有效成簇算法

为了延长网络的生存时间,需要设计能量有效的协议,以适应传感器网络的特点.成簇算法是传感器网络中减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络的生存时间.研究了异构传感器网络中成簇算法在节省能量方面的性能,提出一种适应异构无线传感器网络的分布式能量有效的成簇方案.此方案基于节点剩余能量与网络节点的平均能量的比例来选举簇头节点.较高初始能量和剩余能量的节点比低能量节点拥有更多的机会成为簇头节点,从而使网络能量均匀消耗,延长网络的生存时间.模拟实验结果显示,与现有的重要成簇方案相比,新的成簇算法在异构网络下提供了更长的网络生存时间和更大的网络有效吞吐量.     

低能耗无线传感器网络路由协议研究

针对LEACH协议生成非均匀的簇造成能量损耗的问题,提出一个基于节点剩余能量和地理位置,用于分层次均匀成簇和建立备用簇头以减少反复成簇频率的路由协议LEACH-EP。仿真实验证明,该协议在节点初始能量和网络规模相同的条件下,消耗的能量要远少于LEACH协议,节点生存时间更长,更适用于大规模无线传感器网络的低能耗路由协议。     

高数据融合的非均匀分簇无线传感器网络路由协议*

探讨了基于非均匀分簇的无线传感器网络路由协议,提出了一种高数据融合的非均匀分簇无线传感器网络路由协议。仿真实验结果表明,该路由协议有效地平衡了无线传感器网络的节点能耗,延长了网络的存活时间。     

Adaptive clustering in wireless sensor networks by mining sensor energy data

Clustering has been well received as one of the effective solutions to enhance energy efficiency and scalability of large-scale wireless sensor networks. The goal of clustering is to identify a subset of nodes in a wireless sensor network, then all the other nodes communicate with the network sink via these selected nodes. However, many current clustering algorithms are tightly coupled with exact sensor locations derived through either triangulation methods or extra hardware such as GPS equipment. However, in practice, it is very difficult to know sensor location coordinates accurately due to various factors such as random deployment and low-power, low-cost sensing devices. Therefore, how to develop an adaptive clustering algorithm without relying on exact sensor location information is a very important yet challenging problem. In this paper, we try to address this problem by proposing a new adaptive clustering algorithm for energy efficiency of wireless sensor networks. Compared with other work having been done in this area, our proposed adaptive clustering algorithm is original because of its capability to infer the location information by mining wireless sensor energy data. Furthermore, based on the inferred location information and the remaining (residual) energy level of each node, the proposed clustering algorithm will dynamically change cluster heads for energy efficacy. Simulation results show that the proposed adaptive clustering algorithm is efficient and effective for energy saving in wireless sensor networks.     

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

为延长网络生存时间,提出了一种基于网格的无线传感器网络分簇路由协议.整个网络分成若干个虚拟网格,每个虚拟网格形成一个簇,采用唯一簇头选举法产生簇头,且簇内成员可以根据局部的信息调整簇的大小,达到节省能量的目的.仿真实验和分析表明:该协议能均衡网络能量,延长网络的生存时间.     

无线传感网络中移动节点定位技术研究

现有的定位方式因为需要建立网络模型和能量消耗不平均的现象,故不适用于有少量节点随机移动的无线传感网络.针对此类无线传感网络中各节点的定位问题,在分析了定位的计算复杂度和能量损耗的前提下,提出了分簇定位算法,在簇的范围内对发生移动的节点采用接收信号强度测距(RSSI)与质心定位相结合(CLA)的方法进行定位.分析与仿真结...     

A multicast reprogramming protocol for wireless sensor networks based on small world concepts

Automatic reprogramming is an important and challenging issue in wireless sensor networks (WSNs). A usual approach is the over-the-air programming (OAP), which is a fundamental service based on reliable broadcast for efficient code dissemination. However, existing OAP protocols do not enable the reprogramming of a subset of the sensor nodes in a WSN. Hence, in this work we propose a multicast-based over-the-air programming protocol that considers a small world infrastructure (MOAP-SW). The small world model is used to create shortcuts toward the sink in the communication infrastructure of sensor networks. The endpoints of these shortcuts are more powerful nodes, resulting in a heterogeneous wireless sensor network. Simulation results show the feasibility of the protocol regarding the number of messages transmitted, the energy consumption and the time to reconfigure the network.     

基于Steiner树的层次型无线传感器网络安全组播协议

在基于查询的无线传感器网络中,组播技术的应用可大幅减少传感器节点的能量消耗,延长节点寿命.针对大型无线传感器网络组播协议性能不高,且易遭受攻击等问题,提出了基于Steiner树的层次型无线传感器网络安全组播协议.该协议主要运用Steiner树与分簇网络的思想,将Steiner树的高效性与簇的高扩展性相结合,提高了无线传...     

基于事件驱动保持网络连通性的WSNs路由协议

为保证无线传感器网络（ WSNs）的连通性,延长网络有效工作期,提出了一种事件驱动成簇、能量高效均衡的路由协议。该协议避免了与事件无关的节点参与成簇而消耗能量,通过簇首选举的控制消息延时转发节省了网络能量,建立了综合考虑当前节点剩余能量和包含其邻居节点的平均剩余能量、当前节点到邻居节点和Sink节点距离的中继路由法则。仿真结果表明：与采用预成簇的AEEC协议和事件驱动成簇的ARPEES协议相比,所提出的路由协议推迟了首个死亡节点的出现时间,使WSNs有效工作期分别提高了4.3倍和47%。