Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bui, A. ; PRiSM, Univ. de Versailles, St. Quentin-en-Yvelines, France ; Kudireti, A. ; Sohier, D.

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.

Published in:

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

Date of Conference:

19-23 April 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.