| Popis: |
A system of processes is examined that communicate with beeps in multiple channels. In the beeping model, the processes have limited communication where they can detect the presence of a signal (beep), or its absence (silence). In the weak model, the processes can choose to transmit a beep on one or more channels and can detect beeps and/or silence on all channels. The processes are anonymous and they begin without names to identify themselves. The objective is to develop distributed naming algorithms for two models when n is either known or unknown, where n is the number of processes. The Multichannel Many Beeps Naming algorithm is a Las Vegas algorithm developed for the model when n is known and that has an optimal time complexity of \(\mathcal {O}{(\log {n})}\) rounds. When n is unknown, a Monte Carlo algorithm was developed, called the Unknown Multichannel Many Beeps Naming. It has an optimal time complexity of \(\mathcal {O}(\log {n})\) rounds and a probability of success that is at least \(1-(n\log {n})^{-1}\). These algorithms show an asymptotic improvement when compared to the existing naming algorithms for this model. |
