Sciweavers

12301 search results - page 1795 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
MOBICOM
2009
ACM
16 years 1 months ago
Capacity of large-scale CSMA wireless networks
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
Chi-Kin Chau, Minghua Chen, Soung Chang Liew
MOBICOM
2006
ACM
16 years 1 months ago
A coordinate-based approach for exploiting temporal-spatial diversity in wireless mesh networks
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...
Hyuk Lim, Chaegwon Lim, Jennifer C. Hou
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
16 years 18 days ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 9 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
FAST
2004
15 years 8 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
« Prev « First page 1795 / 2461 Last » Next »