Download Security Providence for Distributed Cooperative Caching in

Security Providence for Distributed
Cooperative Caching in Social Wireless
Networks
Author and Co-Authors Name: Ravi N, Alluraiah K
JNTU Anantapur
Sri Venkateswara College of Engineering,Tirupati, Andhra Pradesh, India
Abstract:
The network is a connecting terminology used widely for any communication of devices. Security is important
in communication, we have wireless and wired networks where communication takes place. The wireless
mobile devices can be connected and share data each other using adhoc network, the security is main concern
for the devices and data which is handled in network. Caching technique provides fast access of data, distributed
caching is the technique where mobile devices share the data requested by other mobile devices. Content
provider will provide data if requested data is not available at end customer. The communication service
provider is the network like 2G or 3G which makes communication for the content provider and the end
customer device. The cost should be paid for usage of data by end customer or content provider for the
communication service provider. The rebate mechanism can be used for the benefit of the user where this
technique pays revenue to the end customer who provides or share data to requested customer. A new phase is
used for handling security among all the devices.
Keywords: social wireless network, cooperative caching, rebate mechanism, communication service provider.
I. INTRODUCTION
The Networks may be homogeneous or heterogeneous where they are connected.
Content provider makes provision of data for end customer which are wireless. The large network is partitioned
in order to have local wireless network devices each can communicate and handle the data. Server is connected
to end customer for handling data using content provider. Based on the request the content is provided to the
customer, all end customers are connected each other for data communication.
Communication service provider manages the connections between content provider
and the end customer. The payment is made to the communication service provider by end customer, the rebate
of cost as redeem is given to the end customer which are participating in content providing to the peer
customers. Caching can be provided in order to reduce the cost of end customer; elsewhere number of
communications to the content provider is reduced. Distributed cooperative caching provides best usage of data
which is already downloaded by the end customer.
Caching is provided through the end customers which makes less cost. The security
makes more valuable in these type of networks the security phase handle all aspects in secure way. Encryption is
posed on the data available at the content provider basically to guarantee the secure data. The object flow in
adhoc network must be secure where unknown devices may be connected, there is more threat prone in these
type of wireless network.
II. RELATED WORK
Social wireless networks are formed by the adhoc network when an end customer
requests the data the communication service provider will handle the request to the content provider and the
object data is forwarded to the end customer. The download cost is paid to the communication service provider.
Caching is distributed among all the end customers to reduce communication cost. Security is maintained for the
object data flow between end customers and the content provider using security phase where data is encrypted.
Fig. 1: Content access from an SWNET in a University Campus.
The models used in the social wireless network
1.
2.
3.
Network model
Search model
Pricing model
1.
Network Model:
We consider two types of SWNETs. The first one involves stationary SWNET
partitions. Meaning, after a partition is formed, it is maintained for sufficiently long so that the
cooperative object caches can be formed and reach steady states. We also investigate a second type
to explore as to what happens when the stationary assumption is relaxed. To investigate this effect,
caching is applied to SWNETs formed using human interaction traces obtained from a set of real
SWNET nodes.
2.
Search Model:
We search the file means, it first searches its local cache. If the local search fails, it
searches the object within its SWNET partition using limited broadcast message. If the search in
partition also fails, the object is downloaded from the CP’s server. In this paper, we have modeled
objects such as electronic books, music, etc., which are time non varying, and therefore cache
consistency is not a critical issue. The popularity-tag of an object indicates its global popularity; it
also indicates the probability that an arbitrary request in the network is generated for this specific
object.
Pricing Model:
We use a pricing model similar to the Amazon Kindle business model in which the CP
pays a download cost Cd to the CSP when an End-Consumer downloads an object from the CP’s
server through the CSP’s cellular network. Also, whenever an EC provides a locally cached object
to another EC within its local SWNET partition, the provider EC is paid a rebate Cr by the CP.
Optionally, this rebate can also be distributed among the provider EC and the ECs of all the
intermediate mobile devices that take part in content forwarding .The selling price is directly paid
to the CP by an EC through an out-of-band secure payment system. A digitally signed rebate
3.
framework needs to be supported so that the rebate recipient ECs can electronically validate and
redeem the rebate with the CP. We assume the presence of these two mechanisms on which the
proposed caching mechanism is built.
Fig. 2: Content and cost flow model.
III. EXISTING SYSTEM
With the existence drawing motivation from Amazon’s Kindle electronic book delivery
business, practical network, service, and pricing models which are then used for creating two object caching
strategies for minimizing content provisioning costs in networks with homogenous and heterogeneous object
demands. The existing system constructs analytical and simulation models for analyzing the proposed caching
strategies in the presence of selfish users that deviate from network-wide cost-optimal policies. Based on a
practical service and pricing case, a stochastic model for the content provider’s cost computation is developed.
The cooperative caching strategy, Split Cache, is numerically analyzed, and theoretically proven to provide
optimal object placement for networks with homogenous content demands. Distributed Benefit, is used to
minimize the provisioning cost in heterogeneous networks consisting of nodes with different content request
rates and patterns. The impacts of user selfishness on object provisioning cost and earned rebate is analyzed.
Security of data should be handled in social wireless network.
IV. PRPOSED SYSTEM
Social wireless network has all the capabilities to handle data, is the data flow is secure or not.
When data is forwarding through the content provider a security level is supported to the data which has
encryption or adding secure key. As we know adhoc network is not secure in data handling the communication
service provider pass the data from content provider in secure way. Distributed cooperative caching is useful
technique for data flow between the end customers, when data is secure then it adds more value to the system. In
previous system object data is not having any security concern which leads to threat to the end customer. Rebate
mechanism adds more advantage to the end customer by providing cost to the response providing end customer.
The data which is forwarding should follow the rules in the security phase. In this proposed system the data is
guaranteed error free or threat free.
V. CONCLUSION AND FUTURE WORK
In this paper, we present the security oriented data in the network. In distributed cooperative
caching end customer, content provider and communication service provider plays major role. When the object
data flow is not secure then end customer face more problems in handling data. So, the security phase helps the
end customer by providing secure data.
The future work may also involves handling more number of users and provide transparency
in the communication. The robust and secure data flow makes the network more effective. The cost should be
reduced in social wireless networks. The improvement of Cooperative caching make more efficient data
handling in the network.
VI. REFERENCES
[1] M. Zhao, L. Mason, and W. Wang, “Empirical Study on Human Mobility for Mobile Wireless Networks,”
Proc. IEEE Military Comm. Conf. (MILCOM), 2008.
[2] “Cambridge Trace File, Human Interaction Study,”
http://www.crawdad.org/download/cambridge/haggle/Exp6.tar.gz, 2012.
[3] E. Cohen, B. Krishnamurthy, and J. Rexford, “Evaluating Server-Assisted Cache Replacement in the Web,”
Proc. Sixth Ann. European Symp. Algorithms, pp. 307-319, 1998.
[4] S. Banerjee and S. Karforma, “A Prototype Design for DRM Based Credit Card Transaction in ECommerce,” Ubiquity, vol. 2008.
[5] L. Breslau, P. Cao, L. Fan, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and
Implications,” Proc. IEEE INFOCOM, 1999.
[6] C. Perkins and E. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. IEEE Second Workshop
Mobile Systems and Applications, 1999.
[7] S. Podlipnig and L. Boszormenyi, “A Survey of Web Cache Replacement Strategies,” ACM Computing
Surveys, vol. 35, pp. 374- 398, 2003.
[8] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Impact of Human Mobility on
Opportunistic Forwarding Algorithms,” IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 606-620, June 2007.
[9] “BU-Web-Client - Six Months of Web Client Traces,” http://www.cs.bu.edu/techreports/1999-011usertrace-98.gz, 2012.
[10] A. Wolman, M. Voelker, A. Karlin, and H. Levy, “On the Scale and Performance of Cooperative Web
Caching,” Proc. 17th ACM Symp. Operating Systems Principles, pp. 16-31, 1999.
[11] S. Dykes and K. Robbins, “A Viability Analysis of Cooperative Proxy Caching,” Proc. IEEE INFOCOM,
2001.