Please use this identifier to cite or link to this item:
|Title:||Analysis of clustering and routing overhead for clustered mobile ad hoc networks|
|Source:||Xue, M.,Er, I.-I.,Seah, W.K.G. (2006). Analysis of clustering and routing overhead for clustered mobile ad hoc networks. Proceedings - International Conference on Distributed Computing Systems 2006. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDCS.2006.15|
|Abstract:||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. © 2006 IEEE.|
|Source Title:||Proceedings - International Conference on Distributed Computing Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.