Mitigating Denial of Service Attacks in OLSR Protocol Using Fictitious Nodes

Mitigating Denial of Service Attacks in OLSR Protocol Using Fictitious Nodes DOWNLOAD PROJECT SYNOPSIS With the main focus of research in routing protocols for Mobile Ad-Hoc Networks (MANET) geared towards routing efficiency, the resulting protocols tend to be vulnerable to various attacks. Over the years, emphasis has also been placed on improving the security of these networks. Different solutions have been proposed for different types of attacks, however, these solutions often compromise routing efficiency or network overload. One major DOS attack against the Optimized Link State Routing protocol (OLSR) known…

Read More

2FLIP: A Two-Factor Lightweight Privacy-Preserving Authentication Scheme for VANET

2FLIP: A Two-Factor Lightweight Privacy-Preserving  Authentication Scheme for VANET Download Project Synopsis Authentication in vehicular ad hoc network (VANET) requires not only secure and efficient authentication with privacy preservation but also applicable flexibility to handle complicated transportation circumstances. In this paper, we proposed a TWO-Factor LIghtweight Privacy preserving authentication scheme (2FLIP) to enhance the security of VANET communication. 2FLIP employs the decentralized certificate authority (CA) and the biological password based two factor authentication (2FA) to achieve the goals. Based on decentralized CA, 2FLIP only requires several extreme lightweight hashing process…

Read More

FiDoop: Parallel Mining of Frequent Itemsets Using MapReduce

FiDoop: Parallel Mining of Frequent Itemsets Using MapReduce Existing parallel mining algorithms for frequent itemsets lack a mechanism that enables automatic parallelization, load balancing, data distribution, and fault tolerance on large clusters. As a solution to this problem, we design a parallel frequent itemsets mining algorithm called FiDoop using the MapReduce programming model. To achieve compressed storage and avoid building conditional pattern bases, FiDoop incorporates the frequent items ultrametric tree, rather than conventional FP trees. In FiDoop, three MapReduce jobs are implemented to complete the mining task. In the crucial…

Read More

Exploit Every Bit: Effective Caching for High-Dimensional Nearest Neighbor Search

Exploit Every Bit: Effective Caching for High-Dimensional Nearest Neighbor Search DOWNLOAD PROJECT SYNOPSIS High-dimensional k nearest neighbor (kNN) search has a wide range of applications in multimedia information retrieval. Existing disk-based kNN search methods incur significant I/O costs in the candidate refinement phase.  Propose to cache compact approximate representations of data points in main memory in order to reduce the candidate refinement time during kNN search. This problem raises two challenging issues: (i) which is the most effective encoding scheme for data points to support kNN search? and (ii) what…

Read More

EPLQ: Efficient Privacy-Preserving Location-Based Query Over Outsourced Encrypted Data

EPLQ: Efficient Privacy-Preserving Location-Based Query Over Outsourced Encrypted Data   With the pervasiveness of smart phones, location based services (LBS) have received considerable attention and become more popular and vital recently. However, the use of LBS also poses a potential threat to user’s location privacy. Aiming at spatial range query, a popular LBS providing information about POIs (Points Of Interest) within a given distance, we present an efficient and privacy-preserving location based query solution, called EPLQ. Specifically, to achieve privacy preserving spatial range query, we propose the first predicate only…

Read More

Probabilistic Static Load-Balancing of Parallel Mining of Frequent Sequences

Probabilistic Static Load-Balancing of Parallel Mining of Frequent Sequences DOWNLOAD PROJECT SYNOPSIS Frequent sequence mining is well known and well studied problem in datamining. The output of the algorithm is used in many other areas like bioinformatics, chemistry, and market basket analysis. Unfortunately the frequent sequence mining is computationally quite expensive. In this paper we present a novel parallel algorithm for mining of frequent sequences based on a static load-balancing. The static load-balancing is done by measuring the computational time using a probabilistic algorithm. For reasonable size of instance, the…

Read More

Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data

Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data DOWNLOAD PROJECT SYNOPSIS Using cloud computing, individuals can store their data on remote servers and allow data access to public users through the cloud servers. As the outsourced data are likely to contain sensitive privacy information, they are typically encrypted before uploaded to the cloud. This, however, significantly limits the usability of outsourced data due to the difficulty of searching over the encrypted data. Developed the fine-grained multi-keyword search schemes over encrypted cloud data. The original contributions are three-fold.…

Read More

Group Key Agreement with Local Connectivity

Group Key Agreement with Local Connectivity DOWNLOAD PROJECT SYNOPSIS A group key agreement problem is studied where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocol, which demonstrates that our constructions are round efficient. Finally, we construct an…

Read More

RSkNN: kNN Search on Road Networks by Incorporating Social Influence

RSkNN: kNN Search on Road Networks by Incorporating Social Influence DOWNLOAD PROJECT SYNOPSIS Although kNN search on a road network Gr, i.e., finding k nearest objects to a query user q on Gr, has been extensively studied, existing works neglected the fact that the q’s social information can play an important role in this kNN query. Many real-world applications, such as location-based social networking services, require such a query. In this paper we study a new problem: kNN search on road networks by incorporating social influence (RSkNN). Specifically, the state-of-the-art…

Read More

Shared Relay Assignment (SRA) for Many-to-One Traffic in Cooperative Networks

Shared Relay Assignment (SRA) for Many-to-One Traffic in Cooperative Networks DOWNLOAD PROJECT SYNOPSIS Relay assignment significantly affects the performance of the cooperative communication, which is an emerging technology for the future mobile system. Previous studies in this area have mostly focused on assigning a dedicated relay to each source destination pair for one-to-one (121) traffic. However, many-to-one (M21) traffic, which is also common in many situations (for example, several users associate with one access point in a wireless access network such as a WLAN), hasn’t been well studied. This paper…

Read More