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, a...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.展开更多
基金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.