Before revision:  The two proposed algorithms have simple structures and can be employed in networks having severe constraints on the size of messages. In the first proposed algorithm, the adjacent nodes having the same value form a set called spot.
After revision:  Given its simplicity, the beep communication model is of practical importance in different applications such as system biology and wireless sensor networks. Yet, the distributed majority voting has not been resolved in this setting. In this paper, we propose two algorithms, named Distributed Voting with Beeps, to resolve this problem. In the first proposed algorithm, the adjacent nodes having the same value form a set called spot.