Abstract
Due to the mobility, limited radio range and low density of mobile devices, the mobile ad-hoc and sensor networks are vulnerable to be partitioned into a group of clusters. In our work, we propose using a set of messengers (called pigeons) that relay messages among clusters. Each cluster in networks owns multiple dedicated pigeons moving around the plane to deliver messages to their destinations. We name this form as homing-pigeon (HoP) based messaging scheme. The proposed scheme is different from the preceding work such as Message Ferry and Data Mules that it is a dedicated messenger scheme. Our goal is to exploit an optimized pigeon scheduling algorithm that can promote cooperation among multi-pigeons, enhance the system performance and reduce the cost. Using simulations, we evaluate the algorithms under different scenarios. The results can be used for better understanding the impact of algorithms on system performance.
The work was funded in part by NSF grant CNS-0832000 and the Mordecai Wyatt Johnson Program at Howard University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fall, K.: A Delay-Tolerant Network Architecture for Challenged Internets. In: ACM SIGCOMM, Karlsruhe, Germany (August 2003)
Jain, S., Fall, K., Patra, R.: Routing in a Delay Tolerant Network. In: ACM SIGCOMM, Portland, OR, USA (August 2004)
Vahdat, A., Becker, D.: Epidemic Routing for Partially Connected Ad hoc Networks. Technical Report CS-200006, Duke University (April 2000)
Lindgren, Doria, A., Schelen, O.: Probabilistic Routing in Intermittently Connected Networks. In: 1st International Workshop on Service Assurance with Partial and Intermittent Resources (August 2004)
Spyropoulos, T., Psounis, K., Raghavendra, C.: Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In: 1st Sigcomm workshop on WDTN (2005)
Zhao, W., Ammar, M., Zegura, E.: Controlling the Mobility of Multiple Data Transport Ferries in a Delay-tolerant Network. In: IEEE Infocom (2005)
Shah, R.C., Roy, S., Jain, S., et al.: Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks. In: IEEE International Workshop on Sensor Network Protocols and Applications (May 2003)
Guo, H., Li, J., Washington, N.A., et al.: Performance Analysis of Homing Pigeon based Delay Tolerant Networks. In: IEEE MILCOM 2007, Orlando, Florida (October 2007)
Bentley, J.: Fast Algorithms for Geometric Traveling Salesman Problems. ORSA Journal on Computing 4, 387–411 (1992)
OPNET Technologies, Inc., http://www.opnet.com/
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B 26(1), 29–41 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, H., Li, J., Qian, Y. (2008). HoP: Pigeon-Assisted Forwarding in Partitioned Wireless Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)