移动参考节点动态路径最优规划  

Dynamic Optimal Planning of Path of Mobile Nodes

作　　者：张玉强[1,2] 何泾沙[3,2] 徐晶[1,2] 赵斌[3,2,4] 蔡方博 

机构地区：[1]北京工业大学计算机学院,北京100124 [2]北京市物联网软件与系统工程技术研究中心,北京100124 [3]北京工业大学软件学院,北京100124 [4]济宁学院计算机科学系,山东济宁273155

出　　处：《北京工业大学学报》2016年第6期851-855,共5页Journal of Beijing University of Technology

基　　金：国家"863"计划资助项目(2015AA017204);北京市自然科学基金资助项目(4142008)

摘　　要：在利用移动参考节点对无线传感器网络进行时间同步或定位的过程中,参考节点的移动路径规划,直接影响节点同步精度、定位精度和能量损耗.将移动节点的移动路径规划转化为对广播点的选取及广播点间路径规划,对应数学模型为经典的选址问题和旅行商问题.通过建立两者的最优联合数学模型,提出利用贪婪算法寻找最优的广播点并获得最优移动路径的方法.仿真结果表明:该路径能够覆盖整个网络,同时缩短参考节点的移动距离.In the process of time synchronization and location of wireless sensor networks based on mobilereference nodes, the path planning of the reference node directly affects the accuracy and energy loss ofthe nodes. This paper transforms the path planning of mobile nodes into the selection of broadcast pointswith the path planning, and sets up a mathematical model based on the problem of location and travelingsalesman problem. By establishing the optimal joint mathematical model, a method that uses a greedyalgorithm was proposed to find the optimal broadcast point and obtain the optimal path. The simulationexperiments were done to validate the performance of the method. Experimental data shows that themobile path witch through this method can cover the whole network, and significantly shorten the movingdistance of the reference node.

关 键 词：时间同步 定位 移动参考节点 路径规划 贪婪算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]