Abstract
Compared with 3G, 4G and Wi-Fi, Delay-Tolerant Networking (DTN) can only have intermittent chance to transmit messages. Without a clear end-to-end path, routing a message in DTN to the destination is difficult. But in some particular case, it could be an advantage. People around the world have their personal habit and it will be projected on their social life. Therefore we use the social behavior as a foundation feature of our routing algorithm. We propose two new kinds of routing algorithms with our own trace file. On one hand, birds of a feather flock together, so people who have similar interests tend to go to the same places. In case of this, we combining the personal interests and the trace file to different buildings where each node locates, we propose the building-based routing algorithm. On the other hand, we think people who have similar interests hang out together more often, so we use the social relationship as a feature and propose social-based routing algorithm. In the end, we compare our algorithms with Epidemic, MaxProp and PRoPHET routing algorithms. The result shows that our algorithms outperform the others.
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
References
Tsai, T.-C., Chan, H.-H.: NCCU trace: social-network-aware mobility trace. Commun. Mag. IEEE 53, 144–149 (2015)
Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: routing for vehicle-based Disruption-Tolerant Networks. In: Proceedings of IEEE Infocom, April 2006
Lindgren, A., Doria, A., Schelen, O.: Probabilistic routing in intermittently connected networks. In: Dini, P., Lorenz, P., de Souza, J.N. (eds.) Service Assurance with Partial and Intermittent Resources (SAPIR 2004). LNCS, vol. 3126, pp. 239–254. Springer, New York (2004)
Zhu, K., Li, W., Fu, X.: Rethinking routing information in mobile social networks: Location-based or social-based? Elsevier Computer Communications (to appear), 2014
Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Pers. Ubiquit. Comput. 10(4), 255–268 (2006)
Hui, P.: People are the network: experimental design and evaluation of social-based forwarding algorithms, Ph.D. Dissertation, UCAM-CL-TR-713. University of Cambridge, Computer Laboratory (2008)
Srinivasan, V., Motani, M., Ooi, W.T.: Analysis and implications of student contact patterns derived from campus schedules. In: Proceedings of ACM MobiCom, Los Angeles, CA, pp. 86–97 (2006)
Zhang, Y., Gao, W., Cao, G., Porta, T.L., Krishnamachari, B., Iyengar, A.: Social-aware data diffusion in delay tolerant MANET. In: Thai, M.T., Pardalos, P.M. (eds.) Handbook of Optimization in Complex Networks: Communication and Social Networks. LNCS, vol. 58, pp. 457–481. Springer, New York (2010)
Daly, E., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proceedings of ACM MobiHoc (2007)
Socievole, A., De Rango, F., Caputo, A.: Wireless contacts, Facebook friendships and interests: analysis of a multi-layer social network in an academic environment. In: 2014 IFIP Wireless Days (WD), IEEE (2014)
Keränen, A., Ott, J., Kärkkäinen, T.: The ONE simulator for DTN protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, March 2009
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Tsai, TC., Chan, HH., Han, C.C., Chen, PC. (2016). A Social Behavior Based Interest-Message Dissemination Approach in Delay Tolerant Networks. In: Doss, R., Piramuthu, S., Zhou, W. (eds) Future Network Systems and Security. FNSS 2016. Communications in Computer and Information Science, vol 670. Springer, Cham. https://doi.org/10.1007/978-3-319-48021-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-48021-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48020-6
Online ISBN: 978-3-319-48021-3
eBook Packages: Computer ScienceComputer Science (R0)