Constructing a Linear Network Code for Multicast Networks Based on Hypergraphs

Privacy threat is a very serious issue in multi-hop wireless networks (MWNs) since open wireless channels are vulnerable to malicious attacks. A distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. Network coding has the potential to thwart traffic analysis attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the simple deployment of network coding cannot achieve the goal once enough packets are collected by the adversaries. This paper proposes non-binary joint network-channel coding for reliable communication in wireless networks. NB-JNCC seamlessly combines non-binary channel coding and random linear network coding, and uses an iterative two-tier coding scheme that we proposed to jointly exploit redundancy inside packets and across packets for error recovery.

Download Full-text

Determining the linear network code parameters to minimize the destructive factors influence in telecommunications systems and networks

Journal of Physics Conference Series ◽

10.1088/1742-6596/1889/3/032016 ◽

2021 ◽

Vol 1889 (3) ◽

pp. 032016

Author(s):

N V Britvin ◽

E O Karpukhin

Keyword(s):

Network Code ◽

Linear Network

Download Full-text

The Adaptive Network Coding-Routing (ANCR) Based on Graph Minors for Multicast Networks

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.781.36 ◽

2015 ◽

Vol 781 ◽

pp. 36-40 ◽

Cited By ~ 1

Author(s):

Nakhon Muangboonma ◽

Nattakan Puttarak ◽

Phisan Kaewprapha

Keyword(s):

Network Coding ◽

Network Topology ◽

Routing Protocol ◽

Relay Node ◽

Network Code ◽

Graph Minors ◽

Adaptive Network ◽

Limited Bandwidth ◽

Multicast Networks ◽

Throughput Gain

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 coding-routing (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 forward 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%.

Download Full-text

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks

Entropy ◽

10.3390/e22091053 ◽

2020 ◽

Vol 22 (9) ◽

pp. 1053

Author(s):

Masahito Hayashi ◽

Masaki Owari ◽

Go Kato ◽

Ning Cai

Keyword(s):

Information Leakage ◽

Network Code ◽

Reduction Theorem ◽

Linear Network ◽

Transmission Setting ◽

Active Attacks ◽

Multiple Transmission

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot increase the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrated the usefulness of this reduction theorem by applying a concrete example of network.

Download Full-text