A Simulation Framework for the Performance Evaluation of Localisation Techniques over WSNs (original) (raw)

A review of simulation framework for wireless sensor networks localization

2014 IEEE Student Conference on Research and Development, 2014

Wireless sensor networks have the capability to deliver the environmental data to the user. Among the significant data is the location of the node either in static or mobile. A number of network simulators were extensively reviewed specifically for the development of wireless sensor networks protocol. However, there is little work done in assessing the framework for localization simulation. This paper addresses the lack of the previous surveys by giving the guidelines for localization developer to select the suitable network simulator or programming language. It includes a comparative description on importance features in evaluating the localization algorithm. In addition, it discusses the general performance evaluation metric use for localization. Finally, it list several open issues which help in developing and analyzing the localization algorithm.

Development and validation of a localization framework for wireless sensor networks

Wireless sensor networks localization is an important area that is required in many wireless sensor network applications. It is rather complex or even unfeasible; to model analytically WSN localization and it usually leads to oversimplified analysis with limited confidence. Besides, deploying test-beds supposes a huge effort. Therefore, simulation is essential to study WSN localization. However, it requires a suitable model based on solid assumptions and an appropriate framework to ease implementation. Most of WSNs simulators fail to support all the following criteria: easy, extendable and scalable, so that we design and implement an integrated framework used for localization in WSNs and available for the analysis of different types of localization schemes (Range-free, Range-based and Hybrid localization algorithms). The obtained framework is simple and easy to be used to demonstrate the performance evaluation and comparison of different types of localization schemes. It can also be extended to include many localization algorithms by future researchers.

Simulation Of Robot-Assisted WSN Localization Using Real-Life Data

ECMS 2016 Proceedings edited by Thorsten Claus, Frank Herrmann, Michael Manitz, Oliver Rose, 2016

The paper concerns the problem of robot-assistance in localization of stationary nodes in Wireless Sensor Networks (WSN). In our work, we present a simulation of localization process based on real-life data obtained during experiments. The paper describes classical localization algorithm-multilateration, however this algorithm is run not only on raw distance estimates but also on distance estimates obtained after application of specialized filtering procedures. A provided case study demonstrates the localization accuracy obtained for a robot localizing three stationary nodes during it's movement along example path.

An experimental evaluation of localization methods used in wireless sensor networks

Indonesian Journal of Electrical Engineering and Computer Science, 2022

The problem of localization in wireless sensor networks has received considerable attention from researchers over the past decades. Several methods and algorithms have been proposed to solve this problem. The effectiveness of these algorithms depends on the accuracy of the estimated positions and the information required to calculate the coordinates. In this paper, we propose to evaluate four of the most commonly used localization methods in sensor networks. Our study considers a mathematical description of the studied methods in order to evaluate their complexity, and then a practical implementation on the simulation tool Cooja. We evaluate the performance of the studied methods as a function of the number of deployed sensor nodes and their degree of mobility in terms of several performance metrics. The objective is to reveal the most suitable localization method for a particular case of deployment. Improvement proposals are also provided to improve the most relevant localization method for the investigated study. This is an open access article under the CC BY-SA license.

Wireless Sensor Network Localization Techniques Performance

Engineering and technology journal, 2023

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.

Exploring Localization in wireless sensor network

Node Localization in Wireless Sensor Networks (WSN) refers to determining the location of sensor nodes which are deployed in sensor field that are responsible for monitoring applications like environment perceived applications, tracking, traffic monitoring etc. This paper covers the localization techniques and study which algorithm provides higher accuracy, low expense and better power utilization.

A Descriptive Study on various Localization Schemes for Localization of WSNs

This paper presents the several localization techniques for the wireless sensors networks and the need for localization. Localization is estimating the position or spatial coordinates of wireless sensor nodes. The localization problem has received considerable attention in the past, as many applications need to know where objects or persons are, and hence various location services have been created. Undoubtedly, the Global Positioning System (GPS) is the most well-known location service in use today. A few of the developed and emerging techniques has been discussed in the paper.

Classification of Localization Algorithms in Wireless Sensor Networks

The important function of a sensor network is to collect and forward data to destination. The target nodes or normal nodes send out information at their location to the nearby base station or anchor node. It is very important to know about the location of collected data being received. This kind of information can be obtained using localization technique in wireless sensor networks (WSNs). Localization is a way to determine the location of sensor nodes. Localization of sensor nodes is an interesting research area, and many works have been done so far. It is highly desirable to design low-cost, scalable, and efficient localization mechanisms for WSNs. For more accurate results the localization algorithms were improvised over time. In this paper we list all the localization algorithms, their concepts and advantages over the previous methodologies.

Localization algorithms of Wireless Sensor Networks: a survey

Telecommunication Systems

In Wireless Sensor Networks (WSNs), localization is one of the most important technologies since it plays a critical role in many applications, e.g., target tracking. If the users cannot obtain the accurate location information, the related applications cannot be accomplished. The main idea in most localization methods is that some deployed nodes (landmarks) with known coordinates (e.g., GPS-equipped nodes) transmit beacons with their coordinates in order to help other nodes localize themselves. In general, the main localization algorithms are classified into two categories: range-based and range-free. In this paper, we reclassify the localization algorithms with a new perspective based on the mobility state of landmarks and unknown nodes, and present a detailed analysis of the representative localization algorithms. Moreover, we compare the existing localization algorithms and analyze the future research directions for the localization algorithms in WSNs.

Performance Analysis of Wireless Sensor Network Localization Algorithms

International Journal of Computer Networks and Applications (IJCNA), 2019

In recent years, the use of Wireless Sensor Networks (WSNs) has been increasing. Like WSNs protocols development, localization is the main issue and needed to address several areas including 3D and mobile anchor-based localization algorithms. WSNs are being used widely in different fields like environment, disaster relief, target tracking and several other applications like the SCADA system for the high voltage of electricity. In many applications, node localization is very important in which the system needed to know the exact location of the event. This paper addresses the main ideas and techniques published in recent years. We highlight the error performance analysis between the algorithms stated static 3D localization.