661 search results - page 66 / 133 » On Distributed Computation in Noisy Random Planar Networks |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
DCOSS
2005
Springer
14 years 11 months ago
2005
Springer
In this paper, we consider the problem of energy balanced data propagation in wireless sensor networks and we generalise previous works by allowing realistic energy assignment. A n...