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

Authors:
Peng Fan;Prasad Sistla;Peter Nelson
Affiliations:
University of Illinois at Chicago, Chicago, IL, USA;University of Illinois at Chicago, Chicago, IL, USA;University of Illinois at Chicago, Chicago, IL, USA
Venue:
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
Year:
2008

Citing 2
Cited 2

Distributed Clustering for Ad Hoc Networks

ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Enhancing collaboration in vehicular networks

CDVE'10 Proceedings of the 7th international conference on Cooperative design, visualization, and engineering
Reputation lists and groups to promote cooperation

Proceedings of the 12th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

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.