Dominating sets are one of the most important graph theoretic structures used in clustering and routing protocols in wireless sensor networks. For this reason, many distributed dominating set algorithms have been studied by researchers. Since wireless sensor networks are usually composed of battery powered devices, it is important to minimize the resource consumption of dominating set algorithms. In this study, experimental performance of four synchronous distributed dominating set algorithms including 1-hop span-based, 2-hop span-based, random and identity (ID)-based are measured in SimPy environment in terms of time, message, cluster size and energy per node. While performing these tests, the node count and the average node degree in the wireless sensor networks are changed and a large number of measurements are taken to compare the algorithms. As a result of the detailed experiments, 2-hop span-based algorithm has the best results in terms of set size and the ID-based algorithm has the best results in terms of resource utilization.