Harmony search algorithm based buffer management in Delay Tolerant Networks

Abstract

Delay Tolerant Networks (DTN) are the decentralized wireless network in which frequent disconnection and drastic change in the network topology makes problematic to transmit data to the destination. Researchers tried to improve the delivery ratio in the network by increasing number of replicas of messages. However multiple copies of messages can easily create the problem of buffer overflow. In this paper, we have proposed a buffer management technique based on Harmony search algorithm to maximize the resource utilization specially when message sizes are different and bandwidth are limited. Proposed method decides which message should be drop when buffer overflow occurs based on Epidemic routing protocol using Harmony search algorithm. We have simulated the environment in Opportunistic Network Environment (ONE) simulator and compared the results with existing DTN buffer management techniques and found that proposed method has higher delivery ratio without affecting the end-to-end delay and overhead ratio.