Theoretical analysis of a directional stability-based clustering algorithm for vanets

ABSTRACT

Clustering has the potential to reduce redundant messaging in MANETs and provide an efficient hierarchical network structure. However, it takes time to form and maintain a cluster structure which also requires additional control overhead. In this paper, we aim to analyze a distributed DIrectional Stability-based Clustering Algorithm (DISCA) designed for VANETs, which takes direction, mobility features, and leadership duration into consideration. We provide insights on the theoretical analysis of DISCA and show that the overhead incurred by DISCA is bound by a constant per node per time step, avoiding expensive reclustering chain reactions.

REFERENCES

• 1: Stefano Basagni, Distributed Clustering for Ad Hoc Networks, Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), p.310, June 23-25, 1999
• 2: S. Basagni, Finding a maximal weighted independent set in wireless networks, Telecommunication Systems 18 (1-3) (2001) 155--168, KluWer Academic Publishers.
• 3: A. Helmy, Architechtural framework for Large scale multicast in mobile ad hoc network, in proceedings of ICC 2002, New York, USA.
• 4: C.R. Lin, M. Gerla, Adaptive Clustering for Mobile Wireless Networks. IEEE Journal on Selected Areas in Communications, 1997,15(6): 1265--1275.
• 5: I. Stojmenovic, M. Seddigh, J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, in proceedings of IEEE Hawaii Int. Conf. on System Sciences, 2001.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

General Terms:
Algorithms, Design, Experimentation

Keywords:
broadcasting, clustering algorithm, traffic simulation, vehicle communication, vehicular ad-hoc network