基于通信半径约束的物联网节点定位算法  

Node Positioning Algorithm of Internet of Things Based on Communication Range Constraint

作　　者：李来祥 LI Laixiang(Experiment Teaching&Network Information Center of Liaocheng University,Liaocheng 252000,Shandong,China)

机构地区：[1]聊城大学实验与网络信息中心,山东聊城252000

出　　处：《电子信息对抗技术》2022年第3期45-50,74,共7页Electronic Information Warfare Technology

基　　金：赛尔网络下一代互联网技术创新项目(NGII20190311)。

摘　　要：DV-Hop是物联网(IoT)领域一种典型的免测距定位方法,具有高性价比的优点。但对于拓扑不规则的随机分布IoT网络,DV-Hop定位算法会出现定位结果与节点间真实连通度不一致的现象。为此,提出一种基于通信半径约束的IoT节点免测距定位算法。基本思想是以网络全部节点连通度误差平方和作为目标函数,以节点的通信半径作为约束条件,构建节点位置优化模型,并利用重要性采样方法对优化模型求解,得到节点位置估计。仿真实验表明,相比于现有DV-Hop及其改进算法,该算法具有更高的节点定位精度。DV-Hop is a typical range-free positioning method for Internet of Things(IoT),and has the advantage of cost-effectiveness.However,for the randomly distributed IoT network with irregular network topology,the positioning results of existing DV-Hop based algorithms are found to be inconsistent with the real connectivity among nodes.For this purpose,a novel positioning algorithm based on communication range constraint is proposed for IoT node position estimation.The basic idea is to construct the node position optimization model by taking the sum of squared connectivity errors among all the nodes as the objective function and the communication range as the constraint condition,and then use the importance sampling method to solve the optimization model and get the node position estimation.Simulation results demonstrate that,compared with existing DV-Hop algorithm and its improved versions,the proposed algorithm has higher node positioning accuracy.

关 键 词：物联网 节点定位 通信半径 DV-HOP 重要性采样 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TN971.1[自动化与计算机技术—计算机科学与技术]