Related Work
LEACH (low-Energy Adaptive Clustering Hierarchy)
The nodes distribute the load over period of time and depending on signal strength, nodes with highest
energy within cluster become cluster heads and transmit data to BS.
Proposed Approach
It is assumed the sensor nodes are spread randomly on 100x100 field and are homogenous. Regarding
the BS is fixed, it is considered that the location of BS is at edge of network bounding and in the center
of the field.
∑ ∑ ∥ 𝑋𝑖 − 𝐶𝑗 ∥2
𝑗=1 𝑋𝑖 ∈ 𝑆𝑖
Every each round of the nodes that will become cluster head is assigned to nearest centroid. If the
chosen nodes have energy under the threshold then new cluster head will be selected by repeating
above steps.
Setup phase
The process begins with the setup phase. The nodes near to the centroid act as cluster head transmit
the data to BS. The node will act as cluster head as long as it has energy above threshold.
Simulation results
Parameter Value
Network size (M*M) 100m by 100m
Location of BS (Base Station) 50*50 By Edge of the network
Number of Nodes 100
Cluster head probability 0.1
Initial Energy 0.5 J
ETX and Erx (Eelec) 50 n J/bit
Number of the Cluster (K-means) 5,10,15,20,25 and 30
The Data Packet Size (bits) 4000
TABLE 1. PARAMETERS VALUE USED IN SIMULATION
FIGURE 1. NETWORK TOPOLOGY
In this section, we provided two scenarios to illustrate the proposed protocol algorithm capabilities
using Matlab R2015a simulation and compare its performance with Leach and Deec. The network
topology as describe on Fig.1 and specific parameters as given in Table 1.
FIGURE 6. The lifetime of the network on a different cluster area, Base station located on
(50/50)
FIGURE 7. The lifetime of the network on a different cluster area, Base station located on
(edge)