Wireless Mobile Ad-Hoc Shortest Path Routing in Delay Tolerant Networks
Opportunistic delay tolerant networks are organized by the sporadic connectivity between their nodes and the lack of stable paths from sender to receiver. Future connections are mostly unknown in these networks sending used to deliver the messages with effective forwarding data i.e., average intermeeting time between nodes to avoid risks or intrusion, attacks. Their proposed system analysis the novel metric conditional intermeeting average time computes duration of time between two nodes relative to meet the third node only local knowledge of past contacts. In this paper, the authors survey the routing protocols in wireless sensor networks, applications of MANETs and compares the metric based algorithms for delay tolerant networks is existing one.