Localization of sensor nodes in the presence of obstruction in wireless sensor network environment

Localization is considered as an important parameter in wireless sensor network where it support the node to identify its location so that routing can take place in power efficient way in a dynamic network topology. The issue of localization has been addressed in many research areas such as vehicle navigation systems, virtual reality systems, user localization in wireless sensor networks (WSNs). The proposed model presents a unique localization framework considering the presence of obstruction in the environment of wireless sensor network with random node placement and irregular radio patterns for minimizing the estimates of the range free localization errors. The mobile anchor nodes frequently broadcast beacon message, including their current location approach. The range-free localization algorithms evaluate the node ranging error accuracy in the anisotropic networks to address the localization inequality issues for the empty feasible set. Here, we applied the approach of convex optimization for localization since the computation is faster. Depending upon the node density the regular node need to communicate with the mobile anchor for the localization process by participating the regular nodes in the cooperative localization process.