A Firefly Optimization for a Connected Dominating Set in a Sensor Network

In the sensor network, a set of connected sensors that dominates all other sensors is called the connected dominating set. The minimum connected dominating set is a computationally difficult problem proved to be NP hard, and a number of approximation algorithms have been proposed. In the present paper, we propose an approximation algorithm for the minimum connected dominating set using firefly optimization, which is an optimization technique based on behaviors of fireflies. The experimental results show that the proposed algorithm achieves a smaller number of sensors than the existing algorithm.