Routing in intermittent networks using storage domains

In this paper, we present a routing algorithm for a class of networks where a contemporaneous end‐to‐end path may not exist at the time of data transfer due to intermittent links. Several examples of such networks exist in the context of sensor networks, mobile ad hoc networks and delay tolerant networks. The proposed routing algorithms follow a priori routing similar to source routing. Link state changes are assumed to be known ahead of time, for instance, due to planned duty cycling resulting in scheduled connectivity. The basic idea behind the proposed routing algorithms is to modify the breadth first search (BFS) algorithm to take into account link state changes and find the quickest route between source and destination nodes. We introduce the idea of time‐varying storage domains where all nodes connected for a length of time act as a single storage unit by sharing the aggregated storage capacity of the nodes. This will help situations where storage is a limited resource. We evaluate the routing algorithm with and without storage domain in an extensive simulation. The delay performance of the proposed algorithms is conceptually the same as flooding‐based algorithms but without the penalty of multiple copies. More significantly, we show that the Quickest Storage Domain (Quickest SD) algorithm distributes the storage demand across many nodes in the network topology, enabling balanced load and higher network utilization. In fact, we show that for the same level of performance, we can actually cut the storage requirement in half using the Quickest SD algorithm. Copyright © 2009 John Wiley & Sons, Ltd.     

一种基于DTN的震后救援路由新策略

地震灾害发生以后,原有电力系统和通讯设施不能够正常运行,使得搜救人员携带的无线通讯节点设备组成的DTN（Delay Tolerance Network）成为了搜救服务网络的重要组成部分。搜救信息是否能够第一时间传送到数据中心尤为重要,分析了震后救援特性需求,设计了地震救援系统模型,综合考虑搜救网络节点间的时间距和数据信息的权重优先级提出了一种适宜于震后救援的路由新策略,通过实验仿真验证了新策略的实用性,为我国地震震后救援提供参考。     

生物网络方法在DTN保管传递机制设计中的应用

延迟容忍网络（DTN）中的保管传递机制存在着节点资源不足,束传输不可靠等问题。分析了存储资源的受限对束传输可靠性的影响,并借鉴生物网络机理,提出了基于生物网络的保管传递机制,设计具有免疫行为的生物实体并代理保管束,生物实体通过自组织协作完成保管传递,可以有效地降低分组丢失率。最后以智能服装无线传感器网络为例,通过试验评价该机制及其性能,证明了其有效性。     

Design and analysis of the Dual-Torus Network

In this paper, we propose a new topology called theDual Torus Network (DTN) which is constructed by adding interleaved edges to a torus. The DTN has many advantages over meshes and tori such as better extendibility, smaller diameter, higher bisection width, and robust link connectivity. The most important property of the DTN is that it can be partitioned into sub-tori of different sizes. This is not possible for mesh and torus-based systems. The DTN is investigated with respect to allocation, embedding, and fault-tolerant embedding. It is shown that the sub-torus allocation problem in the DTN reduces to the sub-mesh allocation problem in the torus. With respect to embedding, it is shown that a topology that can be embedded into a mesh with dilation δ can also be embedded into the DTN with less dilation. In fault-tolerant embedding, a fault-tolerant embedding method based on rotation, column insertion, and column skip is proposed. This method can embed any rectangular grid into its optimal square DTN when the number of faulty nodes is fewer than the number of unused nodes. In conclusion, the DTN is a scalable topology well-suited for massively parallel computation. Sang-Ho Chae, M.S.: He received the B.S. in the Computer Science and Engineering from the Pohang University of Science and Technology (POSTECH) in 1994, and the M.E. in 1996. Since 1996, he works as an Associate Research Engineer in the Central R&D Center of the SK Telecom Co. Ltd. He took part in developing SK Telecom Short Message Server whose subscribers are now over 3.5 million and Advanced Paging System in which he designed and implemented high availability concepts. His research interests are the Fault Tolerance, Parallel Processing, and Parallel Topolgies. Jong Kim, Ph.D.: He received the B.S. degree in Electronic Engineering from Hanyang University, Seoul, Korea, in 1981, the M.S. degree in Computer Science from the Korea Advanced Institute of Science and Technology, Seoul, Korea, in 1983, and the Ph.D. degree in Computer Engineering from Pennsylvania State University, U.S.A., in 1991. He is currently an Associate Professor in the Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea. Prior to this appointment, he was a research fellow in the Real-Time Computing Laboratory of the Department of Electrical Engineering and Computer Science at the University of Michigan from 1991 to 1992. From 1983 to 1986, he was a System Engineer in the Korea Securities Computer Corporation, Seoul, Korea. His major areas of interest are Fault-Tolerant Computing, Performance Evaluation, and Parallel and Distributed Computing. Sung Je Hong, Ph.D.: He received the B.S. degree in Electronics Engineering from Seoul National University, Korea, in 1973, the M.S. degree in Computer Science from Iowa State University, Ames, U.S.A., in 1979, and the Ph.D. degree in Computer Science from the University of Illinois, Urbana, U.S.A., in 1983. He is currently a Professor in the Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea. From 1983 to 1989, he was a staff member of Corporate Research and Development, General Electric Company, Schenectady, NY, U.S.A. From 1975 to 1976, he was with Oriental Computer Engineering, Korea, as a Logic Design Engineer. His current research interest includes VLSI Design, CAD Algorithms, Testing, and Parallel Processing. Sunggu Lee, Ph.D.: He received the B.S.E.E. degree with highest distinction from the University of Kansas, Lawrence, in 1985 and the M.S.E. and Ph.D. degrees from the University of Michigan, Ann Arbor, in 1987 and 1990, respectively. He is currently an Associate Professor in the Department of Electronic and Electrical Engineering at the Pohang University of Science and Technology (POSTECH), Pohang, Korea. Prior to this appointment, he was an Associate Professor in the Department of Electrical Engineering at the University of Delaware in Newark, Delaware, U.S.A. From June 1997 to July 1998, he spent one year as a Visiting Scientist at the IBM T. J. Watson Research Center. His research interests are in Parallel, Distributed, and Fault-Tolerant Computing. Currently, his main research focus is on the high-level and low-level aspects of Inter-Processor Communications for Parallel Computers.     

DTN中概率选择的散发等待路由

目前的Internet体系结构和许多协议无法很好地适应延迟较高和间歇性链接的网络,这些网络有它们自己的专有协议,即聚束层协议,而不采用TCP/IP协议。为了实现这样的网络之间的互联,国际上提出了一种在端到端链接和节点资源都受限的新型网络体系和应用接口,即容迟网络（DTN）。文中主要讨论DTN网络的路由算法,在DTN路由算法中,蔓延路由和概率路由能提供较高的报文投递率,较小的投递延迟,但是开销很大。散发等待路由虽然具有较小的开销,但是投递率低、延迟较大,提出了投递效用的概念。在融合概率选择路由和散发等待路由的基础上,提出了具有概率选择的散发等待路由。通过仿真,与其它已有算法相比,显著提高了报文投递效用。     

用于延时可容忍网络的增强型MED路由算法

最小预期时延(MED)是一种典型的延时可容忍网络(DTN)路由算法,其现有的改进算法MED-PC能有效地提升性能,但后者事实上加强了节点先验知识假设,缩小了应用范围,并引入过大的计算开销。该文针对以上问题,提出了一种新的改进算法——AMED。实验表明,AMED在维持前提假设不变的情况下,取得和MED-PC相当并明显优于MED的性能,而计算量和MED相当,明显小于MED-PC。     

一种基于分组交换的低时延路由算法

针对现有延迟可容忍网络路由算法在SV分组发送和数据分组交换过程中存在的冗余问题,提出了一种基于分组交换的延迟可容忍网络路由算法——PEA(Packet exchange algorithm)。PEA算法通过调整数据分组发送顺序及SV分组发送方式,加快了数据分组交换,降低了分组端到端时延。仿真结果表明,在相同消息传输成功率的条件下,PEA算法比Epi-demic算法具有更低的端到端时延。     

DTN中基于泛模板运算的运动模式发现机制

DTN(Delay-Tolerant Network) 用于描述Ad hoc等无线网络中频繁发生长时间网络分割情形。DTN不假设端到端路径一定存在,因此其主要关注点是如何提高成功投递率,而不是延时等QoS参数。运动模式,例如聚类性等对DTN很重要;本文关注于一种宏观的节点运动模式,并提出一个发现和使用运动模式的框架TOM2D(Template-Operation based Mobility Model Discovery)。其基本思想是：节点利用路由信息交互机制维护一个包含所有节点(或相关节点)三维链路容量矩阵,利用图像处理中的模板运算机制从中提取出可能的运动模式,最后用一个通用的数据结构存储这些信息并用于路由决策过程中。由于TOM2D并不依赖于特定的路由协议,本文最后给出了一个基于OLSR和DSDV的例子,仿真结果显示TOM2D确实为路由决策给出了有价值的信息,提高了路由成功率。     

面向数据的网络概念及其军事应用研究

已有网络是面向主机应用设计,存在很多安全问题,为了提高网络安全性同时提高应用速度,人们提出了面向数据的网络概念。面向数据的网络从以主机为中心应用转向以数据为中心应用,解决当前互联网体系数据与其所在位置相绑定,数据的复制和迁移困难的问题。还概括介绍了面向数据的网络最新研究进展,最后分析了面向数据的网络在美军军事通信研究应用情况及其在中国海军数据通信网中的研究应用。     

DTN中蔓延路由协议拥塞控制方案研究

针对在DTN中使用蔓延路由协议,受转发节点的缓存限制,导致递交率因网络拥塞而下降的问题,在分析比较几种报文丢弃策略的基础上,提出一种改进的拥塞控制方案。当拥塞发生时,对节点缓存中超过某个TTL门限的报文进行丢弃。将改善递交率作为主要参数,使用ONE仿真器对改进方案的性能进行仿真和比较。结果显示,这种方案很好地实现了拥塞控制。