Results 1 
3 of
3
Information Multicast in (Pseudo)Planar Networks: Efficient Network Coding over Small Finite Fields
"... Abstract—Network coding encourages innetwork mixing of information flows for enhanced network capacity, particularly for multicast data dissemination. This work aims to explore properties in the underlying network topology for efficient network coding solutions, including efficient code assignment ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract—Network coding encourages innetwork mixing of information flows for enhanced network capacity, particularly for multicast data dissemination. This work aims to explore properties in the underlying network topology for efficient network coding solutions, including efficient code assignment algorithms and efficient encoding/decoding operations that come with small base field sizes. The following cases of (pseudo)planar types of networks are studied: outerplanar networks where all nodes colocate on a common face, relay/terminal coface networks where all relay/terminal nodes colocate on a common face, general planar networks, and apex networks. I.
1A Matroid Theory Approach to Multicast Network Coding
"... Abstract—Network coding encourages the mixing of information flows at intermediate nodes of a network for enhanced network capacity, especially for onetomany multicast applications. A fundamental problem in multicast network coding is to construct a feasible solution such that encoding and decod ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Network coding encourages the mixing of information flows at intermediate nodes of a network for enhanced network capacity, especially for onetomany multicast applications. A fundamental problem in multicast network coding is to construct a feasible solution such that encoding and decoding are performed over a finite field of size as small as possible. Coding operations over very small finite fields (e.g., F2) enable low computational complexity in theory and ease of implementation in practice. In this work, we propose a new approach based on matroid theory to study multicast network coding and its minimum field size requirements. Applying this new approach that translates multicast networks into matroids, we derive the first upperbounds on the field size requirement based on the number of relay nodes in the network, and make new progresses along the direction of proving that coding over very small fields (F2 and F3) suffices for multicast network coding in planar networks. I.
The Adaptive Network CodingRouting (ANCR) Based on Graph for Multicast Networks*
"... Abstract. The multicast wireless network, where a source needs to deliver packets of data to a set of destination through a group of relays over a network topology, is degraded by a limited bandwidth and capacity regime. Network throughput can be improved using network coding. However, the network c ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. The multicast wireless network, where a source needs to deliver packets of data to a set of destination through a group of relays over a network topology, is degraded by a limited bandwidth and capacity regime. Network throughput can be improved using network coding. However, the network coding might or might not be helpful to increase throughput due to an unpredictable network topology. In this paper, we propose an adaptive network codingrouting (ANCR) algorithm to automatically select whether a packet can construct a network code at a relay node before forwarding to destination or not based on the minor of network graphs. If there is no an appropriate packet, the relay will be forwarded a data packet using routing protocol. The results show that this technique can significantly improve both throughput and timeslot usage. The throughput gain at a bottleneck relay node is increased by 35%, while the timeslot usage is decreased for more than 30%.