Clustering in MANET

Problem

Two clustering issues remain challenging in dynamic mobile environments:
» how to minimize the re-clustering overhead in the face of network partitions (link or node outages), and
» how to make the clustering procedure attack-resistant without sacrificing clustering and network performance.

Solution

The behavior of degree based clustering algorithms is investigated with respect to their stability and attack-resistance. A randomized variant of the highest degree algorithm provides attack-resistant without imposing significant overhead to the clustering performance. Cooperative consistent clustering algorithm integrates security into the clustering, decision achieving attacker identification and classification.

Solution in NS2

  • The behavior of degree based clustering algorithms with respect to their stability and attack-resistance can be evaluated in ns2.

  • Impact of compromising the CHs (such as packet loss) can be avoided by identifying faulty claims.

  • Security is integrated into the Cooperative consistent clustering algorithm.

Related Titles:

  • Degree-Based Clustering Algorithms for Wireless Ad Hoc Networks under Attack, IEEE Communications Letters, Vol. 16, No. 5, May 2012.