190
Ad HoC Mobile Wireless netWorks
are the lowest ID algorithm, highest degree (degree refers to number
of neighbors within transmission range of a node) algorithm, and
least cluster change (LCC) algorithm.
In the lowest ID algorithm, a node becomes a cluster head if it has
the lowest ID among all its neighbors. In the highest degree algo-
rithm, a node with a degree greater than the degrees of all its neigh-
bors becomes the cluster head. In the LCC algorithm, the cluster
head change occurs only if a change in network causes two cluster
heads to come into one cluster or one of the nodes moves out of the
range of all the cluster heads. In each cluster, the corresponding clus-
ter head maintains a power gain 2 matrix. It contains the power gain ...