Delay Tolerance in Wireless Networks through Optimal Path Routing Algorithm

Abstract

A Delay Tolerant Network (DTN) is a mesh network designed to operate effectively over great distances. DTNs have not custom to vindicate complete track from source to destination most of the time during communication. Existing data routing approaches used in DTNs were based on multi-copy routing. However, these existing methods incur overhead due to exorbitant transmissions and increases seer side processing. Hence there is a necessity to propose an optimal path routing algorithm to overcome the above issues. The optimal path routing reduces the proposition of message dropping and wax the throughput. The design approximate also uses random path generation that can reveal the path that affirms active connection for a longer duration to achieve a desired routing delay. In addition, this system has an effective buffer management mechanism to increase throughput and decrease routing delay. The analysis and as well as the simulation results clearly shows that the optimal path routing algorithm, provides high throughput and low routing delay compared to existing routing approaches.(ICCC-2015) 402 M. Sindhuja et al. / Procedia Computer Science 48 ( 2015 ) 401 -407

Fault Tolerance and Congestion Control in Mobile Ad – Hoc Networks: A Survey

“…In [8] optimal path routing is used, the path maintaining active connection for longer duration is identified and further transactions to the destination are made via this path. Also message dropping that occurs due to selfish nodes are reduced using the path trace algorithm.…”

“…Output: Acknowledgement from destination. Algorithm: [8] Step 1: The message from the source is send via the identified optimal path to the destination Step 2: The selfish nodes are present in the optimal path are detected and these nodes are rectified…”