A dominating set based clustering algorithm for mobile ad hoc networks

Authors:
Deniz Cokuslu;Kayhan Erciyes;Orhan Dagdeviren
Affiliations:
Computer Eng. Dept., Izmir Institute of Technology, Urla, Izmir, Turkey;Computer Eng. Dept., Izmir Institute of Technology, Urla, Izmir, Turkey;Computer Eng. Dept., Izmir Institute of Technology, Urla, Izmir, Turkey
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 8
Cited 4

Multicluster, mobile, multimedia radio network

Wireless Networks
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Connectivity-Based k-Hop Clustering in Wireless Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks

ISADS '03 Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03)
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
An improved distributed algorithm for connected dominating sets in wireless ad hoc networks

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications

CASAN: Clustering algorithm for security in ad hoc networks

Computer Communications
REputation based Clustering Algorithm for security management in ad hoc networks with liars

International Journal of Information and Computer Security
A distributed backbone formation algorithm for mobile ad hoc networks

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Performance analysis of virtual clusters in personal communication networks

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is based on Wu and Li’s [14] algorithm, however we provide significant modifications by considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and measure performance of this new algorithm by simulation and show that it performs better than Wu and Li’s [14] algorithm especially in the case of dense networks.