Analysis of simple counting protocols for delay-tolerant networks
Proceedings of the second ACM workshop on Challenged networks
Delay-tolerant network experiments on the meshtest wireless testbed
Proceedings of the third ACM workshop on Challenged networks
Analysis and design of mobile Wireless Social Model
Computer Communications
Congestion aware data dissemination in social opportunistic networks
ACM SIGMOBILE Mobile Computing and Communications Review
Using buffer space advertisements to avoid congestion in mobile opportunistic DTNs
WWIC'11 Proceedings of the 9th IFIP TC 6 international conference on Wired/wireless internet communications
Reasonable routing in delay/disruption tolerant networks
Frontiers of Computer Science in China
Impact of persistent storage on the DTN routing performance
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Fair content dissemination in participatory DTNs
Ad Hoc Networks
A store-carry-process-and-forward paradigm for intelligent sensor grids
Information Sciences: an International Journal
Delay Tolerant Payload Conditioning protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The Delay Tolerant Networking (DTN) architecture approaches the problem of reliable message delivery in intermittent networks using a store-and-forward approach where messages may remain stored for relatively long periods of time in persistent storage at DTN routers. Forwarded messages are removed from persistent storage only when transfer acknowledgment to another router or final recipient is received. Congestion in such networks takes the form of persistent storage exhaustion. Several solutions exist including slowing sources, using alternative routes, discarding traffic, or migrating messages to alternative storage locations. We propose storage routing (SR), a congestion management solution of the last form. SR employs nearby nodes with available storage to store data that would otherwise be lost given uncontrollable data sources (such as sensors). SR determines a collection of messages and neighbors to migrate them to using a set of locally scoped distributed algorithms, possibly incorporating loops that are known to be optimal for some DTN routing scenarios and decouples storage management from global DTN route selection. Simulations show up to a 500 per cent performance improvement using SR as compared with a comparable scenario lacking SR. Furthermore, we show a desirable parameter insensitivity to node storage capacity, neighborhood search radius, and message lifetime. Copyright © 2007 John Wiley & Sons, Ltd.