Low-density parity check

decoding based scheme

against pollution attack to
linear network coding
Base paper details
 Comment on “A Tag Encoding Scheme Against Pollution Attack to Linear
Network Coding”

 Published in: IEEE Transactions on Parallel and Distributed Systems ( Volume:

31, Issue: 11, Nov. 1 2020)

 Date of Publication: 02 June 2020

Abstract
The pollution attacks are amplified by the network coding process, resulting in a greater damage than
under traditional routing. However, it increases the propagation speed of polluted data packets if a
malicious node injects fake data packets into the network, which degrades the bandwidth efficiency
greatly and leads to incorrect decoding at sinks. NETWORK PACKET WITH PARCTICULAR
DISTANCE AND RADIANCE ARE ENCRYPTED AFTER ENCRYPTION RECIEVER PATH
THROUGH WHICH THEY RECEIVE THE PACKETS ARE DESCRIBED AND RECIEVER
AFTER GETTING THE FILE CAN DECODE THE PACKET USING OTP GENERATED WHICH
IS POPPED UP AT THAT TIME FOR ADMIN
 Existing method
In this paper, insights on new mathematical relations in linear network coding are presented and a
key predistribution-based tag encoding scheme KEPTE is proposed, which enables all intermediate
nodes and sinks to detect the correctness of the received data packets. Furthermore, the security of
KEPTE with regard to pollution attack and tag pollution attack is quantitatively analyzed. The
performance of KEPTE is competitive in terms of: 1) low computational complexity; 2) the ability
that all intermediate nodes and sinks detect pollution attack; 3) the ability that all intermediate
nodes and sinks detect tag pollution attack; and 4) high fault-tolerance ability. To the best of our
knowledge, the existing key predistribution-based schemes aiming at pollution detection can only
achieve at most three points as described above. Finally, discussions on the application of KEPTE
to practical network coding are also presented.
 Proposed method
The main purpose of this paper is to develop schemes that can combat network pollution and malicious
attacks from the network nodes based on error-control coding in multihop networks. We propose a new
scheme that combines error-detection and error-correcting (EDEC) to combat network pollution attacks.
In our scheme, the original message symbol is first encoded using an error-control code before encoded
by network coding and transmitted. The application of error-control code gives intermediate nodes the
capability to detect possible errors or pollution of the message. Unlike the existing schemes, when an
intermediate node detects an error, the packet will continue to be forwarded. As long as the errors are
correctable, the sink nodes will be able to recover the corrupted packets and decode the original packet
symbols. Then we further extend the EDEC scheme and propose LDPC based EDEC (LEDEC) scheme.
In the LEDEC scheme we treat the packets as LDPC codewords at the sink nodes and use the belief
propagation algorithm (BPA) to decode the LDPC code. It can guarantee a certain network throughput
even for a heavily polluted network environment, while the throughput becomes very low for error-
detection based schemes
The major contributions of this paper are the
following:
(i)We propose an EDEC scheme by combining a modified error-control code and network coding. The
proposed EDEC scheme can increase the throughput for network environment with pollution attacks
compared to existing error-detection based schemes.

(ii)We propose the LEDEC scheme by augmenting the EDEC scheme with the LDPC decoding. The
proposed LEDEC can further improve the throughput even for network environment with heavy pollution.

(iii)We conduct extensive simulations to evaluate the performance of the proposed schemes and
demonstrate the advantage of the proposed schemes.

Terms

error-detection and error-correction (EDEC)

low-density parity check (LDPC) decoding based EDEC (LEDEC)

 BLOCK DIAGRAM

The encoding process of modified error-control code in EDEC scheme.

The decoding process of modified error-control code in EDEC scheme.

Main idea of the LEDEC scheme