Graph-based single-copy routing in delay tolerant networks  

作　　者：于海征 Ma Jianfeng 

机构地区：[1]Key Laboratory of Computer Network and Information Security, Xidian University, Xi＇ an 710071, P. R. China

出　　处：《High Technology Letters》2011年第1期52-56,共5页高技术通讯（英文版）

基　　金：Supported by the National High Technology Research and Development Programme of China （No. 2007AA01Z429, 2007AA01Z405 ） and the National Natural Science Foundation of China （No. 60633020, 60702059, 60872041 ）.

摘　　要：This paper presents a new graph-based single-copy routmg method m delay tolerant networks （DTN）. With time goes on in the networks, a DTN connectivity graph is constituted with mobility of nodes and communication, and a corresponding greedy tree is obtained using a greedy algorithm in DTN connectivity graph. While there are some bad nodes such as disabled nodes or selfish nodes in delay tolerant networks, the nodes can choose the next p^oper intermediate node to transmit the mes- sage by comparing the location of neighboring nodes in the greedy tree. The single-copy routing method is very appropriate for energy-constrained, storage-constrained and bandwidth-constrained applications such as mobile wireless DTN networks. We show that delivery ratio is increased significantly by using the graph-based single-copy routing when bad nodes exist.

关 键 词：delay tolerant network （ DTN） MESSAGE single-copy ROUTING GRAPH 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] S572.035[自动化与计算机技术—计算机科学与技术]