Peng Fan
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.
- S. Basagni, Distributed Clustering for Ad Hoc Networks, in proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (I--SPAN'99), IEEE Computer Society, pp.310--315, Australia. Google Scholar
Digital Library
- S. Basagni, Finding a maximal weighted independent set in wireless networks, Telecommunication Systems 18 (1-3) (2001) 155--168, KluWer Academic Publishers.Google ScholarDigital Library
- A. Helmy, Architechtural framework for Large scale multicast in mobile ad hoc network, in proceedings of ICC 2002, New York, USA.Google Scholar
- C.R. Lin, M. Gerla, Adaptive Clustering for Mobile Wireless Networks. IEEE Journal on Selected Areas in Communications, 1997,15(6): 1265--1275. Google ScholarDigital Library
- 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.Google Scholar
Index Terms
- Theoretical analysis of a directional stability-based clustering algorithm for vanets
Recommendations
Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks
Special issue: Performance modelling and evaluation of computer systemsWith the emergence of large mobile ad hoc networks, the ability of existing routing protocols to scale well and function satisfactorily comes into question. Clustering has been proposed as a means to divide large networks into groups of suitably smaller ...
Stable Clustering Algorithm for Routing Establishment in Vehicular Ad-Hoc Networks
Algorithms and Architectures for Parallel ProcessingAbstractWith regard to the complex and varied urban scenes in Vehicular Ad-Hoc Network, such as the vehicle nodes with fast speed, unstable links and frequent changes in network topology, this paper proposed a stable clustering algorithm to establish ...
Voting-Based Clustering Algorithm with Subjective Trust and Stability in Mobile Ad Hoc Networks
EUC '08: Proceedings of the 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing - Volume 02In existing clustering algorithms in mobile ad hoc networks, some of them consider only stability of cluster heads, and some others take only security into account, while only a few of them consider both factors. We propose Voting-based Clustering ...
Comments