Coarse-grained localization: extended analyses and optimal beacon distribution

The precise and "cost-efficient" localization is of particular interest in large wireless sensor networks. For this purpose, the pertinent literature proposes various algorithms, which significantly differ in localization precision, energy consumption, and hardware requirements. One of those algorithms, also known as coarse-grained localization with centroid determination, has received particular attention due to its very low (computational) requirements. This paper extensively analyzes this algorithm with respect to highest precision and minimal energy consumption in dependence of the chosen beacon distribution. In so doing, this paper proposes some algorithmic as well as architectural modifications that yield noticeable improvements under certain circumstances