ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES

被引:366
作者
Zhang, Zhensheng [1 ]
机构
[1] San Diego Res Ctr, San Diego, CA 92121 USA
来源
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS | 2006年 / 8卷 / 01期
关键词
D O I
10.1109/COMST.2006.323440
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently there has been much research activity in the emerging area of intermittently connected ad hoc networks and delay/disruption tolerant networks (DTN). There are different types of DTNs, depending on the nature of the network environment. Routing in DTNs is one of the key components in the DTN architecture. Therefore, in the last few years researchers have proposed different routing protocols for different types of DTNs. In this article we capture the state of the art in routing protocols in DTNs. We categorize these routing protocols based on information used. For deterministic time evolving networks, three main approaches are discussed: the tree approach, the space and time approach, and the modified shortest path approach. For stochastic time evolving networks, the following approaches are discussed: the epidemic or random forwarding approach, predication or history based approach (including per contact routing based on one hop information only and per contact routing based on average end to end information), the model based routing approach, as well as approaches that control the movement of certain special nodes. Recent developments in erasure coding and network coding applied to DTNs are also discussed. The article also identifies open research issues and intends to motivate new research and development in this area.
引用
收藏
页码:24 / 37
页数:14
相关论文
共 57 条
  • [1] [Anonymous], 3626 RFC IETF NETW W
  • [2] [Anonymous], MRTR200605
  • [3] [Anonymous], GITCC047
  • [4] [Anonymous], P INT S WEAR COMP ZU
  • [5] [Anonymous], 2003, 3561 IETF RFC
  • [6] [Anonymous], 2000, CS200006 DUK U DEP C
  • [7] [Anonymous], INFOCOM
  • [8] Becker C., 2001, 4 PLEN CAB WKSP PIS
  • [9] Berger R., 2003, ACM QUEUE MAY
  • [10] Burleigh S., 2003, IEEE COMMUN MAG JUN