A cooperative nearest neighbours topology control algorithm for wireless ad hoc networks

In this paper, we introduce a simple distributed algorithm that assigns appropriate individual transmission powers to devices in a wireless ad hoc network. In contrast to many other proposed algorithms, it does not depend on special hardware. It requires only local neighbourhood information and therefore avoids flooding information throughout the network. Finally, the cooperative nature of the algorithm avoids that devices cause excessive interference by using unnecessarily high transmission powers. We show by means of simulation that the topologies created by this algorithm without any global knowledge are as effective as topologies resulting from a good choice of a common transmission power (which would require global knowledge) in terms of the achievable throughput.