Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
— We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a si...