A Survey on One-Hop Clustering Algorithms in Mobile Ad Hoc Networks

  • Authors:
  • Suchismita Chinara;Santanu Kumar Rath

  • Affiliations:
  • Department of Computer Science and Engineering, National Institute of Technology, Rourkela, India 769008;Department of Computer Science and Engineering, National Institute of Technology, Rourkela, India 769008

  • Venue:
  • Journal of Network and Systems Management
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Clustering in mobile ad hoc network (MANET) play a vital role in improving its basic network performance parameters like routing delay, bandwidth consumption and throughput. One-hop clustering scheme adopts the simple mechanism to make the logical partition of the dynamic network where the network topology changes constantly resulting an unstable clustering. This paper makes a comprehensive survey of some bench-mark one-hop clustering algorithms to understand the research trends in this area. The literature provides the logic of cluster formation for different algorithms in achieving a linked cluster architecture and an intensive simulation survey of their performance on the cluster maintenance aspects such as cluster density, frequency of cluster reelection, frequency of cluster changes by the nodes and the granularity of cluster heads. This paper should facilitate the researchers as well as practitioners in choosing a suitable clustering algorithm on the basis of their formation and maintenance overhead, before any routing scheme is adopted in the mobile ad hoc network.