一种节能和时延保证的无线传感器QoS路由算法

无线传感器网络中实时数据（如视频、语音、图像）的传输对时延和抖动比较敏感,文章在充分考虑无线传感器节点能量受限的基础上,针对实时业务对时延的要求提出一种路由算法,该算法在路径创建和维护的过程中考虑时延和节点剩余能量来选择下一跳节点,在路由更新阶段对失效的节点进行标记,能够简化重新建立有效路由的步骤,从而减少路由建立时间,保证了传输的可靠性。仿真结果表明该路由算法既延长了无线传感器网络的生命周期,又能更好地满足实时数据的传输。     

一种用于混合通信网机会式路由选择算法

传统的路由协议都是针对特定的有线或无线网络,仅仅考虑路由的建立过程、路由建立过程中的收敛速度、路由维护的网络开销及路由动态更新时环路的避免等性能。将其用于有线无线混合传输网络会导致较低系统性能。机会式路由选择算法综合分析了无线链路状态和网络时延的影响,得出了各路径优先级的计算表达式,在路由选择时根据各条路径的优先级来选择路由。仿真结果表明,与传统路由算法相比较,该算法能够提高系统吞吐量和减少系统传输时延。     

分布式数据库系统动态数据邮递的QoS模型

在信息通讯中传统的单播网络传输,一般采用Dijkstra最短路径算法来建立点到点的最小路径计算。文章针对广域网分布式数据库系统动态、实时数据交换路由问题,对传统的单播网络传输的Dijkstra算法进行改进,提出了一种平衡网络负载的Qo S的路由算法。     

基于城市道路实时信息的VANET动态路由协议

文章提出动态路由算法DRDC(基于城市道路实时信息的VANET动态路由算法),该路由算法利用实时车流信息来动态创建基于道路的路径,并采用动态路由更新策略和基于下一跳速度矢量选择最优路径来降低端到端时延。仿真结果表明,与现有的VANET路由算法相比,该算法能有效改善分组的传输效率,降低端到端的传输时延。     

电力计量主站通信网最大可靠性路径选择方法

为保证电力计量主站通信网平稳运行，提出基于蚁群算法的通信网最大可靠性路径选择方法。使用网络邻接矩阵算法推算全部节点间最短路径长度与数量，提取抽象化的通信网邻接矩阵，创建通信网可靠性评估模型；计算信息传输时延，将最大可靠性与最低传输时延当作路径选择的双重目标，初始化路径选择参数；凭借蚁群算法的自组织特征更新信息素，实现高精度、最大可靠性路径选择任务。实验结果表明，所提方法可有效优化电力计量主站通信网络带宽，提高网络吞吐率，为计量数据高效率传输提供借鉴与帮助。     

高级量测电气信息流多服务质量传输约束路由算法

智能微电网是实现可再生能源高效利用的有效途径,系统要求具有鲁棒自愈性。高级量测和可靠通信技术是实现以上目标的核心支持技术。基于流量工程理论和分布式代理技术,该文提出一种应用于智能微电网高级量测(AMI)系统的电气信息流传输多服务质量(QoS)保证路由算法(EIF-MQC)。首先设计了基于IEC61850电气标准的信息分形差分服务代码点(DSCP)映射模型,实现异构电气参量数据整形标记。并通过电气信息流多服务质量传输约束路由算法(EIF-MQC)选择满足流量QoS需求的最优路由。理论证明算法计算传输路径是有效最短路径。仿真实验采用电气可靠性技术解决方案联合会(CERTS)微网系统结构进行算法性能评价,在轻度和重度通信负载条件下,算法均具有较好带宽利用率,并比基于链路状态路由协议(OSPF)和负载均衡最短路径路由协议(LB-SPR)配置路径传输延迟低且丢包率小,从而有效避免网络拥塞,提升AMI系统传输性能。     

高速预警信息传输下的VANET路由协议研究

针对当前高速公路信息预警的需求及传统信息传输路由协议存在的传输时延大、网络性能差等问题,提出一种基于实时丢包率估计与最短时延优先的车联网(Vehicular Ad Hoc Network,VANET)路由协议。提出实时丢包率估计算法,从而提高网络传输的准确率;在方向性广播转发路由技术的基础上,从后方行驶的车辆中选择传输时延为最小的节点作为网络信息传输的转播节点,从而协议在保证危险区域内都能够接收到预警信息的前提下减少节点转播的数量。通过NS-3仿真结果表明,该算法可降低传输时延,并提高信息传输的准确率。     

基于门控制的星载时间敏感网络调度算法

空间信息网络中时间敏感业务的实时性、确定性和可靠性要求对基于存储转发方式的传统以太网交换提出巨大挑战。提出一种基于门控制的星载时间敏感网络调度算法,设计星载时间敏感网络交换方案;针对卫星业务突发的特点,提出一种基于时分复用的门控制列表生成方法,对该调度算法在不同业务流量特征背景下的确定性时延及时延抖动性能进行仿真分析。仿真结果表明,所提算法的最小时延减小至10 μs量级,最小时延抖动为0,满足空间时间时敏业务的确定性传输要求,提高了空间信息网络业务传输的确定性、可靠性、灵活性。     

基于OFDM认知无线电网络的最优路径算法

针对基于正交频分复用的分布式认知无线电网络,在考虑频谱移动特性的同时,为保证认知用户数据传输的可靠性,提出一种最优路径的基于OFDM认知无线电网络路由算法.该算法首先通过建立认知无线电网络的模型计算信道的期望传输时间和信道干扰,结合类似于按需路由的基本流程得到所有可能的路径.最后,根据最小累积期望传输时间和路径平均吞吐量的指标来选择最优路径.仿真的结果表明,OROCR算法可以明显地减少平均端到端时延,大大地提高平均端到端吞吐量.     

Ad hoc网络中一种新的路由选择算法

提出了一种基于平均分组时延与分组能量消耗乘积最小的路由路径选择算法。该算法根据路径的平均分组时延和分组能量消耗情况来进行路由路径选择。仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。     

A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time

Shared segment protection (SSP), compared with shared path protection (SPP), and shared link protection (SLP), provides an optimal protection configuration due to the ability of maximizing spare capacity sharing, and reducing the restoration time in cases of a single link failure. This paper provides a thorough study on SSP under the GMPLS-based recovery framework, where an effective survivable routing algorithm for SSP is proposed. The tradeoff between the price (i.e., cost representing the amount of resources, and the blocking probability), and the restoration time is extensively studied by simulations on three networks with highly dynamic traffic. We demonstrate that the proposed survivable routing algorithm can be a powerful solution for meeting stringent delay upper bounds for achieving high restorability of transport services. This can significantly improve the network reliability, and enable more advanced, mission critical services in the networks. The comparison among the three protection types further verifies that the proposed scheme can yield significant advantages over shared path protection, and shared link protection.     

基于量子通信的电力业务调度算法

量子通信能够有效提高电力业务传输的可靠性与安全性,但由于量子密钥成码率低,难以满足重要电力业务的加密需求,因此,需要一种队列调度算法对量子通信中的待加密电力业务进行合理调度。提出了一种改进的加权公平队列（weighted fair queuing,WFQ）算法LD-WFQ,算法通过估计待加密数据分组的预计耗时,优先处理即将超时的待加密数据分组,在保持高优先级业务量子加密时延达标率的基础上,有效降低了低优先级业务的量子加密超时率。与WFQ算法进行仿真对比,结果证明了LD-WFQ算法的优越性。     

A path selection based routing protocol for urban vehicular ad hoc network (UVAN) environment

Routing in urban environment is a challenging task due to high mobility of vehicles in the network. Many existing routing protocols only consider density, link connectivity, delay, and shortest path information to send the data to the destination. In this paper, a routing protocol is proposed which uses the urban road network information such as multi-lane and flyover to send the data to the destination with a minimum packet forwarding delay. The next path for data forwarding is selected based on a path value calculated by the Road Side Unit for each path connected to a junction. This protocol uses Ground Vehicle to Ground Vehicle (GV2GV) communication, Flyover Vehicle to Flyover Vehicle (FV2FV) communication, and Flyover Vehicle to Ground Vehicle/Ground Vehicle to Flyover Vehicle (FV2GV/GV2FV) communication to enhance the routing performance. Simulation results show that proposed protocol performs better than P-GEDIR, GyTAR, A-STAR, and GSR routing protocols in terms of end-to-end delay, number of network gaps, and number of hops.     

层次分析法在ZigBee网络语音通信中的应用研究

在自组织网络语音通信中,针对音频传输中存在的延时、丢包等主要问题,在ZigBee网络路由的基础上建立层次分析法评价模型,设计了一种音频传输路由算法AHP-RP。通过分析路径链路质量、音频负载值、路径存活时间和路径长度等因素对音频质量的影响,构建以网络的4个因素为因子的比较矩阵,选择最优传输路径。仿真及实际通信平台验证表明,该算法能有效地适应网络状态,明显改善了语音通话质量。     

基于图卷积神经网络的软件定义电力通信网络路由控制策略

传输时延和数据包丢失率是电力通信业务可靠传输重点关注的问题,该文提出一种面向软件定义电力通信网络的最小路径选择度路由控制策略。结合电力通信网络软件定义网络(SDN)集中控制架构的特点,利用图卷积神经网络构建的链路带宽占用率预测模型(LBOP-GCN)分析下一时刻路径带宽占用率。通过三角模算子(TMO)融合路径的传输时延、当前时刻的路径带宽占用率和下一时刻的路径带宽占用率,计算出从源节点到目的节点间不同传输路径的选择度(Q),然后将Q值最小的路径作为SDN控制器下发的流表项。实验结果表明,该文所提出的路由控制策略能有效减小业务传输时延和数据包丢失率。     

面向确定性网络的按需智能路由技术

确定性网络需要保证不同应用在时延、丢包率、抖动、吞吐量和可靠性等方面的确定性传输需求。针对应用的差异化、确定性的网络传输需求,提出了一种面向确定性网络的按需智能路由学习框架 OdR,在OdR框架下提出一种基于深度强化学习的按需智能路由算法OdR-TD3,OdR-TD3算法可以根据应用流量的确定性QoS需求生成路由策略,以满足确定性网络应用的需求。通过网络仿真实验评估,在确定性应用的QoS需求达成率上,OdR-TD3算法相较DV算法和SPF算法,具有显著的优势。     

LEO multi-service routing algorithm based on multi-objective decision making

In low earth orbit(LEO) satellite networks,in view of the unbalanced link resource,it's difficult to meet differentiated quality of service(QoS) requirements and easily lead to reduce the efficiency of the whole network.A routing algorithm based on multi-objective decision making was proposed which defined LEO satellite network transmission service as the delay sensitive,sensitive bandwidth and reliability sensitive three categories.It used the eigenvector method to calculate service weights,and used the consistency ratio to determine whether it can be accepted.Based on the multi-objective decision making theory,it combined with the actual state of satellite network nodes and links and the specific requirements of the business,calculating the path that meets the QoS requirements of the service,so as to realize the LEO satellite network multi objective dynamic routing optimization.Established simulation platform based on the iridium network system simulated network delay,the uncertain characteristics like the residual bandwidth and packet error rate,route planning for the randomly generated three classes of business.The simulation results show that,the algorithm not only satisfies the QoS constrain while balancing the traffic load of the satellite link effectively,but also improves the performance on the throughput.     

Load balancing routing with queue overflow prediction for WSNs

The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

     

Minimum delay algorithm based on time aggregated graph in DTN network

The DTN network has the characteristics of dynamic topology change,thus the routing algorithm of static network can not solve the routing problem of time-varying network,and can not support fast transmission of given tasks.The existing time-variant routing algorithm CGR (contact graph routing) uses the earliest contact to obtain the shortest path,but because of the influence of the order of the connectivity period,the CGR algorithm has low link utilization.To solve this problem,the method of finding the shortest path was proposed.Besides,in order to characterize the relation between the different connect periods of the same link,the time series of node cache was added to the time aggregated graph.Based on this,the end-to-end multi-path shortest delay routing algorithm for the known task requirements was proposed.Finally,the feasibility of the algorithm was proved by an example.