Resilient Connectivity: Leveraging Pocket Switched Networks for Post-Disaster Communication

Authors

  • Ratna R. Sarkar Department of CSE. Jahangirnagar University Savar, Bangladesh
  • Amitabha Chakrabarty Department of CSE. BRAC University Dhaka,Bangladesh
  • Mohammad Zahidur Rahman Department of CSE. Jahangirnagar University Savar, Bangladesh

Keywords:

PSN, DTN, Mobility pattern, Communication, Post-Disaster

Abstract

The Pocket Switched Network (PSN) serves as a communication paradigm suitable for scenarios where the conventional network infrastructure is either damaged or intermittently available. Positioned within the domain of Delay-Tolerant Networks (DTN), PSN operates without a fixed infrastructure and leverages human mobility patterns to determine optimal routing. Because of the damaged communication infrastructure, this communication concept finds practical application in areas affected by natural catastrophes. In this research, a thorough analysis of several routing algorithms used in Pocket Switched Networks (PSN) is conducted. It also presents a paradigm based on PSN concepts that is intended to support resilient communication in post-disaster situations.

Downloads

Download data is not yet available.

References

Xie, F., Yuan, H., Ning, Y., Ong, M.E.H., Feng, M., Hsu, W., Chakraborty, B. and Liu, N., 2022. Deep learning for temporal data representation in electronic health records: A systematic review of challenges and methodologies. Journal of biomedical informatics, 126, p.103980.

Fall, K. (2003) A Delay-Tolerant Network Architecture for Challenged Internets. SIGCOMM’03, Karlsruhe, 25-29 August 2003, 27-34.

Wang, S., Liu, M., Cheng, X. and Song, M. (2012) Routing in Pocket Switched Networks. IEEE Wireless Communications.

Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R. and Scott, J. (2006) Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms. IEEE Transactions on Mobile Computing, 6, 606-620.

Mtibaa, A., Chaintreau, A. and Diot, C. (2007) Popularity of Nodes in Pocket Switched Networks. Proceedings of the ACM SIGCOMM, Kyoto, 27-31 August 2007.

Erramilli, V., Chaintreau, A., Crovella, M. and Diot, C. (2007) Diversity of Forwarding Paths in Pocket Switched Networks. Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, San Diego, 24-26 October 2007, 161-174.

Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Richard, G. and James, J. (2005) Pocket Switched Networks: Real-World Mobility and Its Consequences for Opportunistic Forwarding. Technical Reports, University of Cambridge, Cambridge.

Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J. and Diot, C. (2005) Pocket Switched Networks and Human Mobility in Conference Environments. Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Net-working, Philadelphia, 22-26 August 2005, 244-251.

Hui P, Chaintreau A, Gass R, et al. Pocket switched networking: challenges, feasibility and implementation issues[C]. In: Proceedings of the Second international IFIP conference on Autonomic Communication. Springer- Verlag, 2005. 1-12.

Mangrulkar, R.S. and Atique, M. (2011) Performance Evaluation of Flooding Based Delay Tolerant Routing Protocols. Proceedings of the National Conference on Emerging Trends in Computer Science and Information Technology (ETCSIT), Punjab, 25-26 February 2011, 35-40. .

T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Single-copy routing in intermittently connected mobile networks,” In 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, pp. 235 – 244, 2004.

Vahdat, A. and Becker, D. (2000) Epidemic Routing for Partially Connected Ad Hoc Networks. Technical Report, Duke University, Durham.

Haas, Z.J. and Small, T. (2006) A New Networking Model for Biological Applications of Ad Hoc Sensor Networks.IEEE/ACM Transactions on Networking, 14, 27-40.

Zhang, X., Neglia, G., Kurose, J.F. and Towsley, D.F. (2007) Performance Modeling of Epidemic Routing. Computer Networks, 51, 2867-2891.

Jones, E.P.C. and Ward, P.A.C. (2006) Routing Strategies for Delay-Tolerant Networks. ACM Computer Communication Review (CCR).

Spyropoulos, T., Psounis, K. and Raghavendra, C.S. (2005) Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, ACM Press, New York, 252-259

Lindgren, A., Doria, A. and Schelen, O. (2004) Probabilistic Routing in Intermittently Connected Networks. Proceedings of the Workshop on Service Assurance with Partial and Intermittent Resources, Fortaleza, 1-6 August 2004, 239- 254.

Boudguig, M. and Abdali, A. (2013) New DTN Routing Algorithm. IJCSI International Journal of Computer Science Issues, 10, 82-87.

Burgess, J., Gallagher, B., Jensen, D. and Levine, B.N. (2006) MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. Proceedings of the 25th IEEE International Conference on Computer Communications, Barcelona, 23-29 April 2006, 1-11..

Guo, X.F. and Chan, M.C. (2013) Plankton: An Efficient DTN Routing Algorithm. Proceedings of the 10th Annual IEEE International Conference on Sensing, Communications and Networking (SECON), New Orleans, 24-27 June 2013, 550-558.

R. Barua, S. Shadman and A. Chakrabarty, "PNGP : A social relationship based routing algorithm for pocket switched network," 2016 19th International Conference on Computer and Information Technology (ICCIT), Dhaka, 2016, pp. 25-30.

Hui, P., Crowcroft, J. and Yoneki, E. (2008) Bubble Rap: Social-Based Forwarding in Delay Tolerant Networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, ACM Press, New York, 241-250

Gamit, V., Patel, M. H. Evaluation of DTN Routing Protocols.

Hui, P., Crowcroft, J., Yoneki, E.Bubblerap.Proceedings of the 9thACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc ’08).

Khan, S.K.A., Mondragon, R.J. and Tokarchuk, L.N. (2012) Lobby Influence: Opportunistic Forwarding Algorithm Based on Human Social Relationship Patterns. Proceedings of the 2012 IEEE International Conference on Pervasive Computing and Communications Workshops, Lugano, 19-23 March 2012, 211-216.

Rasul, K., Chowdhury, S., Makaroff, D. and Stanley, K.G. (2014) Community-Based Forwarding for Low-Capacity Pocket Switched Networks. In: Proceedings of the 17th ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, ACM Press, New York, 249-257

Sarkar, R., Rasul, K., Chakrabarty, A. Energy Efficient Routing (EER) Algorithm for Pocket Switched Network (2015), International Journal of Computer Science and Network(IJCSN),5,80-86

P. Hui and J. Crowcroft. How Small Labels Create Big Improvements . In PERCOM Workshops, pages 65-70, White Plains, NY, Mar. 2007.

V. D. Blondel, J. Guillaume, R.Lambiotte, andE. Lefebvre. Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, 2008.

Blondel, V.D., Guillaume, J.L., Lambiotte, R. and Lefebvre, E. (2008) Fast Unfolding of Communities in Large Networks.Journal of Statistical Mechanics: Theory and Experiment, 2008, Article ID: P10008.

Bettstetter, C., Hartenstein, H. and Pérez-Costa, X. (2004) Stochastic Properties of the Random Waypoint Mobility Model. Wireless Networks, 10, 555-567.

Royer, E.M., Melliar-Smith, P.M. and Moser, L.E. (2001) An Analysis of the Optimum Node Density for Ad Hoc Mo-bile Networks. Proceedings of the IEEE International Conference on Communication, 3, 857-861.

Bettstetter, C. and Wagner, C. (2002) The Spatial Node Distribution of the Random Waypoint Mobility Model. Pro-ceedings of the 1st German Workshop on Mobile Ad-Hoc Networks, Ulm, 25-26 March 2002, 41-58.

Lim, S., Yu, C. and Da, C.R. (2006) Clustered Mobility Model for Scale Free Wireless Networks. Proceedings of the 31st IEEE Conference on Local Computer Networks (LCN 2006), Tampa, 14-16 November 2006, 231-238.

S. Lim, C. Yu and C. R. Das, "Clustered Mobility Model for Scale-Free Wireless Networks," Proceedings. 2006 31st IEEE Conference on Local Computer Networks, Tampa, FL, 2006, pp. 231-238.

A. L. Barabasi and E. Bonabeau, Scale-free networks. Scientific American, 288 (50-59), 2003.

G. Bigwood, D. Rehunathan, M.Bateman, T. Henderson, and S. Bhatti. CRAWDAD data set st andrews/sassy (v. 2011-06-03). Downloaded from http://crawdad.org/st andrews/sassy, June 2011.

J. Y. Yu and P. H. J. Chong, "A survey of clustering schemes for mobile ad hoc networks," 32-48, 2005.

Downloads

Published

24.03.2024

How to Cite

Sarkar, R. R. ., Chakrabarty, A. ., & Rahman, M. Z. . (2024). Resilient Connectivity: Leveraging Pocket Switched Networks for Post-Disaster Communication. International Journal of Intelligent Systems and Applications in Engineering, 12(20s), 293–300. Retrieved from https://ijisae.org/index.php/IJISAE/article/view/5141

Issue

Vol. 12 No. 20s (2024)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.

IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.