A clustering algorithm for block mobility in ad-hoc network

Long, H; Lu, J; Shao, G; Yip, YJ

Abstract

This paper presents a block mobility judgment that uses the matrix of similarity neighbor at the different time according to character of block mobility. A new clustering algorithms, called Block Mobility Over Clustering Algorithm (BMOC), is proposed based on a block mobility judgment and traditional LCC (Least Cluster-head Change) algorithms. The performances of the algorithm are analyzed by simulation experiments. The results show that BMOC algorithm can significantly improve the performances when there is block mobility in network than LCC?s.

Citation

Long, H., Lu, J., Shao, G., & Yip, Y. (2007). A clustering algorithm for block mobility in ad-hoc network. Communications of SIWN (Print), 5,

• Journal Article Type: Article
• Publication Date: Aug 1, 2007
• Deposit Date: Aug 14, 2012
• Journal: Communications of SIWN
• Print ISSN: 1757-4439
• Peer Reviewed: Peer Reviewed
• Volume: 5
• Publisher URL: http://siwn.org.uk/press/sai/cosiwn0005.htm