Mobility

SCAM: Scenario-Based Clustering Algorithm for Mobile Ad Hoc Networks

Download Now Free registration required

Executive Summary

This paper proposes a scenario based, adaptive and distributed clustering algorithm SCAM (Scenario-based Clustering Algorithm for Mobile ad hoc networks). A distributed algorithm based on (k, r) − Dominating Set is used for the selection of clusterheads and gateway nodes, here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. From among the k dominating nodes, the non-clusterhead node can select the most qualified dominating node as its clusterhead. The quality of the clusterhead is calculated based on various metrics, which include connectivity, stability and residual battery power.

  • Format: PDF
  • Size: 754.9 KB