Merging clustering algorithms in mobile ad hoc networks

Authors:
Orhan Dagdeviren;Kayhan Erciyes;Deniz Cokuslu
Affiliations:
Computer Eng. Dept., Urla, Izmir Institute of Technology, Izmir, Turkey;Computer Eng. Dept., Urla, Izmir Institute of Technology, Izmir, Turkey;Computer Eng. Dept., Urla, Izmir Institute of Technology, Izmir, Turkey
Venue:
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Year:
2005

Citing 3
Cited 0

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
Cluster based routing using a k-tree core backbone for mobile ad hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications

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 first look at minimum spanning tree(MST) based algorithms and then propose a new algorithm for clustering in MANETs. The algorithm we propose 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.