高级检索
    刘克中, 陈巍博, 占 真, 张金奋, 付 琴. 无线传感网络节点定位中的导标动态移动策略[J]. 计算机研究与发展, 2012, 49(11): 2494-2500.
    引用本文: 刘克中, 陈巍博, 占 真, 张金奋, 付 琴. 无线传感网络节点定位中的导标动态移动策略[J]. 计算机研究与发展, 2012, 49(11): 2494-2500.
    Liu Kezhong, Chen Weibo, Zhan Zhen, Zhang Jinfen, Fu Qin. Beacon Dynamic Movement Strategy in Node Localization for Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2012, 49(11): 2494-2500.
    Citation: Liu Kezhong, Chen Weibo, Zhan Zhen, Zhang Jinfen, Fu Qin. Beacon Dynamic Movement Strategy in Node Localization for Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2012, 49(11): 2494-2500.

    无线传感网络节点定位中的导标动态移动策略

    Beacon Dynamic Movement Strategy in Node Localization for Wireless Sensor Networks

    • 摘要: 在基于移动导标的无线传感器网络节点定位中,导标的移动路径将直接影响到节点定位的效率和精度.考虑到无线传感器网络节点通信能力和计算能力有限性,着重研究一种基于网络局部拓扑信息的导标移动虚拟力修正模型.模型中,导标对邻居节点进行筛选,并进一步收集有效节点与导标的距离、有效节点拥有邻居节点数目等参数,在此基础上建立移动导标虚拟引力模型,该模型能使导标的移动具有较强的自适应性.更进一步,针对节点虚拟引力基本模型存在的导标无引力情况和冗余遍历情况,通过加入接近因子及已定位区域边界曲线拟合的方法,对基本模型进行修正.仿真实验表明,提出的路径规划算法与典型的传统路径算法相比较,导标遍历网络的路径长度缩短了20%~30%,较大程度节约了定位过程中导标节点遍历网络所需的能量开销.

       

      Abstract: During the node localization based on mobile beacon in WSNs, the mobile paths of beacon directly affect the efficiency and accuracy of node localization. Considering the limitations of the communication and computational power about the network nodes, a revised virtual gravitation model for beacon movement in node localization is particularly proposed. In the model, the beacon selects its neighbors and gathers the parameters, such as the distance from effective nodes and the number of neighbor nodes and so on. On this basis, a virtual gravitation model for mobile beacon is built, which makes the beacon movements have higher adaptability. Furthermore, for the potential problems of zero gravitation and redundant traversal of these beacons, the model is revised with the method of adding near factors and curve fitting of the located area boundary. Simulation results show that, compared with the typical traditional path planning algorithms, the proposed method shortens the path length of beacon traversal network for 20% to 30%, and greatly saves the energy consumption.

       

    /

    返回文章
    返回