Journal of Northeastern University ›› 2011, Vol. 32 ›› Issue (3): 356-359.DOI: -

• OriginalPaper • Previous Articles     Next Articles

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:
    -

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.

CLC Number: