Self Localization and Routing in densely deployed wireless networks using LAS Algorithm

Localization is a key technique in wireless sensor network. We consider the problem of locating the positions of sensor nodes deployed in an environment without prior knowledge. Localization is the process of computing the locations of sensor nodes in a wireless sensor network. It focuses on checking the minimized localization strategy that can be implemented in a dense network as eligible set of nodes having static property being deployed. The set of anchor nodes evaluated in the algorithm are further used for identifying the locations of remaining nodes recursively. In this paper, a new Least Anchor Selection(LAS) algorithm is proposed to find the set of anchor nodes and to accommodate the whole network with location identification in the recursive process. This technique, an energy efficient routing methodology is framed based on Djikstra's algorithm to establish connection between nodes and base station. The energy level and sensing range of all nodes is considered to be uniform such that each battery-powered node is deployed randomly in the deployment phase. The proposed algorithm is well suited for dense network that outperforms with the minimum number of anchor node selection compared with the existing algorithms. Simulation results shows that, reliable and errorfree location identification is done by the proposed technique with insight knowledge of covering the energy consumption constraints in wireless sensor networks