Abstract: This research investigates distributed clustering scheme and proposes an Ad hoc On demand Distance Vector (AODV) routing protocol for Delay-Tolerant Mobile Networks (DTMNs). The basic idea is to distributively group mobile nodes with similar mobility pattern into a cluster which can then interchangeably share their resources (such as buffer space) for overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. An ad hoc network is self-organizing and adaptive. Networks are formed on the fly, devices can leave and join the network during its lifetime, devices can be mobile within the network, the network as a whole may be mobile and the network can be deformed on the fly. Devices in mobile ad hoc networks should be able to detect the presence of other devices and perform the necessary set-up to facilitate communications and the sharing of data and services. Due to the lack of continuous communications among mobile nodes and possible errors in the estimation of nodal contact probability, convergence and stability become major challenges in distributed clustering in DTMN. Extensive simulations are carried out to evaluate the end to end delay and overhead of the proposed Ad hoc On demand Distance Vector (AODV) routing protocol.
S. Kannan, V.P. Arunachalam and S. Karthik, 2012. Reducing End to End Delay in Delay Tolerant Mobile Network Using AODV and Cluster-Based Routing Protocol. Research Journal of Applied Sciences, 7: 234-239.