A merging clustering algorithm for mobile ad hoc networks

Authors:
Orhan Dagdeviren;Kayhan Erciyes;Deniz Cokuslu
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:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Year:
2006

Citing 6
Cited 3

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A cluster-based approach for routing in dynamic networks

ACM SIGCOMM Computer Communication Review
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Discrete and Combinatorial Mathematics: An Applied Introduction

Discrete and Combinatorial Mathematics: An Applied Introduction
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network

Information Processing Letters
A sub-linear time distributed algorithm for minimum-weight spanning trees

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithms.