动态TDMA时隙分配算法在数据链中的仿真

固定TDMA分配算法能够保证节点数据发送的公平性,但不可能针对当前业务和网络状态进行时隙预留分配,很难实现差别服务和提供支持QoS（服务质量）的机制。因此提出一种适用于TTNT（战术瞄准网络技术）数据链通信系统的动态TDMA时隙分配算法,在高负载的网络环境下,这种算法加入了优先级机制并根据业务量轻重对各节点采取不同的发送策略,对时隙有较高利用率,提高了Ad Hoc（自组织网）网络系统吞吐量。在OPNET网络仿真平台上进行了仿真验证,仿真结果表明该算法在吞吐量和时延方面都优于固定TDMA算法。     

基于非齐次泊松过程的深空骨干节点流量分析

在深空探测及通信中,由于通信距离及复杂深空环境的影响,使得通信难度较大,通信质量难以得到保证,组建深空通信网络是解决相关问题的有效途径。而深空骨干网作为深空通信网络的重要组成部分,其组成节点承担了较为繁重的数据转发服务请求,因此,对骨干网节点进行业务量分布分析是保证整个深空通信网络服务质量(QoS)及通信能力的前提。在假设服务请求到达率不为常数的情况下分析了深空骨干网节点的服务请求到达特点,得到了服务请求时间间隔低于限定时间的概率及某时间段内请求数量少于设定阈值的概率。为深空节点业务流量合理分配提供了一定依据,为深空通信数据路由选择提供了指导,即可避免节点拥塞,提升节点QoS提供能力,为深空通信网络路由及通信质量保证提供了较为直观的参考依据。     

MIMO链路Ad Hoc网络中线程化的拓扑未知多址接入协议

针对MIMO链路Ad Hoc网络,提出了支持MIMO的线程化拓扑未知多址接入协议(MIMO-T-TTMA).MIMO-T-TTMA将时间扩展多址接入(TSMA)协议和时分多址接入(TDMA)协议以时间交替的方式相结合,进而为网络中节点分配时隙.在MIMO-T-TTMA中,每个节点被分配了若干时隙,每个分配时隙中,节点通过交互请求发送/允许发送(RTS/CTS)分组来确定发送使用的数据流数,而当RTS/CTS交互失败或者当前时隙为未分配时隙时,节点仍依一定的概率发送一个数据流,以提高网络的吞吐量.为了评估协议的性能,推导了MIMO-T-TTMA的吞吐量.数值结果表明,与已有的协议相比,MIMO-T-TTMA在节点度较大时具有较高的吞吐量,并且,吞吐量随节点度的变化比较平稳,因此,MIMO-T-TTMA适用于拓扑常发生剧烈变化的Ad Hoc网络.     

无线传感器网络恶意节点溯源追踪方法研究

 传感器节点可能被攻击者俘获用来发送大量虚假数据,从而耗尽整个网络的资源.本文提出一种实用的溯源追踪解决方案:基于概率包标记算法,每个节点按照一定概率标记其转发的包,标记信息填写于包头中的确定域,通过收集到足够多的数据包,汇聚节点能够重建一条到源节点的路径.本文证明了此方案能够应对所有类型的攻击,并针对基本标记方法的不足提出了两种改进标记方法.实验结果表明该溯源追踪解决方案是高效以及实用的.     

节点容量限制对网络交通的影响

本文基于无标度网络模型，在静态局部路由策略的基础上，控制节点信息包排队长度，研究其对网络交通的传输影响。模拟发现：对网络节点容量进行合理范围的限制能够提高网络临界信息包产生率，缩短网络信息包传输时间。通过改变参数口值，得到网络临界信息包产生率以及网络信息包传输时间随参数卢变化曲线。结果表明：为了得到最佳网络临界信息包产生率，参数卢需在合适范围内取值；参数卢对网络信息包平均运输时间的影响主要原因在于参数卢对网络信息包等待时间的影响。     

BA网络中一种基于节点动态权值的局部路由策略

为适应大规模通信网络的路由需求,提出了一种基于BA网络的局部路由策略。基本思想是在数据包转发过程中,将邻居节点的度和发送能力以一定比例加和得到的值作为权值,根据权值大小选择下一站点。其中,节点的发送能力由节点的数据包队列长度,节点的度及一个调节系数组成,节点的发送能力可根据实时数据包产生率进行调节。仿真结果表明,该路由策略有较好的通讯能力,通过改变加权算法中的比例系数可以调节网络的临界负载量,达到该算法下的最优路由方法,使节点的处理能力得到合理利用,为实际大规模通讯网络中利用局部路由实现数据传输提供了有效可靠的方法。     

基于节点冗余容量动态控制的复杂网络鲁棒性研究

针对传统级联失效模型中冗余参数固定不变的问题,该文综合考虑节点受攻击程度不同和失效过程中网络拓扑的动态变化,建立了基于节点冗余容量动态控制(DRC)的级联失效模型.通过定义网络相变临界因子θ衡量节点失效引发级联失效的概率,分析了网络鲁棒性与θ之间的相关性,并结合度分布函数详细推导了θ的解析表达式,基于解析表达式提出了两种网络鲁棒性提升策略.仿真结果表明,在模型网络和真实网络中,根据被攻击节点度的不同,通过调整节点初始负载参数可以有效提高目标网络的鲁棒性;DRC模型下级联失效传播范围较τ Motter-Lai(ML)模型显著减小.     

基于模糊C均值的WSN路由协议

提出一种基于模糊C均值的分簇[1]算法。算法采用经典的模糊C均值聚类技术,对整个传感器区域进行划分;并根据每个节点属于该簇的隶属度来判定节点当选为簇头节点的概率,这样在簇边缘节点也就是隶属度低的节点当选簇头节点的概率就会较低,从而使整个网络能耗负载均衡。在簇的划分中,引入了最优簇头数的概念。该方法有效地解决了簇头分布不均带来的簇头之间距离过近、大片区域没有簇头以及边缘节点能量损失过快的问题。     

适用于ad hoc网络的DCF协议节点自适应休眠机制

针对现有的ad hoc网络节点休眠机制大多采用了周期唤醒,预约发送休眠策略的现状,首先详细分析了这种休眠策略存在的缺陷,然后在DCF协议的框架内提出了一种同时适用于单跳和多跳ad hoc网络的节点自适应休眠机制(NASM).该休眠机制不依赖于周期唤醒/预约发送的休眠策略,它允许节点根据各自的通信状况,自适应调整休眠时间的长度.仿真证明,NASM在有效节省节点能耗的同时并不会严重影响网络的其他性能指标.     

带有消息投递概率估计的机会网络自适应缓存管理策略

高效的缓存管理策略能够有效提高机会网络中节点的缓存资源利用率。消息的投递概率直接决定了消息的转发与存储必要性,该文提出一种带有消息投递概率估计的自适应缓存管理策略,通过构建节点连接状态分析模型,以分布式的方式感知节点服务能力,从而估计消息的投递概率,进而确定消息的转发与删除优先级,以执行缓存管理相关操作。结果表明,所提出的缓存管理策略可降低网络负载57%,并有效提高消息的成功投递率,降低消息的平均投递时延。     

LEO星座中基于不完全信息的路由联盟博弈策略

针对LEO卫星网络在多跳转发数据包时流量分布不均问题,提出了一种基于不完全信息的最优收益路由联盟博弈算法.各节点协同联盟邻居节点,共同确定数据报文当前最优转发路径,从而分配和平衡节点间流量负载.仿真结果表明,与最短路径卫星路由DSP或智能路由TLR相比,本文算法的平均数据传输延迟降低了18.5%,节点流量负载均衡度提高了65.6%.     

Multihop lightwave networks: a comparison of store-and-forward andhot-potato routing

The achievable aggregate capacity for a variant of the basic multihop approach in which minimum distance store-and-forward routing is replaced by a hot-potato routing algorithm is determined. With hot-potato routing, all packets simultaneously arriving at a given node and not intended for reception at that node are immediately placed onto the outbound links leaving that node; if two or more packets contend for the same outgoing link to achieve a minimum distance routing, then all but one will be misrouted to links which produce longer paths to the eventual destination. Attention is confined to the development of an analytical methodology for finding the probability distribution of the number of hops with hot potato routing for symmetric networks under uniform traffic load. Results show that the maximum throughput achievable with hot-potato routing can be as low as 25% of that for store-and-forward routing, and that the relative degradation increases as the number of nodes grows larger. This implies that the link speed up needed to produce a significant overall capacity advantage with hot potato should be at least a factor of 10     

On‐demand flow regulated routing for ad hoc wireless networks

In this paper, we present an on‐demand flow regulated routing algorithm (OFRA) for ad hoc wireless networks. The OFRA consists of two parts: an intermediate node load evaluation process and a routing path selection process. The intermediate node load evaluation process evaluates the load efficiency of the intermediate nodes according to bandwidth, data packets and computing capability. The routing path selection process selects the routing path with lower flow and fewer intermediate nodes. The OFRA can prevent intermediate nodes to be overcrowded and distribute traffic load over routing paths more evenly. The simulation result shows that the percentage of blocked routing paths is reduced and the total flow is more balanced and distributed. Copyright © 2006 John Wiley & Sons, Ltd.     

Oscillations in Complex Communication Networks under Attack

In this paper we study the traffic dynamics of a scale-free complex network under an intentional attack at the node with the largest betweenness (i.e., the hub). This node is removed from the network after the attack. Consequently, the traffic load which used to go through the hub has to find other paths. A weight is defined for each node to indicate how long a packet has to wait at this node. A shortest time delay routing strategy is then applied based on the weight. We find that with different values of the capacity redundancy parameter, the traffic dynamics are quite different. When the capacity has large redundancy, then all the nodes work in a free-flow state even after the attack. If the capacity redundancy is not that large, then congestion may occur at some nodes. Due to the shortest time delay routing strategy, this congestion occurs periodically. If the capacity is very small, then the traffic dynamics become complicated, and oscillations and chaotic phenomena take place.     

Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks

In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of packets served at a node, induced by straight line routing. For a given total offered load on the network, our analysis shows that the nodal load at each node is a function of the node's Voronoi cell, the node's location in the network, and the traffic pattern specified by the source and destination randomness and straight line routing. In the asymptotic regime, we show that each node's probability that the node serves a packet arriving to the network approaches the products of half the length of the Voronoi cell perimeter and the load density function that a packet goes through the node's location. The density function depends on the traffic pattern generation by straight line routing, and determines where the hot spot is created in the network. Hence, contrary to conventional wisdom, straight line routing can balance the load over the network, depending on the traffic patterns.     

SR架构下的软件定义信息中心网络概率路由策略

传统的TCP/IP路由以IP地址为中心,信息传输效率低下,难以满足网络用户需求.信息中心网络(Information-Centric Network,ICN)开始成为研究热点,ICN以内容为中心,可以高效传输信息.为了利用软件定义网络(Software Defined Network,SDN)和分段路由技术的优势,提高...     

Improved multipath routing with WNN for the open networks

Multipath routing mechanism is vital for reliable packet delivery, load balance, and flexibility in the open network because its topology is dynamic and the nodes have limited capability. This article proposes a new multipath switch approach based on traffic prediction according to some characteristics of open networks. We use wavelet neural network (WNN) to predict the node traffic because the method has not only good approximation property of wavelet, but also self-learning adaptive quality of neural network. When the traffic prediction indicates that the primary path is a failure, the alternate path will be occupied promptly according to the switch strategy, which can save time for the switch in advance. The simulation results show that the presented traffic prediction model has better prediction accuracy; and the approach based on the above model can balance network load, prolong network lifetime, and decrease the overall energy consumption of the network.     

基于共享路径和网络编码的光组播容量优化

为了降低光组播路由 的光域网络编码代价和提高达到理论最大光组播容量的 概率,提出一种基于共享链路和网络编 码的优化光组播容量方法。首先设计一种从多条源－ 宿最短路径中选择能达到最大光组播容量的最短路径簇,然后在 最短路径簇中计算路径的共享度,选择共享度高的组播路径传输网络编码信息,构造网络编 码次数最少的光组播编码子图, 解决传统的网络编码组 播路由和最大共享度链路组播路由中存在的网络编码次数过多和达到最大光组播容量概率过 低的问 题。仿真结果表明:本文提出的方法具有最低的网络编码代价,能以最大的概率达到光组播 理论最大容量。     

一种改进的链路容量优化路由策略

设计能够适应高移动环境下的空基自组网路由协议是目前研究的重点方向。提出了基于负载均衡的优化路由协议,该协议在获得位置信息的前提下,首先预测出通信链路的有效时间,然后在满足数据的时延、带宽以及链路有效性等多约束条件下,路由协议以均衡节点负载为优化目标,使得网络节点都能合理承担数据传输任务。仿真结果表明,设计的路由协议能够保证网络节点合理分担传输任务,充分利用链路资源,提高网络的吞吐量。     

A Class of Decentralized Routing Algorithms Using Relaxation

An important problem in packet-switched communication networks is the optimal assignment of routes to the message packets. An optimal routing assignment is one which chooses network paths for the packets in a way that minimizes some cost function, typically average message delay. A class of optimal routing algorithms is described which utilize a type of iterative computation known as relaxation. Computation is decentralized in the sense that each node computes its routing strategy using only information supplied from adjacent nodes. Being iterative, the algorithms are inherently adaptive. The routing computation is based conceptually on an electrical network analog for the optimization problem. We show that a simple, convergent relaxation procedure can be used to "solve" the analog network, thereby yielding the optimal routing strategy. A simple example is presented to illustrate the method. In general, the computational load compares favorably with other (centralized) methods, although further work is needed to obtain quantitive comparisons in specific cases.