期刊文献+

基于能量平衡与拥塞控制的蚁群优化路由协议 被引量:2

Ant Colony Optimization Routing Protocol Considering Energy Balance and Congestion Control
下载PDF
导出
摘要 为降低移动自组网中数据包传输的能量消耗和拥塞现象,提出一种兼顾能量平衡与拥塞控制的蚁群优化路由协议.该路由协议以AODV路由协议为基础,包括路由发现和路由维护两个阶段.在路由发现阶段,采用蚁群优化算法选择具有最大剩余能量、最小路径花费和最小时延变化的最优节点构建路由.在路由维护阶段,监控节点的能量阈值级别和路径能量花费,限制能量不满足条件的节点或者路径传输数据,降低能量消耗,提高网络寿命;使用GPRS技术快速检测链路断开现象,维护路由稳定.仿真结果表明,该路由协议传输数据所需平均跳数少、报文送达率高、端到端延时少. For reducing the energy consumption and congestion of packet transmission in mobile ad hoc networks, it proposes an ant colony optimization routing protocol which takes into account energy balance and congestion control. The routing protocol is based on the AODV routing protocol, including two phases: route discovery and route maintenance. In the route discovery phase, the ant colony optimization algorithm is used to select the optimal nodes with maximum residual energy, minimum path cost and minimum delay variation for route construction. In the route maintenance phase, it monitors node's energy threshold level and path energy cost, to limit package transmission on the nodes or paths whose energy does not meet the conditions, for reducing energy consumption and improving life of network; and uses GPRS technology to quickly detect the link disconnection, for maintaining stability of route. The simulation results show that, this routing protocol requires less average hop count, high packet delivery rate and less end-to-end delay.
作者 濮阳莉 周建明 PU Yang-li;Zhou Jian-ming(School of computer and technology, China University of Mining and Technology, Xuzhou 221008, China;School of computer science and technology, Beijing Institute of Technology, Beijing, 100081, China)
出处 《微电子学与计算机》 CSCD 北大核心 2018年第7期109-113,共5页 Microelectronics & Computer
基金 国家自然科学基金(61363027) 江苏省教育科学规划课题(C-c/2011/02/010)
关键词 路由协议 蚁群优化 能量平衡 拥塞控制 移动自组网 routing protocol ant colony optimization energy balance congestion control mobile ad hoc networks
  • 相关文献

参考文献1

二级参考文献12

  • 1林蔚,杨永田.移动自组网多径资源预留路由算法[J].计算机工程与应用,2006,42(30):151-154. 被引量:1
  • 2GULATI M K, KUMAR K. A review of QoS routing protocols in MANETs[ C] // Proceedings of the 2013 International Conference on Computer Communication and Informatics (ICCCI). Piscataway: IEEE, 2013:1-6.
  • 3WU C, ZHANG F, YANG H. A novel QoS muhipath path routing in MANET[ J]. International Journal of Digital Content Technology and its Applications, 2010, 4(3) : 132 - 136.
  • 4YANG P, HUANG B. QoS routing protocol based on link stability with dynamic delay prediction in MANET[ C]// PACIIA'08: Proceedings of the 2008 Pacific-Asia Workshop on Computational. Intelligence and In- dustrial Application. Piscataway: IEEE, 2008, 1:515-518.
  • 5CHEN S, NAHRSTEDT K. Distributed quality-of-service routing in Ad Hoc netwOrks[ J]. IEEE Journal on Selected Areas in Communi- cations, 1999, 17(8): 1488 - 1505.
  • 6TOH C K. Maxinmm battery life routing to support ubiquitous mobile computing in wireless Ad Hoc networks [ J]. IEEE Communications Magazine, 2001, 39(6) : 138 - 147.
  • 7CHEN S, NAHRSTEDT K. On finding multi-constrained paths[ C]// ICC '98: Proeeedings of the 1998 IEEE International Conference on Communications. Piscataway: 1EEE, 1998, 2: 874-879.
  • 8HOU R, LUI K S, LEUNG K C, et al. An approximation algorithm for QoS routing with two additive constraints[ C]// ICNP 2008: Proceedings of the 2008 IEEE International Conference on Network Protocols. Piscataway: IEEE, 2008:328-337.
  • 9DU Q, ZHU J, ZHANG E. Location aided multi-constrained ant colony QoS routing algorithm for tactical MANETs[ C]//Proceedings of the 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). Piscataway: IEEE, 2011:1 -5.
  • 10LIAN J, LI L, ZHU X. A multi-constraint QoS routing protocol with route-request selection based on mobile predicting in MANET [ C ]// CISW 2007: Proceedings of the 2007 International Conference on Computational Intelligence and Security Workshops. Piscataway: IEEE, 2007:342-345.

共引文献2

同被引文献34

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部