Super Strongly Perfect Graphs in the Selection of Cluster Heads in Wireless Sensor Networks

Abstract

Wireless sensor network comprises of dense sensor nodes which are randomly deployed. Major challenges in WSN are limited battery source and computation capacity. Considerable research has been carried out in the area of maximizing battery lifetime by reducing the energy consumption. Once such proposed technique involves hierarchical topology control. Conventionally proposed algorithm for hierarchical topology control involves computationally intensive soft computing tools. It leads to higher energy consumption in the sink node. Hence it necessitates computationally less intensive technique for cluster head selection. In this paper, an efficient cluster head selection is proposed using minimal dominating set in Super Strongly Perfect (SSP) graph.