Showing papers by "Nathalie Mitton published in 2003"
01 Dec 2003
TL;DR: This paper introduces a novel measure that allows to form clusters and in the same time performs the cluster head election and results show that this novel measure proposed for cluster headelection induces less cluster head changes as compared to classical methods.
Abstract: Flat ad hoc architectures are not scalable. In order to overcome this major drawback, hierarchical routing is introduced since it is found to be more effective. The main challenge in hierarchical routing is to group nodes into clusters. Each cluster is represented by one cluster head. Conventional methods use either the connectivity (degree) or the the node Id to perform the cluster head election. Such parameters are not really robust in terms of side effects. In this paper we introduce a novel measure that allows to form clusters and in the same time performs the cluster head election. Analytical models and simulations results show that this novel measure proposed for cluster head election induces less cluster head changes as compared to classical methods.
5 citations