Abstract
Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possibly not shortest) paths instead of one fixed (greedy) path can decrease the expected time to deliver a packet on such a network by as much as 65 per cent depending on the probability that an edge exists in a given time interval. We provide theoretical justification for this result by studying a special case of the Markovian evolving grid graph. We analyze a natural algorithm for routing on such networks and show that it is possible to improve the expected time of delivery by up to a factor of two depending upon the probability of an edge being up during a time step and the relative positions of the source and destination. Furthermore we show that this is optimal, i.e., no other algorithm can achieve a better expected running time. As an aside, our results give high probability bounds for Knuth’s toilet paper problem [11].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Avin, C., Koucky, M., Lotker, Z.: How to Explore a Fast-Changing World. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121–132. Springer, Heidelberg (2008)
Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. International Journal of Foundations of Computer Science 14, 267–285 (2003)
Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In: Proceedings IEEE INFOCOM, pp. 1–11 (2006)
Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, pp. 32–40 (2007)
Duffy, K., Dukes, W.M.B.: On Knuth’s Generalisation of Banach’Match Box Problem. Mathematical Proceedings of the Royal Irish Academy 104(1), 107–118 (2004)
Ferreira, A.: Building a reference combinatorial model for manets. IEEE Network 18, 24–29 (2004)
Ferreira, A., Goldman, A., Monteiro, J., Ferreira, A.: On the Evaluation of Shortest Journeys in Dynamic Networks. In: Sixth IEEE International Symposium on Network Computing and Applications, 1007. NCA 2007, pp. 3–10 (2007)
Goldman, A., Monteiro, J., Ferreira, A.: Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model. In: Proceedings of WiMob, pp. 173–180 (2006)
Jarry, A., Lotker, Z.: Connectivity in evolving graph with geometric properties. In: Proceedings of the 2004 joint workshop on Foundations of mobile computing, pp. 24–30 (2004)
Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In: Proceedings of Mobicom, pp. 243–254 (2000)
Knuth, D.: The toilet paper problem. American Math Monthly 91(8), 365–370 (1984)
Lindgren, A., Doria, A., Schelen, O.: Probabilistic Routing in Intermittently Connected Networks. In: Proceedings of Workshop on Service Assurance with Partial and Intermittent Resources, pp. 239–254 (2004)
Liu, C., Wu, J.: Scalable routing in delay tolerant networks. In: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, pp. 51–60 (2007)
Mauldin, R.D. (ed.): The Scottish Book:Mathematics from the Scottish Cafe. Birkheuser (1981)
Merugu, S., Ammar, M.H., Zegura, E.W.: Routing in Space and Time in Networks with Predictable Mobility. Technical report, Georgia Institute of Technology, GIT-CC-04-07 (2004)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of SIGCOMM, pp. 252–259 (2005)
Stirzaker, D.: A generalization of the matchbox problem. Mathematical Scientist 13, 104–114 (1988)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Duke University (2000)
Walker, B.D., Glenn, J.K., Clancy, T.C.: Analysis of simple counting protocols for delay-tolerant networks. In: Proceedings of the second workshop on Challenged networks CHANTS, pp. 19–26 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keane, M., Kranakis, E., Krizanc, D., Narayanan, L. (2009). Routing on Delay Tolerant Sensor Networks. In: Dolev, S. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2009. Lecture Notes in Computer Science, vol 5804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05434-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-05434-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05433-4
Online ISBN: 978-3-642-05434-1
eBook Packages: Computer ScienceComputer Science (R0)