检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:易文周[1] Yi Wenzhou(School of Information Engineering,Guangdong Vocational and Technical College of Engineering,Guangzhou 510520,China)
机构地区:[1]广东工程职业技术学院信息工程学院
出 处:《计算机测量与控制》2019年第8期286-290,共5页Computer Measurement &Control
基 金:广东省科技计划项目(2016B090918021)
摘 要:由于非测距的WSN节点定位算法DV-Hop定位精度不高,引入智能优化算法后有效提高了定位精度,但迭代次数过大,节点能耗相对过高,而在较少信标节点和较短的通讯信半径条件下,传统智能优化算法难以生效;针对这种情况,提出了基于二阶段的差分演化定位优化算法;仿真实验设计在100 m×100 m正方形的区域内,随机分布100个无线传感器节点,首先用DV-Hop算法进行第一阶段粗略定位,然后在第二阶段用差化演化算法对定位进行优化,为了对比各种算法在低能耗(很少迭代次数)下的表现,优化过程只迭代了10代,最后得到节点坐标;实验结果表明,算法能获得更好的定位精度和具有更好的稳定性;该算法在极少迭代次数的条件下,在信标节点稀疏和通信半径较短的特殊情况下,获得满意的定位精度和更好的稳定性。Because the DV-Hop localization accuracy of distance-independent WSN node localization algorithm is not high,intelligent optimization algorithm is introduced to improve the localization accuracy effectively,but the number of iterations is too large and the energy consumption of nodes is relatively high.When there are fewer anchor nodes and shorter communication radius,the traditional intelligent optimization algorithm is difficult to take effect.In view of this situation,a two-stage differential evolution location optimization algorithm is proposed.The simulation experiment is designed to randomly distribute 100 wireless sensor nodes in a square area of 100m x 100m,DV-Hop algorithm is used to locate roughly in the first stage,then differential evolution algorithm is used to optimize the location in the second stage,in order to compare the performance of various algorithms under low energy consumption(few iterations),the optimization process only iterates for 10 generations,and finally the coordinates of nodes are obtained.The experimental results show that the algorithm can achieve better positioning accuracy and stability.Under the condition of few iteration algebras,the algorithm achieves satisfactory positioning accuracy and better stability under the special circumstances of sparse anchor nodes and short communication radius.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229