• Source - Source nodes generate the content or fully structureless, at first phase of the experiment, and

take the initiative to send it across the network; partially structureless as an alternative if the delay was
• Relayer - Relayers are temporary content repos- found to be excessive.
itories. They move content across the network
until it reaches its destination. Relayers are a
very important peace of this engine, without them
content would have to be directly delivery by the
source, which could never happen.
• Destination - Destination nodes are the final
target in the dissemination process.
We can classify dissemination methods according to
their spreading strategy in: Broadcasting and Multicas-
ting.
Fig. 2. One-to-many multicasting

B. Many to Many
Every node is capable of generating content and
spread it across the network, and the other side, nodes
also can declare interest for certain kind of content in
order to receive it. Although it seems similar to broad-
casting there is a slightly difference. Only those nodes
Fig. 1. Dissemination scopes in opportunistic networks: a) Full that has explicitly declared interest in the content will
dissemination and b) Limited dissemination
keep it, and the others will act only as relayers. Many-
to-Many multicasting has been used in user content
• Fully dissemination - sees every node as a
generation (UCG) [42] applications such as proposed
potential destination and propagate the content
by [43]. The authors proposes a user-generated pod-
indiscriminately. Fully dissemination can increase
casting where users can publish and generate content
the delivery probability, but may introduce un-
through content channels that indicates the interest of
necessary redundancy into the system, which may
each node.
lead to congestion [36], [37]. Thus, it should be
preferred in scenarios where there is a real need
that all nodes receive and keep a content copy.
• Limited dissemination - destination nodes are
chosen according to some criteria such as IP
number, MAC address, interest, profiles or po-
sition [38], [39]. Limited dissemination strongly
depends on the relayer nodes to move content
across the network until it reaches interested des-
tinations.
III. L IMITED DISSEMINATION STRATEGIES IN
Fig. 3. Many-to-many multicasting
OPPORTUNISTIC NETWORKS
A. One to Many
R EFERENCES
There is only one content source and many desti-
[1] A. Bujari, “A Survey of Opportunistic Data Gathering and Dis-
nations. This approach can be used to provide multi- semination Techniques,” 2012 21st International Conference
media streaming or news propagate systems. A news on Computer Communications and Networks (ICCCN), pp. 1–
system using DTN to spread an electronic version of a 6, Jul. 2012.
[2] C. Huang, K.-c. Lan, and C. Tsai, “A survey of opportunistic
newspaper in a urban area of a large city is proposed networks,” Advanced Information Networking . . . , pp. 1672–
in [40]. The authors used two network configurations, 1677, 2008.
 [3] T. Kathiravelu, “Towards content distribution in opportunistic
networks,” Ph.D. dissertation, UppSala University, 2007.
[4] C. Liu and J. Kaiser, “A survey of mobile ad hoc network
routing protocols,” University of Ulm, Ulm, Tech. Rep., 2003.
[5] S. Dimatteo, P. Hui, B. Han, and V. O. K. Li, “Cellular Traffic
Offloading through WiFi Networks,” 2013.
[6] Y. Go, Y. Moon, and K. Park, “Enabling DTN-based data
offloading in urban mobile network environments,” Proceed-
ings of the 7th International Conference on Future Internet
Technologies - CFI ’12, p. 48, 2012. [Online]. Available:
http://dl.acm.org/citation.cfm?doid=2377310.2377328
[7] B. Han, P. Hui, V. Kumar, and M. Marathe, “Cellular traffic of-
floading through opportunistic communications: a case study,”
Proceedings of the 5th . . . , pp. 31–38, 2010.
[8] I. Leontiadis, P. Costa, and C. Mascolo, “Persistent content-
based information dissemination in hybrid vehicular networks,”
2009 IEEE International Conference on Pervasive Computing
and Communications, pp. 1–10, Mar. 2009.
[9] S. Kapadia, “Data Delivery in Delay Tolerant Networks : A
Survey,” Mobile Ad-hoc Networks: . . . , 2011.
[10] T. Sarkar, Z. Ji, and K. Kim, “A survey of various propagation
models for mobile communication,” . . . and Propagation . . . ,
2003.
[11] Y. Zhu, B. Xu, X. Shi, Y. Wang, and S. Member, “A survey
of social-based routing in delay tolerant networks: positive
and negative social effects,” IEEE Communications Surveys &
Tutorials, pp. 1–15, 2012.
[12] A. Voyiatzis, “A Survey of Delay-and Disruption-Tolerant
Networking Applications,” Journal of Internet Engineering,
vol. 5, no. 1, pp. 331–344, 2012. [Online]. Available:
http://www.jie-online.org/index.php/jie/article/view/91/48
[13] Y. Chen and K. Schwan, “Opportunistic overlays: Efficient
content delivery in mobile ad hoc networks,” Middleware 2005,
2005.
[14] V. Kawadia, N. Riga, J. Opper, and D. Sampath, “Slinky: An
adaptive protocol for content access in disruption-tolerant ad
hoc networks,” . . . Mobile Ad Hoc Networking, 2011.
[15] W. Zhao, M. Ammar, and E. Zegura, “A message ferrying
approach for data delivery in sparse mobile ad hoc networks,”
in Proceedings of the 5th ACM international symposium on
Mobile ad hoc networking and computing. ACM, 2004, pp.
187–198.
[16] S. K. Agarwal, A. Kumar, A. A. Nanavati, and N. Rajput,
“Content creation and dissemination by-and-for users in rural
areas,” 2009 International Conference on Information and
Communication Technologies and Development (ICTD), pp.
56–65, Apr. 2009.
[17] N. Vastardis and K. Yang, “Mobile social networks: Ar-
chitectures, social properties, and key research challenges,”
Communications Surveys & Tutorials, IEEE, vol. 15, no. 3,
pp. 1355–1371, 2013.
[18] B. B. Chen and M. C. Chan, “MobiCent: a Credit-Based
Incentive System for Disruption Tolerant Network,” 2010 Pro-
ceedings IEEE INFOCOM, pp. 1–9, Mar. 2010.
[19] R. C. Shah, S. Roy, S. Jain, and W. Brunette, “Data mules:
Modeling and analysis of a three-tier architecture for sparse
sensor networks,” Ad Hoc Networks, vol. 1, no. 2, pp. 215–
233, 2003.
[20] A. J. Mashhadi, “Content dissemination in participatory de-
lay tolerant networks,” Ph.D. dissertation, University College
London, 2011.
[21] T. Camp, J. Boleng, and V. Davies, “A survey of mobility
models for ad hoc network research,” Wireless communications
and . . . , vol. 2, no. 5, pp. 483–502, 2002.
[22] S. Kapadia, B. Krishnamachari, and L. Zhang, “Data delivery
in delay tolerant networks: A survey,” Mobile Ad-hoc Net-
works: Protocol Design, pp. 565–578, 2011.
[23] G. Chen and D. Kotz, “A survey of context-aware mobile
computing research,” 2000.
[24] M. Liu, Y. Yang, and Z. Qin, “A survey of routing protocols
and simulations in delay-tolerant networks,” Wireless Algo-
rithms, Systems, and Applications, pp. 243–253, 2011.
[25] W. Wang and X. Li, “Low-cost routing in selfish and rational
wireless ad hoc networks,” Mobile Computing, IEEE Transac-
tions on, vol. 5, no. 5, pp. 596–607, 2006.
[26] A. Chaintreau, A. Mtibaa, L. Massoulie, and C. Diot, “The
diameter of opportunistic mobile networks,” Proceedings of the
2007 ACM CoNEXT conference on - CoNEXT ’07, p. 1, 2007.
[27] E. Jones and P. Ward, “Routing strategies for delay-tolerant
networks,” ACM Computer Communication Review (CCR),
2006.
[28] T. Hossmann, T. Spyropoulos, and F. Legendre, “Putting
contacts into context: Mobility modeling beyond inter-contact
times,” Proceedings of the Twelfth, 2011.
[29] A. Passarella, M. Conti, C. Boldrini, and R. I. Dunbar,
“Modelling inter-contact times in social pervasive networks,”
Proceedings of the 14th ACM international conference on
Modeling, analysis and simulation of wireless and mobile
systems - MSWiM ’11, p. 333, 2011.
[30] H. Zhu, L. Fu, G. Xue, Y. Zhu, M. Li, and L. M. Ni,
“Recognizing Exponential Inter-Contact Time in VANETs,”
2010 Proceedings IEEE INFOCOM, pp. 1–5, Mar. 2010.
[31] K. Balakrishnan, “TWOACK: preventing selfishness in mobile
ad hoc networks,” . . . and Networking . . . , pp. 2137–2142,
2005.
[32] K. Komathy and P. Narayanasamy, “Study of Co-Operation
Selfish Neighbors in MANET under Evolutionary Game The-
oretic Model,” . . . and Networking, 2007. ICSCN’ . . . , pp. 133–
138, 2007.
[33] Y. Li, G. Su, D. Wu, and D. Jin, “The impact of node
selfishness on multicasting in delay tolerant networks,” . . . ,
IEEE Transactions on, vol. 60, no. 5, pp. 2224–2238, 2011.
[34] L. Yin, H.-m. Lu, Y.-d. Cao, and J.-m. Gao, “Cooperation in
delay tolerant networks,” 2010 2nd International Conference
on Signal Processing Systems, pp. V1–202–V1–205, Jul. 2010.
[35] A. Mashhadi, “Habit: Leveraging human mobility and social
network for efficient content dissemination in delay tolerant
networks,” . . . and Multimedia Networks . . . , 2009.
[36] A. Lindgren, A. Doria, and O. Schelén, “Probabilistic routing
in intermittently connected networks,” ACM SIGMOBILE
Mobile Computing . . . , vol. 7, no. 3, pp. 19–20, 2003.
[Online]. Available: http://dl.acm.org/citation.cfm?id=961272
[37] C. Liu and J. Wu, “An optimal probabilistic forwarding proto-
colin delay tolerant networks,” . . . international symposium on
Mobile ad hoc networking . . . , pp. 105–114, 2009.
[38] I. Solis and J. J. Garcia-Luna-Aceves, “Robust content dissem-
ination in disrupted environments,” Proceedings of the third
ACM workshop on Challenged networks - CHANTS ’08, p. 3,
2008.
[39] G. Karlsson, V. Lenders, and M. May, “Delay-tolerant broad-
casting,” IEEE Transactions on Broadcasting, vol. 53, no. 1,
pp. 369–381, Mar. 2007.
[40] T.-M. Pham and S. Fdida, “DTN support for news dissemina-
tion in an urban area,” Computer Networks, vol. 56, no. 9, pp.
2276–2291, Jun. 2012.
[41] P. Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and
Rubenstein, “Energy-efficient computing for wildlife tracking:
Design tradeoffs and early experiences with zebranet,” in ACM
 Sigplan Notices, vol. 37, no. 10, ACM. ACM Press, 2002,
pp. 96–107.
[42] A. Ghose and S. P. Han, “An empirical analysis of user
content generation and usage behavior on the mobile internet,”
Management Science, vol. 57, no. 9, pp. 1671–1691, 2011.
[43] L. Hu, L. Dittmann, and J.-Y. Le Boudec, “Reputation-based
content dissemination for user generated wireless podcasting,”
2009 IEEE Wireless Communications and Networking Confer-
ence, pp. 1–6, Apr. 2009.