共查询到20条相似文献,搜索用时 46 毫秒
1.
认知网络能够提高网络端到端的性能,确保服务质量(QoS)要求。而目前普遍使用的路由算法不具备网络认知能力。针对这一问题,提出一种具有认知能力的负载均衡多路径路由算法,该算法结合了Q学习算法和蚁群算法各自的优点,通过蚁群算法完成路径的建立和维护,Q学习算法实现拥塞规避和负载均衡。使用OPNET仿真比较,表明该算法在时延、带宽利用方面均具有较好的性能。 相似文献
2.
移动Ad Hoc网络作为一种无线对等自组织网络,具有组网容易、节点可自主移动等特点。无线网络本身的特点以及移动Ad Hoc网络中网络拓扑的动态变化特性使得引起网络故障的原因更加多样,使得保证网络服务质量更加困难。文中针对网络断链问题,基于AODV协议路径修复算法进行研究,提出一种在断点处向下游二跳节点逐跳发起链接请求的路径修复方案。仿真结果表明,改进后的算法能有效减少端到端的平均时延,提高分组投递率,从而达到较稳定的网络服务质量。 相似文献
3.
《Journal of Network and Computer Applications》2010,33(4):422-432
This paper presents network coding based reliable disjoint and braided multipath routing (NC-RMR ) for sensor networks, which forms multipath by hop-by-hop method and only maintains local path information of each node without establishing end-to-end paths. Neighbors of each local node are divided into groups according to their hops to sink nodes to improve the network load balancing. For further performance improvement of NC-RMR with disjoint multipath model, local nodes select their own backup nodes in neighbor nodes to form additional logical paths, which implement a braided multipath model. Security advantages of NC-RMR with multipath and network coding mechanisms are analyzed. Analytical and simulation results prove that braided multipath routing model has better performance over disjoint model, and NC-RMR protocol can reduce the required number of transmission paths, ensure load balance of sensor network system, reduce the energy consumption of nodes. 相似文献
4.
针对智能电网(SG)中电力线通信(PLC)网络中负载均衡的问题,提出了一个自适应机会路由协议——负载均衡的机会路由协议(LBORP)。在LBORP中,所有收到数据包的候选转发节点都有机会参与到数据包的转发中,不再局限于一条路由路径,避免了流量仅从一条链路经过导致的负载不均衡现象;而且候选转发节点的转发优先级不仅考虑到转发节点到目的节点的距离,还考虑到了PLC链路的不稳定性以及流量的变化。除此之外,在LBORP中采用一种隐式确认方案,进一步减少协议的端到端时延。在仿真实验中,与基于有序树的PLC路由协议(PLC-TR)和PLC机会路由协议(PLC-OR)相比,LBORP在时延上分别降低了19.7%和45.8%,在丢包率上分别降低了23.4%和32.5%。实验结果表明,LBORP能够实现网络的负载均衡,提升网络的可靠性并减小端到端时延。 相似文献
5.
在分析无线Mesh网路由协议所面临的挑战的基础上,结合无线Mesh网络的性能要求,以OLSR协议为原
型,采用跨层设计理论,提出了一种基于链路状态良好程度的路由协议工R-)工SR。该协议引入了认知无线网络中的
环境感知推理思想,通过对节点负载、链路投递率和链路可用性等信息进行感知,并以此为依据对链路质量进行推理,
将其作为路由选择的依据,实现对路由的优化选择,提高网络的吞吐量,达到负载均衡。仿真结果表明,工R-OI_SR能
够在很大程度上提高网络中分组的递交率,降低平均端到端时延,在一定程度上达到负载均衡。 相似文献
6.
Mobile Ad Hoc Network (MANET) is an infrastructure-less network that is comprised of a set of nodes that move randomly. In MANET, the overall performance is improved through multipath multicast routing to achieve the quality of service (quality of service). In this, different nodes are involved in the information data collection and transmission to the destination nodes in the network. The different nodes are combined and presented to achieve energy-efficient data transmission and classification of the nodes. The route identification and routing are established based on the data broadcast by the network nodes. In transmitting the data packet, evaluating the data delivery ratio is necessary to achieve optimal data transmission in the network. Furthermore, energy consumption and overhead are considered essential factors for the effective data transmission rate and better data delivery rate. In this paper, a Gradient-Based Energy Optimization model (GBEOM) for the route in MANET is proposed to achieve an improved data delivery rate. Initially, the Weighted Multi-objective Cluster-based Spider Monkey Load Balancing (WMC-SMLB) technique is utilized for obtaining energy efficiency and load balancing routing. The WMC algorithm is applied to perform an efficient node clustering process from the considered mobile nodes in MANET. Load balancing efficiency is improved with a higher data delivery ratio and minimum routing overhead based on the residual energy and bandwidth estimation. Next, the Gradient Boosted Multinomial ID3 Classification algorithm is applied to improve the performance of multipath multicast routing in MANET with minimal energy consumption and higher load balancing efficiency. The proposed GBEOM exhibits ∼4% improved performance in MANET routing. 相似文献
7.
8.
本文将跨层优化和蚂蚁优化方法结合起来解决自组网中的负载均衡问题,提出了一种基于跨层负载感知和双向逐跳更新信息素的蚂蚁优化路由协议(CLABHPU).协议将整个路径中各节点MAC层的总平均估计时延和节点队列缓存的占用情况结合起来,共同作为路由选择和路由调整的重要依据,进行按需路由发现和维护;通过拥塞节点丢弃蚂蚁分组的方法减少了控制开销,增加了算法的可扩展性,较好地解决了自组网中现有基于蚂蚁算法的路由协议中普遍存在的拥塞问题和路由开销问题.同时,协议在路由发现阶段通过中间节点对信息素表进行双向和逐跳更新,提高了算法的收敛速度和对异常情况的反应速度.通过概率选路提供到目的节点的大量冗余路由,提高了算法的可靠性和顽存性.仿真结果表明,CLABHPU在分组成功递交率、路由开销以及端到端平均时延等方面具有优良性能,能很好地实现网络业务流负载均衡. 相似文献
9.
10.
一种适用于Ad hoc网络的基于概率负载均衡算法 总被引:1,自引:0,他引:1
为解决移动自组织网络(MANET)中网络拥塞导致的网络时延增大和吞吐量下降, 提出一种基于概率的负载均衡算法, 节点利用历史负载信息映射网络负载状态, 用概率算法进行路由准入, 从而完成负载均衡。基于历史状态的负载映射有效解决了分布式独立运算中存在的负载状态判断困难等问题, 概率算法能有效克服门限准入法则存在的模糊判别问题, 同时大量减少广播包的洪泛, 节省信道资源。结合经典的按需路由协议, 设计了H&P_DSR(history and probability based dynamic source routing)协议。仿真和理论分析一致表明, 该负载均衡算法能够准确有效地对网络负载进行均衡, H&P_DSR协议在没有增加任何信道开销的情况下显著提高了网络吞吐量, 降低了时延。 相似文献
11.
12.
为解决移动自组织网络(MANET)中网络拥塞导致的网络时延增大和吞吐量下降, 提出一种基于概率的负载均衡算法, 节点利用历史负载信息映射网络负载状态, 用概率算法进行路由准入, 从而完成负载均衡。基于历史状态的负载映射有效解决了分布式独立运算中存在的负载状态判断困难等问题, 概率算法能有效克服门限准入法则存在的模糊判别问题, 同时大量减少广播包的洪泛, 节省信道资源。结合经典的按需路由协议, 设计了H&P_DSR(History and Probability Based Dynamic Source Routing)协议。仿真和理论分析一致表明, 该负载均衡算法能够准确有效的对网络负载进行均衡, H&P_DSR协议在没有增加任何信道开销的情况下显著提高了网络吞吐量, 降低了时延。 相似文献
13.
14.
为了满足多媒体应用的QoS要求,卫星路由协议应该更有效地利用网络资源,提供更好的QoS保障。为此提出了一个基于遗传算法的LEO卫星网络QoS路由协议,称为遗传卫星路由协议(GSRP)。改进了新的操作函数,如适应度函数、终止函数,以及变异率和路由表。仿真结果表明,GSRP能够实现较少CBP和HBP的可靠的点对点时延约束,以及比传统的算法更有效的负载平衡。 相似文献
15.
针对无线网状网的网络容量问题,在多信道无线网状网模型的基础上,利用线性规划公式对无线网状网的路由问题进行描述,在此基础上提出了一个负载均衡的路由算法,在对业务请求的路由跳步数进行约束的前提上,通过减少网络链路上的负载,达到提高网络的吞吐量的目的。仿真结果表明,提出的算法能显著提高网络性能。 相似文献
16.
Ad Hoc网络中的多径路由协议可以获得源节点和目的节点之间的多条路径,能够减小路由发现延迟,提高路由稳定性,受到了人们的广泛关注。详细分析了AOMDV多径路由协议的机制和特点,从负载均衡的角度仿真评估了AOMDV协议的性能,研究表明可以显著提高网络整体生存性。在此基础上提出了一种优化的负载均衡传输方案,能够减小TCP在多径传输时的乱序问题,仿真表明显著改善了TCP传输的吞吐量。 相似文献
17.
18.
Topology is one of the most important characteristics for any type of networks because it represents the network's inherent properties and has great impact on the performance of the network. For wireless sensor networks (WSN), a well-deployed regular topology can help save more energy than what a random topology can do. WSNs with regular topologies can prolong network lifetime as studied in many previous work. However, little work has been done in developing effective routing algorithms for WSNs with regular topologies, except routing along a shortest path with the knowledge of global location information of sensor nodes. In this paper, a new routing protocol based on random walk is proposed. It does not require global location information. It also achieves load balancing property inherently for WSNs which is difficult to achieve by other routing protocols. In the scenarios where the message required to be sent to the base station is in comparatively small size with the inquiry message among neighboring nodes, it is proved that the random walk routing protocol can guarantee high probability of successful transmission from the source to the base station with the same amount of energy consumption as the shortest path routing. Since in many applications of WSNs, sensor nodes often send only beep-like small messages to the base station to report their status, our proposed random walk routing is thus a viable scheme and can work very efficiently especially in these application scenarios. The random walk routing provides load balancing in the WSN as mentioned, however, the nodes near to the base station are inevitably under heavier burden than those far away from the base station. Therefore, a density-aware deployment scheme is further proposed to guarantee that the heavy-load nodes do not affect the network lifetime even if their energy is exhausted. The main idea is deploying sensors with different densities according to their distance to the base station. It will be shown in this paper that incorporating the random walk routing protocol with the density-aware deployment scheme can effectively prolong the network lifetime. 相似文献
19.
20.
动态源路由DSR路由协议以最短路径优先为原则,但是没考虑负载均衡,产生拥塞区域、连接失败等不利结果.为减轻路由负载,提高协议性能,提出了一种基于负载均衡的DSR路由算法.在路由发现过程中节点根据自身负载情况决定接收或丢弃请求分组,从而避开负载过高节点;中间节点采用不应答路由请求分组策略;目的节点根据路径总负载选择合适的... 相似文献