Partial Network Coding with Cooperation

Partial Network Coding with Cooperation
Author: Panupat Poocharoen
Publisher: LAP Lambert Academic Publishing
Total Pages: 148
Release: 2011-12
Genre:
ISBN: 9783846539989

The imperfections of the propagation channel due to channel fading and the self-generated noise from the RF front-end of the receiver cause errors in the received signal in electronic communication systems. When network coding is applied, more errors occur because of error propagation due to the inexact decoding process. In this book, we present a system called Partial Network Coding with Cooperation (PNC-COOP) for wireless ad hoc networks. It is a system which combines opportunistic network coding with decode-and-forward cooperative diversity, in order to reduce this error propagation by trading off some transmission degrees of freedom. PNC-COOP is a decentralized, energy efficient strategy which provides a substantial benefit over opportunistic network coding when transmission power is a concern. The proposed scheme is compared with both opportunistic network coding and conventional multi-hop transmission analytically and through simulation. The effectiveness of both opportunistic network coding and PNC-COOP depends not only on the amount of network coding but also on other factors that are analyzed and discussed.

Partial Network Coding with Cooperation

Partial Network Coding with Cooperation
Author: Panupat Poocharoen
Publisher:
Total Pages: 140
Release: 2011
Genre:
ISBN:

The imperfections of the propagation channel due to channel fading and the self-generated noise from the RF front-end of the receiver cause errors in the received signal in electronic communication systems. When network coding is applied, more errors occur because of error propagation due to the inexact decoding process. In this dissertation we present a system called Partial Network Coding with Cooperation (PNC-COOP) for wireless ad hoc networks. It is a system which combines opportunistic network coding with decode-and-forward cooperative diversity, in order to reduce this error propagation by trading off some transmission degrees of freedom. PNC-COOP is a decentralized, energy efficient strategy which provides a substantial benefit over opportunistic network coding when transmission power is a concern. The proposed scheme is compared with both opportunistic network coding and conventional multi-hop transmission analytically and through simulation. Using a 3-hop communication scenario, in a 16-node wireless ad hoc network, it is shown that PNC-COOP improves the BER performance by 5 dB compared to opportunistic network coding. On average, it reduces the energy used by each sender node around 10% and reduces the overall transmitted energy of the network by 3.5%. When retransmission is applied, it is shown analytically that PNC-COOP performs well at relatively low to medium SNR while the throughput is comparable to that of opportunistic network coding. The effectiveness of both opportunistic network coding and PNC-COOP depends not only on the amount of network coding but also on other factors that are analyzed and discussed in this dissertation.

Network Coding

Network Coding
Author: Muriel Medard
Publisher: Academic Press
Total Pages: 353
Release: 2012
Genre: Computers
ISBN: 0123809185

Introduction -- Network coding Fundamentals -- Harnessing Network Coding in Wireless Systems -- Network Coding for Content Distribution and Multimedia Streaming in Peer-to-Peer Networks -- Network Coding in the Real World -- Network Coding and User Cooperation for Streaming and Download Services in LTE Networks -- CONCERTO: Experiences with a Real-World MANET System Based on Network Coding -- Secure Network Coding: Bounds and Algorithms for Secret and Reliable Communications -- Network Coding and Data Compression -- Scaling Laws with Network Coding -- Network Coding in Disruption Tolerant Networks.

Distributed Coding for Wireless Cooperative Networks

Distributed Coding for Wireless Cooperative Networks
Author: Atoosa Hatefi
Publisher:
Total Pages: 176
Release: 2012
Genre:
ISBN:

With the rapid growth of wireless technologies, devices and mobile applications, the quest of high throughput and ubiquitous connectivity in wireless communications increases rapidly as well. Relaying is undoubtedly a key concept to provide coverage extension and capacity increase in wireless networks. Network coding, which allows the intermediate nodes to share their computation capabilities in addition to their resource and their power, has grabbed a significant research attention since its inception in information theory. It has become an attractive candidate to bring promising performance improvement, especially in terms of throughput, in relay-based cellular networks. Substantial research efforts are currently focused on theoretical analysis, implementation and evaluation of network coding from a physical layer perspective. The question is, what is the most efficient and practical way to use network coding in wireless relay-based networks, and whether it is beneficial to exploit the broadcast and multiple-access properties of the wireless medium to perform network coding. It is in such a context, that this thesis proceeds. In the first part of the thesis, the problem of Joint Network-Channel Coding (JNCC) for a Multiple Access Relay Channel (MARC) is investigated in the presence of multiple access interferences and for both of the relay operating modes, namely, half-duplex and full-duplex. To this end, three new classes of MARC, referred to as Half-Duplex Semi-Orthogonal MARC (HD-SOMARC), Half-Duplex Non-Orthogonal MARC (HD-NOMARC), and Full-Duplex Non-Orthogonal MARC (FD-NOMARC) have been introduced and studied. The relaying function in all of the classes is based on a Selective Decode-and-Forward (SDF) strategy, which is individually implemented for each source, i.e, the relay forwards only a deterministic function of the error-free decoded messages. For each class, an information-theoretic analysis is conducted, and practical coding and decoding techniques are proposed. The proposed coding schemes, perform very close to the outage limit for both cases of HD-SOMARC and HD-NOMARC. Besides, in the case of HD-NOMARC, the optimal allocation of the transmission time to the relay is considered. It is also verified that exploiting multiple access interferences, either partially or totally, results in considerable gains for MARC compared to the existing interference-avoiding structures, even in the case of single receive antenna. In the second part of the thesis, the network model is extended by considering multiple relays which help multiple sources to communicate with a destination. A new class of Multiple Access Multiple Relay Channel (MAMRC), referred to as Half-Duplex Semi-Orthogonal MAMRC (HD-SOMAMRC) is then proposed and analyzed from both information theoretic and code design perspective. New practical JNCC schemes are proposed, in which binary channel coding and non binary network coding are combined, and they are shown to perform very close to the outage limit. Moreover, the optimal allocation of the transmission time to the sources and relays is considered. Finally, in the third part of the thesis, different ways of implementing cooperation, including practical relaying protocols are investigated for the half-duplex MARC with semi-orthogonal transmission protocol and in the case of JNCC. The hard SDF approach is compared with two Soft Decode and Forward (SoDF) relaying functions: one based on log a posterior probability ratios (LAPPRs) and the other based on Mean Square Error (MSE) estimate. It is then shown that SDF works well in most of the configurations and just in some extreme cases, soft relaying functions (based on LAPPR or MSE estimate) can slightly outperform the hard selective one.

Instantly Decodable Network Coding

Instantly Decodable Network Coding
Author: Mohammad Shahedul Karim
Publisher:
Total Pages: 0
Release: 2017
Genre:
ISBN:

The network coding paradigm enhances transmission efficiency by combining information flows and has drawn significant attention in information theory, networking, communications and data storage. Instantly decodable network coding (IDNC), a subclass of network coding, has demonstrated its ability to improve the quality of service of time critical applications thanks to its attractive properties, namely the throughput enhancement, delay reduction, simple XOR-based encoding and decoding, and small coefficient overhead. Nonetheless, for point to multi-point (PMP) networks, IDNC cannot guarantee the decoding of a specific new packet at individual devices in each transmission. Furthermore, for device-to-device (D2D) networks, the transmitting devices may possess only a subset of packets, which can be used to form coded packets. These challenges require the optimization of IDNC algorithms to be suitable for different application requirements and network configurations. In this thesis, we first study a scalable live video broadcast over a wireless PMP network, where the devices receive video packets from a base station. Such layered live video has a hard deadline and imposes a decoding order on the video layers. We design two prioritized IDNC algorithms that provide a high level of priority to the most important video layer before considering additional video layers in coding decisions. These prioritized algorithms are shown to increase the number of decoded video layers at the devices compared to the existing network coding schemes. We then study video distribution over a partially connected D2D network, where a group of devices cooperate with each other to recover their missing video content. We introduce a cooperation aware IDNC graph that defines all feasible coding and transmission conflictfree decisions. Using this graph, we propose an IDNC solution that avoids coding and transmission conflicts, and meets the hard deadline for high importance video packets. It is demonstrated that the proposed solution delivers an improved video quality to the devices compared to the video and cooperation oblivious coding schemes. We also consider a heterogeneous network wherein devices use two wireless interfaces to receive packets from the base station and another device concurrently. For such network, we are interested in applications with reliable in-order packet delivery requirements. We represent all feasible coding opportunities and conflict-free transmissions using a dual interface IDNC graph. We select a maximal independent set over the graph by considering dual interfaces of individual devices, in-order delivery requirements of packets and lossy channel conditions. This graph based solution is shown to reduce the in-order delivery delay compared to the existing network coding schemes. Finally, we consider a D2D network with a group of devices experiencing heterogeneous channel capacities. For such cooperative scenarios, we address the problem of minimizing the completion time required for recovering all missing packets at the devices using IDNC and physical layer rate adaptation. Our proposed IDNC algorithm balances between the adopted transmission rate and the number of targeted devices that can successfully receive the transmitted packet. We show that the proposed rate aware IDNC algorithm reduces the completion time compared to the rate oblivious coding schemes.