基于多信道协作负载均衡的WSN路由

在无线传感网络中,节点的资源限制给路由协议的设计提出了挑战。在高数据率应用场景中,带宽和存储容量成为其主要问题。为此,提出基于多信道协作负载均衡算法(M-CoLBA)的路由协议来提升网络带宽,并避免因队列溢出导致的数据包丢失。M-CoLBA协议先利用拥塞感知的动态路由度量均衡流量负载,再依据队列时延选择下一跳转发节点。实验数据表明,与单一信道路由协议(S-CoLBA)和多信道协议(M-HopCount)相比,提出的M-CoLBA协议具有较高的数据包传递率。     

认知网络中的拥塞规避多径路由算法

链路拥塞导致的数据包传输延时或者数据包丢弃使得网络无法保证业务的Q0S,而目前普遍使用的链路状态路由算法不具有拥塞响应机制.本文针对以上问题,提出了一种能够快速规避拥塞的多径路由算法,该算法通过改进蚂蚁算法,在拥塞发生时采用双向蚂蚁寻路的方法,提高了新路径搜索的速度;使用新的寻路准则使其更满足认知网络的QoS需求.使用...     

基于全互连立方体的Ad Hoc网络自适应路由算法

路由算法是影响移动自组织网络（Mobile Ad Hoc Network）性能的关键问题,现有的自主式组网方式及路由存在扩展性差或节点负载不均衡问题。本文提出一种基于全互连立方体（FCCN,Fully Connected Cubic Network）虚拟拓扑的层次结构及自适应路由算法,能自适应于无线链路不稳定和网络拥塞的状况,提供良好的网络扩展和负载均衡,并与现有分层结构路由算法进行了比较,最后通过仿真验证了其具有良好的吞吐率和负载均衡能力。     

一种基于信号机制的能量感知地理路由算法

在实际的无线传感器网络中,由于路由空洞的存在,采用边缘转发机制的地理路由算法容易使空洞边缘的节点由于负载较重,能量快速消耗从而过早的死亡,导致空洞进一步的扩大．为了使网络负载更加均衡,延长网络生命周期,提出了一种基于能量信号机制的地理路由算法SIENGR ．SIENGR将节点的初始能量划分3个能量区间,并用能量信号来标识节点的剩余能量所处的能量区间．SIENGR算法的边缘转发机制结合节点的能量信号,利用空洞边界节点的所有平面邻居节点来轮流承担边缘转发的数据量,使产生的路由能够根据节点能耗的情况,自适应地避开空洞边缘能量较少的热区节点,均衡热区附近节点的能量消耗,防止空洞扩大．仿真结果验证了SIENGR算法在网络生命周期、网络能耗均衡、数据包到达率等指标上的性能．     

基于自适应遗传算法的无线激光通信网络负载均衡成簇算法

由于无线激光通信网络吞吐量低、节点传输延时高和存在分组丢失率多等问题，提出基于自适应遗传算法的无线激光通信网络负载均衡成簇算法。利用AGCH算法对无线激光通信网络节点进行分组和成簇，从中取得簇头节点，构建资源调度模型，利用该模型对簇头节点中的资源进行分配调度，采用自适应遗传算法对建立的模型进行求解，以此提升无线激光通信网络负载均衡效果，实现无线激光通信网络负载均衡。实验结果表明，通过对该算法进行网络吞吐量测试、节点传输延时测试和分组丢失率测试，验证了该算法的有效性强、实用性高。     

一种基于负载均衡的高能效LLN路由算法

针对低功耗有损网络(LLN)中由于节点部署不均匀易导致负载不均衡的问题,提出一种基于负载均衡的高能效LLN路由算法(EELB-RPL)。通过将链路质量、传输时延、节点剩余能量、吞吐量以及拥塞检测因子等因素相结合选出最优父节点;再通过调整溪流计时器,使节点根据网络拓扑密度调整自身抑制机制,避免了抑制不公平性导致负载不均衡。仿真结果表明,所提算法与现有算法相比较,能够有效实现负载均衡。其中,数据包投递率提升了14.6%,根节点吞吐量提升了28.5%,网络平均寿命提升了8.96%。     

联合无线网络编码与TCP Vegas的多播协议优化研究

为解决移动自组网中网络编码多播路由协议因业务传输负载增大,而产生的网络拥塞现象,本文提出了一种可靠的基于TCP Vegas窗口拥塞控制的网络编码多播路由协议。该协议的核心思想是发送节点采用发送窗口自调整和反馈消息触发发送窗口调整的机制,综合的调节数据包的发送速率,来改善网络拥塞现象,从而可以降低丢包率。仿真结果表明,当传输负载增大时,基于窗口拥塞控制的网络编码多播路由协议可使得系统的总开销大大降低,分组投递率获得了相对的提升。     

WMN中一种基于干扰感知的负载均衡路由协议

无线信道干扰和负载分布的不均衡严重影响无线Mesh网络吞吐量、端到端延时和资源利用率。在已有基于信噪比和邻居节点个数的干扰模型基础上,进一步研究了无线Mesh网络的链路干扰。在综合考虑了无线Mesh网络流间干扰和和流内干扰的基础上,提出路由判据PIL（Path Interfer-ence Level）。在此基础上,提出一种新的基于干扰感知的负载均衡路由协议IA-DSR（Interference-Aware DSR）。IA-DSR考虑无线网络拥塞并选择受到干扰最小的路径。仿真结果表明,在不显著增加开销的情况下,IA-DSR可以有效地提高网络的整体吞吐量,降低网络端到端时延和丢包率。     

基于SVM的电力通信网络路由均衡方法研究

路由均衡过程存在负载开销，导致路由分配风险概率增加，提出基于SVM的电力通信网络路由均衡方法。构建路由均衡模型，通过能量函数分配网络业务路由，基于粒子群优化算法改进最小支持向量机的路由算法，求解均衡模型；通过最小支持向量机估算网络节点剩余能量，选用负载开销最小的路径路由数据，实现电力通信网络全局路由均衡分配。实验结果表明：该方法可均衡电力通信网络中存在的风险，且噪声大小对电力通信网络覆盖率、节点平均剩余能量以及业务中断影响不明显，在均衡电力通信网络业务方面具有可靠性与有效性。     

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

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

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

Sensor node energy conservation is the primary design parameters in wireless sensor networks (WSNs). Energy efficiency in sensor networks directly prolongs the network lifetime. In the process of route discovery, each node cooperates to forward the data to the base station using multi‐hop routing. But, the nodes nearer to the base station are loaded more than the other nodes that lead to network portioning, packet loss and delay as a result nodes may completely loss its energy during the routing process. To rectify these issues, path establishment considers optimized substance particle selection, load distribution, and an efficient slot allocation scheme for data transmission between the sensor nodes in this paper. The selection of forwarders and conscious multi‐hop path is selected based on the route cost value that is derived directly by taking energy, node degree and distance as crucial metrics. Load distribution based slot allocation method ensures the balance of data traffic and residual energy of the node in areal‐time environment. The proposed LSAPSP simulation results show that our algorithm not only can balance the real‐time environment load and increase the network lifetime but also meet the needs of packet loss and delay.     

WSN中负载均衡能量有效的路由算法研究

在PHGASIS建链方法的基础上提出了一种改进的建链方法；在此基础上提出了一种基于双层链结构并由基站集中控制的负载均衡、能量有效的路由算法（LBEERA），此算法充分利用了簇状路由算法和链状路由算法的优点．LBEERA算法将网络划分为多个簇，每个簇的节点组成一条低层链，每条链的链头节点形成一条高层链．仿真试验发现，相对于LHACH算法和PHGASIS算法，LBEERA算法增加了网络生存时间，减少了包传输时延．     

Hybrid routing and load balancing protocol for wireless sensor network

In wireless sensor network, when the nodes are mobile, the network structure keeps on changing dynamically, that is, new nodes enter the network and old members exit the network. As a result, the path from one node to the other varies from time to time. In addition, if the load on a particular part of the network is high, then the nodes will not be capable of transmitting the data. Thus, data delivery at the destination will be unsuccessful. Moreover, the part of the network involved in transmitting the data should not be overloaded. To overcome these issues, a hybrid routing protocol and load balancing technique is discussed in this paper for the mobile data collectors in which the path from source to destination is ensured before data transmission. The hybrid routing protocol that combines the reactive and proactive approach is used to enhance gradient based routing protocol for low power and lossy networks. This protocol can efficiently handle the movement of multiple sinks. Finally, load balancing is applied over the multiple mobile elements to balance the load of sensor nodes. Simulation results show that this protocol can increase the packet delivery ratio and residual energy with reduced delay and packet drop.     

Queue‐based multiple path load balancing routing protocol for MANETs

Congestion in the network is the main cause for packet drop and increased end‐to‐end transmission delay of packet between source and destination nodes. Congestion occurs because of the simultaneous contention for network resources. It is very important to efficiently utilize the available resources so that a load can be distributed efficiently throughout the network. Otherwise, the resources of heavily loaded nodes may be depleted very soon, which ultimately affects network performances. In this paper, we have proposed a new routing protocol named queue‐based multiple path load balancing routing protocol. This protocol discovers several node‐disjoint paths from source to destination nodes. It also finds minimum queue length with respect to individual paths, sorts the node‐disjoint paths based on queue length, and distributes the packets through these paths based on the minimum queue length. Simulation results show that the proposed routing protocol distributes the load efficiently and achieves better network performances in terms of packet delivery ratio, end‐to‐end delay, and routing overhead. Copyright © 2016 John Wiley & Sons, Ltd.     

Load Balancing Technique for Congestion Control Multipath Routing Protocol in MANETs

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can communicate without a central controller or fixed infrastructure. Due to node mobility, designing a routing protocol to provide an efficient and suitable method to route the data with less energy consumption, packet drop and to prolong the network lifetime has become a challenging issue in MANETs. In MANETs, reducing energy consumption and packet loss involves congestion control and load balancing techniques. Thus, this paper introduces an efficient routing technique called the multipath load balancing technique for congestion control (MLBCC) in MANETs to efficiently balance the load among multiple paths by reducing the congestion. MLBCC introduces a congestion control mechanism and a load balancing mechanism during the data transmission process. The congestion control mechanism detects the congestion by using an arrival rate and an outgoing rate at a particular time interval T. The load balancing mechanism selects a gateway node by using the link cost and the path cost to efficiently distribute the load by selecting the most desirable paths. For an efficient flow of distribution, a node availability degree standard deviation parameter is introduced. Simulation results of MLBCC show the performance improvements in terms of the control overhead, packet delivery ratio, average delay and packet drop ratio in comparison with Fibonacci sequence multipath load balancing, stable backbone-based multipath routing protocol and ad hoc on demand multipath distance vector routing. In addition, the results show that MLBCC efficiently balances the load of the nodes in the network.

     

一种满足带宽和时延约束的选播QoS路由算法

建立一个满足带宽和时延约束的选播通信服务模型，提出相应的选播QoS路由算法。仿真实验结果表明：该算法是有效且切实可行的，它能同时满足带宽和时延的约束条件，较好地平衡网络负载．改善了网络服务质量。     

The Impact of Deployment Pattern and Routing Scheme on the Lifetime in Multi-Sink Wireless Sensor Network

Extensive use of sensor and actuator networks in many real-life applications introduced several new performance metrics at the node and network level. Since wireless sensor nodes have significant battery constraints, therefore, energy efficiency, as well as network lifetime, are among the most significant performance metrics to measure the effectiveness of given network architecture. This work investigates the performance of an event-based data delivery model using a multipath routing scheme for a wireless sensor network with multiple sink nodes. This routing algorithm follows a sink initiated route discovery process with the location information of the source nodes already known to the sink nodes. It also considers communication link costs before making decisions for packet forwarding. Carried out simulation compares the network performance of a wireless sensor network with a single sink, dual sink, and multi sink networking approaches. Based on a series of simulation experiments, the lifetime aware multipath routing approach is found appropriate for increasing the lifetime of sensor nodes significantly when compared to other similar routing schemes. However, energy-efficient packet forwarding is a major concern of this work; other network performance metrics like delay, average packet latency, and packet delivery ratio are also taken into the account.

     

IP网络时延敏感型业务流自适应负载均衡算法

互联网对时延敏感的业务数据流,要求具有较低的端到端时延,但是网络拥塞的发生,将会使服务质量无法保证。基于链路关键度提出了一种新的自适应负载均衡路由算法(LARA,load adaptive routing algorithm),能最大限度地避开拥塞链路从而减少端到端延迟。该算法通过得到一个优化目标函数,并利用凸优化理论将优化目标函数分解为若干个子函数,最终得到一个简单的分布式协议。利用NS2仿真器在基于CERNET2真实的拓扑结构上进行仿真实验,同时与网络中能普遍部署的等开销多路径(ECMP,equal-costmulti-path)算法相比较,通过测试反馈时延、分组丢失率、流量负载,结果表明LARA具有更好的自适应性和健壮性,性能相比更优。     

DBLAR：A DISTANCE-BASED LOCATION-AIDED ROUTING FOR MANET

In location-aided routing of Mobile Ad hoc NETworks (MANET), nodes mobility and the inaccuracy of location information may result in constant flooding, which will reduce the network performance. In this paper, a Distance-Based Location-Aided Routing (DBLAR) for MANET has been proposed. By tracing the location information of destination nodes and referring to distance change between nodes to adjust route discovery dynamically, the proposed routing algorithm can avoid flooding in the whole networks. Besides, Distance Update Threshold (DUT) is set up to reach the balance between real-time ability and update overhead of location information of nodes, meanwhile, the detection of relative distance vector can achieve the goal of adjusting forwarding condition. Simulation results reveal that DBLAR performs better than LAR1 in terms of packet successful delivery ratio, average end-to-end delay and routing-load, and the set of DUT and relative distance vector has a significant impact on this algorithm.