Impact of Strangers on Opportunistic Routing Performance  

作　　者：袁培燕 马华东 段鹏瑞 

机构地区：[1]Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications

出　　处：《Journal of Computer Science & Technology》2013年第3期574-582,共9页计算机科学技术学报（英文版）

基　　金：supported by the National Basic Research 973 Program of China under Grant No. 2011CB302701;the National Science Fund for Distinguished Young Scholars of China under Grant No. 60925010;the National Natural Science Foundation of Chinaunder Grant Nos. 61133015, 61003280, and 61272517;the Funds for Creative Research Groups of China under Grant No. 61121001;the Program for Changjiang Scholars and Innovative Research Team in University of China under Grant No. IRT1049;the Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20120005130002

摘　　要：Routing is one of the challenging tasks in Delay Tolerant Networks （DTNs）, due to the lack of global knowledge and sporadic contacts between nodes. Most existing studies take a greedy scheme in data forwarding process, i.e., only nodes with higher utility values than current carriers can be selected as relays. They lack an in-depth investigation on the main features of the optimal paths in Epidemic. These features are vital to any forwarding scheme that tends to make a trade-off between packet delivery delay and cost. This is mainly because Epidemic provides an upper bound on cost and a lower bound on delivery delay. Therefore, a deep understanding of these features is useful to make informed forwarding decisions. In this paper, we try to explore these features by observing the roles of different social relationships in the optimal paths through a set of real datasets. These datasets provide evidence that strangers have two sides in data forwarding process, and that the importance of strangers shows a decreasing trend along the forwarding paths. Using this heuristic knowledge, we propose STRON, a distributed and lightweight forwarding scheme. The distributed feature makes it very suitable for opportunistic scenarios and the low communication and computation features make it easy to be integrated with state-of-the-art work. The trace-driven simulations obviously confirm its effectiveness, especially in terms of packet delivery delay and cost.Routing is one of the challenging tasks in Delay Tolerant Networks （DTNs）, due to the lack of global knowledge and sporadic contacts between nodes. Most existing studies take a greedy scheme in data forwarding process, i.e., only nodes with higher utility values than current carriers can be selected as relays. They lack an in-depth investigation on the main features of the optimal paths in Epidemic. These features are vital to any forwarding scheme that tends to make a trade-off between packet delivery delay and cost. This is mainly because Epidemic provides an upper bound on cost and a lower bound on delivery delay. Therefore, a deep understanding of these features is useful to make informed forwarding decisions. In this paper, we try to explore these features by observing the roles of different social relationships in the optimal paths through a set of real datasets. These datasets provide evidence that strangers have two sides in data forwarding process, and that the importance of strangers shows a decreasing trend along the forwarding paths. Using this heuristic knowledge, we propose STRON, a distributed and lightweight forwarding scheme. The distributed feature makes it very suitable for opportunistic scenarios and the low communication and computation features make it easy to be integrated with state-of-the-art work. The trace-driven simulations obviously confirm its effectiveness, especially in terms of packet delivery delay and cost.

关 键 词：STRANGER forwarding mechanism social relationship Delay Tolerant Network 

分 类 号：TN929.5[电子电信—通信与信息系统]