| WSN中基于蚁群算法的QoS路由协议 |
| |
| 引用本文： | 王镇,刘学军.WSN中基于蚁群算法的QoS路由协议[J].传感技术学报,2011,24(11):1625-1631. |
| |
| 作者姓名： | 王镇 刘学军 |
| |
| 作者单位： | 南京工业大学信息科学与工程学院,南京,210009 |
| |
| 基金项目： | 国家自然科学基金项目(61073197);江苏省科技支撑计划(SBE201077457) |
| |
| 摘 要： | 蚁群算法的随机自适应性使得它很适合应用于无线传感器网络( WSN)环境中,所以本文针对WSN中的数据拥塞、传输延迟、能量消耗等问题,提出了一种基于蚁群算法的QoS路由协议.协议将如何搜索最佳路径问题抽象为组合规划问题,根据最小费用流规则定义了高带宽和低时延路径的判决条件,利用蚁群优化算法,寻找到不同目标函数的路径,达到...
|
| 关 键 词： | 蚁群算法 组合规划 最小费用流规则 无线传感器网络 |
An Qos Routing Protocol Based on Ant colony algorithm in WSN |
| |
| WANG Zhen,LIU Xuejun.An Qos Routing Protocol Based on Ant colony algorithm in WSN[J].Journal of Transduction Technology,2011,24(11):1625-1631. |
| |
| Authors: | WANG Zhen LIU Xuejun |
| |
| Affiliation: | (College of Information Science and Engineering,Nanjing University of Technology,Nanjing 210009,China) |
| |
| Abstract: | Random self-adaptive of ant colony algorithm makes the algorithm very suitable to wireless sensor network environment.To solve the issues of congestion,latency,energy consumption,we propose a QoS routing protocol based on ant colony algorithm.In the protocol,problems of how to search the best path is abstracted to combinatorial programming problems,we define the decision condition of the high bandwidth and low latency path according to the minimum cost flow rules,and using ant colony optimization algorithm to find the path of two different objective functions,thus this protocol can meet different purpose of QoS requirements.Simulation results demonstrate that this protocol not only can meet the different QoS requirements,but also decrease the network energy consumption and prolong the network lifetime. |
| |
| Keywords: | ant colony algorithm combinatorial planning minimum cost flow rules wireless sensor network |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《传感技术学报》浏览原始摘要信息 |
|
点击此处可从《传感技术学报》下载全文 |
|
