Analysis of Clustering and Routing Overhead for Clustered Mobile Ad Hoc Networks

This paper presents an analysis of the control overhead involved in clustering and routing for one-hop clustered mobile ad hoc networks. Previous work on the analysis of control overhead incurred by clustering algorithms focused mainly on the derivation of control overhead in the Knuth big-O notation with respect to network size. However, we observe that the control overhead in a clustered network is closely related to different network parameters, e.g. node mobility, node transmission range, network size, and network density. We present an analysis that captures the effects of different network parameters on the control overhead. The results of our work can provide valuable insights into the amount of overhead that clustering algorithms may incur in different network environments. This facilitates the design of efficient clustering algorithms in order to minimize the control overhead.

• Type: Conference
• Year: 2006
• Where: ICDCS
• Authors: Mingqiang Xue, Inn Inn Er, Winston Khoon Guan Seah
• Keywords: Clustering Algorithms, Control Overhead, Distributed And Parallel Computing, ICDCS 2006, Network Size