Cluster Density of Dependent Thinning Distributed Clustering Class of Algorithms in Ad Hoc Deployed Wireless Networks

Table 1

Brief definition of some notations used in the paper.

𝜆	Intensity of sensor node distribution point process.
𝛼	Random variable denoting the cluster area.
𝑅	CH message broadcasting distance (using an omni direction antenna).
𝑇𝑖	Time at which a node 𝑖 is supposed to broadcast its CH candidacy, provided that it has not heard similar messages from its neighbor.
𝒮	Set of all 𝑁 sensor nodes deployed in the sensor bed.
ℋ	Set of all CHs at a given moment.
|𝑛𝑖−𝑛𝑗|	Euclidean distance between any two nodes 𝑛𝑖 and 𝑛𝑗.
𝑦	Random variable denoting the probability of any selected random node could be a CH in a given moment.
𝐸[𝑘]	Expected number of clusters where 𝑘 represents the number of clusters in any given moment.
𝐸[𝑛]	Expected number of nodes in a given cluster.
𝜆𝑐	CH density.