
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc, "Consensus and Mutual Exclusion in a Multiple Access Channel," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 7, pp. 10921104, July, 2011.  
BibTex  x  
@article{ 10.1109/TPDS.2010.162, author = {Jurek Czyzowicz and Leszek Gasieniec and Dariusz R. Kowalski and Andrzej Pelc}, title = {Consensus and Mutual Exclusion in a Multiple Access Channel}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {22}, number = {7}, issn = {10459219}, year = {2011}, pages = {10921104}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.162}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Consensus and Mutual Exclusion in a Multiple Access Channel IS  7 SN  10459219 SP1092 EP1104 EPD  10921104 A1  Jurek Czyzowicz, A1  Leszek Gasieniec, A1  Dariusz R. Kowalski, A1  Andrzej Pelc, PY  2011 KW  Consensus KW  mutual exclusion KW  multiple access channel KW  collision detection. VL  22 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] H. Attiya and J. Welch, "Distributed Computing," John Wiley and Sons, Inc., 2004.
[2] R. BarYehuda, 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. 104126, 1992.
[3] M.A. Bender, M. FarachColton, S. He, B.C. Kuszmaul, and C.E. Leiserson, "Adversarial Contention Resolution for Simple Channels," Proc. 17th Ann. ACM Symp. Parallel Algorithms (SPAA), pp. 325332, 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. 8394, 2010.
[5] J. Capetanakis, "Tree Algorithms for Packet Broadcast Channels," IEEE Trans. Information Theory, vol. 25, no. 5, pp. 505515, 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. 5584, 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. 12401246, 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. 2738, 2002.
[9] B.S. Chlebus, L. Gasieniec, D.R. Kowalski, and T. Radzik, "On the WakeUp Problem in Radio Networks," Proc. 32nd Int'l Colloquium on Automata, Languages and Programming (ICALP), pp. 347359, 2005.
[10] B.S. Chlebus and D.R. Kowalski, "A Better WakeUp in Radio Networks," Proc. 23rd ACM Symp. Principles of Distributed Computing (PODC), pp. 266274, 2004.
[11] B.S. Chlebus, D.R. Kowalski, and M.A. Rokicki, "Adversarial Queuing on the MultipleAccess Channel," Proc. 25th ACM Symp. Principles of Distributed Computing (PODC), pp. 92101, 2006.
[12] M. Chrobak, L. Gasieniec, and W. Rytter, "Fast Broadcasting and Gossiping in Radio Networks," J. Algorithms, vol. 43, pp. 177189, 2002.
[13] A.E.F. Clementi, A. Monti, and R. Silvestri, "Selective Families, Superimposed Codes, and Broadcasting on Unknown Radio Networks," Proc. 12th Ann. ACMSIAM Symp. Discrete Algorithms (SODA), pp. 709718, 2001.
[14] A.E.F. Clementi, A. Monti, and R. Silvestri, "Round Robin is Optimal for FaultTolerant Broadcasting on Wireless Networks," Proc. Nineth Ann. European Symp. Algorithms (ESA), pp. 452463, 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. 136141, 2008.
[17] L. Gasieniec, A. Pelc, and D. Peleg, "The Wakeup Problem in Synchronous Broadcast Systems," SIAM J. Discrete Math., vol. 14, pp. 207222, 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. 546569, 2009.
[19] L.A. Goldberg, M. Jerrum, S. Kannan, and M. Paterson, "A Bound on the Capacity of Backoff and AcknowledgmentBased Protocols," SIAM J. Computing, vol. 33, pp. 313331, 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. 589596, 1985.
[21] D.R. Kowalski, "On Selection Problem in Radio Networks," Proc. 24th ACM Symp. Principles of Distributed Computing (PODC), pp. 158166, 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. 7382, 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. 702712, 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. 516526, May 2002.
[26] M.C. Pease, R.E. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults," J. ACM, vol. 27, pp. 228234, 1980.
[27] A. Pelc, "Activating Anonymous Ad Hoc Radio Networks," Distributed Computing, vol. 19, pp. 361371, 2007.
[28] M. Raynal, Algorithms for Mutual Exclusion. The MIT Press, 1986.
[29] D.E. Willard, "LogLogarithmic Selection Resolution Protocols in a Multiple Access Channel," SIAM J. Computing, vol. 15, pp. 468477, 1986.