Journal of Northeastern University ›› 2011, Vol. 32 ›› Issue (9): 1233-1236.DOI: -

• OriginalPaper • Previous Articles     Next Articles

WNNP-based clustering algorithm for ad hoc networks

Sha, Yi (1); Huang, Ye (2); Huang, Li (1); Zhang, Li-Li (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China; (2) Office Information Processing Centre, Shanghai Municipal People's Government, Shanghai 200000, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Sha, Y.
  • About author:-
  • Supported by:
    -

Abstract: According to the dynamic characteristics of ad hoc network topology, a wavelet neural network prediction (WNNP) model was used to predict the geometrical location of the nodes. Comparing the predicted total holding time with the threshold, the stabilization of a cluster in next time can be measured. If the cluster tends to be unstable in next time, a routing pre-repair mechanism can be initiated before the link failure to avoid frequent breaks of links. Thus the network performance is significantly improved. Simulation results show that compared with the lowest-identifier (lowest ID) algorithm and location-based WCA (LWCA) which has no prediction model, WNNP-LWCA can improve by 7% and 5% of the packet delivery rate, reduce by 63% and 50% of the broken routing number, and maintain the stabilization of the cluster.

CLC Number: