Range aware message drop policy for delay tolerant networks.

Abstract

In delay tolerant networks (DTNs) the messages are often not delivered to the destination due to a lack of end-to-end connectivity. In such cases, the messages are stored in the buffer for a long time and are transmitted when the nodes come into the range of each other. The buffer size of each node has a limited capacity, and it cannot accommodate the new incoming message when the buffer memory is full, and as a result network congestion occurs. This leads to a low delivery probability and thus increases the overhead ratio. In this research work, a new buffer management scheme called Range Aware Drop (RAD) is proposed which considers metrics such as message size and time to live (TTL). RAD utilizes TTL as an important metric and as a result, reduces the unnecessary message drop. Simulation results reveal that RAD performs significantly better than drop oldest (DOA) and size aware drop (SAD) in terms of delivery probability and overhead ratio. The obtained results also revealed that the hop-count average of SAD is 3.9 and DOA is 3.4 while the hop-count average of RAD is just 1.7. Also, the message drop ratio of the RAD is 36.2% while SAD and DOA have message drop ratios of 73.3% and 84.9% respectively.