Abstract
This propaganda of research implied in this progress would be arised by introducing the clustering scheme in a very poignant distribute manner This method is very high responsive enough in order to bring up an efficient Cluster acting as the base for the designing up of the Routing protocol for the Delay Tolerant Mobile Networks. This research proposes with an approach that they are clustered into a group. The design of the kind of networks is as: 1) Distributively grouped into mobile nodes 2) The grouping up of the nodes is based on similarity pattern. 3) The similarity of the pattern is it should have a definite cluster of fixed size. The result of such implications is to - reduce the overheads based on the parameters and its constraints, secondly - balancing of the loads implied. They share the resources and perform the same. This would enhance and aim in bringing out an efficient and a enhanced routing scaled up to its standard and hence the routing is aimed to achieve a routing protocol based on exponentially Weighted moving area shortly know an as the EWMA. This one gives the details about the nodal contact it occurs and mathematical probability amongst the nodes themselves, using the weighted mean with the clusters formed. The clusters what were formed using the functions such as Sync (), Leave () and Join (). The defined number of nodes in a particular cluster need to be defined and must be greater or exceeding the optimum value the of nodes allotted for a particular cluster. Finally, some of the gateway nodes group the network information form the other gateways and determines a routing table which are all required in that particular nodes or stipulated nodes in that cluster, so as to determine the moving weighted average and perform the routing process. The results obtained from the simulations revealed the static clusters for improving the sharing of the resource capacity and decreases the memory requirement of then nodes, thus making the computations of the Routing table gets easier for access and at a faster pace too. The consistency of clusters gets improved by making the moving node to inform to its neighbours about its movement from the cluster. The use of Cluster connectivity modification packet (CCMP) is that it would bring down the traffic of the network and would calculate the computation table for shortest path route easier. From the above, one would be able to obtain greater delivery ratio values at a predominantly lesser overhead and the delay in the nodes when reaches end to end. They are poignant enough in achieving this feat when comparing the results obtained from the non - clustered algorithms.