Conditional Shortest Path Routing In Delay Tolerant Networks Project

Conditional shortest path routing in delay tolerant networks is a 2010 CSE project which is implemented in java platform. Main aim of this project is to provide shortest path between nodes while transmitting data from source to destination. In present system end to end path connectivity is not stable and estimation of future node connection is not known in these networks this system works only on optimistic forwarding while delivering message.

In this paper we propose conditional inter meeting time metric which works on observation of changes in human mobility based on his connection history. Based on this past contacts best path between nodes is calculated.

We show this project by using 20 node connections and sending information using different combinations and analyze the shortest path which is shown in text file.

download conditional shortest path routing in delay tolerant network project 2010 cse abstract and project documentation.

Leave a Reply

Your email address will not be published. Required fields are marked *