• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2010, Vol. 32 ›› Issue (2): 27-30.doi: 10.3969/j.issn.1007130X.2010.

• 论文 • Previous Articles     Next Articles

An Adaptive Clustering Algorithm Based on Orbit Prediction in Ad Hoc Networks

  

  1. (1.School of Mathimatics and Computer Science,Fuzhou University,Fuzhou 350108;
    2.School of Computer Science,National University of Defense Technology,Changsha 410073;
    3.School of Computer and Information Technology,Fujian Agriculture and Forestry University,Fuzhou 350003,China)
  • Received:2008-09-13 Revised:2008-12-13 Online:2010-01-25 Published:2010-01-26

Abstract:

This paper studies deeply the technology of mobility prediction, analyzes the shortcomings of the existing clustering algorithms, and presents an adaptive clustering algorithm based on orbit prediction in the mobile MANET. According to a node’s moving history, its future moving track can be predicted using the algorithm. Besides, the stability of the connections between adjacent nodes can be estimated, and then the network topology based on the connection stability can be constructed by the algorithm.Finally, all the nodes in MANET are divided into several clusters by the graph coloring technique. The algorithm maintains the stability for the clustering framework and effectively prevents the interruption of communications, thus compensates for the flaws of the previous clustering algorithms.

Key words: MANET;clustering algorithm;orbit prediction;graph coloring

CLC Number: