MAC design for analog network coding

Khabbazian, Majid; Kühn, Fabian; Lynch, Nancy; Médard, Muriel; ParandehGheibi, Ali

doi:10.1145/1998476.1998484

Cited by 31 publications

(24 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dolev et al [7] have recently developed three new implementations of our probabilistic layer based on physical network models with multiple channels and adversarial interference; by combining these with our high-level broadcast algorithms, they automatically obtain algorithms and bounds for global broadcast for all three models. Khabbazian et al [12] are currently studying implementations of abstract MAC layers based on network coding techniques like Zig-Zag decoding [9]. Related work: This work relies on [14,15] for the general idea of decomposing wireless network algorithms using an abstract MAC layer, as well as the basic layer specification and the greedy multi-message global broadcast algorithm.…”

Section: Introductionmentioning

confidence: 99%

Decomposing broadcast algorithms using abstract MAC layers

Khabbazian

Kühn

Kowalski

et al. 2010

Proceedings of the 6th International Workshop on Foundations of Mobile Computing

Self Cite

View full text Add to dashboard Cite

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 contention-manageent algorithm for a standard graph-based radio network model We show that it implements both abstract MAC layers. We combine this algorithm with greedy algorithms for singlemessage and multi-message 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 previously-known bound for single-message broadcast over the physical network model. For multi-message broadcast, we obtain bounds of O((D + k∆) log( n ) log ∆) using the * Research supported by AFOSR contract FA9550-08-1-0159 and NSF grants CCF-0726514, CNS-0715397 and CCF-0937274.† The work of this author was supported by the NSERC postdoctoral fellowship. ‡ The work of this author was supported by the Engineering and Physical Sciences Research Council [grant numbers EP/G023018/1, EP/H018816/1].Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. DIALM-POMC'10, September 16, 2010, Cambridge, MA, USA. Copyright 2010 ACM 978-1-4503-0413-9/10/09 ...$10.00.basic layer and O((D + k∆ log( n )) log ∆) using the probabilistic layer, for the time to deliver a message everywhere in the presence of at most k concurrent messages.

show abstract

Section: Introductionmentioning

confidence: 99%

Decomposing broadcast algorithms using abstract MAC layers

Khabbazian

Kühn

Kowalski

et al. 2010

Proceedings of the 6th International Workshop on Foundations of Mobile Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…This service hides the complexities introduced by unpredictable link behaviors and therefore has the potential to significantly simplify the development of distributed algorithms for this challenging setting. As noted in the introduction, Our solution can also be adapted to implement the abstract MAC layer specification [13,15], allowing existing results for this abstraction to translate to the dual graph model (e.g., [9,20,6,12,11,5]). Though we leave the details of this adaptation to future work, we note that it would likely be straightforward, with the main effort focused on aligning our local broadcast problem definition-which depends on low level model details, such as rounds and receiving messages-with the higher level of the abstract MAC layer, which is specified in terms of the timing and ordering of input and output events.…”

Section: Resultsmentioning

confidence: 99%

“…To this end, we note that our algorithm can be interpreted as an implementation of the Abstract MAC Layer specification [13,15]. It follows that the growing corpus of results designed to run on top of this abstraction (e.g., [9,20,6,12,11,5]) can be composed with our implementation, automatically porting these existing solutions to the dual graph model for the first time.…”

Section: Introductionmentioning

confidence: 99%

“…Our local broadcast problem was defined with the standard parameters of a (probabilistic) abstract MAC layer in mind. Our algorithm, therefore, can be interpreted as a strategy for implementing this layer in the dual graph radio network model, and therefore providing a way to translate to the dual graph low level model the growing corpus of algorithms designed and analyzed onto of the abstract MAC layer [9,20,6,12,11,5]. We note, however, that the translation from our algorithm to an abstract MAC layer implementation is not immediate, as some (presumably straightforward) work will be required to mediate between our definition, expressed in terms of low-level details like rounds and receiving messages, and the higher level specification of the abstract MAC layer, which is usually expressed only in terms of the ordering and timing of input and output events.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A (Truly) Local Broadcast Layer for Unreliable Radio Networks

Lynch

Newport

2015

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

In this paper, we implement an efficient local broadcast service for the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Our local broadcast service offers probabilistic latency guarantees for: (1) message delivery to all reliable neighbors (i.e., neighbors connected by reliable links), and (2) receiving some message when one or more reliable neighbors are broadcasting. This service significantly simplifies the design and analysis of algorithms for the otherwise challenging dual graph model. To this end, we also note that our solution can be interpreted as an implementation of the abstract MAC layer specification-therefore translating the growing corpus of algorithmic results studied on top of this layer to the dual graph model. At the core of our service is a seed agreement routine which enables nodes in the network to achieve "good enough" coordination to overcome the difficulties of unpredictable link behavior. Because this routine has potential application to other problems in this setting, we capture it with a formal specification-simplifying its reuse in other algorithms. Finally, we note that in a break from much work on distributed radio network algorithms, our problem definitions (including error bounds), implementation, and analysis do not depend on global network parameters such as the network size, a goal which required new analysis techniques. We argue that breaking the dependence of these algorithms on global parameters makes more sense and aligns better with the rise of ubiquitous computing, where devices will be increasingly working locally in an otherwise massive network. Our push for locality, in other words, is a contribution independent of the specific radio network model and problem studied here.

show abstract

“…In that protocol, a tail, which contains the same information as the header, is added to the packet, so that the header information can be successfully decoded from the nonsuperposed part of the superposed packet. A theoretical MAC protocol for PNC using the abstract MAC layer specification was proposed in [4]. In [5], a distributed MAC protocol for PNC (named PNC-MAC), which is regarded as an extension to the IEEE 802.11 MAC protocol, was developed.…”

Section: Introductionmentioning

confidence: 99%

MAC-centric cross-layer collaboration: a case study on physical-layer network coding

Song

Guo

Wang

et al. 2014

IEEE Wireless Commun.

View full text Add to dashboard Cite

Abstract-Some newly emerging physical-layer cooperative communication techniques (e.g. physical-layer network coding (PNC), interference alignment, and virtual multiple-input multiple-output (VMIMO) scheme) provide high spectral efficiency and have attracted much attention. To implement these physical-layer techniques, the support from appropriate upper-layer mechanisms is required. This article takes PNC as an example to show how an upper layer mechanism can work appropriately to support PNC in a multi-hop network. We present a media access control (MAC) centric cross-layer collaboration mechanism for PNC, aiming at scheduling different relaying methods adaptively and allocating the correspondingly needed resources (e.g. transmission powers and channels) efficiently. Our numerical results affirm the efficiency of this mechanism, highlighting the importance of cross-layer collaboration for the implementation of physical-layer cooperative communication techniques.

show abstract

MAC design for analog network coding

Cited by 31 publications

References 20 publications

Decomposing broadcast algorithms using abstract MAC layers

Decomposing broadcast algorithms using abstract MAC layers

A (Truly) Local Broadcast Layer for Unreliable Radio Networks

MAC-centric cross-layer collaboration: a case study on physical-layer network coding

Contact Info

Product

Resources

About