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

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

基于Q-learning算法的无人机自组网AODV稳定路由改进方法

针对小型无人机集群组网中节点高速移动、网络拓扑变化剧烈导致的网络性能下降问题,在无线自组网按需平面距离向量（AODV）协议基础上,提出一种具有链路稳定度意识的无人机自组网路由协议（LN-AODV）。首先,通过加权计算链路维持时间和邻居节点变化度,从而选择稳定路径,解决拓扑结构动态变化条件下数据传输延迟和数据成功投递率下降的难题;然后,结合Q-learning算法自适应调整Hello消息的发送周期,使协议能够通过感知拓扑变化程度调整路由控制开销和拓扑感知灵敏度。仿真结果表明,相比于AODV,所提方法在端到端延迟、分组投递率、路由开销和数据吞吐量4个网络性能指标上分别提升7.56%,2.58%,17.39%,2.62%,可适应于节点高速运动的无人机自组网,对于无线自组网理论研究及拓展应用具有重要的借鉴意义。     

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

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

基于SDN的工业无线网络能量高效型路由算法

在智能制造背景下,为了提高无线网络的灵活性和能量使用效率,提出基于软件定义网络(SDN)的工业无线网络能量高效路由算法(SDERA)。基于SDN数据平面和控制平面分离的思想,构建了新型的工业无线网络模型,控制器根据应用需求、节点的剩余能量和负载等因素,计算全局最优路由策略并分发给交换节点,交换节点按照控制器的决策在不同的逻辑子网中转发数据包。当节点和链路质量信息以及应用需求发生变化时,控制器可以动态地调整路由策略,提高能量使用效率和网络性能。仿真实验结果表明,该路由算法有效地延长了网络的生存时间,提高了网络的能量使用效率。     

移动自组网OLSR路由协议研究

移动自组织网络具有移动、多跳和无中心等特点,可以快速灵活的组建网络,广泛应用在抗灾抢险、作战系统、科考探险等场景。使用MATLAB仿真软件,对最优链路状态路由协议进行仿真分析。实验结果表明,随着节点数目显著增加,OLSR协议路由的传输时间依然较短、传输跳数较少。因此,在规模较大、节点密集的移动自组网络中,使用OLSR协议能缩短的数据传输时间。     

基于异构无线网络的多路径传输

针对异构无线网络环境中,大容量业务传输质量不可靠、网络资源利用率低的问题,提出了一种基于异构无线自组织网络的多路径传输路由算法。该算法有效避免了单路通信方式下的传输链路拥塞、吞吐量低等问题,并结合大容量业务的特点,通过一定的法则合理表征网络环境信息,依据表征结果提出发端到终端的多路径策略,使得重要性不同的业务可选择相应链路质量的路径进行并行传输,避免了网络中的每个自组网节点独立寻找路由导致的源节点难以获得中间节点路由信息的现象。仿真结果表明,该算法可实现整个网络负载均衡,缓解网络链路拥塞,有效降低传输中的丢包率,降低传输时延。     

基于SDN思想的电台网络抗毁重组技术研究

针对山区复杂环境下电台网络抗毁重组困难的问题,基于软件定义网络（Software-Defined Networking,SDN）思想,利用信令与业务信道分离、业务信道通信参数可依托信令信道远程配置的方式,实现受控的业务网络自组织组网;利用网络管理系统和信令信道构建电台业务网络重构逻辑集中控制中心,对业务网络运行状态进行统一筹划和控制;通过基于故障发现的通信网络动态调整机制,解决当前电台固定主从组网模式抗毁顽存能力弱,遇毁后网络无法重新开通,分布式无中心自组网模式需要节点间频繁交互信令,网络开销大以至于无法满足山区复杂环境下电台的高效、可靠通信的问题。     

一种空基自组网路由协议的研究

针对传统Ad Hoc路由协议无法满足空基自组网在高动态拓扑下成功投递、路由开销和低延迟的要求,研究了一种利用空基平台已规划的航线信息来提高网络路由性能的路由协议.该路由协议由已知移动信息路由协议（MARP,mobility aware route protocol）和移动信息洪泛协议（MDP,mobility dissemination protocol）组成.MARP利用规划的航线信息预测网络拓扑并计算路由,MDP采用洪泛方式通知网络中所有节点实际拓扑和预测拓扑的差异信息.设计该协议的数据结构、链路预测机制、实际链路探测机制、多余广播减少机制.通过QualNet仿真验证,结果表明,MARP/MDP在平均报文传输延迟、报文成功投递率及路由开销方面比AODV和OLSR协议具有更优越的性能.     

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

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

从云网融合到ICT基础设施

<正>1电信网络重构和云网融合电信网络重构的理论基础是SDN/NFV,SDN和NFV结合构成一种新型的组网技术。技术要点为:1)采用SDN技术,将原来由网络控制面通过动态路由技术产出的节点路由转发表,由称为"控制器"的设备,根据确定的算法计算出来的节点路由转发表,通过管理面下发给节点设备,由节点执行数据转发;另外,将原来由网管提供的功能,改在"控制器"实现,由于目前"控制器"的算力远超原来网管设备具有的算力,因而     

Routing framework and creation algorithm in Ad Hoc based SDN

Node energy-limited and mobility,indeed,requirement of customized service,made Ad Hoc press for customization Routing.Based on the core principle of software defined networking (SDN),the control framework and the design of routing creation bran-new approach about Ad Hoc based SDN was analyzed firstly.Secondly,the hierarchical routing model was established,and the problem of routing key nodes and key link centralized selection based on service path was proposed and its algorithm was designed,which could embed customize service into physical networks via nodes mapping based network performance maximization.Finally,it corroborate the advantage of routing implement via SDN in function,performance and the whole networks utilization.Experiments show that the energy consumption of network nodes is more balanced and the overall utilization of the network is nearly 14% higher than the traditional method.     

基于IEEE802.11 DCF的链路预先修复AODV路由协议

基于无线自组织网络中普遍使用的底层通信协议IEEE802.11 DCF,针对广泛应用于无线自组织网络中的路由协议(AODV),提出了一种链路预先修复算法。该算法首先推算了DCF协议中的不稳定传输范围,然后通过MAC层与路由层的跨层协作,在下一跳节点移动在不稳定传输范围时就事先采取相应的路由修复措施。相对于AODV中采用节点周期性地发送HELLO消息来监测邻居节点变化的方法,该算法更为高效及时。仿真结果表明,该算法能够有效的减小端到端时延,保障了投递率。     

AODV、AOMDV和AODV-UU路由协议性能仿真与分析

使用NS-2(Network Simulator Version 2)仿真软件,选取分组投递率、端到端平均时延、归一化路由开销和路由发现频率4个指标对按需距离矢量路由(AODV,Ad hoc On-Demand Distance Vector Routing)、多径按需距离矢量路由(AOMDV,Ad Hoc On-Demand Multipath Distance Vector Routing)和乌普萨拉大学开发的按需距离矢量路由(AODV-UU,Ad Hoc On-Demand Distance Vector Routing developed by Uppsala University)进行了性能仿真,通过改变节点最大运动速度和业务源连接对数分析比较这些参数对3个协议性能的影响,研究结果表明了AODV-UU协议的优越性。并提出了对AODV-UU协议的改进。     

一种适合于移动Ad Hoc网络的路由协议WPRP

针对无线Ad Hoc网络特点,提出了一种无线路径发现路由协议(Wireless Path Finding Routing Protocol,WPRP)。对WPRP协议进行了简要概述,分别介绍了采用最短路径算法(Short Path Algorithm,SPA)查找最短路径;递归环路检测算法(Recursive Loop Check Algorithm,RLCA)消除路由环路;路由校验实现节点间路由同步;自适应时间调节机制进一步减少网络冲突、降低网络开销等方法以及实现过程。OPNET仿真结果表明,与OLSR协议相比,WPRP具有较小的路由开销和较快的收敛速度,是一种动态路由协议,适用于无线Ad Hoc网络。     

Minimum energy hierarchical dynamic source routing for Mobile Ad Hoc Networks

In this paper, Minimum Energy Dynamic Source Routing (MEDSR) and Hierarchical Minimum Energy Dynamic Source Routing (HMEDSR) protocols for Mobile Ad Hoc Networks (MANET) are proposed. The objective of MEDSR protocol is to reduce energy consumption in MANET while maintaining connectivity in the network. The objective of HMEDSR is to reduce the overhead of MEDSR. The overall result is that energy spent in transmitting overhead packets is reduced. This reduction allows more energy in transmitting data packets. The Dynamic Source Routing (DSR) protocol is modified to implement both MEDSR and HMEDSR protocols, and these implementations are tested with a network simulator (Network Simulator (NS-2)). The simulation results show that both MEDSR and HMEDSR protocols reduce energy consumption per data packet by 25% compared to DSR, but HMESDR further reduces energy consumption by 12% compared to MEDSR by controlling overhead packets.     

A Safe Proactive Routing Protocol SDSDV for Ad Hoc Network

In mobile Ad Hoc network, nodes move freely, this can lead to frequent changes of network topology. Routing protocol algorithm is the strategy to establish communication links for network nodes, and its performance influences the availability of Ad Hoc network directly. By using wireless channel to transmit data in Ad Hoc network, the invaded malicious nodes will cause various attacks, aim to steal the transmission data or destroy the network. Based on the traditional proactive routing protocol for Ad Hoc network, an improved safe routing strategy SDSDV is put forward to resist attacks against routing protocols. The safe proactive routing protocol includes route request and route response two stages. When the network initialization is complete, after successful identity authentication by each other, secure communication paths are established between nodes and the encrypted data will be transmission through the path. The protocol integrates distributed authentication, encryption algorithm, hash check, and other security policy together. SDSDV protocol reduces the risk of malicious manipulation of routing information and ensures the safe and reliable routing between the source and destination nodes.     

Geographical awareness hybrid routing protocol in Mobile Ad Hoc Networks

This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.     

一种基于AODV路由协议的分簇算法研究

基于距离向量的按需路由协议AODV是AdHoc网络研究的热点之一。该协议有效减少了建立和维护路由所需要的开支,但是随着网络节点发送数据量的增加,网络性能会迅速下降。为了提高AdHoc网络的路由效率和可靠性,文章提出了一种基于AODV路由协议的分簇算法。经仿真研究分析表明,该算法提高了网络节点的平均每跳吞吐率,减少了节点的平均每跳时延。     

A Scalable-Adaptive Snack Routing Strategy (SRS) for Semi-Administrated Mobile Ad Hoc Networks (SAMANETs)

Recently, Mobile Ad Hoc networks (MANETs) are growing in popularity and importance. They present a possible communication among a set of mobile nodes with no need for either a pre-established infrastructure or a central administration. However, in order to guarantee an efficient communication among network nodes, efficient routing algorithms should be established. Routing plays the central role in providing ubiquitous network communications services in such dynamic networks. The problem is further aggravated through the node mobility as any node may move at any time without notice. Several routing protocols had been proposed; however, most of them suffer from control packet flooding, which results in a scalability problem. In this paper, a new routing strategy for MANETs is proposed which is called Snack Routing Strategy (SRS). The basic idea of SRS is to continuously inform the network mobile nodes with any changes in the network topology without overloading the network by a huge amount of control messages. SRS is a hybrid routing strategy that relies on Learning by accumulation, hence, new routes can be discovered by learning the accumulative data stored in the nodes routing tables by several foraging artificial snacks. SRS uses no periodic routing advertisement messages but uses artificial snacks instead, thereby reducing the network bandwidth overhead and minimizing end-to-end transmission delay. SRS has been compared against two well known protocols AODV and DSR. Experimental results have shown that SRS outperforms both AODV and DSR as it introduces the minimal routing overheads.     

Channel Adaptive Shortest Path Routing for Ad Hoc Networks

1　IntroductionAdhocnetworksareformedwithoutrequiringthepreexistinginfrastructureorcentralizedadminis tration ,incontrasttocellularnetworks.Asidefromtheoriginalmilitaryapplication ,ithasapplicationinpublicsafetyandcommercialareas,butadaptiveprotocolsarerequiredinorderforthemtodoso .Twoimportantcharacteristicsofacommunicationlinkinadhocnetworksareitsunreliabilityanditsvariability .Thelinksinsuchanetworkareunreli ablebecauseoffading ,interference,noise,andper hapsthefailureofthetransmittingorrec…