Consistent Re-Clustering in Mobile Ad Hoc Networks

Abstract

Abstract-In this paper we revisit some considerations relative to the performance of re-clustering algorithms in MANET. We recommend that for a secure MANET the design of re-clustering algorithms should not only provide for clustering stability, but also for network robustness in terms of network connectivity, of message reliability, of tolerance against the attacks that target the cluster head nodes and of tolerance to random node failures due to energy drains. We also take into account the possibility of malicious users that might thwart the network protocol by advertising false topology information. We propose a distributed mechanism that for unbiased cluster head election first demands certain levels of consistency to be reached among the nodes.

Empirical Study of Clustering Algorithms for Wireless Ad Hoc Networks

“…This behavior of ERRA is justified (2) by the choice of the coefficients a, b and c, see Equation (1). In more detail, in the experiments we favored as for cluster heads those nodes having larger degree d i rather than those nodes with more energy left, by choosing a larger value for the degree coefficient α than the energy coefficient b.…”

“…• In this paper we compared three clustering algorithms and we proposed an improved version of the RRA [1] for the wireless mobile ad hoc network. For our testing purposes we experimented with simulation of the random waypoint model.…”

“…The Robust Re-clustering Algorithm (RRA) [1] is a graphbased weighted re-clustering algorithm that is based on two decision parameters, as it will be described in more detail later in section IV. The Lower ID (LID) algorithm [2] is one of the earlier static clustering algorithms.…”

“…The Extended Robust Re-clustering Algorithm (ERRA) is an extension of [1] which is a deterministic, sequential, weighted-based re-clustering algorithm. ERRA is executed in two phases.…”