Abstract
Delay Tolerant Networks (DTNs) are wireless networks in which end-to-end connectivity is sporadic. Routing in DTNs uses past connectivity information to predict future node meeting opportunities. Recent research efforts consider the use of social network analysis (i.e., node communities, centralities etc.) for this forecast. However, most of these works focus on unicast. We believe that group communication is the natural basis of most applications envisioned for DTNs. To this end, we study constrained *-cast (broad-, multi- and anycast) in DTNs. The constraint is on the number of copies of a message and the goal is to find the best relay nodes for those copies, that will provide a small delivery delay and a good coverage. After defining a solid probabilistic model for DTNs collecting social information, we prove a near-optimal policy for our constrained *-cast problems that minimizes the expected delivery delay. We verify it through simulation on both real and synthetic mobility traces.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adler, I., Oren, S., et al.: The coupon-collector’s problem revisited. J. Appl. Probab. 40(2), 513–518 (2003)
Aiello, W., Chung, F., et al.: A random graph model for massive graphs. In: STOC 2000, pp. 171–180. ACM, New York (2000)
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)
Altman, E., Başar, T., et al.: Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks. In: ValueTools 2008, pp. 1–13. ICST, Brussels (2008)
Boldrini, C., Conti, M., et al.: ContentPlace: social-aware data dissemination in opportunistic networks. In: MSWiM 2008, pp. 203–210. ACM Press, New York (2008)
Boneh, S., Papanicolaou, V.: General asymptotic estimates for the coupon collector problem. J. Comput. Appl. Math. 67(2), 277–289 (1996)
Borwein, J., Affleck, I., et al.: Convex? Convex! Convex II. SIAM: Problems and Solutions (2000)
Daly, E., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: MobiHoc 2007, pp. 32–40. ACM Press, New York (2007)
Dubois-Ferriere, H., Grossglauser, M., et al.: Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: MobiHoc 2003, pp. 257–266. ACM Press, New York (2003)
Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Personal Ubiquitous Comput. 10(4), 255–268 (2006)
Feller, W.: An introduction to probability theory and its applications, 2nd edn., vol. 2. John Wiley & Sons, Chichester (1957)
Flajolet, P., Gardy, D., et al.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Disc. Appl. Math. 39(3), 207–229 (1992)
Gao, W., Li, Q., et al.: Multicasting in delay tolerant networks: a social network perspective. In: MobiHoc 2009, pp. 299–308. ACM, New York (2009)
Hossmann, T., Legendre, F., et al.: From Contacts to Graphs: Pitfalls in Using Complex Network Analysis for DTN Routing. In: INFOCOM NetSciCom 2009, pp. 1–6 (2009)
Hui, P., Chaintreau, A., et al.: Pocket switched networks and human mobility in conference environments. In: SIGCOMM WDTN 2005, pp. 244–251. ACM, New York (2005)
Hui, P., Crowcroft, J., et al.: Bubble rap: social-based forwarding in delay tolerant networks. In: MobiHoc 2008, pp. 241–250. ACM Press, New York (2008)
Leguay, J., Friedman, T., et al.: Evaluating Mobility Pattern Space Routing for DTNs. In: INFOCOM 2006, pp. 1–10 (2006)
Lenders, V., Wagner, J., et al.: Measurements from an 802.11b Mobile Ad Hoc Network. In: WOWMOM 2006, pp. 519–524. IEEE Computer Society, Washington (2006)
Lindgren, A., Doria, A., et al.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19–20 (2003)
Mihail, M., Saberi, A., et al.: Random walks with lookahead on power law random graphs. Internet Math. 3(2), 147–152 (2006)
Nath, H.: Waiting Time in the Coupon-Collector’s Problem. Austr. & New Zeal. J. of Stat. 15(2), 132–135 (1973)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167 (2003)
Spyropoulos, T., Psounis, K., et al.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: SIGCOMM WDTN 2005, pp. 252–259. ACM Press, New York (2005)
van der Hofstad, R.: Random Graphs and Complex Networks (2009)
Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Communications Surveys & Tutorials 8(1), 24–37 (2007)
Zhao, W., Ammar, M., et al.: Multicasting in delay tolerant networks: semantic models and routing algorithms. In: SIGCOMM WDTN 2005, pp. 268–275. ACM, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Picu, A., Spyropoulos, T. (2010). Minimum Expected *-Cast Time in DTNs. In: Altman, E., Carrera, I., El-Azouzi, R., Hart, E., Hayel, Y. (eds) Bioinspired Models of Network, Information, and Computing Systems. BIONETICS 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 39. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12808-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-12808-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12807-3
Online ISBN: 978-3-642-12808-0
eBook Packages: Computer ScienceComputer Science (R0)