Distributed Cooperative Caching in Social Wireless Networks.

Distributed Cooperative Caching in Social Wireless Networks.

ABSTRACT:

This paper introduces cooperative caching policies for minimizing electronic content provisioning cost in Social Wireless Networks (SWNET).SWNETs are formed by mobile devices, such as data enabled phones, electronic book readers etc., sharing common interests in electronic content, and physically gathering together in public places. Electronic object caching in such SWNETs are shown to be able to reduce the content provisioning cost which depends heavily on the service and pricing dependences among various stakeholders including content providers (CP), network service providers, and End Consumers (EC). Drawing motivation from Amazon’s Kindle electronic book delivery business, this paper develops 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 paper 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. It also reports results from an Android phone based prototype SWNET, validating the presented analytical and simulation results.

EXISTING SYSTEM:

With the existence of such SWNETs, an alternative approach to content access by a device would be to first search the local SWNET for the requested content before downloading it from the CP’s server. The expected content provisioning cost of such an approach can be significantly lower since the download cost to the CSP would be avoided when the content is found within the local SWNET. This mechanism is termed as cooperative caching. In order to encourage the End-Consumers (EC) to cache previously downloaded content and to share it with other end-consumers, a peer-to-peer rebate mechanism is proposed. This mechanism can serve as an incentive so that the end-consumers are enticed to participate in cooperative content caching in spite of the storage and energy costs. In order for cooperative caching to provide cost benefits, this peer-to-peer rebate must be dimensioned to be smaller than the content download cost paid to the CSP. This rebate should be factored in the content provider’s overall cost.

DISADVANTAGES OF EXISTING SYSTEM:

Due to their limited storage, mobile handheld devices are not expected to store all downloaded content for long. This means after downloading and using a purchased electronic content, a device may remove it from the storage.

PROPOSED SYSTEM:

In this paper drawing motivation from Amazon’s Kindle electronic book delivery business, this paper develops 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 paper 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. It also reports results from an Android phone based prototype SWNET, validating the presented analytical and simulation results.

ADVANTAGES OF PROPOSED SYSTEM:

·        Based on a practical service and pricing case, a stochastic model for the content provider’s cost computation is developed.

·        A cooperative caching strategy, Split Cache, is proposed, numerically analyzed, and theoretically proven to provide optimal object placement for networks with homogenous content demands.

·        A benefit-based strategy, Distributed Benefit, is proposed 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.

SYSTEM CONFIGURATION:-

HARDWARE REQUIREMENTS:-

ü Processor                  -        Pentium –IV

ü Speed                        -        1.1 Ghz

ü RAM                         -        512 MB(min)

ü Hard Disk                 -        40 GB

ü Key Board                -        Standard Windows Keyboard

ü Mouse                       -        Two or Three Button Mouse

ü Monitor                     -        LCD/LED

 

SOFTWARE REQUIREMENTS:-

 v   Operating System          : LINUX

 v   Tool                               : Network Simulator-2

v   Front End                      : OTCL (Object Oriented Tool Command  Language)

REFERENCE:

Mahmoud Taghizadeh,Member, IEEE, Kristopher Micinski, Member, IEEE, Charles Ofria, Eric Torng, and Subir Biswas,Senior Member, IEEE “Distributed Cooperative Caching in Social Wireless Networks”- IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 6, JUNE 2013.

 

Privacy-Preserving Distributed Profile Matching in Proximity-based Mobile Social Networks.

Privacy-Preserving Distributed Profile Matching in Proximity-based Mobile Social Networks.

 Abstract

Making new connections according to personal preferences is a crucial service in mobile social networking, where an initiating user can find matching users within physical proximity of him/her. In existing systems for such services, usually all the users directly publish their complete profiles for others to search. However, in many applications, the users' personal profiles may contain sensitive information that they do not want to make public. In this paper, we propose FindU, a set of privacy-preserving profile matching schemes for proximity-based mobile social networks. In FindU, an initiating user can find from a group of users the one whose profile best matches with his/her; to limit the risk of privacy exposure, only necessary and minimal information about the private attributes of the participating users is exchanged. Two increasing levels of user privacy are defined, with decreasing amounts of revealed profile information. Leveraging secure multi-party computation (SMC) techniques, we propose novel protocols that realize each of the user privacy levels, which can also be personalized by the users. We provide formal security proofs and performance evaluation on our schemes, and show their advantages in both security and efficiency over state-of-the-art schemes.

Published in:

A Scalable Server Architecture for Mobile Presence Services in Social Network Applications.

A Scalable Server Architecture for Mobile Presence Services in Social Network Applications.

Towards a Statistical Framework for Source Anonymity in Sensor Networks.

Towards a Statistical Framework for Source Anonymity in Sensor Networks.

Vampire attacks:Draining life from wireless ad-hoc sensor networks.

Vampire attacks:Draining life from wireless ad-hoc sensor networks.

Mobile Relay Configuration in Data-intensive Wireless Sensor Networks.

Mobile Relay Configuration in Data-intensive Wireless Sensor Networks.

ABSTRACT:

Wireless Sensor Networks (WSNs) are increasingly used in data-intensive applications such as microclimate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive WSNs is to transmit all the data generated within an application’s lifetime to the base station despite the fact that sensor nodes have limited power supplies. We propose using lowcost disposable mobile relays to reduce the energy consumption of data-intensive WSNs. Our approach differs from previous work in two main aspects. First, it does not require complex motion planning of mobile nodes, so it can be implemented on a number of low-cost mobile sensor platforms. Second, we integrate the energy consumption due to both mobility and wireless transmissions into a holistic optimization framework. Our framework consists of three main algorithms. The first algorithm computes an optimal routing tree assuming no nodes can move. The second algorithm improves the topology of the routing tree by greedily adding new nodes exploiting mobility of the newly added nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology. This iterative algorithm converges on the optimal position for each node given the constraint that the routing tree topology does not change. We present efficient distributed implementations for each algorithm that require only limited, localized synchronization. Because we do not necessarily compute an optimal topology, our final routing tree is not necessarily optimal. However, our simulation results show that our algorithms significantly outperform the best existing solutions.

EXISTING SYSTEM:

A key challenge faced by data-intensive WSNs is to minimize the energy consumption of sensor nodes so that all the data generated within the lifetime of the application can be transmitted to the base station. Several different approaches have been proposed to significantly reduce the energy cost of WSNs by using the mobility of nodes. A robotic unit may move around the network and collect data from static nodes through one-hop or multihop transmissions. The mobile node may serve as the base station or a “data mule” that transports data between static nodes and the base station. Mobile nodes may also be used as relays that forward data from source nodes to the base station. Several movement strategies for mobile relays have been studied.

DISADVANTAGES OF EXISTING SYSTEM:

Ø First, the movement cost of mobile nodes is not accounted for in the total network energy consumption. Instead, mobile nodes are often assumed to have replenishable energy supplies which are not always feasible due to the constraints of the physical environment.

Ø Second, complex motion planning of mobile nodes is often assumed in existing solutions which introduces significant design complexity and manufacturing costs.

Ø In mobile nodes need to repeatedly compute optimal motion paths and change their location, their orientation and/or speed of movement. Such capabilities are usually not supported by existing low-cost mobile sensor platforms.

PROPOSED SYSTEM:

In this paper, we use low-cost disposable mobile relays to reduce the total energy consumption of data-intensive WSNs. Different from mobile base station or data mules, mobile relays do not transport data; instead, they move to different locations and then remain stationary to forward data along the paths from the sources to the base station. Thus, the communication delays can be significantly reduced compared with using mobile sinks or data mules. Moreover, each mobile node performs a single relocation unlike other approaches which require repeated relocations.

ADVANTAGES OF PROPOSED SYSTEM:

Ø Our approach takes advantage of this capability by assuming that we have a large number of mobile relay nodes.

Ø On the other hand, due to low manufacturing cost, existing mobile sensor platforms are typically powered by batteries and only capable of limited mobility.

Ø Consistent with this constraint, our approach only requires one-shot relocation to designated positions after deployment. Compared with our approach, existing mobility approaches typically assume a small number of powerful mobile nodes, which does not exploit the availability of many low-cost mobile nodes

SYSTEM CONFIGURATION:-

HARDWARE CONFIGURATION:-

ü Processor             -        Pentium –IV

ü Speed                             -        1.1 Ghz

ü RAM                    -        256 MB(min)

ü Hard Disk            -        20 GB

ü Key Board            -        Standard Windows Keyboard

ü Mouse                  -        Two or Three Button Mouse

ü Monitor                -        SVGA

 

SOFTWARE CONFIGURATION:-

                          

ü Operating System                    : Windows XP

ü Programming Language           : JAVA

ü Java Version                           : JDK 1.6 & above.

ü Database                                 : MYSQL

REFERENCE:

Fatme El-Moukaddem, Eric Torng, and Guoliang Xing,Member, IEEE “Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks”- IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 2, FEBRUARY 2013.