Threshold triplet incorporated scheduling of storage based pigeons in Homing-Pigeon-Based Delay Tolerant Networks

The Delay Tolerant Network (DTN) is a network of regional networks. It acts as a binding agent or connector between heterogeneous networks. A new kind of DTN is the Homing-Pigeon-Based DTN (HoP-DTN). In the HoP-DTN, each node owns a dedicated messenger called a pigeon. These pigeons are responsible for message propagation. They carry messages generated at their home (source) node, routes it to its destination and returns back to its home node for further message delivery. Many scheduling strategies have been proposed for HoP-DTN. In this paper we propose a new scheduling strategy that tries to optimize the pigeon buffer queue and reduce delay for the messages so that they don´t expire before reaching their respective destinations. We have done both simulations and mathematical analysis of our approach to prove its correctness and validate our scheme and the results show that our hypothesis is correct.