Swapna Paul Dayakar Raj Vanguru | JNTU-HYDERABAD (original) (raw)
Related Authors
International Journal of Engineering Research and Applications (IJERA)
Uploads
Papers by Swapna Paul Dayakar Raj Vanguru
Routing in delay tolerant networks (DTN) is a challenging problem because at any given time insta... more Routing in delay tolerant networks (DTN) is a challenging problem because at any given time instance, the probability that there is an end-to-end path from a source to a destination is low. Since the routing algorithms for conventional networks assume that the links between nodes are stable most of the time and do not fail frequently, they do not generally work in DTN's. Therefore, the routing problem is still an active research area in DTN's To realize the DTN vision, routes must be found over multiple unreliable, intermittently-connected hops. Many researchers have investigated this fundamental challenge, to overcome these challenges, this paper propose Conditional Shortest Path Routing (CSPR) protocol that routes the messages over conditional shortest paths in which the cost of links between nodes is defined by conditional intermeeting times rather than the conventional intermeeting times. Through trace-driven simulations, we demonstrate that CSPR achieves higher delivery rate and lower end-to-end delay compared to the shortest path based routing protocols that use the conventional intermeeting time as the link metric.
Routing in delay tolerant networks (DTN) is a challenging problem because at any given time insta... more Routing in delay tolerant networks (DTN) is a challenging problem because at any given time instance, the probability that there is an end-to-end path from a source to a destination is low. Since the routing algorithms for conventional networks assume that the links between nodes are stable most of the time and do not fail frequently, they do not generally work in DTN's. Therefore, the routing problem is still an active research area in DTN's To realize the DTN vision, routes must be found over multiple unreliable, intermittently-connected hops. Many researchers have investigated this fundamental challenge, to overcome these challenges, this paper propose Conditional Shortest Path Routing (CSPR) protocol that routes the messages over conditional shortest paths in which the cost of links between nodes is defined by conditional intermeeting times rather than the conventional intermeeting times. Through trace-driven simulations, we demonstrate that CSPR achieves higher delivery rate and lower end-to-end delay compared to the shortest path based routing protocols that use the conventional intermeeting time as the link metric.