arrow
Return

Robust self-stabilizing weight-based clustering algorithm

delete2009-02-01
delete28
delete
OA
AI
C
Colette Johnen *
L
Lê Huy Nguyên
DOI:10.1016/j.tcs.2008.10.009delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Ad hoc networks consist of wireless hosts that Communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The Clustering problem consists of partitioning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organization to the network that facilitates network management and that increases its scalability. In a weight-based clustering algorithm, the clusterheads are selected according to their weight (a node's parameter). The higher the weight of a node, the more suitable this node is for the role of clusterhead. In ad hoc networks, the amount of bandwidth, memory space or battery power of a node could be used to determine weight values. A self-stabilizing algorithm, regardless of the initial system configuration, converges to legitimate configurations without external intervention. Due to this property, self-stabilizing algorithms tolerate transient faults and they are adaptive to any topology change. In this paper, we present a robust self-stabilizing weight-based clustering algorithm for ad hoc networks. The robustness property guarantees that, starting from an arbitrary configuration, after one asynchronous round, the network is partitioned into clusters. After that, the network stays partitioned during the convergence phase toward a legitimate configuration where the clusters verify the ad hoc clustering properties. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Distributed algorithm
Ad hoc networking
Weight-based clustering
Self-stabilization
Robustness
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Theoretical Computer Science cover
Theoretical Computer Science
IF:
1
Papers:
273
Citations:
1.0W

Organization

U
universite de bordeaux
Scholars:
2.7W
Papers: 1.9W
Citations: 37
C
centre national de la recherche scientifique (cnrs)
Scholars:
24.5W
Papers: 18.2W
Citations: 279
Cited Papers

Cited Papers

Macroporous crystalline vanadium oxide foam
err2002-04-01
err0
errOAAI
errG. T. Chandrappa; Nathalie Steunou; Jacques Livage
errShare
errSave
Physical activity and cause-specific mortality in the Whitehall study
err2000-09-01
err0
PREAI
errG Davey Smith; MJ Shipley; GD Batty; JN Morris; M Marmot
errShare
errSave
errShare
errSave
Post-awakening cortisol secretion during basic military training
err2006-04-01
err0
PREAI
errA. Clow; S. Edwards; G. Owen; G. Evans; P. Evans; F. Hucklebridge; A. Casey
errShare
errSave
A Flexible and Highly Sensitive Pressure Sensor Based on a PDMS Foam Coated with Graphene Nanoplatelets
err2016-12-16
err0
errOAAI
errAndrea Rinaldi; Alessio Tamburrano; Marco Fortunato; Maria Sarto
errShare
errSave
A Special Section on Nanoarchitectonics
err2018-01-01
err0
PREAI
errKatsuhiko Ariga; Yusuke Yamauchi; Kevin C.-W Wu
errShare
errSave
Swallow Syncope, a Case Report and Review of the Literature
err2006-02-10
err0
PREAI
errWataru Omi; Yoshiharu Murata; Takanori Yaegashi; Jun-ichiro Inomata; Masahiko Fujioka; Shingo Muramoto
errShare
errSave
researcher View more