An autonomous distributed algorithm based on calling behavior of frogs for a connected dominating set

Abstract

In the sensor network, a connected dominating set is a set of connected sensors such that every sensor not in the set is adjacent to at least one sensor in the set. The connected dominating set with a small number of sensors is desirable because the set reduces network energy and communication costs.

In this paper, we propose an autonomous distributed algorithm, which is based on calling behavior of frog, for constructing the connected dominating set. We implement the proposed algorithm in a simulation environment, and evaluate validity of the proposed algorithm.