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

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

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

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

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