基于蚁群算法的WSN移动信标路径获取研究  

Study of getting mobile beacon path in Wireless Sensor Networks based on ant colony algorithm

作　　者：徐云剑[1] 彭沛夫[1] 郭艾寅[2] 张桂芳[2] 

机构地区：[1]湖南涉外经济学院,长沙410205 [2]湖南师范大学物理与信息科学学院

出　　处：《计算机工程与应用》2008年第28期109-112,共4页Computer Engineering and Applications

基　　金：湖南省自然科学基金No.06JJ5116;湖南省教育厅自然科学基金No.05C408~~

摘　　要：根据ROI(Region of Interest)面积给出了等距三重优化覆盖此ROI所需要的信标发射位置数量计算方法;随后对矩形ROI提出了一种简单的信标发射位置确定方法;针对现有的遍历发射位置点的路径遍历算法的不足,提出了一种新的应用蚁群算法的信标发射位置点的遍历算法,并利用该算法对基于三边测量方法进行传感器节点定位。仿真实验表明,采用该文提出的方法对传感器节点进行定位,在定位的精度和定位的效率方面与现存的方法相比有明显的提高。The equal distance 3-improved-coverage number of beacon sending position is presented according the acreage of ROI （Region of Intercst）.Then a simple method is put forward to calculate the coordinates of the sending positions in rectangular ROI.Aiming at the shortage of the existent sequence algorithm,when beacon moves according to the path and emits RF signals at every position,the ant colony algorithm is applied to the position sequence so as to get the beacon sending position.Further,in this algorithm the sensors could work out their position with trilateration.Experimental results demonstrate that the localization method for sensor node in this paper makes obvious progress than the existent ones both on the precise and on the efficiency.

关 键 词：传感器网络 传感器定位 移动信标 蚁群算法 最优路径 

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