— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...