检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京师范大学数学与计算机科学学院,南京210097 [2]江苏省信息安全保密技术工程研究中心,南京210097
出 处:《计算机工程与应用》2010年第30期95-97,124,共4页Computer Engineering and Applications
摘 要:针对无线传感器网络中使用移动信标定位问题,提出了基于遗传算法的无线传感器网络移动信标定位及路径求取方法。首先根据区域面积计算出三重覆盖所需的发射信标位置的个数,用遗传算法优化求取信标发射位置,再用流浪旅行商算法获取遍历发射位置点的最优路径,在遍历时基于加权质心算法对传感器节点定位。实验结果表明,该方法可对传感器节点进行高效定位。Localization of wireless sensor network with mobile beacon and path acquisition based on genetic algorithm is proposed in order to solve the problem of localization in wireless sensor network with mobile beacon.Firstly,the number of positions for triple circle-covering is calculated according to the area of the region,then a method is advanced based on genetic algorithm to arrange the positions in region,at last,the Wandering Salesman Problem(WSP) algorithm is applied to the positions sequence so as to get the optimal path touring it.When mobile beacon moves according to the optimal path and emits RF signals at every position,the sensors in region can work out their position with weighted centroid localization algorithm.The simulation results indicate that the proposed localization method is efficient.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28