Sciweavers

2968 search results - page 412 / 594
» Network Programming Using PLAN
Sort
View
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 10 months 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
165
Voted
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 6 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
MOBIHOC
2008
ACM
16 years 4 months ago
Efficient binary schemes for training heterogeneous sensor and actor networks
Sensor networks are expected to evolve into long-lived, autonomous networked systems whose main mission is to provide in-situ users ? called actors ? with real-time information in...
Ferruccio Barsi, Alfredo Navarra, Maria Cristina P...
MOBICOM
2004
ACM
15 years 10 months ago
Exploiting medium access diversity in rate adaptive wireless LANs
Recent years have seen the growing popularity of multi-rate wireless network devices (e.g., 802.11a cards) that can exploit variations in channel conditions and improve overall ne...
Zhengrong Ji, Yi Yang, Junlan Zhou, Mineo Takai, R...
CEC
2008
IEEE
15 years 11 months ago
Dynamical evolution analysis of the object-oriented software systems
— Software evolution and update play a vital role in software engineering. It has many advantages, such as improving the efficiency of programming, reducing the cost of maintena...
Huan Li, Beibei Huang, Jinhu Lu