Intermittently connected mobile Network systems represent a challenging environment for networking research, due to the problems of ensuring messages delivery in spite of frequent disconnections and random meeting patterns. These networks fall into general category of Delay Tolerant Networks. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, traditional routing schemes fail, because they try to establish complete end-to-end paths, before any packet is sent. To deal with such networks, researches introduced flooding based routing schemes which leads to high probability of delivery. But the flooding based routing schemes suffered with contention and large delays. Here the proposed protocol “Spraying with performed by a node upon reception of an Acknowledgment message”, sprays a few message copies into the network, neighbors receives a copy and by that relay nodes we are choosing the shortest route and then route that copy towards the destination, if packets reach its destination which that node diffuse Acknowledment with Autonomic behaviour and discard messages. Previous works assumption is that there is no contention and
unreachable nodes. But we argue that contention and unreachable nodes must be considered for finding efficiency in routing. So we are including a network which has contention and unreachable nodes and we applied the proposed protocol. So, we introduce new routing mechanism for Diffusion Based Efficient Spray Routing in Intemittently Connected Mobile Networks with Multiple Copies.
A Storage-Friendly Routing Scheme in Intermittently Connected Mobile Network
