Maximizing P2P File Access Availability in Mobile Ad hoc Networks Though Replication for Efficient File Sharing

ABSTRACT:

File sharing applications in mobile ad hoc networks (MANETs) have attracted more and more attention in recent years. The efficiency of file querying suffers from the distinctive properties of such networks including node mobility and limited communication range and resource. An intuitive method to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no research has focused on the global optimal replica creation with minimum average querying delay. Specifically, current file replication protocols in mobile ad hoc networks have two shortcomings. First, they lack a rule to allocate limited resource to different files in order to minimize the average querying delay. Second, they simply consider storage as resource for replicas, but neglect the fact that the file holders’ frequency of meeting other nodes also plays an important role in determining file availability. Actually, a node that has a higher meeting frequency with others provides higher availability to its files. This becomes even more evident in sparsely distributed MANETs, where nodes meet disruptively. In this paper, we introduce a new concept of resource for file replication, which considers both node storage and meeting frequency. We theoretically study the influence of resource allocation on the average querying delay and derive a resource allocation rule to minimize the average querying delay. We further propose a distributed file replication protocol to realize the proposed rule. Extensive trace-driven experiments with synthesized traces and real traces show that our protocol can achieve shorter average querying delay at a lower cost than current replication protocols.

AIM

The aims of resource allocation on the average querying delay and derive a resource allocation rule to minimize the average querying delay

SCOPE

 The Scope of this paper synthesized traces and real traces show that our protocol can achieve shorter average querying delay at a lower cost than current replication protocols.

EXISTING SYSTEM

In these protocols, each individual node replicates files it frequently queries, or a group of nodes create one replica for each file they frequently query. In the former, redundant replicas are easily created in the system, wasting resources. In the latter, though redundant replicas are reduced by group cooperation, neighboring nodes may separate from each other due to node mobility, leading to large query delay. There are also some works addressing content caching in more sparsely distributed MANETs (disconnected MANETs/DTNs) for efficient data retrieval or message routing current file replication protocols lack a rule to allocate limited resource to different files for replica creation in order to achieve the minimum global average querying delay, i.e., global search efficiency optimization under limited resource. Moreover, they simply consider storage as the resource for replicas, but neglect that a node’s frequency to meet other nodes (meeting ability in short) also influences the availability of its files. Files in a node with a higher meeting ability have higher availability.

DISADVANTAGES:

1.  They  lack a rule to allocate limited resource to different files in order to minimize the average querying delay
2. They simply consider storage as resource for replicas, but neglect the fact that the file holders’ frequency of meeting other nodes also plays an important role in determining file availability

PROPOSED SYSTEM

In this paper, introduce a new concept of resource for file replication, which considers both node storage and node meeting ability. We theoretically study the influence of resource allocation on the average querying delay and derive an optimal file replication rule that allocates resources to each file based on its popularity and size. To the best of our knowledge, this work is the first attempt to theoretically investigate the problem of resource allocation for replica creation to achieve global file searching optimization in MANETs. We further propose a file replication protocol based on the rule, which approximates the minimum global querying delay in a fully distributed manner. Our experiment and simulation results show the superior performance of the proposed protocol in comparison with other representative replication protocols

ADVANTAGES

1. An  optimal replication rule to allocate the limited resource to file replicas in order to minimize the average querying delay
2.  The  Priority Competition and Split replication protocol (PCS) that realizes the proposed optimal replication rule in a fully distributed manner

SYSTEM ARCHITECTURE:

 

 

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                 Processor       -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board           -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System              : Windows  7                                       

·                Front End                  : JSP AND SERVLET

·                Database                  : MYSQL

·                Tool                           :NETBEANS

REFERENCE:

Kang Chen, Haiying Shen. “Maximizing P2P File Access Availability in Mobile Ad hoc Networks Though Replication for Efficient File Sharing”, IEEE Transactions on Computers, Volume  64, Issue 4 FEBRUARY 2014.

Control Cloud Data Access Privilege And Anonymity With Fully Anonymous Attribute-Based Encryption

ABSTRACT

Cloud computing is a revolutionary computing paradigm, which enables flexible, on-demand, and low-cost usage of computing resources, but the data is outsourced to some cloud servers, and various privacy concerns emerge from it. Various schemes based on the attribute-based encryption have been proposed to secure the cloud storage. However, most work focuses on the data contents privacy and the access control, while less attention is paid to the privilege control and the identity privacy. In this paper, we present a semianonymous privilege control scheme AnonyControl to address not only the data privacy, but also the user identity privacy in existing access control schemes. AnonyControl decentralizes the central authority to limit the identity leakage and thus achieves semi anonymity. Besides, it also generalizes the file access control to the privilege control, by which privileges of all operations on the cloud data can be managed in a fine-grained manner. Subsequently, we present the AnonyControl-F, which fully prevents the identity leakage and achieve the full anonymity. Our security analysis shows that both AnonyControl and AnonyControl-F are secure under the decisional bilinear Diffie–Hellman assumption, and our performance evaluation exhibits the feasibility of our schemes.

AIM

The aim of this paper is present a semi anonymous privilege control scheme Anony Control to address not only the data privacy, but also the user identity privacy in existing access control schemes.

SCOPE

The scope of this paper tend to Our security analysis shows that both AnonyControl and AnonyControl-F are secure under the decisional bilinear Diffie–Hellman assumption, and our performance evaluation exhibits the feasibility of our schemes.

EXISTING SYSTEM

First data confidentiality should be guaranteed. The data privacy is not only about the data contents. Since the most attractive part of the cloud computing is the computation outsourcing, it is far beyond enough to just conduct an access control. More likely, users want to control the privileges of data manipulation over other users or cloud servers. This is because when sensitive information or computation is outsourced to the cloud servers or another user, which is out of users’ control in most cases, privacy risks would rise dramatically because the servers might illegally inspect users’ data and access sensitive information, or other users might be able to infer sensitive information from the outsourced computation. Therefore, not only the access but also the operation should be controlled.

DISADVANTAGES

1. The  data is outsourced to some cloud servers, and various privacy concerns emerge from it
2. It most work focuses on the data contents privacy and the access control, while less attention is paid to the privilege control and the identity privacy.

PROPOSED SYSTEM

Various techniques have been proposed to protect the data contents privacy via access control. Identity-based encryption (IBE) was first introduced by Shamir , in which the sender of a message can specify an identity such that only a receiver with matching identity can decrypt it. Few years later, Fuzzy Identity-Based Encryption  is proposed, which is also known as Attribute-Based Encryption (ABE). In such encryption scheme, an identity is viewed as a set of descriptive attributes, and decryption is possible if a decrypter’s identity has some overlaps with the one specified in the ciphertext. Soon after, more general tree-based ABE schemes, Key-Policy Attribute-Based Encryption (KP-ABE) and Ciphertext-Policy Attribute- Based Encryption (CP-ABE)  are presented to express more general condition than simple ‘overlap’. They are counterparts to each other in the sense that the decision of encryption policy (who can or cannot decrypt the message) is made by different parties.

ADVANTAGES

1.  It achieves not only fine-grained privilege control but also identity anonymity while conducting privilege control based on users’ identity information
2.  The security and performance analysis which shows that Anony- Control both secure and efficient for cloud storage system.

SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board                 -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System      : Windows  7                                     

·                Front End                  : JSP AND SERVLET

·                Database                  : MYSQL

·                Tool                           :NETBEANS

REFERENCE

Lei, Chin-Laung Chi, Po-Wen “CONTROL CLOUD DATA ACCESS PRIVILEGE AND ANONYMITY WITH FULLY ANONYMOUS ATTRIBUTE-BASED ENCRYPTION” IEEE Transactions on Information Forensics and Security, VOL 10,ISS 1, NOVEMBER 2014.