Routing Algorithm Based on the Probability of Visiting Area Cells in Delay Tolerant Network
Delay tolerant network generally refers to the wireless network that has not stable end-to-end delivery paths.It is a significantly important research area and widely applied in outer space communication networks,village networks,mobile wireless sensor networks,and Ad hoc networks,etc.The routing problem in such networks is very challenging and has become into a hot research issue by now.The paper focuses on the delay tolerant networks under the area-cell-based mobility model,and proposes a routing algorithm——the PROAREA algorithm.The previous algorithms make the routing decision based on the probability of meeting between nodes.The PROAREA algorithm however has derived out the expected delivery delay between nodes from their visiting probabilities,and then directly use the expected delivery delay to guide the routing decision.Such routing decision has much better performance.The experiment results show that compared with the Epidemic algorithm and the PROHET algorithm,the successful delivery rate of the PROAREA algorithm increases 15% and 6.95%,the average delivery delay reduces 46.7% and 40.2%,respectively.