Home > Archives > IJSRST184528 IJSRST-Library

A Scalable Approach for Achieve the Anonymity of the Neighboring Node in Mobile Social Networks

Authors(2) :-B. Mounika, K. S. Yuvaraj

Social Anonymity is a serious threat to users of mobile social networks. Anonymizing genuine IDs among neighbor nodes explains such concerns. Be that as it may, this prevents nodes from gathering genuine ID-based encountering data, which is expected to help mobile opportunistic social networks services. Along these lines, in this paper, This work Propose that scalable fine grained approach that can support both anonymizing genuine IDs among neighbor nodes furthermore, collecting genuine ID-based encountering data. For node anonymity, two encountering nodes communicate anonymously. Only when the two nodes disconnect with each other, every node sends encrypted encountering evidence to the encountered node to enable encountering data collection. A collection of novel methods are intended to guarantee the confidentiality and uniqueness of encountering proofs. A scalable approach additionally supports fine-grained control over what data is shared to the encountered node in light of attribute similarity (i.e., trust), which is measured without revealing attributes.
B. Mounika, K. S. Yuvaraj
Mobile Opportunistic Social Networks, Anonymity, Encountering Information.
  1. S. Jain, K. Fall, and R. Patra, “Routing in a delay tolerant network,” in Proc. SIGCOMM, 2004, pp. 145–158.
  2. P. Hui, E. Yoneki, S. Y. Chan, and J. Crowcroft, “Distributed community detection in delay tolerant networks,” in Proc. MobiArch, 2007, Art. no. 7,
  3. K. Chen and H. Shen, “SMART: Lightweight distributed social map based routing in delay tolerant networks,” in Proc. IEEE ICNP, Oct./Nov. 2012, pp. 1–10.
  4. K. Chen, H. Shen, and H. Zhang, “Leveraging social networks for p2p content-based file sharing in disconnected MANETs,” IEEE Trans. Mobile Comput., vol. 13, no. 2, pp. 235–249, Feb. 2014.
  5. M. Motani, V. Srinivasan, and P. S. Nuggehalli, “PeopleNet: Engineering a wireless virtual social network,” in Proc. MOBICOM, 2005, pp. 243–257.
  6. G. Costantino, F. Martinelli, and P. Santi, “Privacy-preserving interestcasting in opportunistic networks,” in Proc. IEEE WCNC, Apr. 2012, pp. 2829–2834. 11R. Lu et al., “Prefilter: An efficient privacy-preserving relay filtering scheme for delay tolerant networks,” in Proc. IEEE INFOCOM, Mar. 2012, pp. 1395–1403.
  7. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM, vol. 21, no. 2, pp. 120–126, Feb. 1978.
  8. Ubuntu Network Configuration, accessed on Oct. 10, 2015. Onilne]. Available: https://help.ubuntu. com/community/NetworkConfigurationCommandLine/Automatic
  9. N. Eagle, A. Pentland, and D. Lazer, “Inferring friendship network structure by using mobile phone data,” Proc. Nat. Acad. Sci., vol. 106, no. 36, pp. 15274–15278, 2009.
  10. A. Chaintreau et al., “Impact of human mobility on opportunistic forwarding algorithms,” IEEE Trans. Mobile Comput., vol. 6, no. 6, pp. 606–620, 2007.
Publication Details
  Published in : Volume 4 | Issue 7 | March-April 2018
  Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 66-72
Manuscript Number : IJSRST184528
Publisher : Technoscience Academy
PRINT ISSN : 2395-6011
ONLINE ISSN : 2395-602X
Cite This Article :
B. Mounika, K. S. Yuvaraj, "A Scalable Approach for Achieve the Anonymity of the Neighboring Node in Mobile Social Networks", International Journal of Scientific Research in Science and Technology(IJSRST), Print ISSN : 2395-6011, Online ISSN : 2395-602X, Volume 4, Issue 7, pp.66-72, March-April-2018
URL : http://ijsrst.com/IJSRST184528