Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Dead Reckoning Localization Technique for Mobile Wireless Sensor Networks

Localization in wireless sensor networks not only provides a node with its geographical location but also a basic requirement for other applications such as geographical routing. Although a rich literature is available for localization in static WSN, not enough work is done for mobile WSNs, owing to the complexity due to node mobility. Most of the existing techniques for localization in mobile WSNs uses Monte-Carlo localization, which is not only time-consuming but also memory intensive. They, consider either the unknown nodes or anchor nodes to be static. In this paper, we propose a technique called Dead Reckoning Localization for mobile WSNs. In the proposed technique all nodes (unknown nodes as well as anchor nodes) are mobile. Localization in DRLMSN is done at discrete time intervals called checkpoints. Unknown nodes are localized for the first time using three anchor nodes. For their subsequent localizations, only two anchor nodes are used. The proposed technique estimates two possible locations of a node Using Bezouts theorem. A dead reckoning approach is used to select one of the two estimated locations. We have evaluated DRLMSN through simulation using Castalia simulator, and is compared with a similar technique called RSS-MCL proposed by Wang and Zhu .Comment: Journal Paper, IET Wireless Sensor Systems, 201

A survey of localization in wireless sensor network

Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

Localization Of Sensors In Presence Of Fading And Mobility

The objective of this dissertation is to estimate the location of a sensor through analysis of signal strengths of messages received from a collection of mobile anchors. In particular, a sensor node determines its location from distance measurements to mobile anchors of known locations. We take into account the uncertainty and fluctuation of the RSS as a result of fading and take into account the decay of the RSS which is proportional to the transmitter-receiver distance power raised to the PLE. The objective is to characterize the channel in order to derive accurate distance estimates from RSS measurements and then utilize the distance estimates in locating the sensors. To characterize the channel, two techniques are presented for the mobile anchors to periodically estimate the channel\u27s PLE and fading parameter. Both techniques estimate the PLE by solving an equation via successive approximations. The formula in the first is stated directly from MLE analysis whereas in the second is derived from a simple probability analysis. Then two distance estimates are proposed, one based on a derived formula and the other based on the MLE analysis. Then a location technique is proposed where two anchors are sufficient to uniquely locate a sensor. That is, the sensor narrows down its possible locations to two when collects RSS measurements transmitted by a mobile anchor, then uniquely determines its location when given a distance to the second anchor. Analysis shows the PLE has no effect on the accuracy of the channel characterization, the normalized error in the distance estimation is invariant to the estimated distance, and accurate location estimates can be achieved from a moderate sample of RSS measurements

Minimizing the Localization Error in Wireless Sensor Networks Using Multi-Objective Optimization Techniques

When it comes to remote sensing applications, wireless sensor networks (WSN) are crucial. Because of their small size, low cost, and ability to communicate with one another, sensors are finding more and more applications in a wide range of wireless technologies. The sensor network is the result of the fusion of microelectronic and electromechanical technologies. Through the localization procedure, the precise location of every network node can be determined. When trying to pinpoint the precise location of a node, a mobility anchor can be used in a helpful method known as mobility-assisted localization. In addition to improving route optimization for location-aware mobile nodes, the mobile anchor can do the same for stationary ones. This system proposes a multi-objective approach to minimizing the distance between the source and target nodes by employing the Dijkstra algorithm while avoiding obstacles. Both the Improved Grasshopper Optimization Algorithm (IGOA) and the Butterfly Optimization Algorithm (BOA) have been incorporated into multi-objective models for obstacle avoidance and route planning. Accuracy in localization is enhanced by the proposed system. Further, it decreases both localization errors and computation time when compared to the existing systems

Evaluation and Analysis of Node Localization Power Cost in Ad-Hoc Wireless Sensor Networks with Mobility

One of the key concerns with location-aware Ad-hoc Wireless Sensor Networks (AWSNs) is how sensor nodes determine their position. The inherent power limitations of an AWSN along with the requirement for long network lifetimes makes achieving fast and power-efficient localization vital. This research examines the cost (in terms of power) of network irregularities on communications and localization in an AWSN. The number of data bits transmitted and received are significantly affected by varying levels of mobility, node degree, and network shape. The concurrent localization approach, used by the APS-Euclidean algorithm, has significantly more accurate position estimates with a higher percentage of nodes localized, while requiring 50% less data communications overhead, than the Map-Growing algorithm. Analytical power models capable of estimating the power required to localize are derived. The average amount of data communications required by either of these algorithms in a highly mobile network with a relatively high degree consumes less than 2.0% of the power capacity of an average 560mA-hr battery. This is less than expected and contrary to the common perception that localization algorithms consume a significant amount of a node\u27s power

On Localization Issues of Mobile Devices

Mobile devices, such as sensor nodes, smartphones and smartwatches, are now widely used in many applications. Localization is a highly important topic in wireless networks as well as in many Internet of Things applications. In this thesis, four novel localization schemes of mobile devices are introduced to improve the localization performance in three different areas, like the outdoor, indoor and underwater environments. Firstly, in the outdoor environment, many current localization algorithms are based on the Sequential Monte MCL, the accuracy of which is bounded by the radio range. High computational complexity in the sampling step is another issue of these approaches. Tri-MCL is presented, which significantly improves on the accuracy of the Monte Carlo Localization algorithm. To do this, three different distance measurement algorithms based on range-free approaches are leveraged. Using these, the distances between unknown nodes and anchor nodes are estimated to perform more fine-grained filtering of the particles as well as for weighting the particles in the final estimation step of the algorithm. Simulation results illustrate that the proposed algorithm achieves better accuracy than the MCL and SA-MCL algorithms. Furthermore, it also exhibits high efficiency in the sampling step. Then, in the GPS-denied indoor environment, Twi-Adaboost is proposed, which is a collaborative indoor localization algorithm with the fusion of internal sensors such as the accelerometer, gyroscope and magnetometer from multiple devices. Specifically, the datasets are collected firstly by one person wearing two devices simultaneously: a smartphone and a smartwatch, each collecting multivariate data represented by their internal parameters in a real environment. Then, the datasets from these two devices are evaluated for their strengths and weaknesses in recognizing the indoor position. Based on that, the Twi-AdaBoost algorithm, an interactive ensemble learning method, is proposed to improve the indoor localization accuracy by fusing the co-occurrence information. The performance of the proposed algorithm is assessed on a real-world dataset. The experiment results demonstrate that Twi-AdaBoost achieves a localization error about 0.39 m on average with a low deployment cost, which outperforms the state-of-the-art indoor localization algorithms. Lastly, the characteristics of mobile UWSNs, such as low communication bandwidth, large propagation delay, and sparse deployment, pose challenging issues for successful localization of sensor nodes. In addition, sensor nodes in UWSNs are usually powered by batteries whose replacements introduces high cost and complexity. Thus, the critical problem in UWSNs is to enable each sensor node to find enough anchor nodes in order to localize itself, with minimum energy costs. An Energy-Efficient Localization Algorithm (EELA) is proposed to analyze the decentralized interactions among sensor nodes and anchor nodes. A Single-Leader-Multi-Follower Stackelberg game is utilized to formulate the topology control problem of sensor nodes and anchor nodes by exploiting their available communication opportunities. In this game, the sensor node acts as a leader taking into account factors such as `two-hop' anchor nodes and energy consumption, while anchor nodes act as multiple followers, considering their ability to localize sensor nodes and their energy consumption. I prove that both players select best responses and reach a socially optimal Stackelberg Nash Equilibrium. Simulation results demonstrate that the proposed EELA improves the performance of localization in UWSNs significantly, and in particular the energy cost of sensor nodes. Compared to the baseline schemes, the energy consumption per node is about 48% lower in EELA, while providing a desirable localization coverage, under reasonable error and delay. Based on the EELA scheme, an Adaptive Energy Efficient Localization Algorithm using the Fuzzy game theoretic method (Adaptive EELA) is proposed to solve the environment adaptation problem of EELA. The adaptive neuro-fuzzy method is used as the utility function of the Single-Leader-Multi-Follower Stackelberg game to model the dynamical changes in UWSNs. The proposed Adaptive EELA scheme is able to automatically learn in the offline phase, which is required only once. Then, in the online phase, it can adapt to the environmental changes, such as the densities of nodes or topologies of nodes. Extensive numerical evaluations are conducted under different network topologies and different network node densities. The simulation results demonstrate that the proposed Adaptive EELA scheme achieves about 35% and 66% energy reduction per node on average comparing the state-of-the-art approaches, such as EELA and OLTC, while providing a desirable localization coverage, localization error and localization delay