Distributed Clustering Algorithm for Finding Virtual Backbone in Ad Hoc Networks

  • B. Paul
  • S. V. Rao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3816)

Abstract

An important objective in designing a protocol is to save scarce resources like energy and bandwidth, and avoid the broadcast storm problem [1]. One way of addressing these problems is by forming a small virtual backbone. In this paper, we present a distributed clustering algorithm for forming a small backbone in ad-hoc network, based on connected dominating set. The time and message complexity of the algorithm is in O(n).

Keywords

Cluster Head Cluster Head Node Virtual Backbone Broadcast Storm Problem Internal List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • B. Paul
    • 1
  • S. V. Rao
    • 1
  1. 1.Department of Computer Science & Engineering, Indian Institute of Technology, Guwahati, Guwahati - 781039, AssamIndia

Personalised recommendations