Abstract
Recently, social networking over MANETs has attracted the attention of research community, due to its flexibility, cost saving and infrastructure-less architecture. However, various problems namely, to efficiently find nodes of similar interest and network partition, exist in such environment. For enabling ad hoc social networking in an intermittent network scenario, Delay Tolerant Network (DTN) emerges as one of the solution. This paper proposes a novel algorithm allowing users to find friends of similar interest both in their neighborhood and in entire network by using DTN on OLSR MANET. We investigate and compare the similarity of users interest using four similarity metrics: Cosine Similarity, Jaccard, Correlation and Dice Coefficient. We simulate the algorithms assuming that users change their interest at fixed and random time (normal and uniform distribution). The simulations results show that Cosine Similarity provides the highest number of similar interest matching. In addition, by implementing the proposed algorithm on DTN with the normal distributed users interest-changing time, the success ratio of finding matches increases significantly.
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
Lee, J., Hong, C.S.: A mechanism for building Ad-hoc social network based on users interest. In: The 13th Asia-pacific Network Operatens and Management Symposium (APNOMS 2011), pp. 1–4 (2011), doi:10.1109/APNOMS.2011.6076997
Li, J., Khan, S.U.: MobiSN: Semantics-Based Mobile Ad Hoc Social Network Framework. In: The IEEE Global Telecommunications Conference (GLOBECOM 2009), pp. 1–6 (2009), doi:10.1109/GLOCOM.2009.5425993
Pietiläinen, A.-K., Oliver, E., LeBrun, J., Varghese, G., Diot, C.: MobiClique: middleware for mobile social networking. In: Proceedings of the 2nd ACM Workshop on Online social Networks, pp. 49–54. ACM, New York (2009), doi: http://doi.acm.org/10.1145/1592665.1592678
Rahnama, H., Madni, A.M., Sadeghian, A., Mawson, C., Gajderowicz, B.: Adaptive context for generic pattern matching in ad hoc social networks. In: The 3rd International Symposium on Communications, Control and Signal Processing (ISCCSP 2008), pp. 73–78 (2008), doi:10.1109/ISCCSP.2008.4537195
Sarigöl, E., Riva, O., Stuedi, P., Alonso, G.: Enabling social networking in ad hoc networks of mobile phones. Proc. VLDB Endowment 2(2), 1634–1637 (2009), Retrieved from http://dl.acm.org/citation.cfm?id=1687553.1687611
Smith, N., Bonta, J.: Prototype of a social networking application in a multi-hop autonomous ad hoc network. In: The 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2008), pp. 535–537 (2008), doi:10.1109/MAHSS.2008.4660081
Väänänen-Vainio-Mattila, K., Saarinen, P., Wäljas, M., Hännikäinen, M., Orsila, H., Kiukkonen, N.: User experience of social ad hoc networking: findings from a large-scale field trial of TWIN. In: Proceedings of the 9th International Conference on Mobile and Ubiquitous Multimedia, pp. 1–10. ACM, New York (2010), doi: http://doi.acm.org/10.1145/1899475.1899485
Kas, M.: OLSR-Aware Cross-Layer Channel Access Scheduling in Wireless Mesh Network. Thesis of degree in Master of Science, Bilkent University (June 2009)
Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR), Experimental, Project Hypercom, INIRIA (October 2003)
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
Sanguankotchakorn, T., Shrestha, S., Sugino, N. (2012). Effective Ad Hoc Social Networking on OLSR MANET Using Similarity of Interest Approach. In: Xiang, Y., Pathan, M., Tao, X., Wang, H. (eds) Internet and Distributed Computing Systems. IDCS 2012. Lecture Notes in Computer Science, vol 7646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34883-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-34883-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34882-2
Online ISBN: 978-3-642-34883-9
eBook Packages: Computer ScienceComputer Science (R0)