The Scientific World JOURNAL · 2014 · 23 citations · 17 references
ComputingComputer ScienceComputer SystemsAlgorithmsComputer NetworksMobile ComputingMobile Ad Hoc NetworksMobile NetworkingMobile NetworksRoutingRouting AlgorithmsRouting ProtocolsAd Hoc NetworksDelay-tolerant NetworkingHeuristic Routing AlgorithmsMobile Ad Hoc Network RoutingMobile RoutingNetwork PartitioningPartitioningRouting In Mobile Networks
Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.
17
Epidemic routing for partially-connected ad hoc networks
Amin Vahdat · 2000 · 4.2K citations
A delay-tolerant network architecture for challenged internets
Kevin Fall · 2003 · 3.1K citations · Full text
Thrasyvoulos Spyropoulos, Konstantinos Psounis, C.S. Raghavendra · 2005 · 2.6K citations · Full text
The ONE simulator for DTN protocol evaluation
Ari Keränen, Jörg Ott, Teemu Kärkkäinen · 2009 · 2.3K citations · Full text
Pocket switched networks and human mobility in conference environments
Pan Hui, Augustin Chaintreau, James Scott et al. · 2005 · 948 citations · Full text