Algorithm 1. Minimum Energy Consumption Chain Based Algorithm (ME-CBCCP)

Input

$\text{NN},\text{RN},\text{CH},\text{CCO},\text{BS},\text{ R}>\text{r}>0$

Output

Enhanced network lifetime

1: Deploy nodes randomly in the fixed area

2: Apply subarea division algorithm to form the clusters ($\text{number of clusters}=\text{k}$) with fixed boundaries, allocate the cluster IDs to each layer of the cluster $\text{cls}\_\text{id}<=\text{k}$. That is for $\forall \text{NN}\in \text{N},\text{ NN1}\in \text{Local}\_\text{cluster}$ Select the closest $RN1$ within cluster $\text{u} ϵ \text{RN},\text{ v}\in \text{NN1}$.

3: for each $\text{cls}\_\text{id}<=\text{k}$, repeat 3.1 Elect one $\text{CH}$ in each cluster randomly $\text{x}\in \text{CH}$ where $\text{x}.\text{energy}>\text{threshold}.\text{energy}$. Elect $\text{CCO}$ in each cluster where $y\in \text{CCO}$ and $y.\text{energy}>\text{threshold}\_\text{energy}$ and value of $0<\text{y}<\text{cls}\_\text{id}-\text{1}$ and. Number of C $\text{CCO}$ in each cluster = $\text{cls}\_\text{id}-\text{1}$. 3.2 for $\text{u} ϵ \text{RN},\text{ v}\in \text{NN1}$, $\text{u}\ne \text{v}$ and $\text{u}.\text{energy and v}.\text{energy }>0$ do 3.3 compute the distance ${\text{d}}_{\text{uv}}$ between $u$ and $v$ 3.4 if ${\text{d}}_{\text{uv}}\le R$ then 3.5 add the node $u$ and $v$ to the set of $RN1$ in local cluster, set $\text{P}\left(\text{u},\text{v}\right)=\text{1}$    End if    End for

End for

4: for each $\text{cls}\_\text{id}<=\text{k}$, repeat 4.1 transmit the data from $v$ nodes ($\text{v}\in \text{NN1}$) to $u$ nodes ($\text{u} ϵ \text{RN}1$), 4.2 transmit data in order from $\text{j}\to \text{x}\to \text{y}\to \text{z}$ nodes $(\text{x}\in \text{CH},\text{y}\in \text{CCO},\text{z}\in \text{BS })$

End for

5: for each $\text{cls}\_\text{id}<=\text{k}$, repeat 5.1 Compare: if $\text{x}.\text{energy and y}.\text{energy}\le \text{threshold}.\text{energy}$ Then Go to step 3. Else

Continue with step 4.

End if

End for