Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks

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...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of advanced computer science & applications Vol. 2; no. 2
Main Authors Krishnam, R, Varma, Suresh
Format Journal Article
LanguageEnglish
Published West Yorkshire Science and Information (SAI) Organization Limited 01.01.2011
Subjects
Algorithms
Clustering
Graph theory
Mobile ad hoc networks
Virtual networks
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2158-107X
2156-5570
DOI:10.14569/IJACSA.2011.020213