| 求解无线传感器网络路由问题的蚁群最优化算法及其收敛性 |
| |
| 引用本文： | 杨文国,郭田德.求解无线传感器网络路由问题的蚁群最优化算法及其收敛性[J].系统科学与数学,2007,27(2):239-246. |
| |
| 作者姓名： | 杨文国 郭田德 |
| |
| 作者单位： | 1. 中国科学院研究生院,北京,100049
2. 中国科学院研究生院数学系,北京,100049 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划);中国科学院基金;中国科学院院长基金 |
| |
| 摘 要： | 首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明．最后对找到最优解后信息素值的变化进行了分析．即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值．
|
| 关 键 词： | 无线传感器网络 路由 蚁群优化 最小Steiner树 |
| 修稿时间： | 2004年11月5日 |
Ant Colony Optimization Algorithm and Its Convergence for Wireless Sensor Network Routine Problem |
| |
| Yang Wenguo,Guo Tiande.Ant Colony Optimization Algorithm and Its Convergence for Wireless Sensor Network Routine Problem[J].Journal of Systems Science and Mathematical Sciences,2007,27(2):239-246. |
| |
| Authors: | Yang Wenguo Guo Tiande |
| |
| Institution: | (1)Graduate University of the Chinese Academic of Sciences, Beijing 100049;(2)Mathematics Department, Graduate University of the Chinese Academic of Sciences, Beijing 100049 |
| |
| Abstract: | In this paper,the Steiner tree model for the wireless sensor network routing is first proposed,then an ant colony optimization algorithm and its convergence proof for solving the minimal Steiner tree model is presented and finally changes of the pheromone trails after an optimal solution has been found and analysised.In particularly,it is shown that under condition of constraint of pheromone trails,the probability of finding an optimal solution tends the to 1 for sufficiently large number of iterations.And after an optimal solution has been found,the pheromone trails associated to the optimal solution monotonically increase to reach the maximum value while others pheromone trails reach the minimum one in finite iterations. |
| |
| Keywords: | Wireless sensor network routing ant colony optimization minimum Steiner tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
