Comparative Analysis of Routing Algorithms in Opportunistic Network

Opportunistic networks are developed by connecting interfaces for short-range communication. Routing is difficult in this type of Network. The existing routing algorithms are discussed in this paper and comparison is shown for the five algorithms which are used wisely in this Network. The comparison is made in Epidemic routing, Spray and Wait, First Contact routing, Prophet routing and Maxprop routing. In the comparison, we can see that in all routing algorithms overhead ratio is decreasing when buffer size is increased. And due to increase in buffer size, the delivery probability is also increased. Each algorithm has its own advantages and disadvantages.