Performance analysis of typical algorithms in Ad hoc network

To improve the macro performance of the Ad hoc networks,reduce the average latency and balance the load of the gateway node,the performance of clustering algorithms was analyzed and special algorithm for special case picked up.A mathematic model was firstly established for 3 typical clustering algorithms.Then the complexity and the performance ratio of the 3 algorithms were analysed and compared,and the piecemerge algorithm was specially discussed.The analysis indicated the piece-merge algorithm was better.Finally,these algorithms were evaluated by simulation,which demonstrates that the performance of piece-merge algorithm is better than that of the other two algorithms.This result also verifies the conclusion of the theoretical analysis.