Survey on Routing in Pocket Switched Network

Abstract

Pocket switched Network (PSN) is an emerging research magnet that has been attracting researchers. This paper provides an introduction to PSN and covers some of its basic features and challenges. Continuous connectivity is difficult in infrastructure independent communication. In this paper, we will see how PSN provides an effective alternative. We also explain some routing protocols that can be incorporated for effective data forwarding. This paper also discusses possible applications and areas where PSN can be effectively used and some ideas that may foster future research in PSN routing.

Share and Cite:

Sarkar, R. , Rasul, K. and Chakrabarty, A. (2015) Survey on Routing in Pocket Switched Network. Wireless Sensor Network, 7, 113-128. doi: 10.4236/wsn.2015.79010.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] Fall, K. (2003) A Delay-Tolerant Network Architecture for Challenged Internets. SIGCOMM’03, Karlsruhe, 25-29 August 2003, 27-34.
[2] Hossmann, T., Spyropoulos, T.T. and Legendre, F. (2011) Putting Contacts into Context: Mobility Modeling beyond Inter-Contact Times. Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing, Paris, 16-19 May 2011, Article No. 18.
http://dx.doi.org/10.1145/2107502.2107526
[3] Wang, S., Liu, M., Cheng, X. and Song, M. (2012) Routing in Pocket Switched Networks. IEEE Wireless Communications.
[4] 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.
[5] 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.
[6] 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.
http://dx.doi.org/10.1145/1298306.1298330
[7] 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.
[8] 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 Networking, Philadelphia, 22-26 August 2005, 244-251.
http://dx.doi.org/10.1145/1080139.1080142
[9] Kaur, Er.U. and Kaur, Er.H. (2009) Routing Techniques for Opportunistic Networks and Security Issues. National Conference on Computing, Communication and Control (CCC-09), 2009, 155-161.
[10] Bettstetter, C., Hartenstein, H. and Pérez-Costa, X. (2004) Stochastic Properties of the Random Waypoint Mobility Model. Wireless Networks, 10, 555-567.
http://dx.doi.org/10.1023/B:WINE.0000036458.88990.e5
[11] Royer, E.M., Melliar-Smith, P.M. and Moser, L.E. (2001) An Analysis of the Optimum Node Density for Ad Hoc Mobile Networks. Proceedings of the IEEE International Conference on Communication, 3, 857-861.
[12] Bettstetter, C. and Wagner, C. (2002) The Spatial Node Distribution of the Random Waypoint Mobility Model. Proceedings of the 1st German Workshop on Mobile Ad-Hoc Networks, Ulm, 25-26 March 2002, 41-58.
[13] Aschenbruck, N., Gerhards-Padilla, E. and Martini, P. (2008) A Survey on Mobility Models for Performance Analysis in Tactical Mobile Networks. Journal of Telecommunications and Information Technology, 2, 54-61.
[14] Universal Mobile Telecommunications System (UMTS) (2010) Selection Procedures for the Choice of Radio Transmission Technologies of the UMTS (UMTS 30.03 Version 3.2.0). European Telecommunications Standards Institute (ETSI) TR 101 112 V3.2.0 (1998-04M).
[15] Jardosh, A., Belding-Royer, E.M., Almeroth, K.C. and Suri, S. (2003) Towards Realistic Mobility Models for Mobile Ad Hoc Networks. Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, San Diego, 14-19 September 2003, 217-229.
http://dx.doi.org/10.1145/938985.939008
[16] Jardosh, A.P., Belding-Royer, E.M., Almeroth, K.C. and Suri, S. (2005) Real world environment models for mobile network evaluation”, IEEE Journal on Selected Areas in Communications, 23, 622-632.
[17] Hong, X., Gerla, M., Pei, G. and Chiang, C.-C. (1999) A Group Mobility Model for Ad Hoc Wireless Networks. Proceedings of the 2nd ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Seattle, 20 August 1999, 53-60.
[18] 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.
[19] Liang, B. and Haas, Z.J. (2003) Predictive Distance-Based Mobility Management for Multidimensional PCS Networks. IEEE/ACM Transactions on Networking, 11, 718-732.
http://dx.doi.org/10.1109/TNET.2003.815301
[20] Bettstetter, C. (2001) Mobility Modeling in Wireless Networks: Categorization, Smooth Movement, and Border Effects. ACM SIGMOBILE Mobile Computing and Communications Review, 5, 55-66.
http://dx.doi.org/10.1145/584051.584056
[21] Bettstetter, C. (2001) Smooth Is Better than Sharp: A Random Mobility Model for Simulation of Wireless Networks. In: Proceedings of the 4th ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, ACM Press, New York, 19-27.
http://dx.doi.org/10.1145/381591.381600
[22] Bittner, S., Raffel, W.-U. and Scholz, M. (2005) The Area Graph-Based Mobility Model and Its Impact on Data Dissemination. Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops, Kauai Island, 8-12 March 2005, 268-272.
http://dx.doi.org/10.1109/percomw.2005.79
[23] Musolesi, M., Hailes, S. and Mascolo, C. (2004) An Ad Hoc Mobility Model Founded on Social Network Theory. In: Proceedings of the 7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, ACM Press, New York, 20-24.
http://dx.doi.org/10.1145/1023663.1023669
[24] Musolesi, M. and Mascolo, C. (2006) A Community Based Mobility Model for Ad Hoc Network Research. In: Proceedings of the Second International Workshop on Multi-Hop Ad Hoc Networks: From Theory to Reality, ACM Press, New York, 31-38.
http://dx.doi.org/10.1145/1132983.1132990
[25] Pelusi, L., Passarella, A. and Conti, M. (2006) Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad Hoc Networks. IEEE Communications Magazine, 44, 134-141.
http://dx.doi.org/10.1109/MCOM.2006.248176
[26] Huang, C.M., Lan, K.C. and Tsai, C.Z. (2008) A Survey of Opportunistic Networks. Proceedings of the 22nd International Conference on Advanced Information Networking and Applications-Workshops, Okinawa, 25-28 March 2008, 1672-1677.
http://dx.doi.org/10.1109/waina.2008.292
[27] Lilien, L., Gupta, A. and Yang, Z. (2007) Opportunistic Networks for Emergency Applications and Their Standard Implementation Framework. Proceedings of the First International Workshop on Next Generation Networks for First Responders and Critical Infrastructure, New Orleans, 11-13 April 2007, 588-593.
[28] Girvan, M. and Newman, M.E.J. (2002) Community Structure in Social and Biological Networks. Proceedings of the National Academy of Sciences of the United States of America, 99, 7821-7826.
http://dx.doi.org/10.1073/pnas.122653799
[29] Nguyen, A.-D., Senac, P. and Diaz, M. (2012) Understanding and Modeling the Small-World Phenomenon in Dynamic Networks. Proceedings of the 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, Paphos, 21-25 October 2012, 377.
http://dx.doi.org/10.1145/2387238.2387301
[30] Nguyen, A.D., Senac, P. and Diaz, M. (2013) How Disorder Impacts Routing in Human-Centric Disruption Tolerant Networks. Proceedings of the ACM SIGCOMM, Hong Kong, 12-16 August 2013, 47-52.
[31] Hui, P., Chaintreau, A., Gass, R., Scott, J., Crowcroft, J. and Diot, C. (2005) Pocket Switched Networking: Challenges, Feasibility, and Implementation Issues. Proceedings of the Second International IFIP Workshop, WAC 2005, Athens, 2-5 October 2005, 1-12.
[32] Rasul, K., Nuerie, N. and Pathan, A.K. (2010) An Enhanced Tree-Based Key Management Scheme for Secure Communication in Wireless Sensor Network. Proceedings of the 3rd IEEE International Workshop on Internet and Distributed Computing Systems, Melbourne, 1-3 September 2010, 671-676.
[33] 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.
[34] Breve, F., Zhao, L. and Quiles, M. (2009) Uncovering Overlap Community Structure in Complex Networks Using Particle Competition. In: Deng, H., et al., Eds., AICI 2009, LNAI 5855, 619-628.
[35] Hui, P. and Crowcroft, J. (2007) How Small Labels Create Big Improvements. Proceedings of the Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, White Plains, 19-23 March 2007, 65-70.
http://dx.doi.org/10.1109/percomw.2007.55
[36] Pentland, A., Fletcher, R. and Hasson, A. (2004) DakNet: Rethinking Connectivity in Developing Nations. IEEE Computer, 37, 78-83.
http://dx.doi.org/10.1109/MC.2004.1260729
[37] Uddin, M.Y.S., Nicol, D.M., Abdelzaher, T.F. and Kravets, R.H. (2009) A Post-Disaster Mobility Model for Delay Tolerant Networking. Proceedings of the Winter Simulation Conference, Austin, 13-16 December 2009, 2785-2796.
[38] Wasserman, S. and Faust, K. (1994) Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge.
http://dx.doi.org/10.1017/CBO9780511815478
[39] Hashemian, M., Stanley, K. and Osgood, N. (2010) Flunet: Automated Tracking of Contacts during Flu Season. Proceedings of the 6th International Workshop on Wireless Network Measurements, Avignon, 31 May-4 June 2010, 348- 353.
[40] Blondel, V.D., Guillaume, J.-L., Lambiotte, R. and Lefebvre, E. (2008) Fast Unfolding of Community Hierarchies in Large Networks. Journal of Statistical Mechanics: Theory and Experiment, 2008, Article ID: P10008.
http://dx.doi.org/10.1088/1742-5468/2008/10/P10008
[41] Satuluri, V., Parthasarathy, S. and Ruan, Y. (2011) Local Graph Sparsification for Scalable Clustering. In: Proceedings of the 2011 International Conference on Management of Data, ACM Press, New York, 721-732.
http://dx.doi.org/10.1145/1989323.1989399
[42] Grier, C., Thomas, K., Paxson, V. and Zhang, M. (2010) @Spam: The Underground on 140 Characters or Less. In: Proceeding of the 17th ACM Conference on Computer and Communications Security, ACM Press, New York, 27-37.
http://dx.doi.org/10.1145/1866307.1866311
[43] Vahdat, A. and Becker, D. (2000) Epidemic Routing for Partially Connected Ad Hoc Networks. Technical Report, Duke University, Durham.
[44] 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.
http://dx.doi.org/10.1109/TNET.2005.863461
[45] Zhang, X., Neglia, G., Kurose, J.F. and Towsley, D.F. (2007) Performance Modeling of Epidemic Routing. Computer Networks, 51, 2867-2891.
http://dx.doi.org/10.1016/j.comnet.2006.11.028
[46] Jones, E.P.C. and Ward, P.A.C. (2006) Routing Strategies for Delay-Tolerant Networks. ACM Computer Communication Review (CCR).
[47] 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.
[48] 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.
[49] 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.
[50] Boudguig, M. and Abdali, A. (2013) New DTN Routing Algorithm. IJCSI International Journal of Computer Science Issues, 10, 82-87.
[51] 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.
[52] 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.
[53] Musolesi, M. and Mascolo, C. (2009) CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks. IEEE Transactions on Mobile Computing, 8, 246-260.
http://dx.doi.org/10.1109/TMC.2008.107
[54] Kalman, R.E. (1960) A New Approach to Linear Filtering and Prediction Problems. Journal of Basic Engineering, 82, 34-45.
http://dx.doi.org/10.1115/1.3662552
[55] Keeney, R.L. and Raiffa, H. (1976) Decisions with Multiple Objectives: Preference and Value Tradeoffs. John Wiley & Sons, New York.
[56] Mtibaa, A., Chaintreau, A. and Diot, C. (2008) Are You Moved by Your Social Network Application? In: Proceedings of the First ACM SIGCOMM Workshop on Online Social Network, ACM Press, New York, 67-72.
http://dx.doi.org/10.1145/1397735.1397751
[57] 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.
http://dx.doi.org/10.1145/1374618.1374652
[58] 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.
http://dx.doi.org/10.1109/percomw.2012.6197482
[59] 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.
http://dx.doi.org/10.1145/2641798.2641801
[60] Daly, E. and Haahr, M. (2007) 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, ACM Press, New York, 32-40.
[61] Bayir, M.A. and Demirbas, M. (2010) PRO: A Profile-Based Routing Protocol for Pocket Switched Networks. Proceedings of the Global Telecommunications Conference, Miami, 6-10 December 2010, 1-5.
[62] Miao, J., Hasan, O., Mokhtar, S.B. and Brunie, L. (2012) A Self-Regulating Protocol for Efficient Routing in Mobile Delay Tolerant Networks. Proceedings of the 6th IEEE International Conference on Digital Ecosystems Technologies (DEST), Campione d’Italia, 18-20 June 2012, 1-6.
[63] Mei, A., Morabito, G., Santi, P. and Stefa, J. (2011) Social-Aware Stateless Forwarding in Pocket Switched Networks. Proceedings of the IEEE INFOCOM, Shanghai, 10-15 April 2011, 251-255.
http://dx.doi.org/10.1109/infcom.2011.5935076
[64] Bulut, E. and Szymanski, B.K. (2010) Friendship Based Routing in Delay Tolerant Mobile Social Networks. Proceedings of the Global Telecommunications Conference, Miami, 6-10 December 2010, 1-5.
http://dx.doi.org/10.1109/glocom.2010.5683082
[65] Mtibaa, A. and Harras, K.A. (2011) Social Forwarding in Large Scale Network: Insights Based on Real Trace Analysis. Proceedings of the 20th International Conference on Computer Communications and Networks (ICCCN), Maui, 31 July-4 August 2011, 1-8.
http://dx.doi.org/10.1109/icccn.2011.6005907

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.