一种利用可靠的锚节点的非测距定位算法

发布时间：2018-10-05 18:41

【摘要】：无线传感网中的多类应用均需要准确的定位算法。为了评估位置,普通节点需利用与锚节点间的距离信息,估计自己的位置。因此,距离的估计在无线传感网络定位中扮演着重要的角色。传统的各向同性网INT(isotropic networks)中定位算法是将欧式距离看成最短路径距离SPD(shortest path distances)。然而,这些算法在各向异性网ANT(anisotropic networks)不能准确地估计距离,因为ANT中最短路径距离SPD与欧式距离不成线性比例;并且两节点间的最短路径被迂回,其长度可能大于相应的欧式距离。针对此问题,正确选择可靠的锚节点RANs(reliable anchor nodes)用于准确地估计距离显得格外重要。为此,面向各向异性网ANT,提出基于可靠的锚节点选择的定位方案,记为Se_RANs。每个普通节点通过三角模型原则选择三个可靠锚节点,计算这三个锚节点估计离其他锚节点间的距离,进而利用Mix-max算法估计普通节点位置,从而提高估计的准确性。同时,通过数学分析,推导了普通节点周围存在三个可靠锚节点的概率;并验证了Se_RANs方案的可行性。仿真结果表明,与DV-Hop算法相比,提出的Se_RANs方案具有小的定位均方误差(MLE)。
[Abstract]:Many kinds of applications in wireless sensor networks require accurate localization algorithms. In order to evaluate the location, the common node needs to estimate its position by using the distance information between the anchor node and the node. Therefore, distance estimation plays an important role in wireless sensor network location. Euclidean distance is regarded as the shortest path distance SPD (shortest path distances). In the traditional localization algorithm of isotropic network INT (isotropic networks). However, these algorithms cannot accurately estimate distance in anisotropic networks ANT (anisotropic networks) because the shortest path distance in ANT is not linear to Euclidean distance, and the shortest path between two nodes is circuitous. Its length may be larger than the corresponding Euclidean distance. To solve this problem, it is very important to select the reliable anchor node RANs (reliable anchor nodes) to estimate the distance accurately. For this reason, a location scheme based on reliable anchor node selection for anisotropic network ANT, is proposed, which is described as Se_RANs.. Each common node selects three reliable anchor nodes through the triangular model principle, calculates the distance between the three anchor nodes and other anchor nodes, and then uses the Mix-max algorithm to estimate the common node position, thus improving the accuracy of the estimation. At the same time, the probability of three reliable anchor nodes around common nodes is deduced by mathematical analysis, and the feasibility of Se_RANs scheme is verified. The simulation results show that compared with the DV-Hop algorithm, the proposed Se_RANs scheme has small mean square error (MLE).
【作者单位】：长春工程学院计算机基础教学中心;东北大学信息与工程系;铁道警察学院公安技术系;
【基金】：国家自然科学基金资助项目(61100090,61073062,61100027)资助
【分类号】：TN929.5;TP212.9

【相似文献】