This paper assumes a set of identical wireless hosts, each one aware of its location. The network is described by a unit distance graph whose vertices are points on the plane two of which are connected if their distance is at most one. The goal of this paper is to design local distributed solutions that require a constant number of communication rounds,… (More)
In recent years distributed storage systems have been the object of increasing interest by the research community. They promise improvements on information availability, security and integrity. Nevertheless, at this point in time, there is no a predominant approach, but a wide spectrum of proposals in the literature. In this paper we report our findings… (More)
We present a family of self-stabilizing distributed algorithms to built a spanning tree on the underlaying communications graph of an adhoc wireless network. Next, based on this principle, we show how to construct two overlaying trees which are suitable for routing tasks.