rendezvous and synchronization. Simulation results show that SSCH significantly increases network capacity in several multi-hop and single-hop wireless networking scenarios.

single hop DHT that is able to maximize performance with reasonable maintenance traffic overhead even for huge and dynamic P2P systems. We formally define the algorithm we use to detect and notify any membership change in the system, prove its correctness and performance properties. Our analysis show

acquisition systems that collect data at a single node for centralized processing. In this paper, we discuss the design and evaluation of a wireless sensor network system (called Wisden) for structural data acquisition. Wisden incorporates two novel mechanisms, reliable data transport using a hybrid of end

single hop DHT that is able to maximize performance with reasonable maintenance traffic overhead even for huge and dynamic peer-to-peer (P2P) systems. We formally define the algorithm we propose to detect and notify any membership change in the system, prove its correctness and performance properties

Recent research has demonstrated that if network churn is not excessively high, it becomes entirely reasonable for a Distributed Hash Table (DHT) to store a global lookup table at every node to achieve one-hop lookup. We present a novel algorithm for maintaining global lookup state in a DHT with a

Abstract—This paper presents mDHT, a novel architectural enhancement to DHT using multicast service discovery. In mDHT, a group of host computers in a subnet participate in a DHT overlay as a single node. A query is routed from subnet to subnet until it reaches the final destination subnet, where

the efficiency of DHT infrastructure and may result in serious load imbalance problem. In this paper, we propose ——- POND, a novel and efficient DHT algorithm to relieve the above problem. In POND, peers are divided into two types: Main Peers (MP) and Shadow Peers (SP). As other DHT systems, POND splits the name

the results for any range query within 2logN hops in a P2P system with N peers. Results of analysis and simulations show that the average delay of Armada is less than logN, and the average message cost of single-attribute range queries is about logN+2ní2 (n is the number of peers that intersect with the query

novel algorithm that processes range queries in a parallel fashion, where an on-the-fly space pruning mechanism is adopted to reduce the processing cost. In a DHT with N nodes, ERQ can answer any multi-attribute range query in less than logN(2loglogN+1) hops with low processing cost, irrespective

In this paper, we present a novel image-based rendering technique, which we call manifold hopping. Our technique provides users with perceptually continuous navigation by using only a small number of strategically sampled manifold mosaics or multiperspective panoramas. Manifold hopping has two