基于灰色关联的ZigBee网络混合路由算法研究

ZigBee网络混合路由算法(ZigBee Routing,ZBR)中将源目的节点之间的最小跳数作为唯一的路由度量因素。但随着节点能量消耗以及节点的频繁移动,ZBR算法的这一特性会造成网络间歇性连接,从而导致网络性能下降。本文提出一种选择最优分组转发路径的ZigBee网络混合路由算法—GRA-ZBR算法。GRA-ZBR算法在目的节点选择路径时引入灰色关联算法,综合考虑节点剩余能量、链路质量、节点剩余队列长度、以及路径长度等因素。仿真结果表明：GRA-ZBR算法可以有效提高网络分组投递率,降低平均端到端时延。     

基于灰色关联的ZigBee网络混合路由算法

ZigBee网络混合路由算法(ZigBee Routing,ZBR)中将源节点和目的节点之间的最小跳数作为唯一的路由度量因素.但随着节点能量消耗以及节点的频繁移动,ZBR算法的这一特性会造成网络间歇性连接,从而导致网络性能下降.提出一种选择最优分组转发路径的ZigBee网络混合路由算法(Grey Relational Algorithm based ZBR,GRA-ZBR).GRA-ZBR算法在目的节点选择路径时引入灰色关联算法,综合考虑节点剩余能量、链路质量、节点剩余队列长度以及路径长度等因素.仿真结果表明,GRA-ZBR算法可以有效提高网络分组投递率,降低平均端到端时延.     

基于COPE协议改进的网络编码感知机会路由算法

提出一种网络编码感知机会路由算法,将COPE协议中的机会监听和网络编码技术引入现有的机会路由机制,采用新的路由度量即LQM(链路质量度量)标准来选择备选转发节点集,在确保选择路径的编码机会的同时也在一定程度上保证了链路质量。仿真结果表明,此方法能提高网络的整体吞吐量,增加编码机会,降低平均端到端的时延。     

光突发交换网络中的传输控制协议性能

光突发交换(OBS)是IP over WDM核心网络采用的交换技术。在OBS网络中,送往同一边缘节点的IP分组汇聚成传输和交换的基本单元———数据突发(DB),DB丢弃会导致大量IP分组丢失,显著影响传输层的性能。文中分析OBS网络的参数对传输控制协议(TCP)吞吐量和时延的影响。仿真结果表明,DB丢包率越高,TCP性能越差。在低丢包率情况下,随着DB长度的增加,TCP吞吐量和端到端时延明显增加,高丢包率情况下则不明显;随着汇聚周期的增加,TCP吞吐量逐渐下降,端到端时延逐渐增加。     

基于能量均衡的无线传感器网络机会泛洪算法

传统的机会泛洪算法在低占空比无线传感器网络中,容易造成"瓶颈"节点转发大量数据而导致自身能量消耗过快,加速死亡,从而造成网络分割.针对该算法存在的缺陷,新算法在选择发送节点时,充分考虑到了节点的剩余能量和节点间通信链路的质量,达到了节点能量均衡的效果,解决了网络中瓶颈节点因负载过大而过早死亡的问题.通过仿真实验表明,在保证了较低端到端时延和较高投递率的前提下,新算法有效地延长了网络的生命期和增强了网络可靠性.     

机会网络中一种混合的Epidemic路由算法

机会网络采用存储-携带-转发的路由模式,利用节点移动所形成的相遇机会实现节点间通信。由于网络中节点之间的接触时间周期较短以及节点能量和缓存空间有限,容易导致时延增加和数据分组丢失。为此,提出一种混合的Epidemic路由算法(H–EP算法),通过优先发送目的地址为对方节点的数据分组;同时,根据数据分组的生存时间进行有效的缓存管理;此外,为数据分组设置合理的跳数门限值,达到门限值时,转为直接投递。理论分析和仿真结果表明,所提算法能够在保证分组投递率的同时,有效缩短投递时延,增加缓存利用效率等。     

基于网络编码技术的水声网络路由协议研究

针对水声通信传输速率低、时延大的缺点,提出在水声环境下将随机网络编码方法应用于节点之间广播通信,利用NS-2仿真软件对网络编码路由协议NCR(Network Coding Routing)进行仿真,并分别从投递率、投递时延、协议开销和冲突率4个网络性能评价指标进行了分析。发现在节点数量为50的随机网络拓扑结构中,与传统的泛洪(Flooding)方式相比,NCR协议的数据包投递率大约提高了20%~50%,网络时延降低了大约50%~60%,NCR协议改善了水声通信网络传输效率,提高投递率,提高能量利用效率和传输可靠性,时延和数据冲突率有效降低,网络性能获得明显改善。     

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

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

一种低时延的短波自组网优化链路状态路由协议

优化链路状态路由(Optimized Link State Routing,OLSR)协议是一种先验式路由协议,网络中的所有节点通过周期性地发送控制消息来计算全网路由信息。在短波自组织网络中,节点周期性地发送控制消息会占据大量的信道资源,大幅增加网络的控制开销,浪费短波有限的带宽资源,导致网络通信性能急剧下降。其次,受到地形地貌、天线方向和接收性能的个体差异等影响,造成无线链路不稳定,导致网络中存在非对称链路,增加了通信端到端时延。为此,提出了一种低时延的短波自组网OLSR协议。该协议在执行MPR(Multipoint Relay)选择算法时综合考虑了节点的连接度和链路可靠性,在优化MPR节点个数的同时选择链路可靠性较大的节点作为MPR节点,在进行路由选择时能够利用网络中的非对称链路。仿真结果表明,该协议能优化数据包投递成功率、吞吐量、端到端时延和网络控制开销等性能指标。     

一种基于动态概率转发的AODV路由协议

在Ad hoc网络(自组织网络)的路由建立过程中,由于AODV(Ad hoc按需距离矢量)路由采用洪泛方式转发RREQ(路由请求)消息会产生很多不必要的重传,很可能引发广播风暴而影响网络性能。文章提出了一种基于动态概率转发RREQ消息的改进方案,该方案根据邻居节点的个数选择不同的概率转发RREQ消息。仿真结果表明,在网络节点较多且网络比较稠密的情况下,改进方案能有效减少网络端到端时延,提高网络吞吐量和分组投递率。     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

Reinforcement learning movement path for multiple mobile sinks in wireless sensor networks

Mobile sink nodes play a very active role in wireless sensor network (WSN) routing. Because hiring these nodes can decrease the energy consumption of each node, end-to-end delay, and network latency significantly. Therefore, mobile sinks can soar the network lifetime dramatically. Generally, there are three movement paths for a mobile sink, which are as follows: (1) Random/stochastic, (2) controlled, and (3) fixed/ predictable/predefined paths. In this paper, a novel movement path is introduced as a fourth category of movement paths for mobile sinks. This path is based on deep learning, so a mobile sink node can go to the appropriate region that has more data at a suitable time. Thereupon, WSN routing can improve very much in terms of end-to-end delay, network latency, network lifetime, delivery ratio, and energy efficiency. The new proposed routing suggests a reinforcement learning movement path (RLMP) for multiple mobile sinks. The network in the proposed work consists of a couple of regions; each region can be employed for a special purpose, so this method is hired for any application and any size of the network. All simulations in this paper are done by network simulator 3 (NS-3). The experimental results clearly show that the RLMP overcomes other approaches by at least 32.48% in the network lifetime benchmark.     

基于位置感知和代理的WSN多径路由方案

针对无线传感器网络(WSN)中多径路由的可靠性和能量效率问题,提出了一种基于代理和位置感知的多径路由发现方案(LABMR).事件节点根据位置信息,动态寻找其到Sink节点之间的特殊中间节点,来构建多径路由.利用移动代理来收集多径路由的局部拓扑结构信息,Sink节点根据代理收集的路由参数来计算路径权值,以此选择最优不相交路径.同时,对于信息的重要性差异,Sink节点选择单条或多条路径来传输数据,在保证传输可靠性的同时减少能耗.与现有的基于代理的多径路由(ABMR)方法相比,LABMP在数据包投递率、能量消耗、额外开销和延迟方面具有更好的性能.     

An adaptive‐aware energy and queue improvement of AOMDV

Because the node energy and network resources in the wireless sensor network (WSN) are very finite, it is necessary to distribute data traffic reasonably and achieve network load balancing. Ad hoc on‐demand multipath distance vector (AOMDV) is a widely used routing protocol in WSN, but it has some deficiencies: establishes the route by only using hop counts as the routing criterion without considering other factors such as energy consumption and network load; forwards route request in fixed delay resulting in building the nonoptimal path; and cannot update the path status after built paths. For the deficiency of AOMDV, this paper proposes a multipath routing protocol adaptive energy and queue AOMDV (AEQAOMDV) based on adaptively sensing node residual energy and buffer queue length. When sending a routing request, the forwarding delay of the routing request is adaptively adjusted by both the residual energy and the queue length of the intermediate node; when establishing routes, a fitness is defined as a routing criterion according to the link energy and the queue load, predicting the available duration of the node based on the energy consumption rate and adjusting the weight of the routing criterion by the available duration of the node; after the routes are established, the path information status are updated via periodically broadcasting Hello that carries the path information with the minimum fitness, making the source node update the path information periodically. By using NS‐2, simulations demonstrate that compared with AOMDV, AEQAOMDV has obvious improvements in increasing packet delivery ratio, reducing network routing overhead, reducing route discovery frequency, and decreasing the network delay. And AEQAOMDV is more suitable for WSN.     

End-to-End Link Reliable Energy Efficient Multipath Routing for Mobile Ad Hoc Networks

Among the many multipath routing protocols, the AOMDV is widely used in highly dynamic ad hoc networks because of its generic feature. Since the communicating nodes in AOMDV are prone to link failures and route breaks due to the selection of multiple routes between any source and destination pair based on minimal hop count which does not ensure end-to-end reliable data transmission. To overcome such problems, we propose a novel node disjoint multipath routing protocol called End-to-End Link Reliable Energy Efficient Multipath Routing (E2E-LREEMR) protocol by extending AOMDV. The E2E-LREEMR finds multiple link reliable energy efficient paths between any source and destination pair for data transmission using two metrics such as Path-Link Quality Estimator and Path-Node Energy Estimator. We evaluate the performance of E2E-LREEMR protocol using NS 2.34 with varying network flows under random way-point mobility model and compare it with AOMDV routing protocol in terms of Quality of Service metrics. When there is a hike in network flows, the E2E-LREEMR reduces 30.43 % of average end-to-end delay, 29.44 % of routing overhead, 32.65 % of packet loss ratio, 18.79 % of normalized routing overhead and 12.87 % of energy consumption. It also increases rather 10.26 % of packet delivery ratio and 6.96 % of throughput than AOMDV routing protocol.     

Energy efficient watchman based flooding algorithm for IoT-enabled underwater wireless sensor and actor networks

In the task of data routing in Internet of Things enabled volatile underwater environments, providing better transmission and maximizing network communication performance are always challenging. Many network issues such as void holes and network isolation occur because of long routing distances between nodes. Void holes usually occur around the sink because nodes die early due to the high energy consumed to forward packets sent and received from other nodes. These void holes are a major challenge for I-UWSANs and cause high end-to-end delay, data packet loss, and energy consumption. They also affect the data delivery ratio. Hence, this paper presents an energy efficient watchman based flooding algorithm to address void holes. First, the proposed technique is formally verified by the Z-Eves toolbox to ensure its validity and correctness. Second, simulation is used to evaluate the energy consumption, packet loss, packet delivery ratio, and throughput of the network. The results are compared with well-known algorithms like energy-aware scalable reliable and void-hole mitigation routing and angle based flooding. The extensive results show that the proposed algorithm performs better than the benchmark techniques.     

Mitigation and Performance Analysis of Routing Protocols Under Black-Hole Attack in Vehicular Ad-hoc Network (VANET)

Vehicular Ad-hoc network (VANET) is a self-organized ad hoc network. VANET becomes a most challenging research area as it has several issues related to routing protocols, quality of service, security, etc. Vehicular communication is critically unsafe to several kinds of active and passive routing attacks. This paper analyzes the impact of a compromised node (vehicle) on zone routing protocol and ad-hoc on-demand distance vector, and recommends a suitable solution called secure vehicular on demand routing to find out and mitigate the black hole attack. The given study analyses the effect of vehicle density on the average throughput, packet delivery ratio, end-to-end delay, normalized routing load and average path length.     

基于交叉流网络编码的节能路由

节能路由是无线自组织网络的一个重要研究课题,对延长网络生存时间极为重要。在传统路由下,多对节点之间通信使用的多条数据传递路径会出现交叉存在公共节点,这些公共节点因需要转发来自多条交叉路径的数据包而比其它节点消耗更多的能量,从而过早因能量耗竭而失效。为了克服这一能耗不均衡问题,该文提出基于网络编码的节能路由NCBEER (Network Coding Based Energy Efficient Routing),它可捕捉多条路径交叉的机会,让公共节点对所转发的数据包进行编码,然后把编码数据包多播(Multicast)邻居节点,以减少公共节点转发数据包次数从而降低能耗;推导了编码节点使全部接收节点接收到编码数据包所需要的平均多播次数,定义了无线链路的传输代价,并将之作为信源将流量分配给不同路径的依据。仿真试验表明,NCBEER可降低和均衡节点的能耗,且能够延长网络生存时间。     

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.     

Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

In recent research, link stability is getting tremendous attention in mobile adhoc networks (MANETs), because of several impediments that occur in a reliable and robust network. Link stability metric is used to improve network performance in terms of end-to-end delay, data success delivery ratio (DSDR) and available route time (ART). Energy consumption, bandwidth and communication delay of major concern in ad hoc networks. A high mobility of MANET nodes reduces the reliability of network communication. In a dynamic networks, high mobility of the nodes makes it very difficult to predict the dynamic routing topology and hence cause route/link failures. Multicast in MANETs is an emerging trend that effectively improves the performance while lowering the energy consumption and bandwidth usage. Multicast routing protocol transmits a packet to multicast a group at a given time instant to achieve a better utilization of resources. In this paper, node mobility is considered to map better their movement in the network. So, the links with long active duration time can be identified as a stable link for route construction. Variation in signal strength is used to identify whether the direction of the node is towards or away from estimating node. We consider signal strength as QoS metric to calculate link stability for route construction. Efforts are made to identify the link with highly probable longer lifetime as the best suitable link between two consecutive nodes. We predict the movement time of nodes that define the route path to the node destination. Exata/cyber simulator is used for network simulation. The simulation results of the proposed routing protocol are compared with on-demand multicast routing protocol and E-ODMRP, which works on minimum hop count path. Analysis of our simulation results has shown improvement of various routing performance metrics such as DSDR, ART, routing overhead and packet drop ratio.