Priority aided scheduling of pigeons in Homing-Pigeon-Based Delay Tolerant Networks

摘要

The Delay Tolerant Network (DTN) is a network of regional networks. HoP-DTN was another DTN architecture proposed for a more useful realistic easy-to-deploy message delivery manoeuvring for DTNs. In this proposed disposition, restrained motility for ambulatory messengers to deliver messages to their destinations was utilized to provide an efficient way of routing for mobile wireless network. In the HoP-DTN, each node owns a dedicated messenger called a pigeon. These pigeons are responsible for message proliferation. They carry messages generated at their incepted (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, the priority aided scheduling of storage based pigeon, that intends to optimize the pigeon buffer queue and reduce delay for the messages so that they do not perish before reaching their respective destinations. It also incorporates a new priority standard which allows messages to reach destinations without waiting for the fulfilment of the pigeon's buffer queue. We have performed both simulations and mathematical analysis to prove the preciseness of our approach and validate our scheme and the results manifest that our postulation is correct.