Department of Computer Science, Taif University, Taif 21974, Saudi Arabia.
Sensors (Basel). 2018 Nov 28;18(12):4179. doi: 10.3390/s18124179.
The rapid proliferation of wireless sensor networks over the past few years has posed some serious technical challenges to researchers. The primary function of a multi-hop wireless sensor network (WSN) is to collect and forward sensor data towards the destination node. However, for many applications, the knowledge of the location of sensor nodes is crucial for meaningful interpretation of the sensor data. Localization refers to the process of estimating the location of sensor nodes in a WSN. Self-localization is required in large wireless sensor networks where these nodes cannot be manually positioned. Traditional methods iteratively localize these nodes by using triangulation. However, the inherent instability in wireless signals introduces an error, however minute it might be, in the estimated position of the target node. This results in the embedded error propagating and magnifying rapidly. Machine learning based localizing algorithms for large wireless sensor networks do not function in an iterative manner. In this paper, we investigate the suitability of some of these algorithms while exploring different trade-offs. Specifically, we first formulate a novel way of defining multiple feature vectors for mapping the localizing problem onto different machine learning models. As opposed to treating the localization as a classification problem, as done in the most of the reported work, we treat it as a regression problem. We have studied the impact of varying network parameters, such as network size, anchor population, transmitted signal power, and wireless channel quality, on the localizing accuracy of these models. We have also studied the impact of deploying the anchor nodes in a grid rather than placing these nodes randomly in the deployment area. Our results have revealed interesting insights while using the multivariate regression model and support vector machine (SVM) regression model with radial basis function (RBF) kernel.
在过去的几年中,无线传感器网络的快速发展给研究人员带来了一些严峻的技术挑战。多跳无线传感器网络(WSN)的主要功能是收集和转发传感器数据到目的节点。然而,对于许多应用来说,传感器节点的位置信息对于传感器数据的有意义解释至关重要。定位是指估计 WSN 中传感器节点位置的过程。在大型无线传感器网络中,由于这些节点无法手动定位,因此需要自定位。传统方法通过使用三角测量来迭代地定位这些节点。然而,无线信号的固有不稳定性会在目标节点的估计位置上引入一个误差,无论这个误差有多小。这会导致嵌入式误差迅速传播和放大。基于机器学习的大型无线传感器网络定位算法不是以迭代方式工作的。在本文中,我们研究了其中一些算法的适用性,同时探索了不同的权衡。具体来说,我们首先为将定位问题映射到不同的机器学习模型定义了一种新的多特征向量的方法。与大多数已报告的工作中将定位视为分类问题不同,我们将其视为回归问题。我们研究了网络参数变化对这些模型定位精度的影响,例如网络规模、锚节点数量、传输信号功率和无线信道质量。我们还研究了在部署区域中以网格形式而不是随机放置锚节点对定位精度的影响。我们使用多元回归模型和支持向量机(SVM)回归模型与径向基函数(RBF)核的结果揭示了一些有趣的见解。