基于AODV的无线多媒体传感器网络路由协议

研究了AODV路由协议,分析了多路径路由实现机制,提出了一种可应用于无线多媒体传感器网络的能量均衡多路径AODV路由协议。该协议建立从源节点到目的节点的多条路径,在路径的选择上综合考虑了路径跳数和节点剩余能量,用以保证负载均衡,延长网络生存期,该算法使用了分流的方式避免拥塞。通过使用NS2仿真软件对EEMP-AODV路由协议进行仿真,结果显示其在拥塞避免、实时性、吞吐量和网络生存期方面的性能有明显提升。     

基于代价函数的改进AODV协议

Ad Hoc网络中如何设计良好的路由协议使其网络均衡是当今研究的重点。针对网络负载和能量均衡等问题,提出了一种基于代价函数的改进按需距离矢量路由协议CF-AODV。该协议在路由建立过程中,通过能量阈值和缓存队列长度阈值进行RREQ转发判断;在目的节点选取路由时采用延迟应答方案,通过以路径长短、路径负载、路径剩余能量作为因子的代价函数进行判决来选取最佳路径。仿真结果表明,所提协议在网络负载和能量上得到了均衡,可以延长网络寿命,减轻网络拥塞,减少时延和丢包率。     

MANET中基于AODV的跨层多度量路由协议

针对无线自组网按需平面距离向量路由协议(AODV)路由度量的单一化而引起的节点能耗枯竭,形成的网络区域化以及路径拥塞问题,提出一种多度量路径选择机制的路由协议――M-AODV。以AODV路由协议为基础,在路由发现阶段,根据设定的能量阈值和接收信号强度阈值选择能量较高和信号强度较强的节点作为路由节点;在路径选择阶段,首先根据物理层的接收信号强度、拥塞度和跳数计算每段链路稳定值,其次将每段路径稳定值进行累加得到整条路径的稳定值,最后选择稳定值最大的路径作为最优路径。使用NS2.35仿真软件仿真,结果表明：改进后的协议与AODV相比在端到端延时缩短了近30%,在数据包传输率、吞吐量和节点存活率方面优于AODV和I-AODV-SE路由算法。     

基于限制广播域和节点剩余能量的按需路由算法研究

按需路由协议AODV的路由发现使用洪泛方式的扩散法,导致网络超负荷运行和拥塞,而且在选择转发路由时,总是选择最少跳数的路由,造成无线传感网络中节点能量不均,减少网络寿命.本文提出了AODV-DE算法,该算法引入广播域的概念,限制RREQ分组的转发范围,同时避免使用剩余能量低的节点转发数据分组,选择路由路径时选择总剩余能量最多的路径进行信息的传送.仿真结果表明,AODV-DE协议在路由开销、网络寿命和端到端的延迟这三个方面表现出了优势.     

安全保障：无线Mesh网络中支持QoS的DSR路由协议的改进与实现

随着无线Mesh网络传输多媒体业务需求的增加,要求网络支持服务质量（QoS）,本文基于DSR协议设计了一个支持QoS的路由协议算法QDSR（QoS-DSR）。该算法保证了数据流的带宽、时延的QoS需求,根据路径跳数和节点拥塞情况定义路由代价函数,选择最优路径。仿真结果表明,与DSR相比,QDSR提高了网络吞吐量,降低了平均端到端延时,提高了网络利用率,更好地满足业务的QoS需求,并且具有更强的适用性和可扩展性。     

基于拥塞程度和能量状态的DSR路由协议的改进

无线Ad Hoc网络是由一些无线主机所组成的具有多跳、临时性等特征的网络,这些无线主机还带有无线收发装置;每个无线终端具有路由器和主机两种功能.网络中所有的节点地位平等.无线Ad Hoc网络组网的无基础设施性和自组织性,使它在特定的救灾抢险、军事指挥作战、野外科学考察等特殊场合下得到了广泛的应用.DSR路由协议具有使用源路由机制和路由缓存技术,并且支持中间节点路由回复应答,减少了路由开销等优点.文中主要解决了DSR路由协议节点拥塞、负载不均以及在选择路径时没有考虑节点的能量等问题,经仿真分析比原DSR路由协议在节点的拥塞状态和能量状态方面得到较大的改善.     

一种基于距离矢量的Ad Hoc网络拥塞适应路由协议

DSDV是一种基于距离矢量的Ad Hoc网络路由协议,该路由协议在网络负载较大的情况下,网络性能下降很快。本文对DSDV协议进行了改进,使之能实现拥塞感知和拥塞适应功能,提出了一种拥塞警告距离向量（congestion-aware distance vector, CADV）协议。基于NS-2的仿真结果显示,相比于DSDV和AODV,CADV在网络吞吐量和平均分组投递延时方面的性能有了明显的提高,受到节点移动速度变化的影响是最小的。     

基于ODMRP的稳定路由协议LB-ODMRP

针对Ad Hoc网络拓扑变化频繁及节点能量有限的问题,提出了基于ODMRP的稳定路由协议LBODMRP,通过贪婪转发机制建立主路径,在综合考虑路径保持连接时间和节点负载及节点剩余能量的基础上,引入路径质量模型建立路径,提高了协议的鲁棒性,根据负载情况实现节点能量的均衡消耗,延长了网络的生存时间.仿真结果验证了该协议的有效性.     

面向绿色互联网的低功耗多播路由算法

基于路径节点驱动策略,提出了一种绿色互联网中的一对多组播路由算法,充分利用路径节点共享路径,生成低功耗最短路径树,提高用户QoS满意度。基于CERNET2拓扑仿真实现了该算法,通过与现有的能量感知启发式路由算法在网络功耗、路由成功率和运行时间等方面的性能对比,表明本文提出的算法具有更好的性能。     

无线体域网中能量高效且可靠的自适应路由协议

针对无线体域网中因通信链路时变而带来的能量浪费问题,该文提出一种能量高效且可靠的自适应路由协议.该协议在数据传播模型的基础上引入了无线链路质量的计算方法,并将各个链路质量作为隐马尔可夫模型(HMM)的状态观测值进行训练,以此得出最优的路由路径.仿真结果表明,该协议相比于基于预测的安全可靠路由(PSR)协议等已有的预测路由协议,降低了网络的数据丢包率和时延,延长了网络节点的生命周期.     

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.

     

CPCA: An efficient wireless routing algorithm in WiNoC for cross path congestion awareness

Wireless network-on-chip (WiNoC) is a new paradigm to mitigate the long-distance transmission latency for conventional wired network-on-chip. The wireless routers in WiNoC have to handle a large number of packets which could cause data congestion, thus reducing the network performance. In this paper, we propose a novel wireless routing algorithm, called CPCA, which exploits the cross path congestion information as hints to route the packets. Under CPCA, the whole network is partitioned into sub-networks. In each subnet, the congestion information of the wireless router is propagated along the cross path. As a result, the routers in the same dimension can get the congestion degree of wireless router within the subnet. Based on the congestion information, CPCA can compute the suitable path for packets routing, which can prominently avoid the congestion aggravation in the wireless router. Experimental results show that our proposed method can effectively improve performance in terms of packets transmission latency and network throughput.     

A Novel Energy Efficient and Lifetime Maximization Routing Protocol in Wireless Sensor Networks

The energy consumption is a key design criterion for the routing protocols in wireless sensor networks (WSN). Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. Thus, multipath routing schemes is an optimal alternative to extend the lifetime of WSN. Multipath routing schemes distribute the traffic across multiple paths instead of routing all the traffic along a single path. In this paper, we propose a multipath Energy-Efficient data Routing Protocol for wireless sensor networks (EERP). The latter keeps a set of good paths and chooses one based on the node state and the cost function of this path. In EERP, each node has a number of neighbours through which it can route packets to the base station. A node bases its routing decision on two metrics: state and cost function. It searches its Neighbours Information Table for all its neighbours concerned with minimum cost function. Simulation results show that our EERP protocol minimizes and balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime.     

Centralized congestion control routing protocol based on multi-metrics for low power and lossy networks

Owing to the unreliability of wireless link and the resource constraints of embedded devices in terms of energy, processing power, and memory size in low power and lossy networks (LLNs), network congestion may occur in an emergency and lead to significant packet loss and end-to-end delay. To mitigate the effect of network congestion, this paper proposes a centralized congestion control routing protocol based on multi-metrics (CCRPM). It combines the residual energy of a node, buffer occupancy rate, wireless link quality, and the current number of sub-nodes for the candidate parent to reduce the probability of network congestion in the process of network construction. In addition, it adopts a centralized way to determine whether the sub-nodes of the congested node need to be switched based on the traffic analysis when network congestion occurs. Theoretical analysis and extensive simulation results show that compared with the existing routing protocol, the performance of CCRPM is improved significantly in reducing the probability of network congestion, prolonging average network lifetime, increasing network throughput, and decreasing end-to-end delay.     

The research of cooperative routing algorithm in mobile Ad hoc networks

1 Introduction Ad hoc [1, 2] network is a dynamic-topological mobile self-organized network without any centralized access point. In such a network, each node acts as both host and router simultaneously, entering and departing from the network freely. How…     

Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

无线mesh网络中编码感知且负载均衡的组播路由

提出一种新的基于网络编码的负载均衡路由量度CRM-LB(coding-aware routing metric with load balancing),CRM-LB在CRM(coding-aware routing metric)的基础上增加了对路径p上所有节点通信密集程度与网络拥塞程度的考虑。进一步提出了基于CRM-LB的无线mesh网络多播路由CLR(coding and load-balancing routing)。该协议可以增加网络编码机会,同时考虑到网络中的负载均衡。通过性能分析和仿真实验表明,该协议在提高多播吞吐量的前提下,不仅能更好地支持网络编码,而且网络负载基本均衡。     

一种基于仿生学的MANET拥塞节点自适应回避路由协议

 针对MANET中出现的因节点拥塞而导致路由不稳定、频繁重路由等问题,本文借鉴大肠杆菌培育过程中对营养液浓度变化的新陈代谢自适应调节行为和其数学描述模型ARAS,提出了一种新的拥塞节点自适应回避的MANET路由协议ATAR,其主要思路是:将节点缓存队列信息(可反映该节点拥塞程度)和目的端反馈包跳数信息(可反映该节点到目的端的路径长短)归一化处理后定义为节点的适应值,并将其映射为菌体的成长速率;再在随机性上修正了原始描述模型ARAS,并用其分别计算该节点的所有邻节点若被当作它到目的端路由的下一跳节点时,它们各自对该路由性能的改善度,然后选择其中改善度最大的邻节点作为其下一跳节点,以自适应避开拥塞的邻节点,同时选择较短路径.仿真结果比较显示:ATAR突发大时延发生概率明显较小,具有更低的数据包平均端到端延迟,数据分组投递率也得到提高,体现出ATAR拥塞避免的策略优势较大,并且还观察到ATAR负载均衡程度也优于AODV,瓶颈节点承担的负载差异较AODV小54%.