Fragmentation considered harmful
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Dynamic packet fragmentation for wireless channels with failures
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Message fragmentation in opportunistic DTNs
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
File fragmentation over an unreliable channel
INFOCOM'10 Proceedings of the 29th conference on Information communications
Resource-aware capacity evaluation for heterogeneous, disruption-tolerant networks
Proceedings of the 9th Asian Internet Engineering Conference
| Hi-index | 0.24 |
In this paper we show how the problem of in-time transmission of fragmented messages in disrupted networks can be solved in the simplest case of transmission over a single disrupted link. To this end, we: (1) classify fragmentation algorithms based on the knowledge available at the sending node and design example algorithms in each class; and (2) compare the performance of four fragmentation algorithms in six simulated environments.