Distance Matrix and Markov Chain Based Sensor Localization in WSN

Abstract

Applications based on Wireless Sensor Networks (WSN) have shown to be quite useful in monitoring a particular geographic area of interest. Relevant geometries of the surrounding environment are essential to establish a successful WSN topology. But it is literally hard because constructing a localization algorithm that tracks the exact location of Sensor Nodes (SN) in a WSN is always a challenging task. In this research paper, Distance Matrix and Markov Chain (DM-MC) model is presented as node localization technique in which Distance Matrix and Estimation Matrix are used to identify the position of the node. The method further employs a Markov Chain Model (MCM) for energy optimization and interference reduction. Experiments are performed against two well-known models, and the results demonstrate that the proposed algorithm improves performance by using less network resources when compared to the existing models. Transition probability is used in the Markova chain to sustain higher energy nodes. Finally, the proposed Distance Matrix and Markov Chain model decrease energy use by 31% and 25%, respectively, compared to the existing DV-Hop and CSA methods. The experimental results were performed against two proven models, Distance Vector-Hop Algorithm (DV-HopA) and Crow Search Algorithm (CSA), showing that the proposed DM-MC model outperforms both the existing models regarding localization accuracy and Energy Consumption (EC). These results add to the credibility of the proposed DC-MC model as a better model for employing node localization while establishing a WSN framework.