Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
ISWC '01 Proceedings of the 5th IEEE International Symposium on Wearable Computers
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
Modeling epidemic information dissemination on mobile devices with finite buffers
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Delay/disruption tolerant mobile ad hoc networks: latest developments: Research Articles
Wireless Communications & Mobile Computing - Wireless Ad Hoc and Sensor Networks
Enhancing interactive web applications in hybrid networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Characterizing podcast services: publishing, usage, and dissemination
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
The age of impatience: optimal replication schemes for opportunistic networks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A prsimonious model of mobile partitioned networks with clustering
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Adaptive Randomized Epidemic Routing for Disruption Tolerant Networks
MSN '09 Proceedings of the 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
Replication routing in DTNs: a resource allocation approach
IEEE/ACM Transactions on Networking (TON)
Optimal channel choice for collaborative ad-hoc dissemination
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Communications Surveys & Tutorials
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Distributed caching over heterogeneous mobile networks
Queueing Systems: Theory and Applications
Proceedings of the 22nd international conference on World Wide Web companion
Hi-index | 0.00 |
We consider the problem of delivering information streams to interested mobile users, leveraging both access to the infrastructure and device-to-device data transfers. The goal is to design practical relaying algorithms that aim at optimizing a global system objective that accounts for two important aspects: first, the user interest in content with respect to its type and delivery time; and, second, resource constraints such as storage and transmission costs. We first examine a set of real-world datasets reporting contacts between users moving in relatively restricted geographic areas (e.g. a city). These datasets provide evidence that significant performance gains can be achieved by extending the information dissemination from one to two hops, and that using longer paths only brings marginal benefits. We also show that correlation of delays through different paths is typically significant, thus asking for system design that would allow for general user mobility. We then propose a class of relaying strategies (referred to as SCOOP) that aim at optimizing a global system objective, are fully decentralized, require only locally observable states by individual devices, and allow for general user mobility. These properties characterize a practical scheme whose efficiency is evaluated using real-world mobility traces.