Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding

Paek, Jeongyeup; Neely, Michael J.

doi:10.1007/s11036-010-0290-2

Cited by 10 publications

(10 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper we only consider the worst case, where carrier sensing constantly fails and there are always packet collisions. The improved decoding probabilities we obtain in this paper can be used to improve performance of higher layer multiaccess protocols that incorporate ZigZag-like collision frames, such as those in [24]. Under the 802.11 protocol, each sender retransmits its packet until it receives an acknowledgment that the AP successfully decoded it.…”

Section: Introductionmentioning

confidence: 92%

SigSag: Iterative Detection Through Soft Message-Passing

Tehrani

Dimakis

Neely

2011

IEEE J. Sel. Top. Signal Process.

Self Cite

View full text Add to dashboard Cite

Abstract-The multiple-access framework of ZigZag decoding (Gollakota and Katabi 2008) is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with distributed random access protocols. However, in the presence of noise this type of decoding can magnify errors, particularly when packet sizes are large. We show that ZigZag decoding can be seen as an instance of belief propagation in the high-SNR limit. Building on this observation, we present a simple soft-decoding version, called SigSag, that improves performance. We show that for two users, collisions result in a cycle-free factor graph that can be optimally decoded via belief propagation. For collisions between more than two users, we show that if a simple bit-permutation is used then the graph is locally tree-like with high probability, and hence belief propagation is near-optimal. Further, we introduce the joint channel-collision decoding which decodes the collided packets while the packets are coded by an LDPC code. Through simulations we show that our scheme performs better than coordinated collision-free time division multiple access (TDMA) and the ZigZag decoder. Furthermore, we investigate the performance of the joint channelcollision decoder in different scenarios and show that it performs better than TDMA and ZigZag decoder accompanied by sumproduct decoding.

show abstract

Section: Introductionmentioning

confidence: 92%

SigSag: Iterative Detection Through Soft Message-Passing

Tehrani

Dimakis

Neely

2011

IEEE J. Sel. Top. Signal Process.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Paek and Neely [13] applied ZigZag techniques to four different idealised multi-access system models in order to study the performance benefits of ANC in the existing MAC protocols. Using analytical and simulation results, the authors demonstrated that ZigZag decoding can considerably improve the maximum throughput of random access systems.…”

Section: Related Workmentioning

confidence: 99%

Analogue network coding‐aided game theoretic medium access control protocol for energy‐efficient data dissemination

Antonopoulos

Bastos

Verikoukis

2014

IET Science, Measurement & Technology

View full text Add to dashboard Cite

In this study, a novel medium access scheme based on analogue network coding for data dissemination in wireless networks is presented. Following our previous work, where energy-efficient medium access strategies based on game theory have been introduced, we propose a medium access control protocol that exploits to the maximum the recent advances in network coding (NC) domain to enhance the system performance. In particular, ZigZag decoding techniques are applied to resolve the data packet collisions, whereas random linear NC is employed to eliminate the need for exchanging control packets. The proposed protocol, evaluated by both analytical and simulation results, is proven to improve the energy efficiency in the network without compromising the provided quality of service.

show abstract

“…As another approach for resolving the collision of packets, a zigzag decoder (ZD) was proposed [12]. ZD was first proposed as a solution to the hidden terminal problem in IEEE 802.11 networks and was later applied to the ALOHA schemes [13]- [15]. In ZD, every packet is assumed to be equipped with a unique word or a pilot at both ends.…”

Section: Introductionmentioning

confidence: 99%

Design of Coded ALOHA With ZigZag Decoder

2019

View full text Add to dashboard Cite

In this study, we investigated the effects of combining a zigzag decoder (ZD) with a coded ALOHA using the successive interference cancellation (SIC) technique to retrieve packets from collisions. We proposed zigzag decodable coded slotted ALOHA (ZDCSA) and enhanced-ZDCSA (E-ZDCSA) as a scheme which applies ZD before and after SIC, respectively. Furthermore, we derived the asymptotic analysis for the throughput and packet loss rate (PLR) performances of E-ZDCSA and validated its accuracy with the Monte Carlo simulations. Through numerical and asymptotic analyses, we showed that E-ZDCSA outperforms ZDCSA and the conventional coded ALOHA schemes in terms of throughput and PLR performances in most of the offered load regime. Moreover, we demonstrated that our proposed schemes outperform the conventional protocol in a practical scenario in which ZD cannot resolve all the collisions. INDEX TERMS Slotted ALOHA, successive interference cancellation, ZigZag decoding.

show abstract

Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding

Cited by 10 publications

References 12 publications

SigSag: Iterative Detection Through Soft Message-Passing

SigSag: Iterative Detection Through Soft Message-Passing

Analogue network coding‐aided game theoretic medium access control protocol for energy‐efficient data dissemination

Design of Coded ALOHA With ZigZag Decoder

Contact Info

Product

Resources

About