PAM An Efficient And Privacy-Aware Monitoring Framework For Continuously Moving Objects

Technology Used: Java / J2EE Knowledge and Data Engineering, 2010 Efficiency and privacy are two fundamental issues in moving object monitoring. This paper proposes a privacy-aware monitoring (PAM) framework that addresses both issues. The framework distinguishes itself from the existing work by being the first to holistically address the issues of location updating in terms of monitoring accuracy, efficiency, and privacy, particularly, when and how mobile clients should send location updates to the server. Based on the notions of safe region and most probable result, PAM performs location updates only…

Read More

Closeness A New Privacy Measure For Data Publishing

Technology Used: Java / J2EE Knowledge and Data Engineering, 2010 The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to certain “identifying” attributes) contains at least k records. Recently, several authors have recognized that k-anonymity cannot prevent attribute disclosure. The notion of `-diversity has been proposed to address this; `-diversity requires that each equivalence class has at least ` well-represented values for each sensitive attribute. In this article, we show that `-diversity has a…

Read More

Binrank Scaling Dynamic Authority-Based Search Using Materialized Subgraphs

Binrank Scaling Dynamic Authority-Based Search Using Materialized Subgraphs projects 2010 Technology Used: Java / J2EE Dynamic authority-based keyword search algorithms, such as ObjectRank and personalized PageRank, leverage semantic link information to provide high quality, high recall search in databases, and the Web. Conceptually, these algorithms require a querytime PageRank-style iterative computation over the full graph. This computation is too expensive for large graphs, and not feasible at query time. Alternatively, building an index of precomputed results for some or all keywords involves very expensive preprocessing. We introduce BinRank, a system…

Read More

Minimizing Delay And Maximizing Lifetime For Wireless Sensor Networks With Any Cast

projects  2010 Minimizing Delay And Maximizing Lifetime For Wireless Sensor Networks With Any Cast – projects In this paper, we are interested in minimizing the delay and maximizing the lifetime of event-driven wireless sensor networks for which events occur infrequently. In such systems, most of the energy is consumed when the radios are on, waiting for a packet to arrive. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of these energy-constrained wireless sensor networks. However, sleep-wake scheduling could result in substantial delays because a transmitting node needs to…

Read More

A Fault Tolerant Communication Architecture Supporting Critical Monitoring With Wireless Sensor Networks

  A Fault Tolerant Communication Architecture Supporting Critical Monitoring With Wireless Sensor Networks projects 2012 This paper deals with an integrated MAC and Routing protocol, able to manage faults occurring in Wireless Sensor Network (WSN). To this end, the protocol design has been inspired by the cross-layer principle to minimize both the signaling overhead and power consumption. After an accurate functional characterization, the performance is presented for the most relevant figures (recovering efficiency and latency, as well as the length of established end-to-end paths). The satisfactory results suggest the application…

Read More

A Cooperative Diversity-Based Robust Mac Protocol In Wireless Ad Hoc Networks

A Cooperative Diversity-Based Robust Mac Protocol In Wireless Ad Hoc Networks 2011 In interference-rich and noisy environment, wireless communication is often hampered by unreliable communication links. Recently, there has been active research on cooperative communication that improves the communication reliability by having a collection of radio terminals transmit signals in a cooperative way. This paper proposes a medium access control (MAC) algorithm, called Cooperative Diversity MAC (CD-MAC), which exploits the cooperative communication capability of the physical (PHY) layer to improve robustness in wireless ad hoc networks. In CD-MAC, each terminal…

Read More

Mitigating Selective Forwarding Attacks With A Channel-Aware Approach In WMNS

Mitigating Selective Forwarding Attacks With A Channel-Aware Approach In WMNS 2010 In this paper, we consider a special case of denial of service (DoS) attack in wireless mesh networks (WMNs) known as selective forwarding attack (a.k.a gray hole attacks). With such an attack, a misbehaving mesh router just forwards a subset of the packets it receives but drops the others. While most of the existing studies on selective forwarding attacks focus on attack detection under the assumption of an error-free wireless channel, we consider a more practical and challenging scenario…

Read More

Optimize Storage Placement In Sensor Networks

Optimize Storage Placement In Sensor Networks 2010 Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introduced in this paper to store the data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all data to a central place for archiving and reduce the communication cost induced by the network query. The objective of this paper is to address the storage node placement problem…

Read More

Secure Data Collection In Wireless Sensor Networks Using Randomized Dispersive Routes

Secure Data Collection In Wireless Sensor Networks Using Randomized Dispersive Routes 2010 Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes formed by these attacks. We argue that existing multi-path routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once an adversary acquires the routing algorithm, it can compute the same routes known to the source, and hence endanger all information sent over these routes. In this paper, we develop…

Read More

SSUM: Smart Server Update Mechanism For Maintaining Cache Consistency In Mobile Environments- Mobile Computing

SSUM: Smart Server Update Mechanism For Maintaining Cache Consistency In Mobile Environments- Mobile Computing 2010 This paper proposes a cache consistency scheme based on a previously proposed architecture for caching database data in MANETs. The original scheme for data caching stores the queries that are submitted by requesting nodes in special nodes, called query directories (QDs), and uses these queries to locate the data (responses) that are stored in the nodes that requested them, called caching nodes (CNs). The consistency scheme is server-based in which control mechanisms are implemented to…

Read More