SARM:An Congestion Control Algorithm for DTN

摘要

When congestion happens at the node of DTN, the regular approach is to delete the old message of these nodes in order to make memory space for the new arrival message to remove congestion. A new method for the selection of message to delete, congestion control routing algorithm based on Simulated Annealing and regional movement (SARM) are proposed in this paper. This mechanism is under the premise that node movement has the regional characteristic The probability of node collision and transferring nodes in the message delivery are taken into account comprehensively. We quantitatively evaluate the successful probability of different messages delivered by different nodes. When node congestion happens, we choose the message with lower probability of successful delivered by two encounter nodes to delete using SARM. The experiment shows that the parameters of network are significantly unproved under this congestion control routing algorithm.