Privacy In Opportunistic Network For Interest-Casting In Manets

International Journal of Computer Science (IJCS Journal) Published by SK Research Group of Companies (SKRGC) Scholarly Peer Reviewed Research Journals

Format: Volume 3, Issue 1, No 5, 2015.

Copyright: All Rights Reserved ©2015

Year of Publication: 2015

Author: Dr. S Prabhakaran,T Senthil Kumar,Ojaswani Dubey

Reference:IJCS-095

View PDF Format

Abstract

Many mobile social networking applications are based on the concept, according to which two mobile users try to jointly estimate whether they have common friends, or share same interests, etc. Performing “friend detection” in a privacy-preserving way is fundamental to achieve widespread acceptance of mobile social networking applications. What so ever, the need of privacy preservation is often at odds with application-level performance of the mobile social networking application, since only profuse information about the other user’s profile is available for optimizing performance, More specifically, it is considered a mobile social networking application for opportunistic networks called interest-casting. In this model, a user wants to exchange a piece of information to other users sharing similar interests, possibly through multi-hop forwarding. It is proposed that the privacy-preserving friend proximity detection scheme based on a protocol for solving the Yao’s “Millionaire’s Problem”, and the three interest-casting protocols achieving different tradeoff between privacy and accuracy of the information forwarding process. The privacy versus accuracy adjudge is analyzed both analytical, and through simulations based on a real-world mobility trace.

References

[1] An Efficient Protocol forYao‘sMillionaires‘ Problem Ioannis Ioannidis and Ananth Grama Department of Computer Sciences, Purdue University, W. Lafayette, IN 47907. [2] Andrew C.-C. Yao, Protocols for secure computation, Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), 1982, pp. 160 – 164. [3] FindU:— Privacy-Preserving Distributed Profile Matching in Proximity-based Mobile Social Networks Ming Li, Member, IEEE, Shucheng Yu, Member, IEEE, Ning Cao, Student Member, IEEE, and Wenjing Lou, Senior Member, IEEE.[4] People Tones: A System for the Detection and Notification of Buddy Proximity on Mobile Phones Kevin A. Li, Timothy Y. Sohn, Steven Huang, William G. Griswold Computer Science and Engineering University of California, San Diego La Jolla, CA 92093 [5] Chen, M., Sohn, T., Chmelev, D., et al. Practical Metropolitan-Scale Positioning for GSM Phones. In Proc of Ubicomp 2006. [6] Loopt. http://www.loopt.com [7] Chen M, Gonzalez S, Zhang Q, Li M, Leung V (2010) A 2g-rfid based e-healthcare system. IEEE Wirel CommunMag 17(1):37–43 [8] PeopleNet: Engineering A Wireless Virtual Social NetworkMehul Motani and Vikram Srinivasan Electrical & Computer Engineering National University of Singapore Pavan S. Nuggehalli Centre for Electronics Design & Technology Indian Institute of Science, Bangalore. [9] A Secure Handshake Scheme with Symptoms-Matching for mHealthcare Social Network Rongxing Lu • Xiaodong Lin • Xiaohui Liang • Xuemin Shen [10] Wang H, Peng D, Wang W, Sharif H, Chen HH, Khoynezhad A(2010) Resource-aware secure ECG healthcare monitoring through body sensor networks.

Keywords

Opportunistic networks; Interest-casting; Social Networking; Privacy preservation.

This work is licensed under a Creative Commons Attribution 3.0 Unported License.   

TOP
Facebook IconYouTube IconTwitter IconVisit Our Blog