Abstract: The infrastructure less and dynamic nature of mobile ad hoc networks (MANET) needs efficient clustering algorithms to improve network management and to design hierarchical routing protocols. Clustering algorithms in mobile ad hoc networks builds a virtual backbone for network nodes. Dominating sets and Spanning tree are widely used in clustering networks. Dominating sets and Spanning Tree based MANET clustering algorithms were suitable in a medium size network with respect to time and message complexities. This paper presents different clustering algorithms for mobile ad hoc networks based on dominating sets and spanning tree.

R Krishnam Raju Indukuri and Suresh Varma Penumathsa, “Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks” International Journal of Advanced Computer Science and Applications(IJACSA), 2(2), 2011. http://dx.doi.org/10.14569/IJACSA.2011.020213

@article{Indukuri2011,
title = {Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2011.020213},
url = {http://dx.doi.org/10.14569/IJACSA.2011.020213},
year = {2011},
publisher = {The Science and Information Organization},
volume = {2},
number = {2},
author = {R Krishnam Raju Indukuri and Suresh Varma Penumathsa}
}