Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Alternative custodians for congestion control in delay tolerant networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Haggle: a data-centric network architecture for mobile devices
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
An optimal joint scheduling and drop policy for Delay Tolerant Networks
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Congestion management in delay tolerant networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Making the most of your contacts: transfer ordering in data-centric opportunistic networks
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
Twitter in disaster mode: opportunistic communication and distribution of sensor data in emergencies
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
| Hi-index | 0.01 |
In order to achieve data delivery in an opportunistic network, data is replicated when it is transmitted to nodes within communication reach and that are likely to be able to forward it closer to the destination. This replication and the unpredictable contact times due to mobility necessitate buffer management strategies to avoid buffer overflow on nodes. In this paper, we investigate buffer management strategies based on local forwarding statistics and relevance of the data for other nodes. The results obtained on our emulation platform for opportunistic networks show that strategies with a high data refresh rate achieve the most efficient delivery and generate the smallest overhead on our community and mobility scenarios.