## 2 Related Work  
Naming in a single beeping channel was studied by [PERSON] et al. [20]. The problem of naming anonymous processes was examined in the synchronous communication model when the number of processes is either known or unknown. They developed a Las Vegas algorithm for naming anonymous processes when the number of processes is known. The concept for the algorithm is to simulate the assignment of balls into bins, where a beep in a round represents the selection of a bin. A process is assigned the first name in the namespace when it is the only beeping process. The algorithm iterates until every process has been assigned a unique name in the range \((1,n)\) where \(n\) is the number of processes. The algorithm has a run time complexity of \(\mathcal{O}(n\log n)\). The Monte Carlo algorithm was developed for the model with an unknown number of processes and has a run time complexity of \(\mathcal{O}(n\log n)\). In this algorithm, the execution is run in phases where a process selects a random string of \(k\) bits in each phase. The random string is sent on the channel by each process. A process becomes a winner when the binary string from the channel matches the generated binary string from the process. The algorithm terminates when no additional processes remain and when no collisions are detected. Similar work that focuses on energy efficiency was done by [PERSON] and [PERSON] on the same model [21]. They developed energy-efficient randomized algorithms for both naming and counting that have an optimal running time of \(\mathcal{O}(n\log n)\) and an optimal energy complexity of \(\mathcal{O}(\log n)\). A system of anonymous processes was considered in which \(M\) nodes (\(M\leq n\)) have unique IDs. The naming algorithms are built on a deterministic algorithm that runs as _seasons_. For each _season_, the processes contend for the next name by sending their unique IDs bit by bit through beeps. The process with the maximum IDs obtains the next label. Naming of anonymous processes was studied in ad-hoc networks by [PERSON] and [PERSON], in which they communicate through broadcasting of messages [4]. They developed randomized initialization protocols for two models with either a known or unknown number of processes. The naming protocol has a probability of success that exceeds \(1-\frac{1}{n}\) to assign unique names in \(en+\mathcal{O}(\sqrt{(n\log n)})\) time slots when the number of processes is known, whereas it requires \(10n/3+\mathcal{O}(\sqrt{(n\log n)})\) time slots when the number of processes is unknown. These naming protocols were used for naming \(n\) processes in \(k\) channels that use collision detection, which requires \(10n/3k+\mathcal{O}(\sqrt{((n\ln n)/k)})\) time slots. [PERSON] and [PERSON] have also extended the work and proposed energy-efficient initialization protocols for both single and multiple channels without collision detection, where the awake time for the processes is minimized [5]. [PERSON] et al. constructed energy-efficient initialization protocols for nodes communicating through either single or multiple-channel radio networks [7]. These initialization protocols require \(\mathcal{O}(\log\log n)\) awake time slots, which is better compared to the number of awake time slots of the existing developed initialization protocols. [PERSON] developed several initialization protocols for multiple channels even when the group sizes are not uniform [22]. The algorithm consists of a single-channel initialization protocol and a \(k\)-channel initialization protocol. The single-channel initialization protocol requires \(\mathcal{O}(n/\log 2)\) time slots on average, whereas the k-initialization protocol requires \(\mathcal{O}((n-k+1)/\log 2)\) time slots in the worst case. [PERSON] et al. studied leader election in multi-hop networks in which nodes communicate with beeps [12]. A deterministic leader election was developed for a synchronous beeping model when the nodes have unique identifiers (IDs), whereas both the size of the network and degree of a node are unknown.