A Survey on Clustering Algorithms in MANET using Spanning Tree

Main Article Content

Ravikumar H. Roogi
Dr. H. B. Walikar, Shreedevi V.Shindhe

Abstract

This paper aims to provide a survey of existing graph models and algorithms that arise in searching, sorting, network structures and MANET’s. In particular we discuss the graph problems on spanning tree, minimum spanning tree and clustering algorithms in MANET. An ad hoc network is a multihop wireless communication network supporting mobile users without any existing infrastructure. Clustering provides a method to build and maintain a hierarchical address in ad hoc network. This paper highlights the concept of graph algorithms that address searching, sorting, network structures and MANETs.

Keywords: spanning tree, minimum spanning tree, clustering, mobile ad hoc network (MANET).

Downloads

Download data is not yet available.

Article Details

Section
Articles