Heuristics Based Query Processing for Large RDF Graphs Using Cloud Computing

Heuristics Based Query Processing for Large RDF Graphs Using Cloud Computing

Technology Used: Java / J2EE Knowledge and Data Engineering, 2011 Download Projects 2011 Basepaper Abstract Semantic Web is an emerging area to augment human reasoning for which various technologies are being developed. These technologies have been standardized by W3C. One such standard is the RDF. With the explosion of semantic web technologies, large RDF graphs are common place. Current frameworks do not scale for large RDF graphs and as a result does not address these challenges. In this paper, we describe a framework that we built using Hadoop to store…

Read More

Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries

Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries

Technology Used: Java 2011 Download Projects 2011 Basepaper ABSTRACT With the emergence of high data rate sensor network applications, there is an increasing demand for high-performance query services. To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose workloads, DCQS is specifically designed for query services in wireless sensor networks. DCQS has several unique features. First, it optimizes the query performance through conflict-free transmission scheduling based on the temporal properties…

Read More

Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions

Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions

Technology Used: Java 2011 Download Projects 2011 Basepaper ABSTRACT It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper, we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain model and give an explicit throughput formula that takes into account the cost of collisions and overhead. The…

Read More

Fast Detection of Mobile Replica Node Attacks in Wireless Sensor Networks Using Sequential Hypothesis Testing

Fast Detection of Mobile Replica Node Attacks in Wireless Sensor Networks Using Sequential Hypothesis Testing

Technology Used: Java 2011 Download Projects 2011 Basepaper ABSTRACT Due to the unattended nature of wireless sensor networks, an adversary can capture and compromise sensor nodes, make replicas of them, and then mount a variety of attacks with these replicas. These replica node attacks are dangerous because they allow the attacker to leverage the compromise of a few nodes to exert control over much of the network. Several replica node detection schemes have been proposed in the literature to defend against such attacks in static sensor networks. However, these schemes…

Read More

Dynamics of Malware Spread in Decentralized Peer-to-Peer Networks

Dynamics of Malware Spread in Decentralized Peer-to-Peer Networks

Technology Used: Java Dependable and Secure Computing¬† July-August 2011 Download Projects 2011 Basepaper ABSTRACT In this paper, we formulate an analytical model to characterize the spread of malware in decentralized, Gnutella type peer-to-peer (P2P) networks and study the dynamics associated with the spread of malware. Using a compartmental model, we derive the system parameters or network conditions under which the P2P network may reach a malware free equilibrium. The model also evaluates the effect of control strategies like node quarantine on stifling the spread of malware. The model is then…

Read More

Privacy-Preserving Updates to Anonymous and Confidential Databases

Privacy-Preserving Updates to Anonymous and Confidential Databases

Technology Used: Java Dependable and Secure Computing, 2011 Download Projects 2011 Basepaper ABSTRACT Suppose Alice owns a k-anonymous database and needs to determine whether her database, when inserted with a tuple owned by Bob, is still k-anonymous. Also, suppose that access to the database is strictly controlled, because for example data are used for certain experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob (e.g., a patient medical record); on the other hand, the confidentiality of…

Read More

A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks

A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks

Technology Used: Java / J2EE 2011 Download Projects 2011 Basepaper Monitoring personal locations with a potentially untrusted server poses privacy threats to the monitored individuals. To this end, we propose a privacy-preserving location monitoring system for wireless sensor networks. In our system, we design two in-network location anonymization algorithms, namely, resource and quality-aware algorithms, that aim to enable the system to provide high-quality location monitoring services for system users, while preserving personal location privacy. Both algorithms rely on the well-established k-anonymity privacy concept, that is, a person is indistinguishable among…

Read More

Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems

Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems

Technology Used: Java Parallel and Distributed Systems, 2011 Download Projects 2011 Basepaper Although anonymizing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many systems try to mask the identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based: peers have to pre-construct an anonymous path before transmission. The overhead of maintaining and updating such paths is significantly high. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymity protocol for decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of lower overhead by mainly…

Read More

Nymble: Blocking Misbehaving Users in Anonymizing Networks

Nymble: Blocking Misbehaving Users in Anonymizing Networks

Technology Used: Java / J2EE Dependable Secure Computing, 2011 Download Project 2011 Basepaper Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client’s IP address from the server. The success of such networks, however, has been limited by users employing this anonymity for abusive purposes such as defacing popular Web sites. Web site administrators routinely rely on IP-address blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser routes through an…

Read More

Novel Defense Mechanism Against Data Flooding Attacks In Wireless Ad Hoc Networks

Novel Defense Mechanism Against Data Flooding Attacks In Wireless Ad Hoc Networks

Technology Used: Java Consumer Electronics, 2010 Mobile users like to use their own consumer electronic devices anywhere and at anytime to access multimedia data. Hence, we expect that wireless ad hoc networks will be widely used in the near future since these networks form the topology with low cost on the fly. However, consumer electronic devices generally operate on limited battery power and therefore are vulnerable to security threats like data flooding attacks. The data flooding attack causes Denial of Service (DoS) attacks by flooding many data packets. However, there…

Read More