检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马兴建 张星宇 朱大伟[1] 潘子宇 秦鹏凯 Ma Xingjian;Zhang Xingyu;Zhu Dawei;Pan Ziyu;Qin Pengkai(School of Information and Communication Engineering,Nanjing University of Technology,Nanjing 211167,China)
机构地区:[1]南京工程学院信息与通信工程学院,南京211167
出 处:《信息化研究》2021年第2期38-43,共6页INFORMATIZATION RESEARCH
基 金:国家自然科学基金(No.61901211);南京工程学院大学生科技创新项目(TB202006004);南京工程学院博七资助项目(ZKJ201903)。
摘 要:在无线传感网中进行数据通信的过程中,首要任务是定位出目标点的位置。然而,近几年随着5G时代的到来,大容量设备的接入势必会对定位精度有更高的要求。在传统的定位算法中一般只需要关注长度和宽度这两个维度就足以满足定位需求,但是在一些特定的场景下不仅需要长度和宽度这两个维度,还要关注高度,如紧急防洪;防震预警服务不仅要关注高度,还要关注时延误差等,这些给在三维空间下的定位算法带来了挑战。基于以上需求衍生出了一些比较好的定位算法,如对最小二乘算法进行加权,利于抑制定位算法中所累积的时延误差;采用粒子群约束将最小二乘法进行优化求解,利于提升定位精度。尽管如此,这些算法的共同特点均是二维空间下进行的,当运用在三维空间下会随着算法复杂度的提高,使得计算量过大,从而无法计算。文章提出一种可以不依赖于环境因素,且能满足定位精度和定位误差的一种基于种群的杂草优化竞争生存算法,仿真结果表明,本算法具有一定的适用性。In the process of data communication in the wireless sensor network, the primary purpose is to locate the location of the target point. However, with the advent of 5 G era in recent years, the access of large-capacity equipment is bound to have higher requirements on the positioning schedule. In traditional localization algorithm generally only need to pay attention to the length and width of these two dimensions is enough to meet the demand of positioning, but in certain situations require not only these two dimensions, length and width and height, such as emergency flood, an earthquake early warning service, should not only focus on height, but also focus on poor delays, so bring the localization algorithm under the three dimensional space. Based on the above requirements, some better positioning algorithms are derived, such as weighting the least square algorithm, which is beneficial to restrain the accumulated delay error in the positioning algorithm, and using particle swarm optimization to solve the least square algorithm, which is beneficial to improve the positioning accuracy. Nevertheless, the common characteristics of these algorithms are all carried out in two-dimensional space. When applied in three-dimensional space, the complexity of the algorithm will increase, making the calculation amount too large to be calculated. Therefore, this paper proposes a population-based weed optimization competition survival algorithm that does not depend on environmental factors and can meet the positioning accuracy and positioning error. The simulation results show that this algorithm has certain applicability.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.248.120