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

Embracing Localization Inaccuracy: A Case Study

In recent years, indoor localization has become a hot research topic with some sophisticated solutions reaching accuracy on the order of ten centimeters. While certain classes of applications can justify the corresponding costs that come with these solutions, a wealth of applications have requirements that can be met at much lower cost by accepting lower accuracy. This paper explores one specific application for monitoring patients in a nursing home, showing that sufficient accuracy can be achieved with a carefully designed deployment of low-cost wireless sensor network nodes in combination with a simple RSSI-based localization technique. Notably our solution uses a single radio sample per period, a number that is much lower than similar approaches. This greatly eases the power burden of the nodes, resulting in a significant lifetime increase. This paper evaluates a concrete deployment from summer 2012 composed of fixed anchor motes throughout one floor of a nursing home and mobile units carried by patients. We show how two localization algorithms perform and demonstrate a clear improvement by following a set of simple guidelines to tune the anchor node placement. We show both quantitatively and qualitatively that the results meet the functional and non-functional system requirements

Practical Accuracy Limits of Radiation-Aware Magneto-Inductive 3D Localization

The key motivation for the low-frequency magnetic localization approach is that magnetic near-fields are well predictable by a free-space model, which should enable accurate localization. Yet, limited accuracy has been reported for practical systems and it is unclear whether the inaccuracies are caused by field distortion due to nearby conductors, unconsidered radiative propagation, or measurement noise. Hence, we investigate the practical performance limits by means of a calibrated magnetoinductive system which localizes an active single-coil agent with arbitrary orientation, using 4 mW transmit power at 500 kHz. The system uses eight single-coil anchors around a 3m x 3m area in an office room. We base the location estimation on a complex baseband model which comprises both reactive and radiative propagation. The link coefficients, which serve as input data for location estimation, are measured with a multiport network analyzer while the agent is moved with a positioner device. This establishes a reliable ground truth for calibration and evaluation. The system achieves a median position error of 3.2 cm and a 90th percentile of 8.3 cm. After investigating the model error we conjecture that field distortion due to conducting building structures is the main cause of the performance bottleneck. The results are complemented with predictions on the achievable accuracy in more suitable circumstances using the Cram\'er-Rao lower bound.Comment: To appear at the IEEE ICC 2019 Workshops. This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

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