661 search results - page 78 / 133 » On Distributed Computation in Noisy Random Planar Networks |
CCS
2010
ACM
14 years 11 months ago
2010
ACM
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
ICNS
2009
IEEE
15 years 4 months ago
2009
IEEE
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
IPSN
2007
Springer
15 years 4 months ago
2007
Springer
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...