基于网络编码的空间DTN中CGR改进算法

随着空间通信技术的发展,卫星节点的增多,以及容延迟容中断通信需求的不断提高,空间DTN (DelayTolerant Network,容延迟网络)环境中各通信节点间的路由技术日益重要,相继出现了多种适用于DTN的路由技术.基于空间DTN的结构与特点,对CGR(Contact Graph Routing,接触图路由)算法以及基于编码的路由算法进行了分析比较,然后针对空间DTN中CGR算法的缺点和不足,研究提出了基于NC(Network Coding,网络编码)的空间DTN中的CGR改进算法(NC-CGR),并通过仿真实验平台对算法性能进行了分析评估.仿真结果表明,相比于CGR算法,NC-CGR算法在链路传输时延、传输包裹数目、中继缓存大小、链路丢包率等不同条件下的适应性方面均表现出较大优势,更适用于具有复杂拓扑、带宽受限、高动态特性的空间DTN环境.     

LEACH协议的改进与仿真研究

无线传感器网络由能量受限的节点组成,高效节能的路由算法是路由设计的关键问题。在LEACH算法的基础上,提出了一种新的分簇式路由策略,从簇头个数的确定、簇头选举方法对LEACH算法进行了改进,数据传输方式允许采用多跳方式与基站节点通信,仿真结果表明该算法具有降低网络能耗、延长网络生命周期的优点。     

基于蚁群优化的能量均衡自适应路由算法

基于蚁群优化的WSNs路由算法具有蚁群优化自组织性、正反馈性和并行性的特点,在构造无线传感器网络中的最优路由时有很好的性能。但是蚁群优化构造最优解时带来的网络开销十分可观,不适合在路由维护阶段反复使用蚁群优化重构路由。考虑到蚁群优化的上述特点,同时针对无线传感器网络能量受限的特点,提出了一种基于蚁群优化的能量均衡白适应路由算法。该算法使用了新的信息素更新算子,算子中包含了网络能量水平因子,能够均衡网络能量消耗。在路由维护阶段,该算法使用了新的基于侦测蚂蚁的自适应路由维护机制,很好地降低了网络开销。     

天基网路由策略及算法研究概述

路由技术是天基综合信息网组网的核心技术之一。根据卫星链路长时延、高误码等特点,天基网络和地面网络的路由算法有很大不同。本文在常用地面网络路由算法的基础上,给出了国内外卫星网络路由策略及算法的研究现状,并介绍了卫星星座仿真软件和卫星网络协议仿真工具。     

无线传感器网络路由协议研究与分析

集成了传感器、嵌入式技术、分布式信息处理技术和无线通信技术而形成的无线传感器网络(wireless sensor network,简称WSN)是一种全新的信息获取和处理技术。但由于无线传感器网络的特点,使其路由协议即不同于传统的网络,又有别于ad hoc网络。对几种典型无线传感器网络路由协议进行了详细分析与比较,并针对LEACH算法存在的问题提出了一种改进方案。     

一种新的基于位置信息的路由算法研究

 为航空移动Ad hoc网络(MANET)提出一种基于位置信息的路由算法，即位置网格路由（LBGR）算法，以此来解决节点高速移动引起的路径重建问题。算法中，数据包沿路由发现时得到的网格轨迹进行传输，每个收到数据包的中转节点根据它与相邻节点、目的节点的位置关系及网络轨迹下游的路由网格位置决定下一跳节点。由于利用了网格位置信息，LBGR算法在航空节点高速移动和拓扑变化无法事先预测的情况下，使用较少的开销就可获得稳定的路由。仿真结果表明，与GRID路由算法相比，LBGR算法在节点中高速移动时，能够有效地减少路由开销，提高网络吞吐量。     

基于广播Banyan网的组播地址合并算法

讨论了基于广播Banyan网做为路由网的点到多点通信问题,即传输信元的二进制地址到三进制地址的合并算法,本算法提出了采用树结构存储二进制地址以及合并成三进制地址的一般方法。分析表明:此算法可以有效地减少网络内部占用的链路数,提高了使用网络资源的效率。     

机场特种车辆监控系统中低能耗路由的研究

针对原有ZigBee路由方法应用于机场特种车辆监控系统中节点能量消耗大的缺点，提出了基于ZigBee的低能耗路由算法——LEZR（low—energy ZigBee routing）。该算法通过让节点尽量处于休眠状态来节省能量，从而延长网络生命周期。仿真结果表明，基于此方法设计的系统网络较原路由方法在节能和延长网络生命周期方面都有显著提高。     

一种基于Multi Agent的无线传感器网络数据收集算法

提出了构造多Agent协作模型的方法,设计了基于多Agent的无线传感器网络的数据收集算法ARDG(activereliable data gathering algorithm),将多Agent的协作思想结合到数据路由的计算中,该算法在无线传感器网络资源限制,如在传感器存储空间和能量有限等条件下,提高了数据收集的主动性和可靠性,理论和仿真实验证明了该方法的可靠性与时效性。     

认知协作Ad Hoc网络中分布路由跨层控制策略

认知无线电Ad Hoc网络中,吞吐量最大化是一个关键的挑战.为了实现这一目标,协同传输是前景看好的技术,利用在每个空间节点的多样性中继链路以增加性能,特别是在无线环境中由于不同的信道质量、有限的能源和带宽资源,这种想法是有吸引力的.文章在分布式动态环境下,研究了联合动态路由.中继分配和频谱分配分布式和本地算法,提出了一...     

Research of multi-path routing based on network coding in space information networks

A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.     

Cooperative Routing for Maximizing Network Performance of Wireless Networks

To greatly increase spectral efficiency and improve network performance in wireless networks,a novel cooperative routing algorithm,namely maximum throughput cooperative routing(MTCR) algorithm,is proposed.According to cooperative link model,throughput analysis is presented to evaluate performance improvement in the process of exploiting cooperative commu-nication from physical layer to higher layer.Taking the throughput improvement as performance metric,a cooperative relay se-lection scheme is developed.Finally,based on the route constructed by adaptive forwarding cluster routing(AFCR) algorithm,each node on the route selects the optimum cooperative node from all the potential cooperative nodes to construct the coopera-tive link with maximum throughput so that cooperative route with maximum network throughput from source to destination can be set up.Simulation results show that compared with the noncooperative routing algorithm and minimum power selection de-code-and-forward(MPSDF) routing algorithm,the proposed algorithm can obviously improve network throughput in the pres-ence of low transmission power,large number of nodes and high spectral efficiency.     

ELGR: An Energy-efficiency and Load-balanced Geographic Routing Algorithm for Lossy Mobile Ad Hoc Networks

Geographic routing is a highly active area of research in mobile ad hoc networks (MANETs) owing to its efficiency and scalability. However, the use of simple greedy forwarding decreases the packet reception rate (PRR) dramatically in unreliable wireless environments; this also depresses the network lifetime. Therefore, it is important to improve delivery performance and prolong MANET lifetime simultaneously. In this article, a novel geographic routing algorithm, named energy-efficiency and load-loalanced geographic routing (ELGR), is presented for lossy MANETs. ELGR combines energy efficiency and load balance to make routing decisions. First, a link estimation scheme for the PRR is presented that increases the network energy efficiency level. Second, a learning method is proposed to adaptively sense local network loads, allowing enhanced whole network load balance. The results of a simulation show that ELGR performs better than several other geographic routing algorithms; in particular it extends network lifetime by about 20%, with a higher delivery ratio.     

UMR: A utility-maximizing routing algorithm for delay-sensitive service in LEO satellite networks

This paper develops a routing algorithm for delay-sensitive packet transmission in a low earth orbit multi-hop satellite network consists of micro-satellites. The micro-satellite low earth orbit(MS-LEO) network endures unstable link connection and frequent link congestion due to the uneven user distribution and the link capacity variations. The proposed routing algorithm,referred to as the utility maximizing routing(UMR) algorithm, improve the network utility of the MS-LEO network for carrying flows with strict end-to-end delay bound requirement. In UMR, first, a link state parameter is defined to capture the link reliability on continuing to keep the end-to-end delay into constraint; then, on the basis of this parameter, a routing metric is formulated and a routing scheme is designed for balancing the reliability in delay bound guarantee among paths and building a path maximizing the network utility expectation. While the UMR algorithm has many advantages, it may result in a higher blocking rate of new calls. This phenomenon is discussed and a weight factor is introduced into UMR to provide a flexible performance option for network operator. A set of simulations are conducted to verify the good performance of UMR, in terms of balancing the traffic distribution on inter-satellite links, reducing the flow interruption rate,and improving the network utility.     

软交换承载网络组网模式分析与研究

针对软交换网络中信令流、媒体流和维护流等业务流的交互需求,结合SOFTX3000软交换设备、UMG8900通用媒体网关设备和UA5000用户接入设备相关单板的工作原理,分析了采用二层组网模式的承载网络存在的弊端,提出了基于OSPF(Open Shortest Path First,开放式最短路径优先)协议的三层路由组网模式,并在某电话局软交换网络中得到应用。经分析,采用三层路由组网模式相比于二层组网模式具有更高的安全性和可靠性。     

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.