Modelling of clustering with relay nodes in wireless sensor networks
Souissi Manel, Aref Meddeb · 2017
Reaching the coverage concern through the least number of sensors has received the most attention, while meeting the design goals through random node distribution is an utmost challenge. The deployment of nodes in deterministic fashion is necessary and often viable when node positions affect considerably their operation or when sensors are expensive, while random nodes' distribution is the only feasible option in some wireless sensor network applications. In this paper, we concentrate on clustering in two-tier WSNs where powerful relay nodes are placed at deterministic computed grid points where achieving strong network connectivity, increasing the coverage and extending the network lifetime are the main concern of the proposed node placement scheme. We propose a Mixed Integer Linear Program for optimal energy efficient clustering where the objective is to extend the sensor node life span by minimizing the transmission distance between each sensor node and the corresponding cluster head. To demonstrate the great impact of relay node deployment, we compare three deployment scenarios in term of distance minimization, complexity and computational time.