Abstract
Pocket switched networks (PSNs) take advantage of human mobility to distribute data. Investigations on real-world trace data indicate that human mobility follows a simple reproducible pattern: a human being usually visits a few places at high frequencies. These most frequently visited places form the home of a node, which is exploited in this paper to design two HomE based ROuting (HERO) algorithms. In the basic HERO, the first encountered relay whose home contains the place where the destination resides is selected to deliver the data. The enhanced HERO, on the other hand, continuously selects a better relay that visits the destination place at a higher frequency. In both algorithms, each node only needs to maintain and exchange its relatively stable home information and/or the corresponding visiting frequencies; therefore no global networking information and no frequent information update are needed, resulting in a low burden on the network due to its low communication and storage overheads. Moreover, HERO involves only simple arithmetic operations, thus causing little computation overhead at the mobile nodes. The simulation results indicate that both HERO algorithms outperform the state-of-the art.
This work has been supported by the National Basic Research Program of China (No. 2011CB302702, No.2011CB302800), the Beijing Nova Program, the National Natural Science Foundation of China (No. 61120106008, No. 61132001, No. 61133015, No. 60803140, No. 60970133, No. 61070187, and No. 61003225), the National Science Foundation of the US (CNS-0831852), and the NPST program by King Saud University Project No. 10-INF1184-02.
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
Wang, S., Liu, M., Cheng, X., Song, M.: Routing in Pocket Switched Networks. IEEE Wireless Communications 19(2), 67–73 (2012)
Lindgren, A., Doria, A., Scheln, O.: Probabilistic routing in intermittently connected networks. In: MobiHoc, Annapolis Maryland, USA (2003)
Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: Age matters: efficient route discovery in mobile Ad hoc networks using encounter ages. In: MobiHoc, Annapolis, Maryland, USA (2003)
Spyropoulos, T., Turletti, T., Obraczka, K.: Routing in Delay-Tolerant Networks comprising heterogeneous node populations. IEEE Transactions on Mobile Computing 8(8), 1132–1147 (2009)
Gao, W., Cao, G.: On exploiting transient contact patterns for data forwarding in delay tolerant networks. In: ICNP, Kyotp, Japan (2010)
Jones, E., Li, L., Schmidtke, J., Ward, P.: Practical Routing in delay tolerant networks. IEEE Transactions on Mobile Computing 6(8), 943–959 (2007)
Burgess, J., Gallagher, B., Jensen, D., Levine, B.: MaxProp: routing for vehicle-based disruption-tolerant networks. In: INFOCOM, Piscataway, USA (2006)
Hui, P., Crowcroft, J., Yoneki, E.: BUBBBLE Rap: social-based forwarding in delay tolerant networks. In: MOBIHOC, Hong Kong, China (2008)
Daly, E., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: MOBIHOC, Montreal, CA (2007)
Dang, H., Wu, H.: Practical Clustering and cluster-based routing protocol for delay-tolerant mobile networks. IEEE Transactions on Wireless Communication 9(6), 1874–1881 (2010)
Liu, C., Wu, J.: Scalable routing in delay tolerant networks. In: MOBIHOC, Montreal, CA (2007)
Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: SIGCOMM, New York, USA (2004)
Conan, V., Leguay, J., Friedman, T.: Fixed point opportunistic routing in delay tolerant networks. IEEE Journal on Selected Areas in Communications 26(5), 773–781 (2008)
Gao, W., Li, Q., Zhao, B., Cao, G.: Multicasting in delay tolerant networks: a social network perspective. In: MOBIHOC, New Orleans, USA (2009)
Liu, C., Wu, J.: Routing in a cyclic Mobispace. In: MOBIHOC, Hong Kong, China (2008)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (2000)
Costa, P., Mascolo, C., Musolesi, M., Picco, G.: Socially-aware routing for publish-subscribe in delay-tolerant mobile Ad hoc networks. IEEE Journal on Selected Areas in Communications 26(5), 748–760 (2008)
Gao, W., Cao, G.: User-centric data dissenmination in disruption tolerant networks. In: INFOCOM, Shanghai, China (2011)
Alessandro Mei, A., Morabito, G., Santi, P., Stefa, J.: Social-aware stateless forwarding in pocket switched networks. In: INFOCOM, Shanghai, China (2011)
Leguay, J., Friedman, T., Conan, V.: Evaluating mobility pattern space routing for DTNs. In: INFOCOM, Barcelona, Catalunya, SPAIN (2006)
Balachandran, A., Voelker, M., Bahl, P., Rangan, P.: Characterizing user behavior and network performance in a public wireless LAN. In: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Marina Del Rey, California (2002)
Balazinska, M., Castro, P.: Characterizing mobility and network usage in a corporate wireless local-area network. In: MobiSys 2003, San Francisco, California (2003)
Henderson, T., Kotz, D., Abyzov, I., Yeo, J.: CRAWDAD trace set dartmouth/campus/movement (v.2005-03-08) (2005), http://crawdad.cs.dartmouth.edu/dartmouth/campus/movement
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, S., Liu, M., Cheng, X., Li, Z., Huang, J., Chen, B. (2012). HERO – A Home Based Routing in Pocket Switched Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)