Sciweavers

1432 search results - page 187 / 287
» Hardness of robust network design
Sort
View
TON
2010
126views more  TON 2010»
15 years 1 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
15 years 11 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
LOCA
2005
Springer
15 years 11 months ago
Classifying the Mobility of Users and the Popularity of Access Points
Abstract. There is increasing interest in location-aware systems and applications. It is important for any designer of such systems and applications to understand the nature of use...
Minkyong Kim, David Kotz
MOBICOM
2004
ACM
15 years 11 months ago
MobiDesk: mobile virtual desktop computing
We present MobiDesk, a mobile virtual desktop computing hosting infrastructure that leverages continued improvements in network speed, cost, and ubiquity to address the complexity...
Ricardo A. Baratto, Shaya Potter, Gong Su, Jason N...
PODC
2004
ACM
15 years 11 months ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan