无线传感网多Sink负载均衡路由协议

大多数无线传感网络应用中,传感节点将所采集的数据传输到距离最近的汇聚节点(Sink),从而形成"多对一"的汇聚型传输.如果节点持续向Sink节点发送数据,由于传感节点产生和多跳传输转发数据分布的不均衡性,普遍采用最近Sink(nearest sink,NS)导致部分区域节点负载过重能量耗尽,整个网络分割,缩短网络寿命.为了延长网络寿命,在多Sink情况下提出一种基于最近Sink机制的启发式负载均衡路由协议.此算法不仅考虑Sink间均衡,同时考虑局部区域负载均衡.仿真结果表明本算法网络寿命大大优于同类算法.     

一种SRIO网络负载均衡最短路径路由算法

在串行RapidIO传输过程中,路由选路算法是影响传输性能的重要因素之一。针对串行高速输入-输出(SRIO)网络深度优先搜索分配路径非最优问题,提出一种负载均衡最短路径路由算法。通过广度优先搜索对SRIO网络中的节点进行枚举并建立网络拓扑信息,以路由跳数定义路由的成本,根据改进Floyd-WarShall算法计算并保存交换节点间的K最短路径。给出预期负载的概念和链路上的路由路径数量来定义链路的负载,采用负载均衡算法从K最短路径中进行选路,建立SRIO网络最短路径约束的负载均衡路由。实验结果表明,与深度遍历路由算法、最小跳数算法相比,该算法在网络传输平均跳数、链路平均负载和链路负载均衡方面有更好的表现,能够有效提升SRIO路由网络的稳定性。     

基于负载均衡的簇间路由协议

针对无线传感器网络簇头节点负载不均衡的问题,提出一种基于负载均衡的簇间路由协议.该协议通过记录邻居簇头节点到Sink节点的最小跳数信息建立到Sink节点的多条路径,根据簇节点的剩余能量和负载选择合适的路径进行路由,从而实现了簇头节点间的负载均衡.仿真实验结果表明,该路由协议能有效地均衡网络负载和簇头节点能量消耗,减少数据传输延迟,延长网络生存时间.     

一种新的P2P流媒体负载均衡路由算法

构建和维持一个高带宽路由结构是P2P流媒体中的一个重要问题。针对节点频繁地加入和退出覆盖会话的现状,本文设计了基于链路可用带宽的负载均衡路由算法LBR,利用已知的物理拓扑知识,在多条路由路径中选择一条对网络可用带宽影响最小的路由路径,得到轻负载的覆盖边。该算法能够动态维护高带宽的多播树,平衡覆盖会话中节点间的负载和链路间的流量。仿真实验表明,在动态环境下算法能够缓解路由上的拥塞问题,达到负载均衡的效果。     

能量均衡的无线传感器网络节点非均匀分布路由协议

针对现有无线传感器网络(WSN)分簇路由协议因节点分布不均匀而造成能量不均衡、“热区”能量空洞问题,提出一种能量均衡的节点非均匀分布路由协议。该协议以节点“度”、 节点到Sink节点的距离及节点平均剩余能量与节点本身剩余能量的比值作为竞选主(副)簇头的参数,并且各簇之间通过路由树与Sink节点通信。仿真结果表明,本协议可降减少于“热区”内或节点密度高的簇的簇头轮换次数,推迟出现第一个死亡节点的时间,使网络负载更加均衡,延长了网络的生命周期。     

能量感知的GPSR动态路由负载均衡

贪婪周边无状态路由协议（GPSR）在Ad Hoc和传感器网络中有广泛的应用,GPSR的路由是以距离目的坐标最近的原则进行选路的,容易形成热点路由,从而缩短网络的生存时间。基于对邻居传感器节点的能量感知,提出了有动态负载均衡能力的GPSR路由算法。该算法能够根据网络节点的能量情况动态调整路由。仿真结果表明提出的具有动态路由负载均衡能力的GPSR算法能有效延长网络的生存时间。     

一种能耗均衡的WSNs动态数据汇聚方法

无线传感器网络一般采用分簇路由协议实现数据的汇聚,这类协议要求Sink节点的位置固定,并通过节点间多跳接力传输,将数据汇聚到Sink节点。由于网络中不同节点承担中继的负载不同,这会导致某些负载过重的节点能量提早耗尽,从而形成网络空洞。虽然某些路由协议在网络能耗均衡方面做了一定的措施,但仍无法较好的解决该问题。为此提出一种能耗均衡的动态数据汇聚方法,该方法的汇聚节点(Sink)为可移动节点,为平衡网络能耗,利用网络节点的能量为Sink节点确定若干个数据汇聚位置。并结合TSP算法规划Sink节点的最佳移动路径,通过对该算法进行大量的仿真,并与现有的一些方案进行比较,验证了该算法在各种性能指标上的有效性。     

移动自组网基于跨层协作的负载均衡队列调度算法

传统的路由协议都是基于"最短路径"的考虑,节点在对数据包进行调度转发的时候,无条件的为路由控制消息赋予较高的优先转发权,这样就会导致网络中处于骨干位置的节点负载过重,从而进一步影响整个网络的性能.本文提出一种新的基于跨层协作的负载均衡队列调度算法(CLLBS),通过在MAC层与网络层监视节点网络负载,配合路由协议,根据节点的负载状况实时动态地对数据流的转发优先权进行调整,在整个网络进行负载均衡,缓解那些拥塞节点的负载压力.仿真结果表明本文算法较之传统的简单优先权算法有明显的性能提高,可以有效地提高网络的吞吐量,降低丢包率.     

基于移动 Ｓｉｎｋ 的带状无线传感器网络数据汇聚方法研究

无线传感器网络内部能耗不均衡容易导致节点提早死亡,为此大量的能耗均衡路由协议被提出,然而这类方法主要针对环状无线传感器网络。带状无线传感器网络呈长条形分布,传统的能耗均衡路由协议无法发挥节能和能耗均衡的作用。本文提出一种基于移动Sink的带状WSN数据汇聚方法,首先基于节点能耗模型计算簇内节点的平均能耗,然后利用节点平均能耗求取Sink节点的最佳移动速度,最后簇首节点根据它与Sink的距离动态调整数据传输范围,从而实现对带状传感器网络的数据汇聚。实验结果表明该方法具有较好的节能和能耗均衡性,能够有效延长网络的生存周期。     

WSN中基于可信核心树的路由算法研究

介绍了一种适用于WSN网络的基于可信核心树的路由算法。该算法在局部范围内选取具有相对较高剩余能量和可信度的节点作为簇首节点,从而对整个网络进行分簇。然后通过一个最小能耗生成树算法将所有簇首节点组织成以Sink节点为根的可信核心树,进而对该树进行扩展,构建成覆盖全网的可信路由树。所有的数据沿着可信路由树上唯一的路径向Sink节点汇报。同时算法引入了可信模型,该模型通过检测网络中有数据包墓改、丢包、谎报等行为的恶意节点来评佑节点的可信度。实验结果证明,该TCTR算法能有效减小能耗、平衡负载,从而延长网络生存时间,同时能有效识别与隔离恶意节点,从而提高路径安全度与网络安全度。     

无线传感器网络中一种负载均衡的跳跃式路由协议

如何实现能量的高效利用,延长网络的生命周期一直是无线传感器网络研究的热点.在传统的路由协议中,靠近基站的节点由于要转发其它节点的数据容易过早耗尽能量而失效.本文基于传感器节点传输功率可调这一假设,提出了一种负载均衡的跳跃式路由协议(LBR).协议中每个节点维护K跳的路由表.在需要发送数据时,剩余能量较少的节点将数据发送给下一跳节点,而剩余能量较多的节点可以跨越多跳进行数据传输.从而均衡了节点的能量消耗.模拟结果表明,采用该协议建立的路由,不仅具有延时小,数据传送的路径长度短,维护简单等优点,并且能够改善网络的负载均衡,极大地延长网络的生命周期.     

Termite-hill: Performance optimized swarm intelligence based routing algorithm for wireless sensor networks

A wireless sensor network (WSN) is a large collection of sensor nodes with limited power supply, constrained memory capacity, processing capability, and available bandwidth. The main problem in event gathering in wireless sensor networks is the formation of energy-holes or hot spots near the sink. Due to the restricted communication range and high network density, events forwarding in sensor networks is very challenging, and require multi-hop data forwarding. Improving network lifetime and network reliability are the main factors to consider in the research associated with WSN. In static wireless sensor networks, sensors nodes close to the sink node run out of energy much faster than nodes in other parts of the monitored area. The nodes near the sink are more likely to use up their energy because they have to forward all the traffic generated by the nodes farther away to the sink. The uneven energy consumption results in network partitioning and limit the network lifetime. To this end, we propose an on-demand and multipath routing algorithm that utilizes the behavior of real termites on hill building termed Termite-hill which support sink mobility. The main objective of our proposed algorithm is to efficiently relay all the traffic destined for the sink, and also balance the network energy. The performance of our proposed algorithm was tested on static, dynamic and mobile sink scenarios with varying speed, and compared with other state-of-the-art routing algorithms in WSN. The results of our extensive experiments on Routing Modeling Application Simulation Environment (RMASE) demonstrated that our proposed routing algorithm was able to balance the network traffic load, and prolong the network lifetime.     

Rendezvous based routing protocol for wireless sensor networks with mobile sink

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit data. Data transmission happens either directly to the sink node or through the intermediate nodes. As the sensor node has limited energy, it is very important to develop efficient routing technique to prolong network life time. In this paper we proposed rendezvous-based routing protocol, which creates a rendezvous region in the middle of the network and constructs a tree within that region. There are two different modes of data transmission in the proposed protocol. In Method 1, the tree is directed towards the sink and the source node transmits the data to the sink via this tree, whereas in Method 2, the sink transmits its location to the tree, and the source node gets the sink’s location from the tree and transmits the data directly to the sink. The proposed protocol is validated through experiment and compared with the existing protocols using some metrics such as packet delivery ratio, energy consumption, end-to-end latency, network life time.     

能量高效的无线传感器网络路由协议

针对目前无线传感器网络分簇路由协议存在的节点能耗不均衡的问题,提出一种基于分簇思想的能量高效的多跳路由协议(EEMR)。该协议首先基于节点临近度将网络划分成簇,采用簇首自适应轮转模式优化簇内节点通信的能量消耗,以高剩余能量短路径向心角的适应度路由算法均衡簇间通信负载和能量消耗,有效避免多跳路由中出现的能量消耗不均衡问题。仿真结果表明,EEMR协议能有效均衡网络内节点的能量消耗,显著延长无线传感器网络的生命期并提高网络能量利用率。     

Fine grained load balancing in multi-hop wireless networks

In this paper we address the problem of local balancing in multi-hop wireless networks. We introduce the notion of proactive routing: after a short pre-processing phase in which nodes build their routing tables by exchanging messages with neighbors, we require that nodes decide the relay of each message without any further interaction with other nodes. Besides delivering very low communication overhead, proactive routing protocols are robust against some well known active attacks to network routing. In this framework, we develop a proactive routing protocol that is able to balance the local load. Experiments show that our protocol improves network lifetime up to 98% and that it delivers a network that is more robust against attacks that have the goal of getting control over a large part of the network traffic.     

SCALLOP: a scalable and load-balanced peer-to-peer lookup protocol

A number of structured peer-to-peer (P2P) lookup protocols have been proposed recently. A P2P lookup protocol routes a lookup request to its target node in a P2P distributed system. Existing protocols achieve balanced routing traffic among nodes by assuming that lookup requests are evenly targeted at every node. However, when lookup requests concentrate on a few nodes simultaneously, these nodes become hot spots. Due to uneven routing patterns in existing protocols, hot spots cause unbalanced routing traffic which leads to routing bottlenecks. In this paper, we present a novel structured P2P lookup protocol called SCALLOP that delivers balanced routing and avoids routing bottlenecks at occurrences of hot spots. Among existing protocols, SCALLOP is the first one to accomplish this goal at the fundamental nature of a routing protocol. SCALLOP achieves balanced routing by uniquely constructing a balanced lookup tree for each node. The balanced tree evenly distributes routing traffic among sibling nodes and, therefore, avoids or reduces routing bottlenecks. In addition, as a load-balanced protocol, SCALLOP delivers asymptotically optimal lookup performance at the tradeoff between routing path and routing table size. We conducted a set of simulations to demonstrate the effectiveness of SCALLOP. The results show that, compared-with a most-referenced and representative structured P2P lookup, protocol and a graph-based extension of this protocol, SCALLOP significantly reduces routing bottlenecks while all three protocols deliver comparable lookup performance.     

双向路径重选的自组网负载均衡路由协议

基于跨层负载感知和双向路径重选的自纽网负载均衡路由协议（CLBLR）在路由发现阶段和路由维护阶段，将整个路径中各节点MAC层的总平均估计时延和路径总业务流负载结合起来，共同作为路由选择和路由调整的重要依据，通过双向路径重选方法实现最优路径选择和网络业务流的均衡分布和均衡传输．协议通过禁止中间节点对路由请求进行应答和阻止不必要的路由请求分组，经由重负载中间节点转发，以保证路由发现时能够利用最新负载信息，并避免了节点在重负载情况下成为新建路由的中间节点，使协议具有一定的拥塞控制功能，以间接的方式实现了请求接纳控制．上述措施使分组传输路由很好地避免了拥塞节点，减少了网络瓶颈对网络性能的影响．仿真表明，CLBLR在分组丢失率、平均端到端时延和路由附加开销等方面具有良好性能，其优良的分布式控制特征能适应自组网的动态环境．     

基于能量感知的无线传感器网络层次型路由协议

为了有效平衡负载,满足大规模网络的需要,提出了一种基于能量感知的无线传感器网络层次型路由协议。该协议基于能量消耗模型,根据节点与基站的距离将网络中的节点划分为不同的层次。每层次内的节点轮流当选负责收集该层内所有节点数据的汇聚节点。汇聚节点的数据逐层转发和聚合,最后传送到剩余能量较大的一个汇聚节点——超节点,由其将数据发送到基站。汇聚节点变迁、超节点变迁机制用于均衡节点能量消耗,延长网络生命周期。NS2仿真结果表明,该协议可以有效节省能量,延长网络生存时间。     

神经网络预测Ad hoc节点流量的路由协议

提出了一种基于神经网络预测模型对网络流量负载进行预测的负载均衡协议NNP-LBRP（Load-Balanced Routing Protocol based on Neural Network Prediction model）,该协议利用RBF神经网络预测模型对Ad hoc网络中的节点流量负载进行预测,根据预测到的下一时刻的流量负载状况,在节点出现拥塞之前提前更换路径,避免中间节点出现拥塞,以此来提高网络的性能。协议中的流量值是以MAC层接口队列长度来衡量,负载均衡中的负载是流量负载。另外,协议在目的节点处采用了延迟应答策略,即在多路径中选择负载最轻的路径应答,对改善网络的性能也有一定作用。仿真结果与AODV路由协议进行比较,数据包投递率提高了约10%;平均端到端延时平均降低了27%;网络开销平均降低了26%。     

基于能量感知的无线传感器网络路由算法

针对LEPS(Link Estimation and Parent Selection)在路由选择维护阶段数据收集成功率较低、节点间负载不均衡、链路质量评估复杂等问题,提出了基于能量感知的路由算法Energy-Aware and Load-Balance(EALB)。在路由选择时,EALB引入了能量感知和同层节点数据转发机制。通过仿真实验将该算法与LEPS路由协议进行比较,结果表明在相同的实验环境下,该路由协议能够提高收集成功率,有效均衡负载,延长网络生存时间。