Routing Algorithm for Delay-Tolerant Network Based on Price Game

Abstract

Due to the limited resource of Delay-Tolerant Network (DTN) nodes, in order to prolong their life cycles, the nodes would exhibit a "selfish" behavior, which is quite common in DTN, and will seriously affect the overall performance of the network. Targeting at these issues, to suppress such behavior and improve the overall performance of DTN, this paper proposed a DTN routing algorithm based on the auction price game, which converted the routing process into a data forwarding service auction process, and took the "prices" and the history data of the nodes as the main basis for the selection of data nodes. The experimental results showed that, compared with Epidemic algorithm and FC algorithm, the proposed algorithm showed good performance in time delay and cost ratio, which had well suppressed the "selfish" behavior of the nodes, and the proposed algorithm is a DTN routing algorithm with balanced performance.