Design and Analysis of an Efficient
Friend-to-Friend Content Dissemination System
ABSTRACT:
Opportunistic communication, off-loading and decentralized distribution
have been proposed as a means of cost efficient disseminating content
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 latency, security and privacy
concerns. This paper, presents a novel hybrid content storage and
distribution system addressing the trust and privacy concerns of users,
lowering the cost of content distribution and storage, and shows how
they can be combined uniquely to develop mobile social networking
services. The system exploit the fact that users will trust their friends,
and by replicating content on friends’ devices that 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, and show that it is NP hard. 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. The practicality of the proposed system is demonstrated
through an implementation on Android smart phones.
The Friend to Friend in whole consists of two modules in android side,
they are:
 Helper.
 User.
The helper module is meant for registering with server and getting
authentication from the server side.
The User module consists of four modules. They are:
 PDF
 WORD
 IMAGE
 PPT
And in the server side consists of five modules, they are:
 Authentication
 Sending files
 Sending password
 Send SMS.
 Send mail.
The past few years have seen a rapid growth in the use of free social
networking applications such as Face book, Twitter and Google+. In
addition, other centralized content hosting services that support the
distribution of user generated content (UGC) such as YouTube and
Flickers are also becoming widely used. The UGC that is shared through
these services are increasingly being generated and consumed by users
using their mobile devices, necessitating the transfer of content between
Mobile devices and the content hosts. This will impact the users as well
as the mobile operators as it will exacerbate congestion of the mobile
networks and make the problems associated with privacy and data
ownership even more acute. As the service providers will not only have
full control of the user data, but have access to more private information
that are available through the mobile devices, such as location. There
have been numerous proposals for dealing with increasing mobile data
traffic by taking advantage of ubiquitous availability of mobile devices
and access to different types networks. Majority of the proposals for
using mobile devices exploit the possibility of using short-range
communication to communicate with each other when they are in close
proximity, i.e. opportunistic communication.
EXISTING SYSTEM:
Despite offering additional advantages for mobile users, such as
providing connectivity when there is no direct access to a network,
opportunistic communication solutions have not seen wide spread
adoption, primarily for two reasons. Firstly, due to the inherent
reluctance by users to interact with strangers or third parties, despite
security and privacy concerns are being partially addressed by the use of
encryption. Secondly, due to the unbounded latencies of data transport.
DISADVANTAGE:
 Due to the inherent reluctance by users to interact with strangers or
third parties.
 Security and privacy concerns are being partially addressed by the
use of encryption.
 Due to the unbounded latencies of data transport.
PROPOSED SYSTEM:
In contrast, offloading offer a generic solution for reducing congestion in
a given network. Offloading between cellular and WLANs have been
adopted by a number of operators. However, they still suffer from the
lack of universal availability of WLANs provided by the same cellular
network operator and the time taken for authentication. Importantly,
neither of these solutions directly addresses loss of control of data and
privacy.
ADVANTAGE:
 Presents a hybrid content dissemination system for mobile social
networks, which takes advantage of trusted social networking
friends.
 Provides a formal definition of content replication, which
maximizes content availability and minimizes replication and
shows this to be NP-hard.
 Presents a community based greedy algorithm for efficient content
replication by taking advantage of routine behavioral patterns of
mobile users.
 Proposes dynamic centrality metrics to identify the most influential
users within communities to minimize the content replication and
delivery delay.
 Shows that it is possible to provide delivery success rates of 80%
with less than 10% replication, through extensive data driven
simulations using both real world and synthetic datasets.
 Demonstrates the practicality of the proposed hybrid content
dissemination through the implementation of the system on
Android smart phones.
 Reduces the traffic to the server because the helper alone going to
contact the server.
ARCHITECTURE DIAGRAM:
ANDROID MODULES:
The Friend to Friend in whole consists of two modules in android side,
they are:
 Helper.
 Receiver.
The helper module is meant for registering with server and getting
authentication from the server side.
The Helper module consists of four modules. They are:
 PDF
 WORD
 IMAGE
 PPT
 Login
 Registration.
In each module they can download the respective PDF, word, image or
PPT. From the server side in which each module will list the available
files which the server shared and from there they can download the files
and store it in their devices. Before contacting the server the helper
should register himself through the app and in turn the server will send
confirmation of username and password to him. He has to use it for
downloading the files from the server.
The Receiver module consists of four modules. They are:
 PDF
 WORD
 IMAGE
 PPT
Here the two android mobiles will communicate by receiving files the
helper will act as the sender and the other mobile will act as the receiver.
Thus on connection the receiver mobile has to give the address of the
sender mobile as the input .So they will connect and on connection the
file will be send .The sender has to mention the file name to send the
file. So the transferring of files is done.
SERVER SIDE:
And in the server side consists of five modules, they are:
 Authentication
 Sending files
 Sending password
 Send SMS.
 Send mail.
Authentication:
In the authentication module the server has to authenticate the user who
are register through the friend to friend application.
Sending password:
In this category the server will make the password and username for the
authenticated user and save it in the database the user has to use the
password to download the files in the android side.
Sending files:
In this module the server will upload the files of PDF, PPT, word and
jpeg. In the database from where the user can download the files. This
will produce a list in the user side.
Send SMS:
The password the server has made has to be send to the user, which can
be sending as a message to the user privately to his number that is
mentioned by the user while registering.
Send mail:
The password the server has made has to be send to the user, which can
be sending as a mail to the user privately to his id that is mentioned by
the user while registering.
ALGORITHM TECHNIQUES:
A greedy algorithm is an algorithm that follows the problem
solving heuristic of making the locally optimal choice at each stage with
the hope of finding a global optimum.
Greedy Heuristics
All heuristically algorithms that we have investigated use the same
greedy approach: The set of jobs is worked one after the other and for
each job we select one processor the job is assigned to.
NP-hard
Class of problems which are at least as hard as the hardest problems in
NP. Problems that are NP-hard do not have to be elements of NP;
indeed, they may not even be decidable.
SYSTEM SPECIFICATION:
HARDWARE REQUIREMENTS:
•
Microsoft® Windows® 7/8/10 (32- or 64-bit)
•
2 GB RAM minimum, 8 GB RAM recommended
•
2 GB of available disk space minimum,
4 GB recommended (500 MB for IDE + 1.5 GB for Android SDK and
emulator system image)
•
1280 x 800 minimum screen resolutions
•
Java Development Kit (JDK) 8
•
For accelerated emulator: 64-bit operating system and Intel® processor with
support for Intel® VT-x, Intel® EM64T (Intel® 64), and Execute Disable (XD)
Bit functionality
SOFTWARE REQUIREMENTS:
 Operating system
: Windows 7 Ultimate.
 Coding Language
: Java.
 Front-End
: Android Studio.
 Data Base
: Cloud database Manger.
 Server
: Wamp Server.
CONCLUSION:
In contrast, offloading offer a generic solution for reducing
congestion in a given network. Offloading between cellular and
WLANs have been adopted by a number of operators. However, they
still suffer from the lack of universal availability of WLANs provided
by the same cellular network operator and the time taken for
authentication. Importantly, neither of these solutions directly
addresses loss of control of data and privacy. We proposed a novel
distributed content storage and dissemination architecture that uses
intelligent content replication to addresses the issues of lack of trust
and timeliness of delivery, and loss of privacy that has hindered the
adoption and deployment of friend-to-friend content delivery. First,
we showed that the content replication problem in opportunistic
content dissemination architectures is NP-hard. Then, we developed a
community based greedy algorithm for efficient content replication,
taking advantage of routine behavioral patterns of social networking
friends.