IEEE Projects,ieee projects 2012, IEEE Projects 2011, IEEE Projects 2010, IEEE Project ,Final year Projects,Ns2 Projects http://www.finalsemprojects.com ieee projects, ieee projects 2011,ieee projects 2012, NS2 Projects,IEEE Academic Projects, IEEE 2011 Projects, IEEE, IEEE Projects Chennai,IEEE Software Projects, Latest IEEE Projects,IEEE Student Projects, IEEE Final year Student Projects,Final Year Projects, ENGINEERING PROJECTS, MCA projects, BE projects, Embedded Projects, JAVA projects, J2EE projects, .NET projects, Students projects, MATLAB Projects Fri, 18 May 2012 05:50:01 +0000 en hourly 1 A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks http://www.finalsemprojects.com/a-distributed-csma-algorithm-for-throughput-and-utility-maximization-in-wireless-networks-2 http://www.finalsemprojects.com/a-distributed-csma-algorithm-for-throughput-and-utility-maximization-in-wireless-networks-2#comments Fri, 20 Apr 2012 06:36:05 +0000 admin http://www.finalsemprojects.com/a-distributed-csma-algorithm-for-throughput-and-utility-maximization-in-wireless-networks-2

A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks

Related Posts :

]]> http://www.finalsemprojects.com/a-distributed-csma-algorithm-for-throughput-and-utility-maximization-in-wireless-networks-2/feed 0 Cell Breathing Techniques For Load Balancing In Wireless LANS http://www.finalsemprojects.com/cell-breathing-techniques-for-load-balancing-in-wireless-lans http://www.finalsemprojects.com/cell-breathing-techniques-for-load-balancing-in-wireless-lans#comments Mon, 16 Apr 2012 08:32:07 +0000 admin http://www.finalsemprojects.com/cell-breathing-techniques-for-load-balancing-in-wireless-lans

Cell Breathing Techniques For Load Balancing In Wireless LANS

Related Posts :

]]> http://www.finalsemprojects.com/cell-breathing-techniques-for-load-balancing-in-wireless-lans/feed 0 Truth Discovery with Multiple Conflicting Information Providers on the Web http://www.finalsemprojects.com/truth-discovery-with-multiple-conflicting-information-providers-on-the-web http://www.finalsemprojects.com/truth-discovery-with-multiple-conflicting-information-providers-on-the-web#comments Sat, 07 Apr 2012 08:33:20 +0000 admin http://www.finalsemprojects.com/truth-discovery-with-multiple-conflicting-information-providers-on-the-web

Truth Discovery with Multiple Conflicting Information Providers on the Web

Related Posts :

]]> http://www.finalsemprojects.com/truth-discovery-with-multiple-conflicting-information-providers-on-the-web/feed 0 Protection of Database Security via Collaborative Inference Detection http://www.finalsemprojects.com/protection-of-database-security-via-collaborative-inference-detection http://www.finalsemprojects.com/protection-of-database-security-via-collaborative-inference-detection#comments Sat, 07 Apr 2012 08:25:37 +0000 admin http://www.finalsemprojects.com/protection-of-database-security-via-collaborative-inference-detection

Protection of Database Security via Collaborative Inference Detection

Related Posts :

]]> http://www.finalsemprojects.com/protection-of-database-security-via-collaborative-inference-detection/feed 0 Monitoring the Application-Layer DDoS Attacks for Popular Websites http://www.finalsemprojects.com/monitoring-the-application-layer-ddos-attacks-for-popular-websites http://www.finalsemprojects.com/monitoring-the-application-layer-ddos-attacks-for-popular-websites#comments Tue, 28 Feb 2012 13:08:50 +0000 admin http://www.finalsemprojects.com/monitoring-the-application-layer-ddos-attacks-for-popular-websites

Monitoring the Application-Layer DDoS Attacks for Popular Websites

Related Posts :

]]> http://www.finalsemprojects.com/monitoring-the-application-layer-ddos-attacks-for-popular-websites/feed 0 Traceback of DDoS Attacks Using Entropy Variations http://www.finalsemprojects.com/traceback-of-ddos-attacks-using-entropy-variations-2 http://www.finalsemprojects.com/traceback-of-ddos-attacks-using-entropy-variations-2#comments Thu, 09 Feb 2012 05:55:24 +0000 admin http://www.finalsemprojects.com/traceback-of-ddos-attacks-using-entropy-variations-2 http://www.finalsemprojects.com/traceback-of-ddos-attacks-using-entropy-variations-2/feed 0 Packet-Hiding Methods for Preventing Selective Jamming Attacks http://www.finalsemprojects.com/packet-hiding-methods-for-preventing-selective-jamming-attacks http://www.finalsemprojects.com/packet-hiding-methods-for-preventing-selective-jamming-attacks#comments Mon, 26 Dec 2011 11:24:13 +0000 admin http://www.finalsemprojects.com/?p=550 Dependable and Secure Computing

IEEE 2012- January- February 2012

Technology Used: JAVA

The open nature of the wireless medium leaves it vulnerable to intentional interference attacks, typically referred to as jamming. This intentional interference with wireless transmissions can be used as a launchpad for mounting Denial-of-Service attacks on wireless networks. Typically, jamming has been addressed under an external threat model. However, adversaries with internal knowledge of protocol specifications and network secrets can launch low-effort jamming attacks that are difficult to detect and counter. In this work, we address the problem of selective jamming attacks in wireless networks. In these attacks, the adversary is active only for a short period of time, selectively targeting messages of high importance. We illustrate the advantages of selective jamming in terms of network performance degradation and adversary effort by presenting two case studies; a selective attack on TCP and one on routing. We show that selective jamming attacks can be launched by performing real-time packet classification at the physical layer. To mitigate these attacks, we develop three schemes that prevent real-time packet classification by combining cryptographic primitives with physical-layer attributes. We analyze the security of our methods and evaluate their computational and communication overhead.

Related Posts :

]]> http://www.finalsemprojects.com/packet-hiding-methods-for-preventing-selective-jamming-attacks/feed 1 pCloud: A Distributed System for Practical PIR http://www.finalsemprojects.com/pcloud-a-distributed-system-for-practical-pir http://www.finalsemprojects.com/pcloud-a-distributed-system-for-practical-pir#comments Mon, 26 Dec 2011 11:23:00 +0000 admin http://www.finalsemprojects.com/?p=548 Dependable and Secure Computing –

IEEE 2012 – January- February 2012

Technology Used: Java/J2EE

Computational Private Information Retrieval (cPIR) protocols allow a client to retrieve one bit from a database, without the server inferring any information about the queried bit. These protocols are too costly in practice because they invoke complex arithmetic operations for every bit of the database. In this paper, we present pCloud, a distributed system that constitutes the first attempt toward practical cPIR. Our approach assumes a disk-based architecture that retrieves one page with a single query. Using a striping technique, we distribute the database to a number of cooperative peers, and leverage their computational resources to process cPIR queries in parallel. We implemented pCloud on the PlanetLab network, and experimented extensively with several system parameters. Our results indicate that pCloud reduces considerably the query response time compared to the traditional client/server model, and has a very low communication overhead. Additionally, it scales well with an increasing number of peers, achieving a linear speedup.

Related Posts :

]]> http://www.finalsemprojects.com/pcloud-a-distributed-system-for-practical-pir/feed 0 Multiple Exposure Fusion for High Dynamic Range Image Acquisition http://www.finalsemprojects.com/multiple-exposure-fusion-for-high-dynamic-range-image-acquisition http://www.finalsemprojects.com/multiple-exposure-fusion-for-high-dynamic-range-image-acquisition#comments Mon, 26 Dec 2011 11:21:46 +0000 admin http://www.finalsemprojects.com/?p=546 Image Processing -

IEEE 2012- January 2012

Technology Used: DOT NET

A multiple exposure fusion to enhance the dynamic range of an image is proposed. The construction of high dynamic range images (HDRIs) is performed by combining multiple images taken with different exposures and estimating the irradiance value for each pixel. This is a common process for HDRI acquisition. During this process, displacements of the images caused by object movements often yield motion blur and ghosting artifacts. To address the problem, this paper presents an efficient and accurate multiple exposure fusion technique for the HDRI acquisition. Our method simultaneously estimates displacements and occlusion and saturation regions by using maximum a posteriori estimation and constructs motion-blur-free HDRIs. We also propose a new weighting scheme for the multiple image fusion. We demonstrate that our HDRI acquisition algorithm is accurate, even for images with large motion.

Related Posts :

]]> http://www.finalsemprojects.com/multiple-exposure-fusion-for-high-dynamic-range-image-acquisition/feed 0 Pareto-Based Dominant Graph: An Efficient Indexing Structure To Answer Top-K Queries http://www.finalsemprojects.com/pareto-based-dominant-graph-an-efficient-indexing-structure-to-answer-top-k-queries-2 http://www.finalsemprojects.com/pareto-based-dominant-graph-an-efficient-indexing-structure-to-answer-top-k-queries-2#comments Mon, 05 Dec 2011 13:34:32 +0000 admin http://www.finalsemprojects.com/?p=540 Technology Used: Dot Net

Knowledge and Data Engineering, IEEE 2011

Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investigate the intrinsic connection between top-k queries and dominant relationships between records, and based on which, we propose an efficient layer-based indexing structure, Pareto-Based Dominant Graph (DG), to improve the query efficiency. Specifically, DG is built offline to express the dominant relationship between records and top-k query is implemented as a graph traversal problem, i.e., Traveler algorithm. We prove theoretically that the size of search space (that is the number of retrieved records from the record set to answer top-k query) in our algorithm is directly related to the cardinality of skyline points in the record set (see Theorem 3). Considering I/O cost, we propose cluster-based storage schema to reduce I/O cost in Traveler algorithm. We also propose the cost estimation methods in this paper. Based on cost analysis, we propose an optimization technique, pseudorecord, to further improve the search efficiency. In order to handle the top-k query in the high-dimension record set, we also propose N-Way Traveler algorithm. In order to handle DG maintenance efficiently, we propose “Insertion” and “Deletion” algorithms for DG. Finally, extensive experiments demonstrate that our proposed methods have significant improvement over its counterparts, including both classical and state art of top-k algorithms.

http://www.youtube.com/watch?v=AiJM0V3f6XQ

Related Posts :

]]> http://www.finalsemprojects.com/pareto-based-dominant-graph-an-efficient-indexing-structure-to-answer-top-k-queries-2/feed 0