The network coding could improve the wireless network transmission performance. The network nodes using the traditional full network coding have to wait the arrival of other data packets for coding, which increase the...
详细信息
The network coding usually suffers from pollution attacks. Two schemes against pollution attacks are discussed in this paper, based on linear space signature and information theory, respectively. Pollution attacks det...
详细信息
Generative Moment-Matching network (GMMN) is a deep generative model, which employs maximum mean discrepancy as the objective to learn model parameters. However, this model can only generate samples, failing to infer ...
详细信息
ISBN:
(纸本)9780999241127
Generative Moment-Matching network (GMMN) is a deep generative model, which employs maximum mean discrepancy as the objective to learn model parameters. However, this model can only generate samples, failing to infer the latent code from samples for downstream tasks. In this paper, we propose a novel Joint Generative Moment-Matching network (JGMMN), which learns the structural latent code for unsupervised inference. Specifically, JGMMN has a generation network for the generation task and an inference network for the inference task. We first reformulate this model as the two joint distributions matching problem. To solve this problem, we propose to use the Joint Maximum Mean Discrepancy (JMMD) as the objective to learn these two networks simultaneously. Furthermore, to enforce the consistency between the sample distribution and the inferred latent code distribution, we propose a novel multi-modal regularization to enforce this consistency. At last, extensive experiments on both synthetic and real-world datasets have verified the effectiveness and correctness of our proposed JGMMN.
The sharp increase in the video traffic and hand-held devices in the last decade warrant for new paradigms of applications including massive video multicasting, such as in the football stadiums, or concert halls where...
详细信息
ISBN:
(纸本)9781538647905
The sharp increase in the video traffic and hand-held devices in the last decade warrant for new paradigms of applications including massive video multicasting, such as in the football stadiums, or concert halls where multiple angles of the live feed could be multicasted to the users' smart phones or tablets. However, the current state-of-the-art cellular solution is simply individually unicast the video stream to each node, which is extremely resource-inefficient. In this demo, we show how we perform reliable massive video multicasting over standard LTE links by combining the principle of cooperative networking and Random Linear network coding. We offload the majority of the traffic from LTE onto Wifi multicasts, thus increasing the efficiency of the LTE channel usage by multiple orders of magnitude. This demo has been demonstrated at the Mobile World Congress 2017 as a part of Nokia's booth to demonstrate the 5G stadium experience.
The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and fo...
详细信息
This paper provides a high-level overview of the SHINE project, whose focus is the design and implementation of an end-to-end secure infrastructure for the delivery of collaborative multimedia services over integrated...
详细信息
ISBN:
(纸本)9781538647295
This paper provides a high-level overview of the SHINE project, whose focus is the design and implementation of an end-to-end secure infrastructure for the delivery of collaborative multimedia services over integrated satellite-terrestrial networks. The project extends to satellite-enabled scenarios the outstanding solutions available for terrestrial communication networks, while also designing innovative mechanisms for the protection from unauthorized access to content-related data, as well as for the secure distribution of real-time multimedia information across hybrid channels leveraging both the unicast and the multicast communication paradigm. The original contribution of the paper is the analysis of satellite architectures and configurations tailored to efficiently support the SHINE solution, together with the presentation of the testbed envisaged to proof the SHINE concept.
A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. ...
详细信息
A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to characterize multiplicative properties of subspaces, and yet no explicit constructions were given. In this paper, several constructions of Sidon spaces are provided. In particular, in some of the constructions the relation between k, the dimension of the Sidon space, and n, the dimension of the ambient extension field, is optimal. These constructions are shown to provide cyclic subspace codes, which are useful tools in network coding schemes. To the best of our knowledge, this constitutes the first set of constructions of non-trivial cyclic subspace codes in which the relation between k and n is polynomial, and in particular, linear. As a result, a conjecture by Trautmann et al. regarding the existence of non-trivial cyclic subspace codes is resolved for most parameters, and multi-orbit cyclic subspace codes are attained, whose cardinality is within a constant factor (close to 1/2) from the sphere-packing bound for subspace codes.
We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F, and serves K users each with a cach...
详细信息
ISBN:
(纸本)9781538631805
We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F, and serves K users each with a cache memory of MF bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N <= K and cache capacities satisfying 1/K <= M <= N/K. The proposed scheme outperforms the best rate-memory region known in the literature if N <= K <= N (2)+1/2.
Multi-hop communication with multiple sinks provides better data propagation in terms of network throughput, bandwidth and energy consumption in energy and computationally constraint wireless sensor network. In this p...
详细信息
ISBN:
(纸本)9781538656570
Multi-hop communication with multiple sinks provides better data propagation in terms of network throughput, bandwidth and energy consumption in energy and computationally constraint wireless sensor network. In this paper, we come up with the conceptualization of network coding scheme based transmission over a pre-defined minimum Wiener index spanning tree (MWST) based multi-hop routing access in a multiple sink scenario for energy constraint wireless sensor network. For effective data transmission between sensor nodes to sink node, we have proposed XOR based network coding Le. COPE. Contraiy to the previous methods in literature, we here deployed random sensor nodes over a pre-defined area. Each sensor node is connected with one and only one sink node depending on its Euclidian distance and number of hops between them and the same is implemented by nature inspired Particle Swarm Optimization (PSO) technique. Finally, the data transmission is enriched with the network coding approach for significant decrease in energy consumption and enhancement in network throughput gain.
This paper considers a network of source nodes that transmit data packets to a destination node via relay nodes over erasure channels by using random linear network coding. The probability that the destination node wi...
详细信息
This paper considers a network of source nodes that transmit data packets to a destination node via relay nodes over erasure channels by using random linear network coding. The probability that the destination node will fail to recover the packets of all source nodes has been bounded and approximated in the literature for the case of relay nodes that randomly assign only nonzero values to the coefficients of linear combinations of data packets. The paper argues for the necessity of giving relay nodes the choice to also assign the zero value to coefficients when arithmetic operations are over finite fields of small size, e.g. GF(2). Alternative probability mass functions for the coefficients are considered, and expressions for the decoding failure probability are re-derived.
暂无评论