东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2011, Vol. 32 ›› Issue (3): 356-359.DOI: -

• 论著 • 上一篇    下一篇

WPANT:应用于移动对等网络的轻量级层次蚁群路由算法

曲大鹏;王兴伟;黄敏;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-19 修回日期:2013-06-19 发布日期:2013-04-04
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(61070162,71071028,60802023,70931001);;

WPANT: A lightweight hierarchical ant routing algorithm for mobile peer-to-peer networks

Qu, Da-Peng (1); Wang, Xing-Wei (1); Huang, Min (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Qu, D.-P.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

580

摘要： 针对移动对等网络中存在的节点移动、拓扑多变、资源受限和可扩展性差等问题,提出了一种基于轻量级层次结构的蚁群路由算法.该算法通过选取活动路由上的节点将网络划分成轻量级的层次结构,在此结构上运行蚁群路由算法.轻量级的层次结构提高了蚁群算法中信息素更新机制的效率,同时,蚁群路由算法的自组织和流量均衡等特性增强了轻量级层次结构的健壮性.模拟仿真表明了该算法的有效性.

关键词: 移动对等网络, 路由, 蚂蚁算法, 轻量级层次, 流量均衡

Abstract: An ant routing algorithm based on a lightweight hierarchical structure was proposed to address problems related to mobile nodes, dynamic topology, limited resources, and inadequate scalability over mobile peer-to-peer (P2P) networks. In this algorithm the network was divided into lightweight hierarchical structures by selecting nodes on active routers and running the ant routing algorithm on these structures. The lightweight hierarchical structure improves efficiency of the pheromone update mechanism of the ant algorithm. In addition, the self-organization and load-balancing properties of the ant routing algorithm increases the robustness of the lightweight hierarchical structure. Simulation experiments demonstrated the effectiveness of the algorithm.

中图分类号: