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

在无线传感器网络中,分簇型路由在路由协议中占据重要的地位,该协议方便拓扑结构管理,能源利用率高,数据融合简单。文章从簇头生成、簇形成和簇路由3个角度对典型的分簇路由算法LEACH,HEED,EEUC,PEGASIS进行了系统描述,从网络生命周期和节点存活数量等方面,对比了其优缺点,结合该领域的研究现状,指出了未来研究的方向。     

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

无线传感器网络与传统网络的特点不同,且与人们日常生活应用息息相关。无线传感器网络不能利用传统的路由协议,网络层的路由技术在无线传感器网络体系结构中非常重要。数据融合简单、拓扑管理方便、能量利用高效是分簇路由具有的优点,是当前研究非常热门的路由技术。文章分析了无线传感器网络分簇路由概念,着重对无线传感网络路由分簇协议的分类和协议系统进行分析,为路由无线传感器网络路由分簇协议的进一步研究提供参考。     

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

针对无线传感器网络中节点能量受限的特征,提出了ILEACH(improved-LEACH)分簇路由协议,达到延长网络生存时间的目的,该分簇路由协议在簇头选取时,充分考虑了节点的剩余能量;簇形成时利用了距离阈值的约束来优化分簇方案;数据收集阶段,根据节点的权值在簇头节点之间建立到基站的路由树,利用NS2仿真软件对LEACH和ILEACH协议进行仿真、比较,结果显示ILEACH具有良好的性能.     

基于分簇的无线传感器网络安全路由协议研究

无线传感器网络（Wireless Sensor Networks,简称WSNs）作为一种新的获取信息的方式和处理模式,已成为通信领域的研究重点。而路由协议则是无线传感器网络当前的热点研究之一。目前,针对较为典型的分簇式路由协议LEACH路由协议的研究,是无线传感器网络目前研究的一个热点。介绍了无线传感器网络路由协议常见的攻击类型,并从路由安全的角度建议性的提出了一种对LEACH路由协议针对安全性的改进方案,并应用NS2仿真平台,对改进协议做了仿真并进行了性能分析。     

无线传感器网络簇类路由协议的研究

介绍了无线传感器网络的概念、特点和应用,以及无线传感器网络中几个代表性的簇类路由协议,包括LEACH以及由LEACH稍加改进的LEACH—EE、DEEAC、LEACH—NEW、LEACH—C,TEEN,PEGASIS。这几种协议都使用了簇的概念,基于不同的应用,在簇头选择、簇内数据传输、簇头间数据传输等方面各有特色。分别介绍了这几种路由算法的基本原理、优缺点,以及它们之间的异同。最后,根据衡量无线传感器网络性能的一些重要标准进行了比较和总结。     

无线传感器网络分簇算法分析与性能比较

文中在介绍无线传感器网络路由协议的基础上,重点分析了几种有代表性的分簇路由协议算法。然后对各种分簇算法从10个评价参数上进行了一个综合对比,总结了无线传感器网络现有分簇路由协议的优点和存在的问题。最后从网络安全性和协议的实用性等方面,并对无线传感器网络分簇路由协议算法进行了展望。     

大规模无线传感器网络分簇路由协议改进方案

本文对大规模无线传感器网络的路由协议进行了研究,提出一种全新的高能效分簇路由协议.根据节点数目以及分布区域大小,通过数学公式推导得出最优的簇首节点数目.对簇首进行改进,均衡网络的负载,减少节点的过早死亡,延长整个网络的寿命.离基站较远的簇首利用多跳来传输数据,减少远距离簇首的能量消耗,延长网络寿命,使网络规模不受限.使用Matlab软件进行仿真实验,实验结果表明新协议能够均衡网络节点能耗,延长网络生命时间,且能适用于大规模的网络.     

基于距离测算的无线传感器网络分簇路由协议优化

传统网络路由协议优化方法中数据包传输过程中,容易出现丢失的问题,影响网络通信的连贯性,为提升优化效果,设计了基于距离测算的无线传感器网络分簇路由协议优化方法.分析网络分簇路由协议特点,以此特点为基础,提升无线传感器网络数据传输的准确性;均衡路由协议分簇各环节点能量,提升网络节点存活性能;基于距离测算构建无线传感网络优化...     

无线传感器网络能量异构分簇算法的研究

在无线传感器网络能量异构环境下对低功耗自适应的分簇算法(Low Energy Adaptive Clustering Hierarchy,LEACH)与稳定选举协议(Stable Election Protocol,SEP)算法进行了分析,针对其存在的不足提出了一种改进的方案。在簇头选举过程中提高了剩余能量高、距离基站较近节点当选为簇头的概率,同时对当选为簇头的节点设定能量阈值,避免能量过低的节点当选为簇头。仿真结果表明,改进后的算法较好地均衡了网络中节点的能量消耗,有效地提高了网络中能量的利用效率,并且极大地延长了网络正常工作的生命周期。     

基于权值的无线传感器网络分簇算法

综述了无线传感器网络路由算法的主要成果,但重点分析更具有能量有效性的分簇路由算法,对各种算法的主要思想进行了性能评价,提出了一种新的算法.     

Energy-balanced unequal clustering protocol for wireless sensor networks

Clustering provides an effective way to prolong the lifetime of wireless sensor networks.One of the major issues of a clustering protocol is selecting an optimal group of sensor nodes as the cluster heads to divide the network.Another is the mode of inter-cluster communication.In this paper,an energy-balanced unequal clustering(EBUC)protocol is proposed and evaluated.By using the particle swarm optimization(PSO)algorithm,EBUC partitions all nodes into clusters of unequal size,in which the clusters closer to the base station have smaller size.The cluster heads of these clusters can preserve some more energy for the inter-cluster relay traffic and the 'hot-spots' problem can be avoided.For inter-cluster communication,EBUC adopts an energy-aware multihop routing to reduce the energy consumption of the cluster heads.Simulation results demonstrate that the protocol can efficiently decrease the dead speed of the nodes and prolong the network lifetime.     

基于动态分区的无线传感器网络非均匀成簇路由协议简

针对节点负载不均而形成的“热区”问题,提出了一种基于动态分区负载均衡的分布式成簇路由协议(UCDP)。其核心思想是：将网络合理化地动态分区,使距离基站较近的区面积较小,从而减少需要承担转发任务节点的区内通信开销,节省更多的能量供数据转发使用;综合考虑距离因子和剩余能量因子进行区内非均匀成簇;有机结合簇内单跳和区间转发,区头与簇头共同协作进行路由传输。实验表明,协议具有较好的稳定性,显著延长了网络的生存周期。     

无线传感器网络高可靠低维护地理路由协议

无线传感器网络地理路由协议要求节点根据少量本地路由信息将数据分组传输路由到目标节点。为了消除路由环,地理路由算法通常需要将网络拓扑平面化。然而现有的平面化算法要么假设节点的通信半径是一固定值,在实际应用中不适用;要么对每一条链路都进行检测是否有交叉链路,路由维护代价很高。针对以上问题,提出一种具有高可靠性和低维护成本的地理路由协议RPR(region partitioning-based routing),其基本思想是将网络划分为规则多边形区域,并在贪心路由失败时将多边形区域内的所有节点看作一个虚拟节点进行周边路由。多边形区域间通信能够降低平均路由路径长度,从而提高了路由的可靠性。基于区域划分的网络平面化策略不需要检测和删除相交链路,因此减少了路由维护开销。模拟实验结果显示,RPR协议比现有方法的平均路由路径长度更短,路由维护开销更低。     

无线传感器网络的自组织成簇算法

异构传感器网络是一种能量有限且分布不均衡的网络,负载均衡和能量有效是此网络路由算法的一个挑战。现提出的自组织成簇算法能够有效增加传感器网络的稳定周期,算法基于传感器节点的剩余能量和通讯能耗选择适合的簇头节点。与经典的成簇算法LEACH和SET比较,本算法能够更好实现负载均衡,并极大地提高传感器网络的稳定周期。     

Modulated relay based stable election protocol for large-scale wireless sensor networks

Internet of things (IoT) applications based on wireless sensor networks (WSNs) have recently gained vast momentum. These applications vary from health care, smart cities, and military applications to environmental monitoring and disaster prevention. As a result, energy consumption and network lifetime have become the most critical research area of WSNs. Through energy-efficient routing protocols, it is possible to reduce energy consumption and extend the network lifetime for WSNs. Using hybrid routing protocols that incorporate multiple transmission methods is an effective way to improve network performance. This paper proposes modulated R-SEP (MR-SEP) for large-scale WSN-based IoT applications. MR-SEP is based on the well-known stable election protocol (SEP). MR-SEP defines three initial energy levels for the nodes to improve the network energy distribution and establishes multi-hop communication between the cluster heads (CHs) and the base station (BS) through relay nodes (RNs) to reduce the energy consumption of the nodes to reach the BS. In addition, MR-SEP reduces the replacement frequency of CHs, which helps increase network lifetime and decrease power consumption. Simulation results show that MR-SEP outperforms SEP, LEACH, and DEEC protocols by 70.2%, 71.58%, and 74.3%, respectively, in terms of lifetime and by 86.53%, 86.68%, and 86.93% in terms of throughput.     

A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

In wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.     

无线传感器网络中匿名的聚合节点选举协议

提出一种分簇无线传感器网络中匿名的簇头选举协议。给出了匿名簇头选举的判定规则及成簇模式,并采用基于双线性对的匿名否决协议对选举结果进行验证以保证存在节点成功当选。设计了相应的匿名数据聚合方案,无需泄露节点身份信息即可完成聚合。分析及仿真结果表明,协议同时实现了簇头选举的匿名性、高效性及安全性,可有效抵抗窃听攻击、节点妥协攻击及合谋攻击等恶意行为。     

基于网络分割的无线传感器网络多信道MAC协议

无线传感器网络中,可用正交信道数目较少和噪声干扰问题制约着多信道MAC协议性能的提升,结合数据采集应用的特点,提出一种基于网络分割的多信道MAC协议。在最小化网络总干扰值的基础上,网络分割引入碰撞因子进一步优化子树结构、降低树内干扰。并利用基于图着色理论的分配策略为每棵子树分配一条高质量信道。仿真实验结果表明,该协议显著提高了网络吞吐量,并且大幅降低了传输延迟和分组丢失率。     

Optimal load balanced clustering in homogeneous wireless sensor networks

Balancing the load among sensor nodes is a major challenge for the long run operation of wireless sensor networks. When a sensor node becomes overloaded, the likelihood of higher latency, energy loss, and congestion becomes high. In this paper, we propose an optimal load balanced clustering for hierarchical cluster‐based wireless sensor networks. We formulate the network design problem as mixed‐integer linear programming. Our contribution is 3‐fold: First, we propose an energy aware cluster head selection model for optimal cluster head selection. Then we propose a delay and energy‐aware routing model for optimal inter‐cluster communication. Finally, we propose an equal traffic for energy efficient clustering for optimal load balanced clustering. We consider the worst case scenario, where all nodes have the same capability and where there are no ways to use mobile sinks or add some powerful nodes as gateways. Thus, our models perform load balancing and maximize network lifetime with no need for special node capabilities such as mobility or heterogeneity or pre‐deployment, which would greatly simplify the problem. We show that the proposed models not only increase network lifetime but also minimize latency between sensor nodes. Numerical results show that energy consumption can be effectively balanced among sensor nodes, and stability period can be greatly extended using our models.