Abstract
This paper describes an algorithm for clustering an ad hoc network, in which the devices have highly varying resources. Such a heterogeneous ad hoc network is formed when wireless and fixed consumer devices like laptops, personal data assistants, cellular phones and servers automatically interconnect. The aim of clustering is twofold: to reduce broadcast traffic, which is typical to ad hoc routing protocols, and to concentrate traffic to devices with more available resources and less mobility. Further, the clustering process identifies nodes that are suitable for service provision. The algorithm is lightweight as it operates with a single periodically sent message. We provide simulation results that show the performance of the algorithm.
Chapter PDF
Similar content being viewed by others
References
B. Das, R. Sivakumar, and V. Bharghavan, Routing in ad hoc networks using a spine, in Proceedings of Sixth International Conference on Computer Communications and Networks, 1997, pp. 34–39, September 1997
R. Sivakumar, B. Das, and V. Bharghavan, The Clade Vertebrata: Spines and routing in ad hoc networks, in Proceedings of the Third IEEE Symposium on Computers and Communications, 1998, ISCC’ 98, pp. 599–605, June–July 1998
Jie Wu, and Hailan Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, in Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, August 1999.
Stojmenovic, M. Seddigh, and J. Zunic, Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks, in IEEE Transactions on Parallel and Distributed Systems, Volume 13, Issue 1, pp. 14–25, January 2002
Srivastava, R. K. Ghosh, Cluster based routing using a k-tree core backbone for mobile ad hoc networks, in Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications, September 2002
Simple Network Layer Simulator for Ad-Hoc Networks, http://www.netlab.hut.fi/tutkimus/MobileMan/snelsan/
http://www.python.org/
R. Giovanni, S. Paolo, An analysis of the node spatial distribution of the random waypoint mobility model for ad hoc networks, in Proceedings of the second ACM international workshop on Principles of mobile computing, pp. 44–50, October 30–31, 2002
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Beijar, N., Kantola, R., Costa-Requena, J. (2006). A Lightweight Clustering Algorithm Utilizing Capacity Heterogeneity. In: Al Agha, K., Guérin Lassous, I., Pujolle, G. (eds) Challenges in Ad Hoc Networking. Med-Hoc-Net 2005. IFIP International Federation for Information Processing, vol 197. Springer, Boston, MA. https://doi.org/10.1007/0-387-31173-4_28
Download citation
DOI: https://doi.org/10.1007/0-387-31173-4_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-31171-5
Online ISBN: 978-0-387-31173-9
eBook Packages: Computer ScienceComputer Science (R0)