The Community for Technology Leaders
Green Image
Issue No. 08 - August (2007 vol. 6)
ISSN: 1536-1233
pp: 943-959
Delay-tolerant networks (DTNs) have the potential to interconnect devices in regions that current networking technology cannot reach. To realize the DTN vision, routes must be found over multiple unreliable, intermittently-connected hops. In this paper we present a practical routing protocol that uses only observed information about the network. We designed a metric that estimates the average waiting time for each potential next hop. This learned topology information is distributed using a link-state routing protocol, where the link-state packets are "flooded" using epidemic routing. The routing is recomputed each time connections are established, allowing messages to take advantage of unpredictable contacts. A message is forwarded if the topology suggests that the connected node is "closer" to the destination than the current node. We demonstrate through simulation that our protocol provides performance similar to that of schemes that have global knowledge of the network topology, yet without requiring that knowledge. Further, it requires significantly less resources than the alternative, epidemic routing, suggesting that our approach scales better with the number of messages in the network. This performance is achieved with minimal protocol overhead for networks of approximately 100 nodes.
delays, routing protocols, telecommunication network topology,delay-tolerant networks, link-state routing protocol, link-state packets, average waiting time, epidemic routing, network topology, protocol overhead,Disruption tolerant networking, Routing protocols, Telecommunication network topology, Mobile communication, Delay, Network topology, Relays, Government, Monitoring, Costs,Routing protocols, mobile communication systems, nomadic computing.
"Practical Routing in Delay-Tolerant Networks", IEEE Transactions on Mobile Computing, vol. 6, no. , pp. 943-959, August 2007, doi:10.1109/TMC.2007.1016
98 ms
(Ver 3.3 (11022016))