Reach Centroid Localization Algorithm

Abstract

As much as accurate or precise position estimation is always desirable, coarse accuracy due to sensor node localization is often sufficient. For such level of accuracy, Range-free localization techniques are being explored as low cost alternatives to range based localization techniques. To manage cost, few loca-tion aware nodes, called anchors are deployed in the wireless sensor environ-ment. It is from these anchors that all other free nodes are expected to esti-mate their own positions. This paper therefore, takes a look at some of the foremost Range-free localization algorithms, detailing their limitations, with a view to proposing a modified form of Centroid Localization Algorithm called Reach Centroid Localization Algorithm. The algorithm employs a form of anchor nodes position validation mechanism by looking at the consistency in the quality of Received Signal Strength. Each anchor within the vicinity of a free node seeks to validate the actual position or proximity of other anchors within its vicinity using received signal strength. This process mitigates mul-tipath effects of radio waves, particularly in an enclosed environment, and consequently limits localization estimation errors and uncertainties. Centroid Localization Algorithm is then used to estimate the location of a node using the anchors selected through the validation mechanism. Our approach to lo-calization becomes more significant, particularly in indoor environments, where radio signal signatures are inconsistent or outrightly unreliable. Simu-lated results show a significant improvement in localization accuracy when compared with the original Centroid Localization Algorithm, Approximate Point in Triangulation and DV-Hop.