A random walk based clustering with local recomputations for mobile ad hoc networks

Author

Bui, Alain ; Kudireti, Abdurusul ; Sohier, Devan

Author_Institution

PRiSM, Univ. de Versailles, St. Quentin-en-Yvelines, France

fYear

2010

fDate

19-23 April 2010

Firstpage

1

Lastpage

8

Abstract

In this paper, we present a clustering algorithm for MANETs. A cluster is divided in two parts: core nodes, that are recruited by a randomly moving token, and ordinary nodes, that are adjacent to core nodes. The clustering built by this algorithm is adaptive to topological changes. When a topological change occurs, nodes that are not in the cluster in which it occurs, or in adjacent clusters, are not affected. This property allows the scalability of this algorithm, by ensuring that only a bounded number of nodes have to recompute their cluster.

Keywords

ad hoc networks; mobile radio; statistical analysis; MANET; algorithm scalability; core nodes; local recomputations; mobile ad hoc networks; random walk based clustering; randomly moving token; topological change; Ad hoc networks; Algorithm design and analysis; Clustering algorithms; Context; Mobile ad hoc networks; Mobile communication; Network topology; Recruitment; Scalability; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on

Conference_Location

Atlanta, GA

Print_ISBN

978-1-4244-6533-0

Type

conf

DOI

10.1109/IPDPSW.2010.5470836

Filename

5470836