More Like this

1. Burst-MAC: A MAC Protocol for Handling Burst Traffic in LoRa Network

   https://doi.org/10.1109/RTSS62706.2024.00022  

   Jain, Aakriti; Haque, Md Ashikul; Saifullah, Abusayeed; Zhang, Haibo (December 2024, IEEE)
2. Byzantine Consensus in Abstract MAC Layer

   https://doi.org/10.4230/LIPICS.OPODIS.2023.9  

   Tseng, Lewis; Sardina, Callie (January 2024, International Conference on Principles of Distributed Systems)

   Bessani, Alysson; Défago, Xavier; Nakamura, Junya; Wada, Koichi; Yamauchi, Yukiko (Ed.)

   This paper studies the design of Byzantine consensus algorithms in an asynchronous single-hop network equipped with the "abstract MAC layer" [DISC09], which captures core properties of modern wireless MAC protocols. Newport [PODC14], Newport and Robinson [DISC18], and Tseng and Zhang [PODC22] study crash-tolerant consensus in the model. In our setting, a Byzantine faulty node may behave arbitrarily, but it cannot break the guarantees provided by the underlying abstract MAC layer. To our knowledge, we are the first to study Byzantine faults in this model. We harness the power of the abstract MAC layer to develop a Byzantine approximate consensus algorithm and a Byzantine randomized binary consensus algorithm. Both of our algorithms require only the knowledge of the upper bound on the number of faulty nodes f, and do not require the knowledge of the number of nodes n. This demonstrates the "power" of the abstract MAC layer, as consensus algorithms in traditional message-passing models require the knowledge of both n and f. Additionally, we show that it is necessary to know f in order to reach consensus. Hence, from this perspective, our algorithms require the minimal knowledge. The lack of knowledge of n brings the challenge of identifying a quorum explicitly, which is a common technique in traditional message-passing algorithms. A key technical novelty of our algorithms is to identify "implicit quorums" which have the necessary information for reaching consensus. The quorums are implicit because nodes do not know the identity of the quorums - such notion is only used in the analysis. 

   more » « less
3. On Energy-Delay Tradeoff in Uncoordinated MAC

   https://doi.org/10.1109/Allerton58177.2023.10313356  

   Han, Yuming; Xiong, Zixiang; Host-Madsen, Anders (September 2023, IEEE)
4. MAC Aware Quantization for Distributed Gradient Descent

   https://doi.org/10.1109/GLOBECOM42002.2020.9322254  

   Chang, Wei-Ting; Tandon, Ravi (December 2020, IEEE Globecom)

   null (Ed.)
5. On energy-delay tradeoff in uncoordinated MAC

   Yuming Han, Zixiang Xiong (October 2023, Proc. 2023 Allterton conference)

   Polyanskiy [1] proposed a framework for the MAC problem with a large number of users, where users employ a common codebook in the finite blocklength regime. In this work, we extend [1] to the case when the number of active users is random and there is also a delay constraint. We first define a random-access channel and derive the general converse bound. Our bound captures the basic tradeoff between the required energy and the delay constraint. Then we propose an achievable bound for block transmission. In this case, all packets are transmitted in the second half of the block to avoid interference. We then study treating interference as noise (TIN) with both single user and multiple users. Last, we derive an achievable bound for the packet splitting model, which allows users to split each packet into two parts with different blocklengths. Our numerical results indicate that, when the delay is large, TIN is effective; on the other hand, packet splitting outperforms as the delay decreases. 

   more » « less