Sciweavers

1674 search results - page 98 / 335
» On the Optimality of the ARQ-DDF Protocol
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 2 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
IWCMC
2010
ACM
14 years 2 months ago
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
ICDCN
2009
Springer
14 years 1 months ago
Rate Adaptive Channel MAC
A novel ‘Rate adaptive Channel MAC paradigm’ has been proposed considering perfect channel prediction and optimal rate adaptation. Simulation results reveal a significant perf...
Manzur Ashraf, Aruna Jayasuriya
SC
1995
ACM
14 years 15 days ago
Lazy Release Consistency for Hardware-Coherent Multiprocessors
Release consistency is a widely accepted memory model for distributed shared memory systems. Eager release consistency represents the state of the art in release consistent protoc...
Leonidas I. Kontothanassis, Michael L. Scott, Rica...
P2P
2009
IEEE
103views Communications» more  P2P 2009»
14 years 3 months ago
Towards Robust Peer Counting
Abstract—This paper describes T-SIZE, a peer counting protocol that is based on gossip-based aggregation. Peer counting has become increasingly important as the size of the netwo...
Alberto Montresor, Ali Ghodsi