Background & Objective: Routing is a popular challenge in ad hoc networks. A routing
algorithm developed for one type of ad hoc network may be adapted for other. However, such adaptation
is very difficult for Delay Tolerant Network (DTN) due to special DTN characteristics like latency,
intermittency, disruptions, etc. and its applications in hostile environments like extreme terrestrial
Methods: We have used Ant Colony Optimization (ACO) to develop a routing algorithm suited to
DTNs. The ants wander for food and after few epochs they find shortest path to it. The ant’s movement
in ACO can be mapped with propagation of messages that are replicated in DTN and look for
their destination. Also, we apply an efficient buffer management method to boost the performance of
our routing algorithm.
Results & Conclusion: To highlight the effectiveness of our algorithm, the simulation results have been
compared with some leading algorithms available in the literature and have found that our
algorithm produces better result than other algorithms in terms of delivery, overhead and probability ratio.