Locate, promote and split: An exponentially fast localization algorithm for wireless sensor networks

Development of algorithms for discovering the location of nodes in a wireless sensor network is a task that offers a lot challenges to the research community. In this paper, we present a protocol for locating nodes in a wireless sensor network. The proposed protocol follows a locate-promote and split strategy. We analyze the number of iterations needed to locate almost all nodes in a network and the delays incurred in the process of localization. We show that the rate of localization of the proposed protocol in terms of the number of nodes localized with respect to the number of iterations is exponential.