WIRELESS SENSOR NETWORK LOCALIZATION TECHNIQUES PERFORMANCE

Abstract

A large number of inexpensive, small sensors make up a wireless sensor network. The collection and transmission of data is one of the crucial functions of a sensor network. In the greater part of the applications, it is of much interest to figure out the area of the information. Localization methods can be used to obtain this kind of information. Therefore, node localization is very important when using localization algorithms to determine the position of a node. As a result, WSN node localization emerges as one of the primary obstacles. The localization schemes can be broadly divided into two groups based on range measurements, such as: range based and range free plans. Range-based localization techniques cannot be used due to the sensing node's hardware limitations and high cost. Since coarse accuracy is sufficient for most sensor network applications, range-free schemes are being considered an alternative. The performances and accuracy of the range-free algorithms were tested with the application of MATLAB 2017a. The results demonstrated that the amorphous algorithm has the lowest localization error in most cases in comparison to the performance of these four algorithms. Likewise, results demonstrated amorphous, and DV-hop algorithms have 100% coverage rate in every situation that were tested.