Innovative Localization Algorithm Using the Line of Intersection Technique in Wireless Sensor Networks

Abstract

Wireless Sensor Networks consists of a small number of random nodes, which possess lesser memory, fault tolerance, perform multi-functions and have integrated micro sensors. The purpose of the sensor node is to collect, process, compute, store and dispatch information from one node to another node. The process of estimating geometric placement through a message between the localized node and beacon node in the wireless sensor field is termed as localization. Numerous schemes have been implemented to decide the location of a sensor node with utmost accuracy. Generally two types of schemes are present, namely range-based scheme and range-free scheme. In this paper, a range-free based technique is proposed to find the exact locality of the sensor nodes. Proposed algorithm uses a line of Intersection Technique for Localizing Sensor Nodes and brings out accurate locality information when compared with traditional centroid range-free method. The simulation results are demonstrated by comparing the proposed algorithm with a traditional centroid localization algorithm to determine exact geometric placement of sensors.