An epidemic model for information diffusion in MANETs
MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
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
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Designing mobility models based on social network theory
ACM SIGMOBILE Mobile Computing and Communications Review
ACM SIGMOBILE Mobile Computing and Communications Review
Haggle: seamless networking for mobile applications
UbiComp '07 Proceedings of the 9th international conference on Ubiquitous computing
Exploiting social interactions in mobile systems
UbiComp '07 Proceedings of the 9th international conference on Ubiquitous computing
Delay tolerant mobile networks (DTMNs): controlled flooding in sparse mobile networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Location based information storage and dissemination in vehicular ad hoc networks
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.00 |
Opportunistic communications have been extensively studied in the last few years, with special emphasis on the optimal trade-offs between the resources needed to operate such systems and the performance experienced by the end-users. We focus in this work on application scenarios, in which users exploit opportunistic communications to exchange and diffuse data of potential interest. We assume a data-centric architecture, in which users would like to receive messages whose content matches a set of interests they expressed. We propose a data diffusion scheme based on the combination of two features: (i) interest-driven one-hop data exchange (upon a transmission opportunity, a node requests data matching a set of interests) (ii) neighbourhood-based data conveyance (each node maintains a list of the most interesting contents for its nearest neighbours and looks actively for such kind of data). An algorithmic solution is proposed, together with a protocol implementing it. The performance of the proposed scheme is evaluated by simulating the data diffusion process, exploiting contact traces and interests lists gathered through real-life experiments.