Abstract
Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN). The aim of this paper is to explore highly efficient dynamic scheduling strategies of pigeons for such applications. The upper bound of traffic that can be supported under the deadline constraints for the basic on-demand strategy is given through the analysis. Based on the analysis, a waiting based packing strategy is introduced. Although the latter strategy could not change the maximum traffic rate that a pigeon can support, it improves the efficiency of the pigeon largely. The analytical results are verified by the simulations.
The work was funded in part by NSF grant CNS-0832000 and the Mordecai Wyatt Johnson Program of Howard University.
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
Guo, H., Li, J., Qian, Y.: HoP: Pigeon-Assisted Forwarding in Partitioned Wireless Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol. 5258, pp. 72–83. Springer, Heidelberg (2008)
Guo, H., Li, J., Qian, Y., Tian, Y.: A practical routing strategy in delay tolerant networks using multiple pigeons. In: Proceedings of Milcom 2008, San Diego, CA, November 17-19 (2008)
Psaraftis, H.N.: Dynamic vehicle routing problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicle routing: Methods and studies, pp. 223–248. North Holland, Amsterdam (1988)
Psaraftis, H.N.: Dynamic vehicle routing: Status and prospects. Annals of Operations Research 61(1), 143–164 (1995)
Larsen, A.: The Dynamic Vehicle Routing Problem. Dissertation, Technical University of Denmark (2000)
Bertsimas, D., van Ryzin, G.: A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operation Researches 39, 601–615 (1991)
Bertsimas, D., Ryzin, G.: Stochastic and Dynamic Vehicle Routing with General Demand and Interarrival Time Distribution. Advanced Applied Probability 25, 947–978 (1993)
Swihart, M., Papastavrou, J.: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. European Journal of Operational Research 114(3), 447–464 (1999)
Beardwood, J., Halton, J., Hammersley, J.: The shortest path through many points. Proc. Camb. Phil. Soc. 55, 299–327 (1959)
Johnson, D.: Presented at the Mathematical Programming Symposium, Tokyo (1988)
Mesquite Software, Inc.: CSIM19 User’s Guide, Austin, Texas (2001)
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
Zhou, J., Li, J., Burge, L. (2009). Dynamic Scheduling of Pigeons for Delay Constrained Applications. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)