Efficient routing in delay tolerant network using clustering technique

Delay Tolerant Networks (DTNs) have the vast potential to connect devices and different area of the world that are instantly under-served by current systems. A fundamental test for Delay Tolerant Network is to decide the routes through the network ever having an end-to-end, or knowing which “routes” will be connected at every instant of time. The issue has an additional requirement of constrained size off buffers at each node. This situation limits the applicability of traditional routing techniques which categorized lack of path as failure of nodes and try to seek for existing end-to-end path. In this paper we attempt to deal with the topology by utilizing k-means algorithm and amplify the message delivery rate without trading off on the request of message dispose of and attempt to route the message starting with one node then onto the next. The amount of message discarded has a direct relation to the bandwidth used and the battery consumed. The more the message discarded more is the bandwidth used and battery consumed by every node in transmitting the message. At the same time, with the increase in the number of messages discarded, the cost for processing every message increases and this adversely affects the nodes. We have also focused on passing the messages to those nodes which is highest trusted node, as the nodes moving away have a greater probability of disseminating the messages throughout the network and hence increases chances of delivering the message to the destination.