We consider network coding for a noiseless broadcast channel where each receiver demands a subset of messages available at the transmitter and is equipped with noisy side information in the form an erroneous version o...
详细信息
ISBN:
(纸本)9781538612248
We consider network coding for a noiseless broadcast channel where each receiver demands a subset of messages available at the transmitter and is equipped with noisy side information in the form an erroneous version of the message symbols it demands. We view the message symbols as elements from a finite field and assume that the number of symbol errors in the noisy side information is upper bounded by a known constant. This communication problem, which we refer to as broadcasting with noisy side information (BNSI), has applications in the re-transmission phase of downlink networks. We derive a necessary and sufficient condition for a linear coding scheme to satisfy the demands of all the receivers in a given BNSI network, and show that syndrome decoding can be used at the receivers to decode the demanded messages from the received codeword and the available noisy side information. We represent BNSI problems as bipartite graphs, and using this representation, classify the family of problems where linear coding provides bandwidth savings compared to uncoded transmission. We also provide a simple algorithm to determine if a given BNSI network belongs to this family of problems, i.e., to identify if linear coding provides an advantage over uncoded transmission for the given BNSI problem.
Applications of multicast technology in space information network are increasing year by year. Due to the inherent characteristics of space information network, the existing multicast protocols are difficult to meet t...
详细信息
ISBN:
(纸本)9781509007295
Applications of multicast technology in space information network are increasing year by year. Due to the inherent characteristics of space information network, the existing multicast protocols are difficult to meet the high-quality service requirements and the need for reliability. A coding-aware and load balancing reliable multicast protocol in space information network is proposed. A coding-aware and load balancing routing metric is designed. This paper defines a load balancing factor to measure load status of the node and the Expected Transmission Time with coding to measure the coding gain. A new route metric ECTTL (Expected Transmission Time with coding and Load balancing) which combines the two factors is designed to select the high throughput path routes. It not only has the potential coding opportunity but is also able to prevent routing node overflows due to overload. In route establishment process, according to different business needs, it is preferable to use ECTTL metric to build multipath multicast tree and network coding method to encode the data for transmission. The coding-aware load balancing and reliable multicast protocol LCRM is simulated and analyzed in NS-2 simulation platform, The results showed that the design of coding-aware load balancing and reliable multicast protocol LCRM had good performance in reducing the end-to-end delay, routing overhead and improving the network throughput.
network coding (NC) and relay selection (RS) are two well-known techniques for achieving higher throughput and spectral efficiency in wireless networks. In this paper, we study a multiple-source, multiple-relay networ...
详细信息
network coding (NC) and relay selection (RS) are two well-known techniques for achieving higher throughput and spectral efficiency in wireless networks. In this paper, we study a multiple-source, multiple-relay network-coded cooperative (NCC) system. We propose a new smart decode-and-forward (DF) relay selection scheme which considers the source-destination links' outage status for relay selection. Assuming that the number of selected relays is less than the number of the sources, the selected relays will need to use linear network coding to combine their received information. To do this, the network coding coefficients have drawn from a generator matrix of a systematic maximum distance separable (MDS) code. Our analytical and simulation results indicate that the proposed scheme outperforms the conventional max-min relay selection schemes in terms of the outage probability (OP) and throughput.
Efficient designs for intra-session network coding based practical applications largely rely on a better understanding on its queueing behaviors. However, few work devote on this topics. In this paper, we build a mult...
详细信息
Device-to-device (D2D) communication has been introduced as a promising technology for the 5th generation (5G) of cellular networks. It has been defined as a connection between two user equipments (UEs) without traver...
详细信息
Device-to-device (D2D) communication has been introduced as a promising technology for the 5th generation (5G) of cellular networks. It has been defined as a connection between two user equipments (UEs) without traversing the base station. In this paper, a heterogeneous macro-femtocell network is considered with the presence of D2D UEs. It has been shown that network coding in cooperative communication can enhance the quality of service (QoS) in wireless communications. In this paper, we consider the random linear network coding (RLNC) in cooperative D2D communication, where relay nodes are selected from the set of femtocell base stations (FBSs). Since energy efficiency is an important issue in wireless communications, our aim is to select efficient relay node that maximizes the energy efficiency of network-coded D2D communication by taking the minimum data rate constraint into account. Simulation results demonstrate that RLNC achieves the better efficiency in comparison with direct D2D.
In most of the network coding problems with k messages, the existence of binary network coding solution over 2depends on the existence of adequate sets of k-dimensional binary vectors such that each set comprises of l...
详细信息
Stereoscopic image quality assessment (SIQA) has encountered non-trivial challenges due to the fast proliferation of 3D contents. In the past years, deep learning oriented SIQA methods have emerged and achieved specta...
详细信息
We propose an innovative framework to improve communication reliability of IoT sensory traffic, when the network is subject to congestion. The proposed architecture is based on information dispersion and relies on the...
详细信息
ISBN:
(数字)9781728146010
ISBN:
(纸本)9781728146027
We propose an innovative framework to improve communication reliability of IoT sensory traffic, when the network is subject to congestion. The proposed architecture is based on information dispersion and relies on the fact that congestion occurs in space-and time-differing parts of the network. Our approach uses encoding and spreading of data flows across various parts of the network, while ensuring that the original data could be recovered at the destination with sufficient accuracy, even if only parts of the encoded data survive the congestion losses. The encoding is based on spatial use of erasure coding, while the recovery is based on Dictionary-based Compressed Sensing. We term this approach Congestion-Tolerant Framework. Our work is specifically targeted at the paradigm of IoT that promises to provide wide-area sensory connectivity to devices on a massive scale, interconnecting billions of such devices. Our framework is applicable to both, real-time and non-real-time IoT networking paradigms.
In contrast to the network coding problem wherein the sinks in a network demand subsets of the source messages, in a network computation problem the sinks demand functions of the source messages. Similarly, in the fun...
详细信息
ISBN:
(纸本)9781509010905
In contrast to the network coding problem wherein the sinks in a network demand subsets of the source messages, in a network computation problem the sinks demand functions of the source messages. Similarly, in the functional index coding problem, the side information and demands of the clients include disjoint sets of functions of the information messages held by the transmitter instead of disjoint subsets of the messages, as is the case in the conventional index coding problem. It is known that any network coding problem can be transformed into an index coding problem and vice versa. In this work, we establish a similar relationship between network computation problems and a class of functional index coding problems, viz., those in which only the demands of the clients include functions of messages. We show that any network computation problem can be converted into a functional index coding problem wherein some clients demand functions of messages and vice versa. We prove that a solution for a network computation problem exists if and only if a functional index code (of a specific length determined by the network computation problem) for a suitably constructed functional index coding problem exists. Next we show that a functional index coding problem admits a solution of a specified length if and only if a suitably constructed network computation problem admits a solution.
In this work, it is revealed that an acyclic multicast network that is scalar linearly solvable over Galois Field of two elements, GF(2), is solvable over all higher finite fields. An algorithm which, given a GF(2) so...
详细信息
ISBN:
(纸本)9781538647813
In this work, it is revealed that an acyclic multicast network that is scalar linearly solvable over Galois Field of two elements, GF(2), is solvable over all higher finite fields. An algorithm which, given a GF(2) solution for an acyclic multicast network, computes the solution over any arbitrary finite field is presented. The concept of multicast matroid is introduced in this paper. Gammoids and their base-orderability along with the regularity of a binary multicast matroid are used.
暂无评论