Please use this identifier to cite or link to this item:
|Title:||Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks||Authors:||Er, I.I.
Mobile ad hoc network
|Issue Date:||2006||Citation:||Er, I.I., Seah, W.K.G. (2006). Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks. Journal of Computer and System Sciences 72 (7) : 1144-1155. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jcss.2005.12.010||Abstract:||With the emergence of large mobile ad hoc networks, the ability of existing routing protocols to scale well and function satisfactorily comes into question. Clustering has been proposed as a means to divide large networks into groups of suitably smaller sizes such that prevailing MANET routing protocols can be applied. However, the benefits of clustering come at a cost. Clusters take time to form and the clustering algorithms also introduce additional control messages that contend with data traffic for the wireless bandwidth. In this paper, we aim to analyse a distributed multi-hop clustering algorithm, Mobility-based D-Hop (MobDHop), based on two key clustering performance metrics and compare it with other popular clustering algorithms used in MANETs. We show that the overhead incurred by multi-hop clustering has a similar asymptotic bound as 1-hop clustering while being able to reap the benefits of multi-hop clusters. Simulation results are presented to verify our analysis. © 2006 Elsevier Inc. All rights reserved.||Source Title:||Journal of Computer and System Sciences||URI:||http://scholarbank.nus.edu.sg/handle/10635/39532||ISSN:||00220000||DOI:||10.1016/j.jcss.2005.12.010|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.