Clustering the wireless Ad Hoc networks: A distributed learning automata approach
JA Torkestani, MR Meybodi - Journal of Parallel and Distributed Computing, 2010 - Elsevier
In Ad Hoc networks, the performance is significantly degraded as the size of the network
grows. The network clustering by which the nodes are hierarchically organized on the basis
of the proximity relieves this performance degradation. Finding the weakly connected
dominating set (WCDS) is a promising approach for clustering the wireless Ad Hoc
networks. Finding the minimum WCDS in the unit disk graph is an NP-Hard problem, and a
host of approximation algorithms has been proposed. In this article, we first proposed a …
grows. The network clustering by which the nodes are hierarchically organized on the basis
of the proximity relieves this performance degradation. Finding the weakly connected
dominating set (WCDS) is a promising approach for clustering the wireless Ad Hoc
networks. Finding the minimum WCDS in the unit disk graph is an NP-Hard problem, and a
host of approximation algorithms has been proposed. In this article, we first proposed a …