Calvin Newport
ABSTRACT
In this paper, we study distributed consensus in the radio network setting. We produce new upper and lower bounds for this problem in an abstract MAC layer model that captures the key guarantees provided by most wireless MAC layers. In more detail, we first generalize the well-known impossibility of deterministic consensus with a single crash failure [FLP 1985] from the asynchronous message passing model to our wireless setting. Proceeding under the assumption of no faults, we then investigate the amount of network knowledge required to solve consensus in our model---an important question given that these networks are often deployed in an ad hoc manner. We prove consensus is impossible without unique ids or without knowledge of network size (in multihop topologies). We also prove a lower bound on optimal time complexity. We then match these lower bounds with a pair of new deterministic consensus algorithms---one for single hop topologies and one for multihop topologies---providing a comprehensive characterization of the consensus problem in the wireless setting. From a theoretical perspective, our results shed new insight into the role of network information and the power of MAC layer abstractions in solving distributed consensus. From a practical perspective, given the level of abstraction used by our model, our upper bounds can be easily implemented in real wireless devices on existing MAC layers while preserving their correctness guarantees---facilitating the development of wireless distributed systems.
- M. Abboud, C. Delporte-Gallet, and H. Fauconnier. Agreement without knowing everybody: a first step to dynamicity. In Proceedings of the International Conference on New Technologies in Distributed Systems, 2008. Google Scholar
Digital Library
- M. K. Aguilera, W. Chen, and S. Toueg. Failure detection and consensus in the crash-recovery model. Distributed computing, 13(2):99--125, 2000. Google ScholarDigital Library
- E. A. Alchieri, A. N. Bessani, J. da Silva Fraga, and F. Greve. Byzantine consensus with unknown participants. In Proceedings of the International Conference on the Principles of Distributed Systems. 2008. Google ScholarDigital Library
- K. Alekeish and P. Ezhilchelvan. Consensus in sparse, mobile ad hoc networks. IEEE Transactions on Parallel and Distributed Systems, 23(3):467--474, 2012. Google ScholarDigital Library
- H. Attiya, A. Gorbach, and S. Moran. Computing in totally anonymous asynchronous shared memory systems. Information and Computation, 173(2):162--183, 2002. Google ScholarDigital Library
- R. Bar-Yehuda, O. Goldreich, and A. Itai. On the Time Complexity of Broadcast in Radio Networks: an Exponential Gap Between Determinism and Randomization. In Proceedings of the International Symposium on Principles of Distributed Computing, 1987. Google ScholarDigital Library
- F. Bonnet and M. Raynal. Anonymous Asynchronous Systems: the Case of Failure Detectors. In Proceedings of the International Symposium on Distributed Computing, 2010. Google ScholarDigital Library
- D. Cavin, Y. Sasson, and A. Schiper. Consensus with unknown participants or fundamental self-organization. In ADHOC-NOW, 2004.Google ScholarCross Ref
- T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225--267, 1996. Google ScholarDigital Library
- G. Chockler, M. Demirbas, S. Gilbert, C. Newport, and T. Nolte. Consensus and collision detectors in wireless ad hoc networks. In Proceedings of the International Symposium on Principles of Distributed Computing, 2005. Google ScholarDigital Library
- A. Cornejo, N. Lynch, S. Viqar, and J. L. Welch. Neighbor Discovery in Mobile Ad Hoc Networks Using an Abstract MAC Layer. In Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, 2009. Google ScholarDigital Library
- A. Cornejo, S. Viqar, and J. L. Welch. Reliable Neighbor Discovery for Mobile Ad Hoc Networks. Ad Hoc Networks, 12:259--277, 2014. Google ScholarDigital Library
- A. Czumaj and W. Rytter. Broadcasting Algorithms in Radio Networks with Unknown Topology. Journal of Algorithms, 60:115--143, 2006. Google ScholarDigital Library
- S. Daum, S. Gilbert, F. Kuhn, and C. Newport. Broadcast in the Ad Hoc SINR Model. In Proceedings of the International Symposium on Distributed Computing, 2013.Google ScholarDigital Library
- M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2), 1985. Google ScholarDigital Library
- L. Gasieniec, D. Peleg, and Q. Xin. Faster Communication in Known Topology Radio Networks. Distributed Computing, 19(4):289--300, 2007.Google ScholarDigital Library
- O. Goussevskaia, R. Wattenhofer, M. Halldorsson, and E. Welzl. Capacity of Arbitrary Wireless Networks. In Proceedings of the IEEE International Conference on Computer Communications, 2009.Google ScholarCross Ref
- F. Greve and S. Tixeuil. Knowledge connectivity vs. synchrony requirements for fault-tolerant agreement in unknown networks. In Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks, 2007. Google ScholarDigital Library
- R. Guerraoui, M. Hurfinn, A. Mostéfaoui, R. Oliveira, M. Raynal, and A. Schiper. Consensus in asynchronous distributed systems: A concise guided tour. Advances in Distributed Systems, Lecture Notes in Computer Science, 1752:33--47, 2000. Google ScholarDigital Library
- R. Guerraoui and A. Schiper. Consensus: the big misunderstanding {distributed fault tolerant systems}. In Proceedings of the IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems, 1997. Google ScholarDigital Library
- R. Guerraoui and A. Schiper. The generic consensus service. IEEE Transactions on Software Engineering, 27(1):29--41, 2001. Google ScholarDigital Library
- M. M. Halldorsson and P. Mitra. Wireless Connectivity and Capacity. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2012. Google ScholarDigital Library
- T. Jurdzinski, D. R. Kowalski, M. Rozanski, and G. Stachowiak. Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. In Proceedings of the International Symposium on Distributed Computing, 2013.Google ScholarDigital Library
- T. Jurdzi'nski and G. Stachowiak. Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. In Algorithms and Computation, pages 535--549. Springer, 2002. Google ScholarDigital Library
- M. Khabbazian, F. Kuhn, D. Kowalski, and N. Lynch. Decomposing Broadcast Algorithms Using Abstract MAC Layers. In Proceedings of the Workshop on the Foundations of Mobile Computing, 2010. Google ScholarDigital Library
- M. Khabbazian, F. Kuhn, N. Lynch, M. Medard, and A. ParandehGheibi. MAC Design for Analog Network Coding. In Proceedings of the Workshop on the Foundations of Mobile Computing, 2011. Google ScholarDigital Library
- D. Kowalski and A. Pelc. Broadcasting in Undirected Ad Hoc Radio Networks. Distributed Computing, 18(1):43--57, 2005. Google ScholarDigital Library
- F. Kuhn, N. Lynch, and C. Newport. The Abstract MAC Layer. In Proceedings of the International Symposium on Distributed Computing, 2009. Google ScholarDigital Library
- F. Kuhn, N. Lynch, and C. Newport. The Abstract MAC Layer. Distributed Computing, 24(3--4):187--206, 2011.Google Scholar
- L. Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133--169, 1998. Google ScholarDigital Library
- L. Lamport. Paxos made simple. ACM Sigact News, 32(4):18--25, 2001.Google Scholar
- N. A. Lynch. Distributed algorithms. Morgan Kaufmann, 1996. Google ScholarDigital Library
- T. Moscibroda. The Worst-Case Capacity of Wireless Sensor Networks. In Proceedings of the ACM/IEEE International Conference on Information Processing in Sensor Networks, 2007. Google ScholarDigital Library
- T. Moscibroda and R. Wattenhofer. Maximal Independent Sets in Radio Networks. In Proceedings of the International Symposium on Principles of Distributed Computing, 2005. Google ScholarDigital Library
- T. Moscibroda and R. Wattenhofer. The Complexity of Connectivity in Wireless Networks. In Proceedings of the IEEE International Conference on Computer Communications, 2006.Google ScholarCross Ref
- A. Mostefaoui and M. Raynal. Solving consensus using chandra-toueg's unreliable failure detectors: A general quorum-based approach. Lecture Notes in Computer Science, 1693:49--63, 1999. Google ScholarDigital Library
- C. Newport. Consensus with an Abstract MAC Layer. (Available on arXiv; also online at http://cs.georgetown.edu/ cnewport/pubs/consensus-abstract-full.pdf).Google Scholar
- D. Peleg. Time-Efficient Broadcasting in Radio Networks: a Review. In Proceedings of the Conference on Distributed Computing and Internet Technology, 2007. Google ScholarDigital Library
- E. Ruppert. The Anonymous Consensus Hierarchy and Naming Problems. In Proceedings of the International Conference on Principles of Distributed Systems, 2007. Google ScholarDigital Library
- A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149--157, 1997. Google ScholarDigital Library
- E. W. Vollset and P. D. Ezhilchelvan. Design and performance-study of crash-tolerant protocols for broadcasting and reaching consensus in MANETs. In IEEE Symposium on Reliable Distributed Systems, 2005. Google ScholarDigital Library
- W. Wu, J. Cao, and M. Raynal. Eventual clusterer: A modular approach to designing hierarchical consensus protocols in manets. IEEE Transactions on Parallel and Distributed Systems, 20(6):753--765, 2009. Google ScholarDigital Library
Index Terms
- Consensus with an abstract MAC layer
Recommendations
Methods for restoring MAC layer fairness in IEEE 802.11 networks with physical layer capture
REALMAN '06: Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to realityIn this paper, we experimentally investigate the physical layer capture effect in off-the-shelf 802.11 network cards and confirm that it reduces throughput fairness of traffic flows. We then study the feasibility of using the following PHY and MAC layer ...
Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC Layer
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingThis paper explores fault-tolerant algorithms in the abstract MAC layer [7] in a single-hop network. The model captures the basic properties of modern wireless MAC protocols. Newport [11] proves that it is impossible to achieve deterministic fault-...
Distributed MAC Protocol Supporting Physical-Layer Network Coding
Physical-layer network coding (PNC) is a promising approach for wireless networks. It allows nodes to transmit simultaneously. Due to the difficulties of scheduling simultaneous transmissions, existing works on PNC are based on simplified medium access ...
Comments