容迟网络路由算法.pdfVIP

ISSN 1000- 1239PCN 11- 1777PTP Journal of Computer Research and De elopment 46( 7) : 1065- 1073, 2009 肖明军 黄刘生 ( 230027) ( 2 15 123) ( x iaomj@ ustc. edu. cn) Delay-Tolerant Network Routing Algorithm Xiao M ingjun and Huang Liusheng ( School of Comp uter S cience and Technology , University of Science and Technology of China, H ef ei 230027) ( S uz hou Institute f or A dvanced Study , University of Science and Technology of China, Suzhou, J iangsu 215123) Abstract Delay-tolerant netw or ks ( DTN s) are intermittently-connected netw orks that may suffer from frequent and long lasting disconnection due to arious reasons such as mobility , pow er management, scheduling, etc. Representati e delay tolerant netw orks include w ireless sensor netw or ks using scheduled intermittent connecti ity , mobile ad hoc netw or ks, satellite netw orks w ith per iodic connecti ity , illage netw orks, w ildlife tracking netw orks, and pocket sw itched netw orks, etc. Due to the broad application prospect, delay tolerant netw or ks attract much attention. How e er, compared w ith traditional netw orks, there ar e no stable end-to-end deli ery paths in delay-tolerant netw or ks, and the routing problem is thus much more complicated. Most of the existing research w ork also focuses on this pr oblem, and many delay-tolerant network routing algorithm s are proposed. In this paper, the state of the art in these algorithm s is summarized. At fir st, the e aluation criter ion of performance is introduced. Secondly, different taxonomies for delay-tolerant netw ork routing algorithm s are presented. According to the routing strategy , all the algorithm s can be categor ized into the algorithms based on replicat