Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...