Sciweavers

661 search results - page 92 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
OPODIS
2007
14 years 11 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 3 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...
MOBIHOC
2005
ACM
15 years 9 months ago
Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
Xiangying Yang, Gustavo de Veciana
WISEC
2010
ACM
15 years 2 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
IMC
2006
ACM
15 years 3 months ago
Comprehensive view of a live network coding P2P system
In this paper we present the first implementation of a P2P content distribution system that uses Network Coding. Using results from live trials with several hundred nodes, we pro...
Christos Gkantsidis, John Miller, Pablo Rodriguez