Sciweavers

346 search results - page 42 / 70
» Routing networks for distributed hash tables
Sort
View
MDM
2007
Springer
131views Communications» more  MDM 2007»
14 years 1 months ago
Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks
Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access t...
Michele Albano, Stefano Chessa, Francesco Nidito, ...
IWDC
2005
Springer
117views Communications» more  IWDC 2005»
14 years 1 months ago
Oasis: A Hierarchical EMST Based P2P Network
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and ...
Pankaj Ghanshani, Tarun Bansal
IPPS
1998
IEEE
13 years 12 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
MOBIHOC
2009
ACM
14 years 2 months ago
Routing in multi-hop wireless mesh networks with bandwidth guarantees
Wireless Mesh Networks (WMNs) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we d...
Ronghui Hou, King-Shan Lui, Hon Sun Chiu, Kwan L. ...
HOTOS
2007
IEEE
13 years 11 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer