软件定义WSN规则一致更新研究

遵循控制转发分离思想,软件定义无线传感器网络（Wireless Sensor Network,WSN）数据转发采用基于流的实现方式.因此,软件定义WSN规则更新过程中节点行为可能违背网络属性一致性.针对此,提出每包前向一致性概念,并证明其可保持所有网络属性的更新一致性.在此基础上,通过引入缓存节点与缓存规则简化规则依赖关系,提出一种规则前向一致更新算法,在满足每包前向一致性的同时,支持规则快速并行更新.实验结果表明,算法在规则开销、更新时间和通信开销等关键性能指标上具有较为明显的优势.     

一种基于分段路由的多路径流传输机制

针对传统网络多路径流量调度时存在的负载均衡效能差、路径部署困难的问题，利用软件定义网络的集中控制优势，设计了一种基于分段路由的多路径流传输（Segment Routing based Multipath Flow Transmission，SRMFT）机制.首先，以实现数据流的协同最优调度为目标，建立了SRMFT最优化模型；其次，采用分段路由技术和最简段标识序列（Segment IDentify sequence，SIDs）生成算法将多路径流调度问题转化为最简SIDs的选择问题，并设计了流调度算法求解；最后，试验结果表明，同等网络流量模型下，与较典型的多路径流传输机制相比，SRMFT有效提高了网络的对分带宽，降低了短流的传输时延，同时具有较低的流表存储开销.     

低轨卫星网络的航点分段路由及业务性能分析

提出一种基于卫星航点的分段路由（waypoint-segmentrouting,WSR）算法，WSR算法以可预测的卫星网络拓扑运动周期为基础，根据卫星节点链路状态确定卫星航点的位置；利用分段路由灵活规划分组传输路径的机制，提前响应网络拓扑变化，计算得到一条不受网络拓扑快照切换影响的传输路径。基于NS-3仿真平台进行仿真实验，设置源节点与目标节点在反向缝同侧与不同侧两种场景，选取优化链路状态路由（optimized link state routing,OLSR）算法和最短路径算法与WSR进行时延抖动与分组丢失率的对比分析。实验证明WSR与OLSR相比，两种场景下最大时延抖动分别降低46 ms与126 ms，分组丢失率分别降低30%和21%，并且能够解决拓扑快照切换导致分组传输路径中断的问题。     

SR软件路由器的设计与实现

分段路由(segment routing,SR)是近几年IETF提出的一种路由机制,其目的是使IP/MPLS网络面向服务并且更高效.SR减少现有MPLS网络控制平面复杂的协议(LDP/RSVP-TE),并实现流量工程等机制.与基于RSVP的显式路径中隧道中间节点维护报文流的状态不同,基于SR的显式路径只在入口边界路由器中维护报文流的状态,从而提高了网络的可扩展性,因此SR对于下一代互联网具有重要的研究意义.对SR的实现机制进行了研究,利用软件路由平台Click,对基于PCE架构的SR控制平面子系统和基于MPLS的SR数据平面子系统的各个模块进行实现,并在实际中进行部署,以验证SR软件路由器的可行性.     

多并发流无线网状网中的机会路由算法

现有机会路由选择未考虑数据流的分布,可能使候选节点空闲或过载,导致网络吞吐量提升有限.本文将多并发流的机会路由描述成一个凸优化问题,基于对偶和子梯度方法,提出分布式联合候选节点选择和速率分配的多流机会路由算法(Opportunistic Routing for Multi-Flow,ORMF).该算法迭代进行流速率分配,并在速率分配过程中完成候选节点选择.实验结果表明,与基于期望传输次数和期望任意传输次数指标的机会路由相比,ORMF平均可提高33.4%和27.9%的汇聚吞吐量.     

基于移动IPv6的平滑切换算法研究

切换时延和数据包丢失一直是制约移动IPv6发展的关键因素.文章针对现有切换算法及存在的问题进行了分析,然后在现有算法的基础上提出了一种改进算法.仿真实验结果表明,该算法能有效地抑制因移动节点的网络切换而导致的通信节点拥塞控制机制的启动,提高了移动网络数据流的正确率和吞吐量,进而提高了移动网络的通信质量.     

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

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

一种机会网络中节点转发策略的改进

在分析现有机会网络转发策略及机会网络中节点的运动特性的基础上,通过改进节点的转发策略提出一种新的机会网络路由算法(Delayed Spray and Wait,DSW).算法假设的应用场景为节点均沿着预先存在的路径移动,通过延迟发送转发数据包,可以显著减少网络中的低效数据包转发的数量.仿真结果表明,在合适的应用场景下该算法可以显著的降低网络中数据包的转发数量并略微提高传输成功率,这对于减少节点能耗和改善网络拥塞状况都具有实际意义.     

基于动态分段网络编码的DTN高效路由算法

针对DTN现有的动态分段网络编码(Dynamic Segmented Network Coding,DSNC)路由算法在编码包头部存在冗余字段、ACK反馈阶段存在冗余开销和节点因无序转发编码包而影响数据包端到端时延等问题,提出基于动态分段网络编码的DTN高效路由算法—ERBNC(Efficient Routing Based on dynamic segmented Network Coding).该算法通过采取压缩编码包头部字段、删除冗余的ACK分组、设置编码包的发送优先级等措施以减少网络开销和数据包平均端到端时延.仿真结果表明,与DSNC算法相比,ERBNC算法在网络开销和端到端时延方面的性能均得到改善.     

MANET中一种具有能量意识的无信标地理路由算法

 地理路由具有有效的传输性能和良好的可扩展能力,是当前移动Ad Hoc网络路由算法中的一个研究热点. 在许多实际场合下,网络中的节点能量有限并且难以补充,所以合理调整节点之间的能量消耗成为提高网络寿命的一种重要手段. 本文针对贪婪转发和空洞解决方案中存在的节点能量消耗不平衡的问题,提出了一种具有能量意识的无信标地理路由算法EBGR (Energy-Aware and Beaconless Geographic Routing). 该算法包括两个模式：贪婪竞争策略和空洞解决策略. 在贪婪竞争策略中,源节点或中继节点（即上游节点）广播数据包,位于数据包转发域内具有最小动态转发延迟的节点（即下游节点）转发数据包,其余候选节点侦听到该广播包后,自动放弃转发该数据包. 当遇到节点空洞时,将角度和能量信息同时加入到转发节点的动态延迟计算中,从而在数据包转发过程中有效地避绕空洞和平衡节点间的能量消耗. 仿真结果表明,与已有的BLR和GEAR等典型地理路由算法相比,平均投递率提高2%到4%;平均网络寿命提高了10%到20%.     

An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments

This paper presents a new solution to the dynamic all‐pairs shortest‐path routing problem using a fast‐converging pursuit automata learning approach. The particular instance of the problem that we have investigated concerns finding the all‐pairs shortest paths in a stochastic graph, where there are continuous probabilistically based updates in edge‐weights. We present the details of the algorithm with an illustrative example. The algorithm can be used to find the all‐pairs shortest paths for the ‘statistical’ average graph, and the solution converges irrespective of whether there are new changes in edge‐weights or not. On the other hand, the existing popular algorithms will fail to exhibit such a behavior and would recalculate the affected all‐pairs shortest paths after each edge‐weight update. There are two important contributions of the proposed algorithm. The first contribution is that not all the edges in a stochastic graph are probed and, even if they are, they are not all probed equally often. Indeed, the algorithm attempts to almost always probe only those edges that will be included in the final list involving all pairs of nodes in the graph, while probing the other edges minimally. This increases the performance of the proposed algorithm. The second contribution is designing a data structure, the elements of which represent the probability that a particular edge in the graph lies in the shortest path between a pair of nodes in the graph. All the algorithms were tested in environments where edge‐weights change stochastically, and where the graph topologies undergo multiple simultaneous edge‐weight updates. Its superiority in terms of the average number of processed nodes, scanned edges and the time per update operation, when compared with the existing algorithms, was experimentally established. Copyright © 2008 John Wiley & Sons, Ltd.     

A Failsafe Distributed Routing Protocol

An algorithm for constructing and adaptively maintaining routing tables in communication networks is presented. The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe. The latter means that after arbitrary failures and additions, the network recovers in finite time in the sense of providing routing paths between all physically connected nodes. For each destination, the routes are independently updated by an update cycle triggered by the destination.     

A localized adaptive proportioning approach to QoS routing

In QoS routing, paths for flows are selected based on knowledge of resource availability at network nodes and the QoS requirements of flows. Several QoS routing schemes have been proposed that differ in the way they gather information about the network state and select paths based on this information. We broadly categorize these schemes into best path routing and proportional routing. The best path routing schemes gather global network state information and always select the best path for an incoming I-low,based on this global view. It has been shown that best path routing schemes require frequent exchange of network state, imposing both communication overhead on the network and processing overheads on the core routers. On the other hand, proportional routing schemes proportion incoming flows among a set of candidate paths. We have shown that it is possible to compute near-optimal proportions using only locally collected information. Furthermore, a few good candidate paths can be selected using infrequently exchanged global information and thus with minimal communication overhead. We describe these schemes in detail and demonstrate that proportional routing schemes can achieve higher throughput with lower overhead than best path routing schemes     

Toward path reliability by using adaptive multi-path routing mechanism for multimedia service in mobile Ad-hoc network

Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths.However,under some circumstances if multiple paths cannot be established based on the current network topology,the traditional multi-path routing mechanism will degenerate into single path routing mechanism,thus the advantages of multi-path routing cannot be exhibited.To enhance the end-to-end path reliability,an adaptive multi-path routing mechanism with path segment is proposed,in which multi-path can be establ...     

Online energy aware routing in wireless networks

Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flows. To maximize network lifetime, the paths for message flows are chosen in such a way that the total energy consumed along the path is minimized while avoiding energy depleted nodes. Finding paths which consume minimum energy and finding paths which do not use energy depleted nodes lead to conflicting objectives. In this paper, we propose two-phased energy aware routing strategies that balance these two conflicting objectives by transforming the routing problem into a multi-metric widest path problem. We find that the proposed approaches outperform the best-known algorithms in the literature. We also demonstrate a simple but insightful relationship between the total energy required along a path and the minimum remaining energy of a node along the path. We further exploit this relationship to show that staying within the solution space of paths with high residual energy and low total energy provides much improved lifetimes in general.     

Heuristics for Diverse Routing in Wavelength-Routed Networks with Shared Risk Link Groups

In this paper, we consider path protection in wavelength-routed networks with shared risk link groups (SRLGs). Specifically, we study diverse routing, where two paths without sharing any SRLG have to be found between each pair of source–destination nodes, and its applications in dynamic shared protection as well. For the NP-complete diverse routing problem, a heuristic method is proposed, which steadily outperforms an existing algorithm within the first few iterations. When more iterations of calculations are allowed, we demonstrate that the two different algorithms perform nearly the same. This interesting observation helps to achieve some insight into how to further improve the performance of the heuristics in the future.     

Hop count based optimization of Bluetooth scatternets

In the past five years Bluetooth scatternets were one of the most promising wireless networking technologies for ad hoc networking. In such networks, mobility together with the fact that wireless network nodes may change their communication peers in time, generate permanently changing traffic flows. Thus, forming an optimal scatternet for a given traffic pattern may be not enough, rather a scatternet that best supports traffic flows as they vary in time is required.In this paper we study the optimization of scatternets through the reduction of communication path lengths. After demonstrating analytically that there is a strong relationship between the communication path length on one hand and throughput and power consumption on the other hand, we propose a novel heuristic algorithm suite capable of dynamically adapting the network topology to the existing traffic connections between the scatternet nodes. The periodic adaptation of the scatternet topology to the traffic connections enables the routing algorithms to identify shorter paths between communicating network nodes, thus allowing for more efficient communications. We evaluate our approach through simulations, in the presence of dynamic traffic flows and mobility.     

Detection of Wormhole Attack and Secure Path Selection in Wireless Sensor Network

In Wireless Sensor Network (WSN), securable data transmission is one of the most challenges. During the transmission between the source and a destination node, routing information of the particular path may be misbehaved by the particular nodes which are known as wormhole nodes/attackers. The paths which include the wormhole nodes are known as wormhole attacked paths. For improving security in WSN, these wormhole attacked paths should be identified. To achieve this, wormhole attack detection method and optimal or secure path selection are presented in this paper. Initially, ‘K’ paths or multiple paths are generated between source and destination using Ad-hoc On demand Multipath Distance Vector (AOMDV) routing protocol. Then, the source node identifies the wormhole attacked path by verifying the Detection Packet (DP) and Feedback Packet (FP) from the destination. After detecting the wormhole attacked paths, the source node selects the optimal path among the attacker free paths using Particle Swarm Optimization (PSO) algorithm. Simulation results show that the performance of the proposed approach improves energy efficiency and network lifetime of the network.

     

Oblivious Routing in Fat-Tree Based System Area Networks With Uncertain Traffic Demands

We study oblivious routing in fat-tree-based system area networks with deterministic routing under the assumption that the traffic demand is uncertain. The performance of a routing algorithm under uncertain traffic demands is characterized by the oblivious performance ratio that bounds the relative performance of the routing algorithm with respect to the optimal algorithm for any given traffic demand. We consider both single-path routing, where only one path is used to carry the traffic between each source-destination pair, and multipath routing, where multiple paths are allowed. For single-path routing, we derive lower bounds of the oblivious performance ratio for different fat-trees and develop routing schemes that achieve the optimal oblivious performance ratios for commonly used topologies. Our evaluation results indicate that the proposed oblivious routing schemes not only provide the optimal worst-case performance guarantees but also outperform existing schemes in average cases. For multipath routing, we show that it is possible to obtain an optimal scheme for all traffic demands (an oblivious performance ratio of 1). These results quantitatively demonstrate the performance difference between single-path routing and multipath routing in fat-trees.