Subscribe
Issue No.07 - July (2011 vol.22)
pp: 1092-1104
Jurek Czyzowicz , Universite du Quebec en Outaouais, Gatineau
Leszek Gasieniec , University of Liverpool, Liverpool
Dariusz R. Kowalski , University of Liverpool, Liverpool
Andrzej Pelc , Universite du Quebec en Outaouais, Gatineau
ABSTRACT
We consider deterministic feasibility and time complexity of two fundamental tasks in distributed computing: consensus and mutual exclusion. Processes have different labels and communicate through a multiple access channel. The adversary wakes up some processes in possibly different rounds. In any round, every awake process either listens or transmits. The message of a process i is heard by all other awake processes, if i is the only process to transmit in a given round. If more than one process transmits simultaneously, there is a collision and no message is heard. We consider three characteristics that may or may not exist in the channel: collision detection (listening processes can distinguish collision from silence), the availability of a global clock showing the round number, and the knowledge of the number n of all processes. If none of the above three characteristics is available in the channel, we prove that consensus and mutual exclusion are infeasible; if at least one of them is available, both tasks are feasible, and we study their time complexity. Collision detection is shown to cause an exponential gap in complexity: if it is available, both tasks can be performed in time logarithmic in n, which is optimal, and without collision detection both tasks require linear time. We then investigate both consensus and mutual exclusion in the absence of collision detection, but under alternative presence of the two other features. With global clock, we give an algorithm whose time complexity linearly depends on n and on the wake-up time, and an algorithm whose complexity does not depend on the wake-up time and differs from the linear lower bound only by a factor O(\log^2 n). If n is known, we also show an algorithm whose complexity differs from the linear lower bound only by a factor O(\log^2 n).
INDEX TERMS
Consensus, mutual exclusion, multiple access channel, collision detection.
CITATION
Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc, "Consensus and Mutual Exclusion in a Multiple Access Channel", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 7, pp. 1092-1104, July 2011, doi:10.1109/TPDS.2010.162
REFERENCES
 [1] H. Attiya and J. Welch, "Distributed Computing," John Wiley and Sons, Inc., 2004. [2] R. Bar-Yehuda, O. Goldreich, and A. Itai, "On the Time Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism And Randomization," J. Computer and System Sciences, vol.45, pp. 104-126, 1992. [3] M.A. Bender, M. Farach-Colton, S. He, B.C. Kuszmaul, and C.E. Leiserson, "Adversarial Contention Resolution for Simple Channels," Proc. 17th Ann. ACM Symp. Parallel Algorithms (SPAA), pp. 325-332, 2005 [4] M. Bienkowski, M. Klonowski, M. Korzeniowski, and D.R. Kowalski, "Dynamic Sharing of a Multiple Access Channel," Proc. 27th Int'l Symp. Theoretical Aspects of Computer Science (STACS), vol. 5, pp. 83-94, 2010. [5] J. Capetanakis, "Tree Algorithms for Packet Broadcast Channels," IEEE Trans. Information Theory, vol. 25, no. 5, pp. 505-515, Sep. 1979. [6] G. Chockler, M. Demirbas, S. Gilbert, N.A. Lynch, C.C. Newport, and T. Nolte, "Consensus and Collision Detectors in Radio Networks," Distributed Computing, vol. 21, pp. 55-84, 2008. [7] I. Chlamtac and S. Kutten, "On Broadcasting in Radio Networks— Problem Analysis and Protocol Design," IEEE Trans. Comm., vol. 33, no. 12, pp. 1240-1246, Dec. 1985. [8] B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter, "Deterministic Broadcasting in Unknown Radio Networks," Distributed Computing, vol. 15, pp. 27-38, 2002. [9] B.S. Chlebus, L. Gasieniec, D.R. Kowalski, and T. Radzik, "On the Wake-Up Problem in Radio Networks," Proc. 32nd Int'l Colloquium on Automata, Languages and Programming (ICALP), pp. 347-359, 2005. [10] B.S. Chlebus and D.R. Kowalski, "A Better Wake-Up in Radio Networks," Proc. 23rd ACM Symp. Principles of Distributed Computing (PODC), pp. 266-274, 2004. [11] B.S. Chlebus, D.R. Kowalski, and M.A. Rokicki, "Adversarial Queuing on the Multiple-Access Channel," Proc. 25th ACM Symp. Principles of Distributed Computing (PODC), pp. 92-101, 2006. [12] M. Chrobak, L. Gasieniec, and W. Rytter, "Fast Broadcasting and Gossiping in Radio Networks," J. Algorithms, vol. 43, pp. 177-189, 2002. [13] A.E.F. Clementi, A. Monti, and R. Silvestri, "Selective Families, Superimposed Codes, and Broadcasting on Unknown Radio Networks," Proc. 12th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 709-718, 2001. [14] A.E.F. Clementi, A. Monti, and R. Silvestri, "Round Robin is Optimal for Fault-Tolerant Broadcasting on Wireless Networks," Proc. Nineth Ann. European Symp. Algorithms (ESA), pp. 452-463, 2001. [15] E.W. Dijkstra, "Solution of a Problem in Concurrent Programming Control," Comm. ACM, vol. 8, no. 9, p. 569, 1965. [16] E.G. Fusco and A. Pelc, "Acknowledged Broadcasting in Ad Hoc Radio Networks," Information Processing Letters, vol. 109, pp. 136-141, 2008. [17] L. Gasieniec, A. Pelc, and D. Peleg, "The Wakeup Problem in Synchronous Broadcast Systems," SIAM J. Discrete Math., vol. 14, pp. 207-222, 2001. [18] S. Gilbert, R. Guerraoui, and C.C. Newport, "Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks," Theoretical Computer Science, vol. 410, pp. 546-569, 2009. [19] L.A. Goldberg, M. Jerrum, S. Kannan, and M. Paterson, "A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols," SIAM J. Computing, vol. 33, pp. 313-331, 2004. [20] A.G. Greenberg and S. Winograd, "A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels," J. ACM, vol. 32, pp. 589-596, 1985. [21] D.R. Kowalski, "On Selection Problem in Radio Networks," Proc. 24th ACM Symp. Principles of Distributed Computing (PODC), pp. 158-166, 2005. [22] D.R. Kowalski and A. Pelc, "Deterministic Broadcasting Time in Radio Networks of Unknown Topology," Proc. 22nd ACM Symp. Principles of Distributed Computing (PODC), pp. 73-82, 2003. [23] Y. Kushilevitz and Y. Mansour, "An $\Omega (D \log (N/D))$ Lower Bound for Broadcast in Radio Networks," SIAM J. Computing, vol. 27, pp. 702-712, 1998. [24] N.A. Lynch, Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1996. [25] K. Nakano and S. Olariu, "Uniform Leader Election Protocols for Radio Networks," IEEE Trans. Parallel Distributed Systems, vol. 13, no. 5, pp. 516-526, May 2002. [26] M.C. Pease, R.E. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults," J. ACM, vol. 27, pp. 228-234, 1980. [27] A. Pelc, "Activating Anonymous Ad Hoc Radio Networks," Distributed Computing, vol. 19, pp. 361-371, 2007. [28] M. Raynal, Algorithms for Mutual Exclusion. The MIT Press, 1986. [29] D.E. Willard, "Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel," SIAM J. Computing, vol. 15, pp. 468-477, 1986.