Sciweavers

460 search results - page 55 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
MOBIHOC
2005
ACM
14 years 8 months ago
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Recently, several studies have analyzed the statistical properties of low power wireless links in real environments, clearly demonstrating the differences between experimentally o...
Alberto Cerpa, Jennifer L. Wong, Miodrag Potkonjak...
JNW
2008
173views more  JNW 2008»
13 years 9 months ago
Dominating Set Theory based Semantic Overlay Networks for Efficient and Resilient Content Distribution
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
J. Amutharaj, S. Radhakrishnan
MIDDLEWARE
2005
Springer
14 years 2 months ago
Frugal Event Dissemination in a Mobile Environment
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
Sébastien Baehni, Chirdeep Singh Chhabra, R...
JPDC
2006
133views more  JPDC 2006»
13 years 9 months ago
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing fe...
Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Gr...
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 9 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu