Search

Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things. Battery-powered sensor nodes may face many problems, such as battery drain and software problems. Therefore, the utilization of self-stabilization, which is one of the fault-tolerance techniques, brings the network back to its legitimate state when the topology is changed due to node leaves. In this technique, a scheduler decides on which nodes could execute their rules regarding spatial and temporal properties. A useful graph theoretical structure is the vertex cover that can be utilized in various WSN applications such as routing, clustering, replica placement and link monitoring. A capacitated vertex cover is the generalized version of the problem which restricts the number of edges covered by a vertex by applying a capacity constraint to limit the covered edge count. In this paper, we propose two self-stabilizing capacitated vertex cover algorithms for WSNs. To the best of our knowledge, these algorithms are the first attempts in this manner. The first algorithm is stabilized under an unfair distributed scheduler (that is, the scheduler which does not grant all enabled nodes to make their moves but guarantees the global progress of the system) at most O (n 2) step, where n is the count of nodes. The second algorithm assumes 2-hop (degree 2) knowledge about the network and runs under the unfair scheduler, which subsumes the synchronous and distributed fair scheduler and stabilizes itself after O (n) moves in O (n) step, which is acceptable for most WSN setups. We theoretically analyze the algorithms to provide proof of correctness and their step complexities. Moreover, we provide simulation setups by applying IRIS sensor node parameters and compare our algorithms with their counterparts. The gathered measurements from the simulations revealed that the proposed algorithms are faster than their competitors, use less energy and offer better vertex cover solutions. [ABSTRACT FROM AUTHOR]

Currently, the use of unmanned vehicles, such as drones, boats and ships, in monitoring tasks where human presence is difficult or even impossible raises several issues. Continuous efforts to improve the autonomy of such vehicles have not solved all aspects of this issue. In an Internet of Unmanned Vehicles (IoUV) environment, the idea of replacing the static wireless infrastructure and reusing the mobile monitoring nodes in different conditions would converge to a dynamic solution to assure data collection in areas where there is no infrastructure that ensures Internet access. The current paper fills a significant gap, proposing an algorithm that optimises the positions of unmanned vehicles such that an ad hoc network is deployed to serve specific wireless sensor networks that have no other Internet connectivity (hilly/mountainous areas, Danube Delta) and must be connected to an Internet of Things (IoT) ecosystem. The algorithm determines the optimum positions of UV nodes that decrease the path losses below the link budget threshold with minimum UV node displacement compared to their initial coordinates. The algorithm was tested in a rural scenario and 3rd Generation Partnership Project (3GPP), free space and two-ray propagation models. The paper proposes another type of network, a Flying and Surface Ad Hoc Network (FSANET), a concept which implies collaboration and coexistence between unmanned aerial vehicles (UAVs) and unmanned surface vehicles (USVs) and several use cases that motivate the need for such a network. [ABSTRACT FROM AUTHOR]

The application of the Internet of Things (IoT) in wireless sensor networks (WSNs) poses serious challenges in preserving network longevity since the IoT necessitates a considerable amount of energy usage for sensing, processing, and data communication. As a result, there are several conventional algorithms that aim to enhance the performance of WSN networks by incorporating various optimization strategies. These algorithms primarily focus on the network layer by developing routing protocols to perform reliable communication in an energy-efficient manner, thus leading to an enhanced network life. For increasing the network lifetime in WSNs, clustering has been widely accepted as an important method that groups sensor nodes (SNs) into clusters. Additionally, numerous researchers have been focusing on devising various methods to increase the network lifetime. The prime factor that helps to maximize the network lifetime is the minimization of energy consumption. The authors of this paper propose a multi-objective optimization approach. It selects the optimal route for transmitting packets from source to sink or the base station (BS). The proposed model employs a two-step approach. The first step employs a trust model to select the cluster heads (CHs) that manage the data communication between the BS and nodes in the cluster. Further, a novel hybrid algorithm, combining a particle swarm optimization (PSO) algorithm and a genetic algorithm (GA), is proposed to determine the routes for data transmission. To validate the efficacy of the proposed hybrid algorithm, named PSOGA, simulations were conducted and the results were compared with the existing LEACH method and PSO, with a random route selection for five different cases. The obtained results establish the efficiency of the proposed approach, as it outperforms existing methods with increased energy efficiency, increased network throughput, high packet delivery rate, and high residual energy throughout the entire iterations. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) in the role of flying anchor nodes have been proposed to assist the localisation of terrestrial Internet of Things (IoT) sensors and provide relay services in the context of the upcoming 6G networks. This paper considered the objective of tracing a mobile IoT device of unknown location, using a group of UAVs that were equipped with received signal strength indicator (RSSI) sensors. The UAVs employed measurements of the target's radio frequency (RF) signal power to approach the target as quickly as possible. A deep learning model performed clustering in the UAV network at regular intervals, based on a graph convolutional network (GCN) architecture, which utilised information about the RSSI and the UAV positions. The number of clusters was determined dynamically at each instant using a heuristic method, and the partitions were determined by optimising an RSSI loss function. The proposed algorithm retained the clusters that approached the RF source more effectively, removing the rest of the UAVs, which returned to the base. Simulation experiments demonstrated the improvement of this method compared to a previous deterministic approach, in terms of the time required to reach the target and the total distance covered by the UAVs. [ABSTRACT FROM AUTHOR]

In this paper, we present an efficient way to find a gateway deployment for a given sensor network topology. We assume that the expired sensors and gateways can be replaced and the locations of the gateways are chosen among the given sensor nodes. The objective is to find a gateway deployment that minimizes the cost per unit time, which consists of the maintenance and installation costs. The proposed algorithm creates a cost reference and uses it to find the optimal deployment via a divide and conquer algorithm. Comparing all cases is the most reliable way to find the optimal gateway deployment, but this is practically impossible to calculate, since its computation time increases exponentially as the number of nodes increases. The method we propose increases linearly, and so is suitable for large scale networks. Additionally, compared to stochastic algorithms such as the genetic algorithm, this methodology has advantages in computational speed and accuracy for a large number of nodes. We also verify our methodology through several numerical experiments. [ABSTRACT FROM AUTHOR]

In the traditional wireless sensor networks (WSNs) localization algorithm based on the Internet of Things (IoT), the distance vector hop (DV-Hop) localization algorithm has the disadvantages of large deviation and low accuracy in three-dimensional (3D) space. Based on the 3DDV-Hop algorithm and combined with the idea of A* algorithm, this paper proposes a wireless sensor network node location algorithm (MA*-3DDV-Hop) that integrates the improved A* algorithm and the 3DDV-Hop algorithm. In MA*-3DDV-Hop, firstly, the hop-count value of nodes is optimized and the error of average distance per hop is corrected. Then, the multi-objective optimization non dominated sorting genetic algorithm (NSGA-II) is adopted to optimize the coordinates locally. After selection, crossover, mutation, the Pareto optimal solution is obtained, which overcomes the problems of premature convergence and poor convergence of existing algorithms. Moreover, it reduces the error of coordinate calculation and raises the localization accuracy of wireless sensor network nodes. For three different multi-peak random scenes, simulation results show that MA*-3DDV-Hop algorithm has better robustness and higher localization accuracy than the 3DDV-Hop, PSO-3DDV-Hop, GA-3DDV-Hop, and N2-3DDV-Hop. [ABSTRACT FROM AUTHOR]

As a key technology of the Internet of Things, wireless sensor network (WSN) has been used widely in indoor localization systems. However, when the sensor is transmitting signals, it is affected by the non-line-of-sight (NLOS) transmission, and the accuracy of the positioning result is decreased. Therefore, solving the problem of NLOS positioning has become a major focus for indoor positioning. This paper focuses on solving the problem of NLOS transmission that reduces positioning accuracy in indoor positioning. We divided the anchor nodes into several groups and obtained the position information of the target node for each group through the maximum likelihood estimation (MLE). By identifying the NLOS method, a part of the position estimates polluted by NLOS transmission was discarded. For the position estimates that passed the hypothesis testing, a corresponding poly-probability matrix was established, and the probability of each position estimate from line-of-sight (LOS) and NLOS was calculated. The position of the target was obtained by combining the probability with the position estimate. In addition, we also considered the case where there was no continuous position estimation through hypothesis testing and through the NLOS tracking method to avoid positioning errors. Simulation and experimental results show that the algorithm proposed has higher positioning accuracy and higher robustness than other algorithms. [ABSTRACT FROM AUTHOR]

Although the number of Internet of Things devices increases every year, efforts to decrease hardware energy demands and to improve efficiencies of the energy-harvesting stages have reached an ultra-low power level. However, no current standard of wireless communication protocol (WCP) can fully address those scenarios. Our focus in this paper is to introduce treNch, a novel WCP implementing the cross-layer principle to use the power input for adapting its operation in a dynamic manner that goes from pure best-effort to nearly real time. Together with the energy-management algorithm, it operates with asynchronous transmissions, synchronous and optional receptions, short frame sizes and a light architecture that gives control to the nodes. These features make treNch an optimal option for wireless sensor networks with ultra-low power demands and severe energy fluctuations. We demonstrate through a comparison with different modes of Bluetooth Low Energy (BLE) a decrease of the power consumption in 1 to 2 orders of magnitude for different scenarios at equal quality of service. Moreover, we propose some security optimizations, such as shorter over-the-air counters, to reduce the packet overhead without decreasing the security level. Finally, we discuss other features aside of the energy needs, such as latency, reliability or topology, brought again against BLE. [ABSTRACT FROM AUTHOR]

Most Internet of Things (IoT) systems are based on the wireless sensor network (WSN) due to the reduction of the cable layout cost. However, the battery life of nodes is a key issue when the node is powered by a battery. A Low-Power WSN Protocol with ADR and TP Hybrid Control is proposed in this paper to improve battery life significantly. Besides, techniques including the Sub-1GHz star topology network with Time Division Multiple Access (TDMA), adaptive data rate (ADR), and transmission power control (TPC) are also used. The long-term testing results show that the nodes with the proposed algorithm can balance the communication quality and low power consumption simultaneously. The experimental results also show that the power consumption of the node with the algorithm was reduced by 38.46-54.44% compared with the control group. If using AAA battery with 1200 mAh, the node could run approximately 4.2 years with the proposed hybrid control algorithm with an acquisition period of under 5 s. [ABSTRACT FROM AUTHOR]

Within the context of the Internet of Things (IoT) and the Location of Things (LoT) service, this paper presents an interactive tool to quantitatively analyze the performance of cooperative localization techniques for wireless sensor networks (WSNs). In these types of algorithms, nodes help each other determine their location based on some signal metrics such as time of arrival (TOA), received signal strength (RSS), or a fusion of them. The developed tool is intended to provide researchers and designers a fast way to measure the performance of localization algorithms considering specific network topologies. Using TOA or RSS models, the Crámer-Rao lower bound (CRLB) has been implemented within the tool. This lower bound can be used as a benchmark for testing a particular algorithm for specific channel characteristics and WSN topology, which allows determination if the necessary accuracy for a specific application is possible. Furthermore, the tool allows us to consider independent characteristics for each node in the WSN. This feature allows the avoidance of the typical "disk graph model," which is usually applied to test cooperative localization algorithms. The tool allows us to run Monte-Carlo simulations and generate statistical reports. A set of basic illustrative examples are described comparing the performance of different localization algorithms and showing the capabilities of the presented tool. [ABSTRACT FROM AUTHOR]