Sunday, September 2, 2012
Tuesday, August 28, 2012
IEEE ANDROID PROJECTS 2012
1. Safe Driving Using Mobile Phones IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2012/ANDROID
2. EduPad — A tablet based educational system for improving adult literacy in rural India IEEE (CONFERENCE) 2012/ANDROID
3. Designing Mobile Language Learning Applications Using Multimedia: Implications from a Small-scale Prospective Learner Study IEEE (CONFERENCE) 2012/ANDROID
4. Research and design of chatting room system based on Android Bluetooth IEEE (CONFERENCE) 2012/ANDROID
5. Design and Implementation of Improved Authentication System for Android Smartphone Users IEEE (CONFERENCE) 2012/ANDROID
6. Learn to Personalized Image Search from the Photo Sharing Websites IEEE TRANSACTIONS ON MULTIMEDIA 2012/ANDROID
7. SPOC A Secure and Privacy-preserving Opportunistic Computing Framework for Mobile-Healthcare Emergency PARALLEL AND DISTRIBUTED SYSTEMS 2012/ANDROID
8. The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks PARALLEL AND DISTRIBUTED SYSTEMS 2012/ANDROID
9. Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based Encryption CLOUD COMPUTING, PARALLEL AND DISTRIBUTED SYSTEMS 2012/ANDROID
10. Payments for Outsourced Computations PARALLEL AND DISTRIBUTED SYSTEMS 2012/ANDROID
11. Outsourced Similarity Search on Metric Data Assets KNOWLEDGE AND DATA ENGINEERING 2012/ANDROID
12. A Query Formulation Language for the Data Web IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2012/ANDROID
13. PMSE A Personalized Mobile Search Engine IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2012/ANDROID
14. Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators KNOWLEDGE AND DATA ENGINEERING 2012/ANDROID
15. Ranking Model Adaptation for Domain-Specific Search KNOWLEDGE AND DATA ENGINEERING 2012/ANDROID
16. DEFENSES AGAINST LARGE SCALE ONLINE PASSWORD GUESSING ATTACKS BY USING PERSUASIVE CLICK POINTS SECURE COMPUTING (IJCE) 2012/ANDROID
17. Efficient audit service outsourcing for data integrity in clouds CLOUD COMPUTING (ELSEVIER) 2012/ANDROID
18. Ensuring Distributed Accountability for Data Sharing in the Cloud CLOUD COMPUTING, DEPENDABLE AND SECURE COMPUTING 2012/ANDROID
19. Network Assisted Mobile Computing Optimal Uplink Query Processing MOBILE COMPUTING 2012/ANDROID
20. Tram location and route navigation system using smartphone IEEE (CONFERENCE) 2012/ANDROID
DOWNLOAD BASE PAPERS
IEEE NS2 PROJECTS 2012
1. A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access MOBILE COMPUTING 2012 / NS2
2. A Trigger Identification Service for Defending Reactive Jammers in WSN MOBILE COMPUTING 2012 / NS2
3. Capacity Scaling of Wireless Ad Hoc Networks: Shannon Meets Maxwell MOBILE COMPUTING 2012 / NS2
4. Connectivity of Multiple Cooperative Cognitive Radio Ad Hoc Networks MOBILE COMPUTING 2012 / NS2
5. CORMAN: A Novel Cooperative Opportunistic Routing Scheme in Mobile Ad Hoc Networks MOBILE COMPUTING 2012 / NS2
6. DSDMAC: Dual Sensing Directional MAC Protocol for Ad Hoc Networks with Directional Antennas MOBILE COMPUTING 2012 / NS2
7. FESCIM: Fair, Efficient, and Secure Cooperation Incentive Mechanism for Multihop Cellular Networks MOBILE COMPUTING 2012 / NS2
8. Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network MOBILE COMPUTING 2012 / NS2
9. Improving QoS in High-Speed Mobility Using Bandwidth Maps MOBILE COMPUTING 2012 / NS2
10. Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions MOBILE COMPUTING 2012 / NS2
11. Maximal Scheduling in Wireless Ad Hoc Networks with Hyper graph Interference Models VECHICULAR TECHNOLOGIES 2012 / NS2
12. TAM: A Tiered Authentication of Multicast Protocol for Ad-Hoc Networks MOBILE COMPUTING 2012 / NS2
13. Throughput and Energy Efficiency in Wireless Ad Hoc Networks With Gaussian Channels NETWORKING 2012 / NS2
14. The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks PARALLEL AND DISTRIBUTED SYSTEMS 2012 / NS2
DOWNLOAD BASE PAPERS
IEEE MATLAB PROJECTS 2012
1. A Block-Based Pass-Parallel SPIHT Algorithm IMAGE PROCESSING 2012/MATLAB
2. A Novel Data Embedding Method Using Adaptive Pixel Pair Matching. IMAGE PROCESSING 2012/MATLAB
3. A Probabilistic Model of Visual Cryptography Scheme With Dynamic Group IMAGE PROCESSING 2012/MATLAB
4. A Secret-Sharing-Based Method for Authentication of Grayscale Document Images via the Use of the PNG Image With a Data Repair Capability IMAGE PROCESSING 2012/MATLAB
5. A Semisupervised Segmentation Model for Collections of Images IMAGE PROCESSING 2012/MATLAB
6. Active Visual Segmentation IMAGE PROCESSING 2012/MATLAB
7. An Energy Efficient Algrithm Based on LEACH Protocol NETWORKING (CONFERENCE) 2012/MATLAB
8. An Energy-Based Model for the Image Edge-Histogram Specification Problem IMAGE PROCESSING 2012/MATLAB
9. An Extended Visual Cryptography Algorithm for General Access Structures IMAGE PROCESSING 2012/MATLAB
10. Blind Adaptive Sampling of Images IMAGE PROCESSING 2012/MATLAB
11. Enhanced Patterns of Oriented Edge Magnitudes for Face Recognition and Image Matching IMAGE PROCESSING 2012/MATLAB
12. Fast Wavelet-Based Image Characterization for Highly Adaptive Image Retrieval IMAGE PROCESSING 2012/MATLAB
13. Image Reduction Using Means on Discrete Product Lattices IMAGE PROCESSING 2012/MATLAB
14. Image Segmentation Based on the Poincaré Map Method IMAGE PROCESSING 2012/MATLAB
15. Improved Image Recovery From Compressed Data Contaminated With Impulsive Noise IMAGE PROCESSING 2012/MATLAB
16. Low Distortion Transform for Reversible Watermarking IMAGE PROCESSING 2012/MATLAB
17. Outdoor Scene Image Segmentation based on Background Recognition and Perceptual Organization IMAGE PROCESSING 2012/MATLAB
18. Performance Analysis of a Block-Neighborhood- Based Self- Recovery Fragile Watermarking Scheme IMAGE PROCESSING 2012/MATLAB
19. Preconditioning for Edge-Preserving Image Super Resolution IMAGE PROCESSING 2012/MATLAB
20. Riverbed: A Novel User-Steered Image Segmentation Method Based on Optimum Boundary Tracking IMAGE PROCESSING 2012/MATLAB
21. Robust Watermarking of Compressed and Encrypted JPEG 2000 images IMAGE PROCESSING 2012/MATLAB
22. Segmentation of Stochastic Images with a Stochastic Random Walker Method IMAGE PROCESSING 2012/MATLAB
23. Semi-supervised Biased Maximum Margin Analysis for Interactive Image Retrieval. IMAGE PROCESSING 2012/MATLAB
24. Sparse Color Interest Points for Image Retrieval and Object Categorization IMAGE PROCESSING 2012/MATLAB
25. Spatially Adaptive Block-Based Super-Resolution IMAGE PROCESSING 2012/MATLAB
26. Principal Visual Word Discovery for Automatic License Plate Detection IMAGE PROCESSING 2012/MATLAB
DOWNLOAD BASE PAPERS
https://rapidshare.com/files/4276624947/MATLAB.rar
IEEE JAVA PROJECTS 2012
1. A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding CLOUD COMPUTING 2012/JAVA
2. Cloud Computing Security: From Single to Multi-Clouds CLOUD COMPUTING 2012/JAVA
3. Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage CLOUD COMPUTING 2012/JAVA
4. HASBE: A Hierarchical Attribute-Based Solution for Flexible and Scalable Access Control in Cloud Computing CLOUD COMPUTING 2012/JAVA
5. Outsourced Similarity Search on Metric Data Assets CLOUD COMPUTING 2012/JAVA
6. Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based Encryption CLOUD COMPUTING 2012/JAVA
7. Toward Secure and Dependable Storage Services in Cloud Computing CLOUD COMPUTING 2012/JAVA
8. Clustering with Multi-viewpoint-Based Similarity Measure KNOWLEDGE AND DATA ENGINEERING 2012/JAVA
9. Efficient Extended Boolean Retrieval KNOWLEDGE AND DATA ENGINEERING 2012/JAVA
10. Ranking Model Adaptation for Domain-Specific Search KNOWLEDGE AND DATA ENGINEERING 2012/JAVA
11. Slicing: A New Approach for Privacy Preserving Data Publishing KNOWLEDGE AND DATA ENGINEERING 2012/JAVA
12. BloomCast: Efficient and Effective Full-Text Retrieval in Unstructured P2P Networks PARALLEL AND DISTRIBUTED SYSTEMS 2012/JAVA
13. Payments for Outsourced Computations PARALLEL AND DISTRIBUTED SYSTEMS 2012/JAVA
14. Adaptive Opportunistic Routing for Wireless Ad Hoc Networks NETWORKING 2012/JAVA
15. Design, Implementation, and Performance of a Load Balancer for SIP Server Clusters NETWORKING 2012/JAVA
16. Independent Directed Acyclic Graphs for Resilient Multipath Routing NETWORKING 2012/JAVA
17. MeasuRouting: A Framework for Routing Assisted Traffic Monitoring NETWORKING 2012/JAVA
18. Privacy- and Integrity-Preserving Range Queries in Sensor Networks NETWORKING 2012/JAVA
19. RIHT: A Novel Hybrid IP Traceback Scheme NETWORKING 2012/JAVA
20. Router Support for Fine-Grained Latency Measurements NETWORKING 2012/JAVA
21. A Stochastic Model of Multi-virus Dynamics SECURE COMPUTING 2012/JAVA
22. Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs SECURE COMPUTING 2012/JAVA
23. Detecting and Resolving Firewall Policy Anomalies SECURE COMPUTING 2012/JAVA
24. Detecting Spam Zombies by Monitoring Outgoing Messages SECURE COMPUTING 2012/JAVA
25. On the Security of a Ticket-Based Anonymity System with Traceability Property in Wireless Mesh Networks SECURE COMPUTING 2012/JAVA
26. Online Modeling of Proactive Moderation System for Auction Fraud Detection SECURE COMPUTING 2012/JAVA
27. Packet-Hiding Methods for Preventing Selective Jamming Attacks SECURE COMPUTING 2012/JAVA
28. Risk-Aware Mitigation for MANET Routing Attacks SECURE COMPUTING 2012/JAVA
29. A Novel Data Embedding Method Using Adaptive Pixel Pair Matching IMAGE PROCESSING 2012/JAVA
30. Improving Various Reversible Data Hiding Schemes Via Optimal Codes for Binary Covers IMAGE PROCESSING 2012/JAVA
31. Scalable Coding of Encrypted Images IMAGE PROCESSING 2012/JAVA
32. Learn to Personalized Image Search from the Photo Sharing Websites MULTIMEDIA 2012/JAVA
33. Fast Data Collection in Tree-Based Wireless Sensor Networks MOBILE COMPUTING 2012/JAVA
34. Protecting Location Privacy in Sensor Networks against a Global Eavesdropper MOBILE COMPUTING 2012/JAVA
35. Bootstrapping Ontologies for Web Services SERVICE COMPUTING (WEB SERVICE) 2012/JAVA
36. Handwritten Chinese Text Recognition by Integrating Multiple Contexts IMAGE PROCESSING 2012/JAVA
37. Adaptive Membership Functions for Hand-Written Character Recognition by Voronoi-based Image Zoning IMAGE PROCESSING 2012/JAVA
38. Semantics-Based Automated Service Discovery WEB SERVICE (SOA) 2012/JAVA
39. Efficient Fuzzy Type-Ahead Search in XML Data KNOWLEDGE AND DATA ENGINEERING 2012/JAVA
40. A Probabilistic Model of (t,n) Visual Cryptography Scheme With Dynamic Group IMAGE PROCESSING 2012/JAVA
41. Energy-Efficient Cooperative Video Distribution with Statistical QoS Provisions over Wireless Networks MOBILE COMPUTING 2012/JAVA
DOWNLOAD BASE PAPERS
https://rapidshare.com/files/3188434777/JAVA.rar
Monday, August 27, 2012
IEEE DOTNET PROJECTS 2012
1 A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding.
CLOUD COMPUTING 2012/.NET
2 Cloud Computing Security From Single to Multi-Clouds.CLOUD COMPUTING (IEEE CONFERENCE) 2012/.NET
3 Enhanced Data Security Model for Cloud Computing CLOUD COMPUTING (IEEE CONFERENCE) 2012/.NET
4 Ensuring Distributed Accountability for Data Sharing in the Cloud. CLOUD COMPUTING 2012/.NET
5 HASBE: A Hierarchical Attribute-Based Solution for Flexible and Scalable Access Control in Cloud Computing. CLOUD COMPUTING 2012/.NET
6 Outsourced Similarity Search on Metric Data Assets.CLOUD COMPUTING 2012/.NET
7 Privacy-Preserving Public Auditing for Secure Cloud Storage CLOUD COMPUTING 2012/.NET
8 Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based Encryption. CLOUD COMPUTING 2012/.NET
9 Toward Secure and Dependable Storage Services in Cloud Computing. CLOUD COMPUTING 2012/.NET
10 A Query Formulation Language for the data web KNOWLEDGE AND DATA ENGINEERING 2012/.NET
11 Creating Evolving User Behavior Profiles Automatically KNOWLEDGE AND DATA ENGINEERING 2012/.NET
12 D-Cache: Universal Distance Cache for Metric Access Methods KNOWLEDGE AND DATA ENGINEERING 2012/.NET
13 DDD: A New Ensemble Approach for Dealing with Concept Drift KNOWLEDGE AND DATA ENGINEERING 2012/.NET
14 Efficient Computation of Range Aggregates against Uncertain Location-Based Queries KNOWLEDGE AND DATA ENGINEERING
2012/.NET
15 Efficient Fuzzy Type-Ahead Search in XML Data KNOWLEDGE AND DATA ENGINEERING 2012/.NET
16 Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis KNOWLEDGE AND DATA ENGINEERING 2012/.NET
17 Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques KNOWLEDGE AND DATA ENGINEERING 2012/.NET
18 Measuring the Sky: On Computing Data Cubes via Skylining the Measures KNOWLEDGE AND DATA ENGINEERING 2012/.NET
19 Mining Web Graphs for Recommendations KNOWLEDGE AND DATA ENGINEERING 2012/.NET
20 Organizing User Search Histories KNOWLEDGE AND DATA ENGINEERING 2012/.NET
21 Publishing Search Logs—A Comparative Study of Privacy Guarantees KNOWLEDGE AND DATA ENGINEERING 2012/.NET
22 Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators KNOWLEDGE AND DATA ENGINEERING 2012/.NET
23 ROAD: A New Spatial Object Search Framework for Road Networks KNOWLEDGE AND DATA ENGINEERING 2012/.NET
24 Scalable Learning of Collective Behavior KNOWLEDGE AND DATA ENGINEERING 2012/.NET
25 Slicing: A New Approach for Privacy Preserving Data Publishing KNOWLEDGE AND DATA ENGINEERING 2012/.NET
26 Tree-Based Mining for Discovering Patterns of Human Interaction in Meetings KNOWLEDGE AND DATA ENGINEERING 2012/.NET
27 Bounding the Impact of Unbounded Attacks in Stabilization PARALLEL AND DISTRIBUTED SYSTEMS 2012/.NET
28 Catching Packet Droppers and Modifiers in Wireless Sensor Networks PARALLEL AND DISTRIBUTED SYSTEMS 2012/.NET
29 The Three-Tier Security Scheme in Wireless Sensor Networks with Mobile Sinks PARALLEL AND DISTRIBUTED SYSTEMS 2012/.NET
30 A New Cell-Counting-Based Attack Against Tor NETWORKING 2012/.NET
31 Optimal Source-Based Filtering of Malicious Traffic NETWORKING 2012/.NET
32 Topology Control in Mobile AD-HOC Networks with Cooperative Communications NETWORKING (IEEE JOURNAL) 2012/.NET
33 A Secure Intrusion detection system against DDOS attack in Wireless Mobile Ad-hoc Network SECURE COMPUTING (IJCA) 2012/.NET
34 Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs SECURE COMPUTING 2012/.NET
35 ES-MPICH2: A Message Passing Interface with Enhanced Security SECURE COMPUTING 2012/.NET
36 On the Security and Efficiency of Content Distribution via Network Coding SECURE COMPUTING 2012/.NET
37 SPOC: A Secure and Privacy-preserving Opportunistic Computing Framework forMobile-Healthcare Emergency SECURE COMPUTING 2012/.NET
38 A Novel Data Embedding Method Using Adaptive Pixel Pair Matching IMAGE PROCESSING 2012/.NET
39 A Probabilistic Model of Visual Cryptography Scheme With Dynamic Group IMAGE PROCESSING 2012/.NET
40 Active Visual Segmentation IMAGE PROCESSING 2012/.NET
41 Image Segmentation Based on the Poincaré Map Method IMAGE PROCESSING 2012/.NET
42 K-N SECRET SHARING VISUAL CRYPTOGRAPHY SCHEME FOR COLOR IMAGE USING RANDOM NUMBER IMAGE PROCESSING (IJEST) 2012/.NET
43 Multiple Exposure Fusion for High Dynamic Range Image Acquisition IMAGE PROCESSING 2012/.NET
44 Semi-supervised Biased Maximum Margin Analysis for Interactive Image Retrieval IMAGE PROCESSING 2012/.NET
45 Smile Detection by Boosting Pixel Differences IMAGE PROCESSING 2012/.NET
46 View-invariant action recognition based on Artificial Neural Networks IMAGE PROCESSING 2012/.NET
47 Cooperative Download in Vehicular Environments MOBILE COMPUTING 2012/.NET
48 Distributed Throughput Maximization in Wireless Networks via Random Power Allocation MOBILE COMPUTING 2012/.NET
49 Network Assisted Mobile Computing with Optimal Uplink Query Processing MOBILE COMPUTING 2012/.NET
50 Protecting Location Privacy in Sensor Networks against a Global Eavesdropper MOBILE COMPUTING 2012/.NET
51 Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks MOBILE COMPUTING 2012/.NET
52 Revisiting Defenses against Large-Scale Online Password Guessing Attacks SECURE COMPUTING 2012/.NET
53 A Novel Anti phishing framework based on visual cryptography IMAGE PROCESSING 2012/.NET
54 AMPLE: An Adaptive Traffic Engineering System Based on Virtual Routing Topologies NETWORKING (JOURNAL) 2012/.NET
55 Robust Face-Name Graph Matching for Movie Character Identification MULTIMEDIA 2012/.NET
56 Low-Complexity Compression Method for Hyperspectral Images Based on Distributed Source Coding IMAGE PROCESSING 2012/.NET
57 Balancing the Trade-Offs between Query Delay and Data Availability in MANETs PARALLEL AND DISTRIBUTED SYSTEMS 2012/.NET
58 Efficient Multidimensional Fuzzy Search for Personal Information Management Systems KNOWLEDGE AND DATA ENGINEERING 2012/.NET
59 Robustness of Offline Signature Verification Based on Gray Level Features IMAGE PROCESSING/ INFORMATION FORENSICS & SECURITY
2012/.NET
60 Controllable SecureWatermarking Technique for Tradeoff Between Robustness and Security IMAGE PROCESSING/ INFORMATION FORENSICS & SECURITY 2012/.NET
61 A Discriminative Model of Motion and Cross Ratio for View- Invariant Action Recognition IMAGE PROCESSING 2012/.NET
61 A Discriminative Model of Motion and Cross Ratio for View- Invariant Action Recognition IMAGE PROCESSING 2012/.NET
62 Towards Accurate Mobile Sensor Network Localization in Noisy Environments MOBILE COMPUTING 2012/.NET
63 Persuasive Cued Click-Points: Design, Implementation, and Evaluation of a Knowledge-Based Authentication Mechanism SECURE COMPUTING 2012/.NET
64 Using Linked Data to Annotate and Search Educational Video Resources for Supporting Distance Learning LEARNING TECHNOLOGIES 2012/.NET
65 Multi-biometric Cryptosystems Based on Feature-Level Fusion IMAGE PROCESSING 2012/.NET
Download Base papers:
https://rapidshare.com/files/2544105175/Dot NET.rarMonday, October 3, 2011
THE COQUOS APPROACH TO CONTINUOUS QUERIES IN UNSTRUCTURED OVERLAYS
THE COQUOS APPROACH TO CONTINUOUS QUERIES IN UNSTRUCTURED OVERLAYS
ABSTRACT:
The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly enhanced by incorporating two capabilities, namely a mechanism through which peers can register their long term interests with the network so that they can be continuously notified of new data items, and a means for the peers to advertise their contents. Although researchers have proposed a few unstructured overlay-based publish-subscribe systems that provide the above capabilities, most of these systems require intricate indexing and routing schemes, which not only make them highly complex but also render the overlay network less flexible toward transient peers. This paper argues that for many P2P applications, implementing full-fledged publish-subscribe systems is an overkill. For these applications, we study the alternate continuous query paradigm, which is a best-effort service providing the above two capabilities. We present a scalable and effective middleware, called CoQUOS, for supporting continuous queries in unstructured overlay networks. Besides being independent of the overlay topology, CoQUOS preserves the simplicity and flexibility of the unstructured P2P network. Our design of the CoQUOS system is characterized by two novel techniques, namely cluster-resilient random walk algorithm for propagating the queries to various regions of the network and dynamic probability-based query registration scheme to ensure that the registrations are well distributed in the overlay. Further, we also develop effective and efficient schemes for providing resilience to the churn of the P2P network and for ensuring a fair distribution of the notification load among the peers. This paper studies the properties of our algorithms through theoretical analysis. We also report series of experiments evaluating the effectiveness and the costs of the proposed schemes.
System Architecture:
Existing System:
Despite their popularity, most of the current unstructured P2P content distribution systems suffer from certain serious limitations. One such limitation is their simple, on demand mechanism for content discovery. Peers in these systems discover data items by circulating queries within the overlay network. A peer receiving a query responds back to the initiating node if it has any matching content. Upon processing a query, the recipient node removes it from its local buffers1. Thus, a query expires after it completes its circulation within the network. In other words, the network forgets the queries once they have completed their circulation. For clarity purposes, we call this the ad hoc query model, and we refer to the queries as ad hoc queries.
Disadvantages:
1. One such limitation is their simple, on demand mechanism for content discovery.
2. However, this approach is unviable. Besides heavy messaging overheads, this scheme could overwhelm the peers with unwanted advertisements.
3. The ad hoc query model suffers from two main shortcomings. First, an ad hoc query is only capable of searching and retrieving content that exists in the P2P network at the time the query was issued.
Proposed System:
We Propose,
We focus on an alternate notification paradigm called the continuous query model. Similar to content-based pub-sub systems this model provides a mechanism through which peers can register their queries, which are maintained in the network for extended durations of time. However, in contrast to traditional pub-sub model, a system implementing the continuous query model provides a best-effort notification service for the registered queries informing their initiating nodes of new content that may have been added in the recent past.
. Peers in these systems discover data items by circulating queries within the overlay network. A peer receiving a query responds back to the initiating node if it has any matching content. Upon processing a query, the recipient node removes it from its local buffers1. Thus, a query expires after it completes its circulation within the network. In other words, the network forgets the queries once they have completed their circulation. For clarity purposes, we call this the ad hoc query model, and we refer to the queries as ad hoc queries.
Advantages:
1. First, we present a novel query propagation technique called Cluster Resilient Random Walk (CRW). This technique retains the overall framework of the random walk paradigm. However, at each step of propagation, CRW favors neighbors that are more likely to send messages deeper into the network thereby enabling the continuous queries to reach different topological regions of the overlay network.
2. Second, a dynamic probability scheme is proposed for enabling the recipients of a continuous query to make independent decisions on whether to register the query. In this scheme, a query that has not been registered in the past several hops has a higher chance of getting registered in its next hop, which ensures that registrations are well distributed along the path of a query message.
3. Third, we discuss a passive replication-based scheme for preserving high notification effectiveness of the system even when the underlying P2P network experiences significant churn.
Module Description:
- Cluster Resilient Random Walk
- Dynamic Probability Scheme
- Passive Replication
- Overlay Churn
Cluster Resilient Random Walk:
Random walk corresponds to a depth first traversal of the network, and a message propagated through random walks has a higher probability of reaching remote regions of the network than its flooding-based counterpart. In this paper we use the terms random walk and pure random walk (PRW) interchangeably.
The above property of the random walk makes it an attractive paradigm for propagating continuous queries. Unfortunately, the random walk protocol suffers from one significant drawback that undermines its utility for propagating queries in the CoQUOS system.
we have designed a novel query dissemination scheme called cluster resilient random walk (CRW). This scheme is motivated by a crucial observation: Two peers belonging to the same cluster generally have large numbers of common neighbors.
Dynamic Probability Scheme:
The CRW scheme provides a mechanism for propagating a continuous query. But, how does a node receiving this message decide whether to register the query? A straightforward solution would be to register a query at every node it visits. However, this would result in large numbers of unnecessary subscriptions, which affects the efficiency of the network.
The reason is that for some continuous queries a long series of peers in the path of the query message may all decide not to register the query, whereas another sequence of consecutive nodes may all decide to host the query. The announcements originated near the dry patches of a query's path might fail to reach any of its beacon nodes, thus leading to low success rates. Considering these requirements, we have designed a novel dynamic probability-based technique (DP scheme, for short) for peers to decide whether to register a continuous query. However, the registration probability of a query varies as the query traverses along its route. The central idea of the dynamic probability scheme can be summarized as follows:
The probability of registering a query at a peer node would be high if the query has not been registered at the nodes it visited in the recent past. In contrast, if the query has been registered at a node that visited in the past few hops, the probability of it getting registered at the
Current peer would be low.
Passive Replication:
We discuss a passive replication-based scheme for preserving high notification effectiveness of the system even when the underlying P2P network experiences significant churn.
This churn of the overlay network can adversely impact the success of continuous queries and announcements. When a node Pi gracefully leaves the system, it asks one of its neighbors to handle all registered queries at Pi and also notifies all the beacon nodes with queries issued by Pi to remove the queries. However, when Pi exits the system unexpectedly, all the registrations are lost and the notification success rates of the respective queries and the matching announcements drop. Thus, effective mechanisms are needed to alleviate the negative effects of churn in the overlay network.
Overlay Churn:
In order to counter the adverse effects of network churn, we have designed a low-cost technique wherein the query registrations present on a peer are replicated on one or more of its neighbors. Failures are detected through periodic exchange of heartbeat messages between the beacon node and the peers maintaining its replicas. The beacon node that does not respond to two consecutive messages is assumed to have failed. In the interest of better load distribution, two or more neighbors may takeover subsets of the queries registered at the failed node. The communication costs of maintaining query replicas are optimized through lazy replication and piggybacking the information they utilize. They only require interactions between neighboring peers, thus making them suitable for generic unstructured P2P networks. In both schemes, neighboring peers periodically (at the end of pre-specified cycles) exchange information about their loads. Based on the load information obtained from its neighbors, a peer decides whether it is overloaded.
System Configuration:-
H/W System Configuration:-
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
S/W System Configuration:-
v Operating System :Windows95/98/2000/XP
v Application Server : Tomcat5.0/6.X
v Front End : HTML, Java, Jsp, jquery
v Scripts : JavaScript.
v Server side Script : Java Server Pages.
v Database : Mysql
v Database Connectivity : JDBC.
Subscribe to:
Posts (Atom)