Landmarks Selection Algorithm for Wireless Sensor Networks
Sergey Baskakov · 2008
In this paper, we propose a distributed, self-organized landmarks selection algorithm that ensures different patterns of landmarks spread throughout deployment area of a wireless sensor network. The algorithm is highly scalable through decentralized implementation with low time and memory complexity. The proposed technique represents an optimal complexity algorithm for virtual coordinates routing protocols in large-scale wireless sensor networks, and our simulations show that it improves significantly virtual coordinates routing protocols performance, preserving the simplicity and high scalability of this routing method.