Modelling data dissemination in opportunistic networks

ABSTRACT

In opportunistic networks data dissemination is an important, although not widely explored, topic. Since opportunistic networks topologies are very challenged and unstable, data-centric approaches are an interesting direction to pursue. Data should be proactively and cooperatively disseminated from sources towards possibly interested receivers, as sources and receivers might not be aware of each other, and never get in touch directly. In this paper we consider a utility-based cooperative data dissemination system in which the utility of data is defined based on the social relationships between users. Specifically, we study the performance of this system through an analytical model. Our model allows us to completely characterise the data dissemination process, as it describes both its stationary and transient regimes. After validating the model, we study the system's behaviour with respect to key parameters such as the definition of the data utility function, the initial data allocation on nodes, the number of users in the system, and the data popularity.

REFERENCES

• 1: A. Balamash and M. Krunz. An overview of web caching replacement algorithms. IEEE Comm. Surv., 6(2):44--56, 2004.
• 2: Aruna Balasubramanian , Brian Levine , Arun Venkataramani, DTN routing as a resource allocation problem, Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, August 27-31, 2007, Kyoto, Japan
• 3: C. Boldrini, M. Conti, and A. Passarella. Context and resource awareness in opportunistic network data dissemination. In IEEE AOC, 2008.
• 4: C. Boldrini, M. Conti, and A. Passarella. Modelling data dissemination in opportunistic networks. Tech. Rep., IIT-CNR, http://cnd.iit.cnr.it/andrea/tr/model-dd-tr.pdf, 2008.
• 5: Roy Friedman , Daniela Gavidia , Luis Rodrigues , Aline Carneiro Viana , Spyros Voulgaris, Gossiping on MANETs: the beauty and the beast, ACM SIGOPS Operating Systems Review, v.41 n.5, October 2007 [doi>10.1145/1317379.1317390]
• 6: H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
• 7: Averill M. Law , W. David Kelton, Simulation Modeling and Analysis, McGraw-Hill Higher Education, 1997
• 8: V. Lenders, G. Karlsson, and M. May. Wireless Ad hoc Podcasting. In IEEE SECON, 2007.
• 9: L. Pelusi, A. Passarella, and M. Conti. Opportunistic Networking: data forwarding in disconnected mobile ad hoc networks. IEEE Comm. Magazine, 44(11), Nov. 2006.
• 10: Huaping Shen , Mohan Kumar , Sajal K. Das , Zhijun Wang, Energy-efficient data caching and prefetching for mobile devices based on utility, Mobile Networks and Applications, v.10 n.4, p.475-486, August 2005 [doi>10.1145/1160162.1160171]
• 11: Liangzhong Yin , Guohong Cao, Supporting Cooperative Caching in Ad Hoc Networks, IEEE Transactions on Mobile Computing, v.5 n.1, p.77-89, January 2006 [doi>10.1109/TMC.2006.15]
• 12: Eiko Yoneki , Pan Hui , ShuYan Chan , Jon Crowcroft, A socio-aware overlay for publish/subscribe communication in delay tolerant networks, Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems, October 22-26, 2007, Chania, Crete Island, Greece [doi>10.1145/1298126.1298166]
• 13: Wenrui Zhao , Mostafa Ammar , Ellen Zegura, Multicasting in delay tolerant networks: semantic models and routing algorithms, Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, p.268-275, August 26-26, 2005, Philadelphia, Pennsylvania, USA [doi>10.1145/1080139.1080145]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

General Terms:
Performance

Keywords:
data dissemination, modelling, opportunistic networks