检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学技术大学计算机科学与技术学院,合肥230027 [2]中国科学技术大学苏州研究院,江苏苏州215123
出 处:《计算机研究与发展》2009年第7期1065-1073,共9页Journal of Computer Research and Development
基 金:国家"九七三"重点基础研究发展计划基金项目(2006CB303006);国家自然科学基金项目(60803009);教育部高等学校博士学科点专项科研基金项目(20070358075)~~
摘 要:容迟网络泛指那些由于节点移动、能量管理、调度等原因而出现频繁中断、甚至长时间处于中断状态的一类网络.它涵盖了由于节点调度而处于间歇式连通的无线传感网络、移动Ad hoc网络、周期性连通的卫星网络、乡村网络、野生动物追踪网络以及个人设备交换网络等等,具有十分广阔的应用前景,引起了广泛的关注.与传统网络相比,容迟网络没有稳定的端到端传输路径,因而其路由问题更为复杂.已有的研究工作也主要集中于这一问题,并提出了许多的容迟网络路由算法.对这些算法的最新进展进行了综述.首先,介绍了容迟网络路由算法的性能评价标准.其次,给出了容迟网络路由算法的分类方法.按照路由策略来分,容迟网络路由算法可以分为基于复制策略的算法和基于转发策略的算法.按照网络模型来分,容迟网络路由算法又可以分为面向主动移动模型的算法和面向被动移动模型的算法.然后,针对每一分类,重点综述了其中具有代表性的一些容迟网络路由算法,并总结了各算法的优缺点.最后,讨论了未来的研究方向.Delay-tolerant n, etworks (DTNs) are intermittently-connected networks that may suffer from frequent and long lasting disconnection due to various reasons such as mobility, power management, scheduling, etc. Representative delay tolerant networks include wireless sensor networks using scheduled intermittent connectivity, mobile ad hoc networks, satellite networks with periodic connectivity, village networks, wildlife tracking networks, and pocket switched networks, etc. Due to the broad application prospect, delay tolerant networks attract much attention. However, compared with traditional networks, there are no stable end-to-end delivery paths in delay-tolerant networks, and the routing problem is thus much more complicated. Most of the existing research work also focuses on this problem, and many delay-tolerant network routing algorithms are proposed. In this paper, the state of the art in these algorithms is summarized. At first, the evaluation criterion of performance is introduced. Secondly, different taxonomies for delay-tolerant network routing algorithms are presented. According to the routing strategy, all the algorithms can be categorized into the algorithms based on replication and the algorithms based on forwarding. According to the network model, the algorithms can be categorized into the algorithms based on active mobility model and the algorithms based on passive mobility model. Thirdly, the representative routing algorithms are described for each class of algorithms. Furthermore, the advantages and disadvantages of these algorithms are summarized. Finally the future directions of research in this area are discussed.
关 键 词:容迟网络 容断网络 移动AD HOC网络 机会网络 路由算法
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.115