In recent years, the use of wireless sensor networks has been increasing. Localization is a fundamental problem in wireless sensor networks (WSNs), since location information is essential for diverse applications such as tracking, quality network coverage, health, and energy efficiency. In this paper performance of localization algorithms such as range-free, range-based, and fuzzybased decision is evaluated. We introduce a modification of an algorithm by providing weights to the correlation matrix to improve correctness. In all the cases the accuracy, precision, and computational complexity are evaluated as performance metrics. Location algorithms are evaluated using two scenarios, a first stage where all nodes are randomly distributed in a given area and a second scenario where four APs (access points) are placed on fixed positions and unknown nodes are randomly distributed within the sensing area. The received signal strength (RSS) is used to estimate the position of a node of interest. In the simulation results we show how our modified algorithm improves localization. On the other hand, we also have acceptable accuracy using distance-based algorithms, but they are more complex computationally.

The localization of nodes plays a fundamental role in Wireless Sensor and Actors Networks (WSAN) identifying geographically where an event occurred, which facilitates timely response to this action. This article presents a performance evaluation of multi-hop localization range-free algorithms used in WSAN, such as Distance Vector Hop (DV-Hop), Improved DV-Hop (IDV-Hop), and the Weighted DV-Hop (WDV-Hop). In addition, we propose a new localization algorithm, merging WDV-Hop, with the weighted hyperbolic localization algorithm (WH), which includes weights to the correlation matrix of the estimated distances between the node of interest (NOI) and the reference nodes (RN) in order to improve accuracy and precision. As performance metrics, the accuracy, precision, and computational complexity are evaluated. The algorithms are evaluated in three scenarios where all nodes are randomly distributed in a given area, varying the number of RNs, the density of nodes in the network, and radio coverage of the nodes. The results show that in networks with 100 nodes, WDV-Hop outperforms the DV-Hop and IDV-Hop even if the number of RNs is reduced to 10. Moreover, our proposal shows an improvement in terms of accuracy and precision at the cost of increased computational complexity, specifically in the algorithm execution time, but without affecting the hardware cost or power consumption.

Long power wide area networks (LPWAN) systems play an important role in monitoring environmental conditions for smart cities applications. With the development of Internet of Things (IoT), wireless sensor networks (WSN), and energy harvesting devices, ultra-low power sensor nodes (SNs) are able to collect and monitor the information for environmental protection, urban planning, and risk prevention. This paper presents a WSN of self-powered IoT SNs energetically autonomous using Plant Microbial Fuel Cells (PMFCs). An energy harvesting device has been adapted with the PMFC to enable a batteryless operation of the SN providing power supply to the sensor network. The low-power communication feature of the SN network is used to monitor the environmental data with a dynamic power management strategy successfully designed for the PMFC-based LoRa sensor node. Environmental data of ozone (O3) and carbon dioxide (CO2) are monitored in real time through a web application providing IoT cloud services with security and privacy protocols.

A Wireless Sensor and Actor Network (WSAN) is composed of sensor and actor nodes distributed in a geographic area of interest; the sensors are involved in monitoring the physical environment, while the actors can execute a designated task in accordance to the data collected and reported by the sensors during an event. To achieve a balanced performance, a WSAN architecture must implement an efficient cooperative communication strategy to allow the nodes to collaborate in the optimal assignment of resources and to execute tasks with the lowest possible delay. Such collaboration must take place by exchanging information and generating negotiated decisions while trying to extend the WSAN lifetime. The main contribution of this work is the proposal of a coordination mechanism taxonomy for WSANs; this taxonomy provides a framework for the classification of coordination mechanisms designed for WSAN environments. Based on this taxonomy, a comparative analysis is presented to study some of the most representative coordination mechanisms proposed in the area of WSANs up to this date.

Localization is a fundamental problem in Wireless Sensor Networks, as it provides useful information regarding the detection of an event. There are different localization algorithms applied in single-hop or multi-hop networks; in both cases their performance depends on several factors involved in the evaluation scenario such as node density, the number of reference nodes and the log-normal shadowing propagation model, determined by the path-loss exponent (η) and the noise level (σdB) which impact on the accuracy and precision performance metrics of localization techniques. In this paper, we present a statistical analysis based on the 2k factorial methodology to determine the key factors affecting the performance metrics of localization techniques in a single-hop network to concentrate on such parameters, thus reducing the amount of simulation time required. For this proposal, MATLAB simulations are carried out in different scenarios, i.e., extreme values are used for each of the factors of interest and the impact of the interaction among them in the performance metrics is observed. The simulation results show that the path-loss exponent (η) and noise level (σdB) factors have the greatest impact on the accuracy and precision metrics evaluated in this study. Based on this statistical analysis, we recommend estimating the propagation model as close to reality as possible to consider it in the design of new localization techniques and thus improve their accuracy and precision metrics.

No abstract

No abstract

Localization is one of the main problems in Mobile Wireless Sensor Networks, since it provides the location of an event occurrence. This paper presents a performance evaluation of the localization algorithms: Multilateration Algorithm, Weighted Multilateration Algorithm and Probabilistic Multilateration Algorithm (PMA). In addition, we propose an Improved Probabilistic Multilateration Algorithm that decreases the localization error of the interest node by using an approach that computes iteratively the position of a node of interest until it reaches the solution that minimizes the localization error. The proposed approach regards the noisy environment by its impact on a correlation matrix that involves the variance of the separation distance between the node of interest and the respective reference nodes (RNs). Furthermore, we also introduce a constant parameter called damping factor; which enhances the convergence of the localization algorithm providing the solution that minimizes the localization error. In this study, we evaluate localization algorithms in a single-hop and multi-hop scenarios considering a distribution with solid geometry of the RNs and randomly distributed RNs in both scenarios. The results we obtained show that our proposed algorithm Improved PMA presents a better performance according to the Normalized Root Mean Squared Error varying the number of reference nodes and noise proportion.