Open Access Open Access  Restricted Access Subscription or Fee Access

Enhanced Privacy Policy Based Friend-To-Friend Content Dissemination System

K. R. Viknesh


When users are geographically clustered into communities. Despite its promise, none of the proposed systems have not been widely adopted due to unbounded high content delivery security and privacy concerns. This paper, presents a privacy concerns of users,  The system exploit the fact that users will trust their friends, and by replicating content on friends’ devices who are likely to consume that content it will be possible to disseminate it to other friends when connected to low cost networks. The paper provides a formal definition of this content replication problem, Then, it presents a community based greedy heuristic algorithm with novel dynamic centrality metrics that replicates the content on a minimum number of friends’ devices, to maximize availability. Then using real world and synthetic datasets, the effectiveness of the proposed scheme is demonstrated.

In the existing system, probability of using users’ encounters is highly dependent on their social behavior. Hence, there is a diurnal correlation of opportunistic encounters among users. These patterns have been extensively analyzed. Usually, social behavior of the majority of users has weekly routines. In existing, there is higher probability that a user meets the same people at the same day and time in every week. This predictive regularity of encounter patterns can be leveraged of efficient content replication. And to evaluate the content delivery success rate use Greedy helper selection and compare the delivery performance of the proposed system against the cases where No replication is performed and Random replication, which is the simplest way of selecting helpers without any knowledge about the contact patterns among consumers.

The proposed system is providing the privacy policies of each category of images/contents are analyzed for the policy prediction.

Full Text:



A. Abhari and M. Soraya, “Workload generation for youtube,”

Multimedia Tools and Applications, vol. 46, no. 1, pp. 91–118, 2010.

M. Barbera, J. Stefa, A. Viana, M. de Amorim, and M. Boc, “Vip delegation: Enabling vips to offload data in wireless social mobile networks,” in DCOSS’11. IEEE, 2011, pp. 1–8.

C. Boldrini, M. Conti, and A. Passarella, “Contentplace: social- aware data dissemination in opportunistic networks,” in Proceed- ings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems. ACM, 2008, pp. 203–210.

G. Chen and F. Rahman, “Analyzing privacy designs of mobile social networking applications,” in IEEE/IFIP EUC’08, vol. 2. IEEE, 2008, pp. 83–88.

T. Chen, M. A. Kaafar, and R. Boreli, “The where and when of finding new friends: Analysis of a location-based social discovery network.” in ICWSM, 2013.

E. Cho, S. A. Myers, and J. Leskovec, “Friendship and mobility: user movement in location-based social networks,” in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2011, pp. 1082–1090.

R. Gracia-Tinedo, M. S. Artigas, and P. Garcia Lopez, “Analysis of data availability in f2f storage systems: When correlations matter,” in IEEE P2P’12, sept. 2012, pp. 225 –236.

B. Han, P. Hui, V. Kumar, M. Marathe, J. Shao, and A. Srinivasan, “Mobile data offloading through opportunistic communications and social participation,” Mobile Computing, IEEE Transactions on, no. 99, pp. 1–1, 2011.


  • There are currently no refbacks.

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