Results 1 
9 of
9
Decomposing Broadcast Algorithms Using Abstract MAC Layers ABSTRACT
"... In much of the theoretical literature on wireless algorithms, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated algorithms and analysis, and makes it difficult to extend the work to harder communication problems. In th ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
(Show Context)
In much of the theoretical literature on wireless algorithms, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated algorithms and analysis, and makes it difficult to extend the work to harder communication problems. In this paper, we present results of a current project aimed at simplifying such algorithms and analysis by decomposing the treatment into two levels, using abstract “MAC layer ” specifications to encapsulate the contention management. We use two different abstract MAC layers: the basic one of [14, 15] and a new probabilistic layer. We first present a typical randomized contentionmanageent algorithm for a standard graphbased radio network model We show that it implements both abstract MAC layers. We combine this algorithm with greedy algorithms for singlemessage and multimessage global broadcast and analyze the combination, using both abstract MAC layers as intermediate layers. Using the basic MAC layer, we prove a bound of O(D log ( n) log ∆) for the time to deliver a single message ɛ everywhere with probability 1 − ɛ, where D is the network diameter, n is the number of nodes, and ∆ is the maximum node degree. Using the probabilistic layer, we prove a bound of O((D + log ( n)) log ∆), which matches the best ɛ previouslyknown bound for singlemessage broadcast over the physical network model. For multimessage broadcast,) log ∆) using the we obtain bounds of O((D + k∆) log ( n ɛ
Efficient distributed multiplemessage broadcasting in unstructured wireless networks
 In INFOCOM
, 2013
"... AbstractMultiplemessage broadcast is a generalization of the traditional broadcast problem. It is to disseminate k distinct (1 ≤ k ≤ n) messages stored at k arbitrary nodes to the entire network with the fewest timeslots. In this paper, we study this basic communication primitive in unstructured ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
AbstractMultiplemessage broadcast is a generalization of the traditional broadcast problem. It is to disseminate k distinct (1 ≤ k ≤ n) messages stored at k arbitrary nodes to the entire network with the fewest timeslots. In this paper, we study this basic communication primitive in unstructured wireless networks under the physical interference model (also known as the SINR model). The unstructured wireless network assumes unknown network topology, no collision detection and asynchronous communications. Our proposed randomized distributed algorithm can accomplish multiplemessage broadcast in O((D + k) log n + log 2 n) timeslots with high probability, where D is the network diameter and n is the number of nodes in the network. To our best knowledge, this work is the first one to consider distributively implementing multiplemessage broadcasting in unstructured wireless networks under a global interference model, which may shed some light on how to efficiently solve in general a "global" problem in a "local" fashion with "global" interference constraints in asynchronous wireless ad hoc networks. Apart from the algorithm, we also show an Ω(D+k+log n) lower bound for randomized distributed multiple message broadcast algorithms under the assumed network model.
Bounds on Contention Management in Radio Networks
"... Abstract. The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two wellstudied wireless network models: the classical model, in which links are ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two wellstudied wireless network models: the classical model, in which links are reliable and collisions consistent, and the more recent dual graph model, which introduces unreliable edges. Our results prove that the Decay strategy, commonly used for local broadcast in the classical setting, is optimal. They also establish a separation between the two models, proving that the dual graph setting is strictly harder than the classical setting, with respect to this primitive. 1
Networkcoded multiple access
 IEEE Transactions on Mobile Computing
, 2014
"... Abstract—This paper proposes and experimentally demonstrates a first wireless local area network (WLAN) system that jointly exploits physicallayer network coding (PNC) and multiuser decoding (MUD) to boost system throughput. We refer to this multiple access mode as NetworkCoded Multiple Access (NC ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—This paper proposes and experimentally demonstrates a first wireless local area network (WLAN) system that jointly exploits physicallayer network coding (PNC) and multiuser decoding (MUD) to boost system throughput. We refer to this multiple access mode as NetworkCoded Multiple Access (NCMA). Prior studies on PNC mostly focused on relay networks. NCMA is the first realized multiple access scheme that establishes the usefulness of PNC in a nonrelay setting. NCMA allows multiple nodes to transmit simultaneously to the access point (AP) to boost throughput. In the nonrelay setting, when two nodes A and B transmit to the AP simultaneously, the AP aims to obtain both packet A and packet B rather than their networkcoded packet. An interesting question is whether network coding, specifically PNC which extracts packet A ⊕ B, can still be useful in such a setting. We provide an affirmative answer to this question with a novel twolayer decoding approach amenable to realtime implementation. Our USRP prototype indicates that NCMA can boost throughput by 100 % in the mediumhigh SNR regime (≥10dB). We believe further throughput enhancement is possible by allowing more than two users to transmit together. Index Terms—network coding, physicallayer network coding, multiuser detection, multiple access, implementation F 1
MAC Design for Analog Network Coding * General Terms
"... ABSTRACT Most medium access control (MAC) mechanisms discard collided packets and consider interference harmful. Recent work on Analog Network Coding (ANC) suggests a different approach, in which multiple interfering transmissions are strategically scheduled. Receiving nodes collect the results of ..."
Abstract
 Add to MetaCart
(Show Context)
ABSTRACT Most medium access control (MAC) mechanisms discard collided packets and consider interference harmful. Recent work on Analog Network Coding (ANC) suggests a different approach, in which multiple interfering transmissions are strategically scheduled. Receiving nodes collect the results of collisions and then use a decoding process, such as ZigZag decoding, to extract the packets involved in the collisions. In this paper, we present an algebraic representation of collisions and describe a general approach to recovering collisions using ANC. To study the effects of using ANC on the performance of MAC layers, we develop an ANCbased MAC algorithm, CMAC , and analyze its performance in terms of probabilistic latency guarantees for local packet delivery. Specifically, we prove that CMAC implements an abstract MAC layer service, as defined in We illustrate how this improvement in the MAC layer can translate into faster higherlevel algorithms, by analyzing the time complexity of a multimessage networkwide broadcast algorithm that uses CMAC .
1NetworkCoded Multiple Access II: Toward Realtime Operation with Improved Performance
"... Abstract—This paper presents a first realtime networkcoded multiple access (NCMA) system that jointly exploits physicallayer network coding (PNC) and multiuser decoding (MUD) to boost the throughput of a wireless local area network (WLAN). NCMA is a new design paradigm for multipacket reception ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—This paper presents a first realtime networkcoded multiple access (NCMA) system that jointly exploits physicallayer network coding (PNC) and multiuser decoding (MUD) to boost the throughput of a wireless local area network (WLAN). NCMA is a new design paradigm for multipacket reception wireless networks, in which the access point (AP) can receive and decode several packets simultaneously transmitted by multiple users. Conventionally, multipacket reception is realized using MUD only, while the key idea of NCMA is to use PNC together with MUD to realize multipacket reception. Although the feasibility of NCMA has previously been studied by the authors, our previous NCMA prototype was a version with offline signal processing. In addition, our previous investigation left open a number of theoretical and implementation issues, the resolution of which is critical to the adoption of NCMA in real practice. The current investigation makes the following stateoftheart contributions toward NCMA: 1) we demonstrate a first NCMA system with integrated realtime PHYlayer and MAClayer decoding; 2) we construct a new unified framework for MAClayer decoding that yields higher throughput with faster decoding – the faster decoding is one of the key enablers of our realtime implementation; 3) we design new PHYlayer decoding techniques that overcome the poor performance of the firstgeneration NCMA prototype at low SNR. Experimental results show that, compared with the previous NCMA prototype, our new NCMA prototype improves realtime throughput by more than 100 % at mediumhigh SNR (8dB). I.
Consensus with an Abstract MAC Layer
"... 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 wellknown imposs ..."
Abstract
 Add to MetaCart
(Show Context)
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 wellknown impossibility of deterministic consensus with a single crash failure