Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Efficient Peer-to-Peer Data Dissemination in Mobile Ad-Hoc Networks
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Co-operative Downloading in Vehicular Ad-Hoc Wireless Networks
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Perfect Simulations for Random Trip Mobility Models
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
A community based mobility model for ad hoc network research
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Bluetooth content distribution stations on public transit
MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
BlueTorrent: Cooperative Content Sharing for Bluetooth Users
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
Youtube traffic characterization: a view from the edge
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
Media sharing based on colocation prediction in urban transport
Proceedings of the 14th ACM international conference on Mobile computing and networking
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
Opportunistic forwarding in workplaces
Proceedings of the 2nd ACM workshop on Online social networks
Toward network coding-based protocols for data broadcasting in wireless ad hoc networks
IEEE Transactions on Wireless Communications
P2P content sharing in spontaneous multi-hop wireless networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
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
A Survey of BitTorrent Performance
IEEE Communications Surveys & Tutorials
Hi-index | 0.24 |
A common assumption in intermittently-connected (or opportunistic) mobile networks is that any contact has enough capacity to transfer the required amount of data. Although such an assumption is reasonable for analytical purposes and when contents are small, it does not hold anymore when users produce contents that are larger than the capacity of a contact. In such a case, users must slice data and send fragments separately, which allows better use of short contacts and progressive dissemination of large contents data pieces. The main question here is to design the best strategy for deciding which piece(s) to transmit whenever nodes meet. In addition, although small pieces imply a better use of short contacts, they generate more overhead due to the headers required at each piece. In this paper, we investigate these two issues: piece size selection and piece selection strategy. First, we theoretically define the global goodput of the system that defines the tradeoff between the size of the shortest contact that can be considered as useful and piece overhead. Results from real-world traces show that, for reasonable header size, the piece size can be selected out of a large range of values without significantly impacting the results. Second, we present the design and evaluation of PACS (Prevalence-Aware Content Spreading), a completely distributed algorithm that selects pieces to transfer based on their popularity. We evaluate the performance of PACS using both synthetic and real traces from intermittently-connected networks. When compared with sequential and randomized solutions, we show that PACS significantly outperforms these approaches both in terms of latency to achieve full dissemination and ratio of effective contacts. Moreover, PACS achieves performance levels that are extremely close to a centralized oracle-based solution.