IR evaluation methods for retrieving highly relevant documents
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
TACO-DTN: a time-aware content-based dissemination system for delay tolerant networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
ContentPlace: social-aware data dissemination in opportunistic networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Peoplerank: social opportunistic forwarding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing in socially selfish delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A mobile peer-to-peer system for opportunistic content-centric networking
Proceedings of the second ACM SIGCOMM workshop on Networking, systems, and applications on mobile handhelds
Congestion avoidance in a data-centric opportunistic network
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
MobiTrade: trading content in disruption tolerant networks
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
Putting contacts into context: mobility modeling beyond inter-contact times
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
| Hi-index | 0.00 |
Opportunistic networks use unpredictable and time-limited contacts to disseminate data. Therefore, it is important that protocols transfer useful data when contacts do occur. Specifically, in a data-centric network, nodes benefit from receiving data relevant to their interests. To this end, we study five strategies to select and order the data to be exchanged during a limited contact, and measure their ability to promptly and efficiently deliver highly relevant data. Our trace-driven experiments on an emulation testbed suggest that nodes benefit in the short-term from ordering data transfers to satisfy local interests. However, this can lead to suboptimal long-term system performance. Restricting sharing based on matching nodes' interests can lead to segregation of the network, and limit useful dissemination of data. A non-local understanding of other nodes' interests is necessary to effectively move data across the network. If ordering of transfers for data relevance is not explicitly considered performance is comparable to random, which limits the delivery of individually relevant data.