Name
Abstract | ||
|---|---|---|
Delay tolerant network (DTN) is a sparse wireless mobile network that does not guarantee a path between a source and a destination at any time. In DTN, one critical issue is to reliably deliver data with low latency. In an N-node network, naive forwarding approaches such as flooding and its derivatives make the routing cost very high (O(N)). Recently, an approach called delegation forwarding (DF) caught significant attention in the research community because it reduces the cost to O(root N) while maintaining good performance. In this paper, we enhance the DF algorithm by proposing a probability delegation forwarding (PDF) that further reduces the cost to O(Nlog2+2p(1+p) , p is an element of (0,1) and a threshold-based probability delegation forwarding (TPDF) that closes the latency gap between DF and PDF. Simulation results show that both PDF and TPDF can achieve similar delivery ratio as DF at a lower cost if p is not too small. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1080/17445760903548317 | INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS |
Keywords | Field | DocType |
delay tolerant networks, forwarding algorithms, routing, traces | Wireless,Delay-tolerant networking,Computer science,Latency (engineering),Computer network,Cellular network,Latency (engineering),Delegation,Packet forwarding,Distributed computing | Journal |
Volume | Issue | ISSN |
26 | 5 | 1744-5760 |
Citations | PageRank | References |
3 | 0.44 | 11 |
Authors | ||
3 | ||