This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.
A Review Paper of an Encryption Scheme using
Network Coding
for Energy Optimization in MANET
Shruti Patel
Department of Computer Engineering
CGPIT, Bardoli
Bardoli, India
shrutipatel01@yahoo.com
Abstract— Mobile ad-hoc network is a collection of mobile nodes
which forms an instant network without fixed topology and can
be arranged dynamically. Energy saving and security are
important issue in MANET. Network coding technique is used to
reduce energy consumption by less transmissions in MANET. To
achieve a security, there are many encryption scheme are
available. Out of which p-coding technique is lightweight
encryption scheme which provides confidentiality. P-coding is to
let the source randomly permute the symbol of each packet. So
eavesdropper can’t obtain the meaningful information without
knowing the permutation encryption function and coding vector.
Index Terms— MANET, Security, Energy optimization,
Network coding, P-coding etc.
I. INTRODUCTION
Mobile ad-hoc network is a collection of mobile nodes
which forms an instant network without fixed topology and
can be arranged dynamically. Mobile nodes can communicate
with each other directly without use of any centralized
authority. It can easily collect emergency data in disastrous
area and perform communication in battle field [1]. There are
many issues of mobile ad-hoc network: To minimize energy
consumption, routing, security etc. To minimize energy
consumption and Security are major issues in mobile ad-hoc
network.
Network coding is a technique which is used to reduce the
energy consumption by less transmission [1]. It allows
intermediate node to mix incoming data flows [2]. So two or
more data are combined and transmitted to the neighbor node,
in order to reduce the energy consumption. Network coding is
performed using XOR operation on packet data.
For Ex, Alice and Bob wants to exchange the data via
router. Fig. 1. Shows the transmission of data without
network coding and fig. 2. Shows the transmission of data
with network coding.
Fig.1. Without Network Coding [3]
978-1-4673-9338-6/16/$31.00 2016
c IEEE
Fenil Khatiwala
Department of Computer Engineering
CGPIT, Bardoli
Bardoli, India
fenil.khatiwala@utu.ac.in
In without network coding, Alice sends data to router and
then router sends data to Bob. Only then Bob sends data to
router and then router sends it to Alice. So this requires 4
transmission.
Fig.2. Using Network Coding [3]
With network coding, Alice and Bob simultaneously sends
data to intended receiver. It requires only 3 transmission. So if
we considered that energy is not consumed by
encryption/decryption, then ¼ energy can be saved.
To provide a security in MANET, some or all of the
following security goal have to be achieved.
There are many security goal: Authentication, Integrity,
Confidentiality, Non-repudiation etc.
Confidentiality: Keep the information sent unreadable to
unauthorized users or nodes. One way to keep information
confidential is to encrypt the data [6].
Integrity: Ensure that the data has been not altered during
transmission. This service can be provided using cryptography
hash function along with some form of encryption [6].
Authentication: This service verifies the identity of node or a
user, and to be able to prevent impersonation. It can be
providing using encryption along with cryptographic hash
function, digital signature and certificates [6].
Non-repudiation: Ensure that parties can prove the
transmission or reception of information by another party [6].
There are many encryption scheme like DES (Data
Encryption Standard), 3DES (Triple DES), AES (Advanced
Encryption Standard), P-coding etc. used for provide a
confidentiality.
To achieve a security, MANET security solution also
needs to consume a low amount of energy.
The remainder of the paper has been organized as follows:
Section I describes Introduction of Mobile ad-hoc network.
1054
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.
Section II describes the Literature Survey of different
encryption techniques also it describes how network coding
technique is used to reduced energy consumption. Section III
describes the Comparative Analysis of different encryption
techniques. Section IV describes Conclusion of the work.
II. LITERATURE SURVEY
Security and minimizing energy consumption are two
major issue in mobile ad-hoc network. Security can be achieve
through many encryption scheme. Network coding is one of
technique to reduce energy consumption.
Network coding [8]:
To reduce energy consumption, network coding is one of
the technique.
How Network coding works
Network coding is performed using XOR operation.
Here, node A need to transmit their message a and b to both
nodes X and Y. Each node can deliver their own message to
its neighbor node.
Fig. 3. Shows how data is transmitted by traditional
technique and fig. 4. Shows how network coding works during
data transmission.
Fig.3. Without Network Coding [8]
Fig.4. Using Network Coding [8]
As fig. 3. says that in traditional routing, node D simply
receive the information and replicate the information which it
receives from the previous sender. In this case, node D
receives both message a and b simultaneously. Node D will
send out message a first and then message b. Thus, only node
1055
Y will have received both message, while node X has still only
message a at the end of a single arbitrary time unit.
As Fig. 4. Says that if we make use of network coding, we
give node D the capability to transmit a linear combination of
the message a and b via E to node X and Y. we also give
capability to decode the message by using the other message
which it already received. Thus, both nodes X and Y have
both messages at the end of a single arbitrary time unit.
DIFFERENT TYPES OF ENCRYPTION SCHEME
There are different techniques to provide Security:
x DES
x AES
x 3DES
x Homomorphic Encryption Function
x P-coding
A. DES (Data Encryption Standard) Algorithm [9]
It is a block cipher which encrypts 64 bit plain text at a
time and it uses 56 bit key. This was based on symmetric key
algorithm, in which the same key will be used for both
encryption and decryption. DES has 16 rounds, in which a
total of 16 processing steps are being applied on the input
plain text and it produce cipher text. First, 64 bit data is passed
through the initial permutation phase and then 16 rounds of
processing takes place and lastly, final permutation is carried
out on the input plain text which results in 64 bit cipher text.
The drawback of this algorithm is that it can be easily
prone to Brute Force Attack, in which the hacker attempts to
break the key by applying all possible combinations. In DES,
there are only 256 possible combinations which are quite easy
to crack. So DES is not so secure.
B. AES (Advanced Encryption Standard) [4][9]
AES (Advanced Encryption Standard) is a symmetric
block cipher. It uses variable key length of 128, 192 and 256
bits. If both the block length and key length are 128 bits, then
AES will perform 9 processing rounds. If the block and key
are of 192 bits, then AES performs 11 processing rounds. If
the block and key are of length 256 bits then it performs 13
processing rounds.
Each processing round involves four steps:
Substitute bytes: Uses an S-box to perform a byte by byte
substitution of the block.
Shift rows: A simple permutation.
Mix column: A substitution method where data in each
column from the shift row step is multiplied by the algorithms
matrix.
Add round key: The key for the processing round is XOR
with the data.
AES encryption is fast and flexible; it can be implemented
on various platforms. The key length is variable which sense
the processing speed and memory usage is variable in different
environment, due to flexible key length, it could be used in
both higher secure and for less secure environments
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.
In this scheme, message contents are encrypted using the
Advanced Encryption Standard (AES) algorithm. This scheme
is used for providing confidentiality. By this scheme, security
can be increased but encryption/decryption time is more. So
more CPU time is used which is reflecting the energy
consumption. This scheme has computation overhead.
C. 3DES (Triple DES) [9]
3DES (Triple DES) is an enhancement of DES. It is 64 bit
block size with 112 bit or 168 bit key size. It is similar to the
one in the original DES but applied 3 times to increase the
encryption level and the average safe time. 3DES is slower
than other block cipher methods.
In this scheme, message contents are encrypted using the
3DES algorithm. This scheme is used for providing
confidentiality. By this scheme, security can be increased but
encryption/decryption time is more. So more CPU time is used
which is reflecting the energy consumption. This scheme has
computation overhead.
D. HEFs (Homomorphic Encryption Functions) [5]
This scheme is used for encrypt the coding vector for
privacy preserving and provide message content
confidentiality. Random linear network-coding (RLNC) could
be performed directly on the encrypted coding vectors due to
the homomorphism of HEFs. HEF operation is expensive. So
this approach is computational heavyweight and not scalable.
E. P-coding [1][2]
P-coding scheme is to perform permutation encryption on
coded message. P-coding scheme is consist of three stages: 1)
Source Encoding, 2) Intermediate recoding and 3) Sink
decoding. Fig. 1. shows the operation of p-coding.
Source Encoding:
In source encoding, consider source has h message to be
send. First, it prefixes these h message with their
corresponding unit vectors, then the source performs linear
combination on these message with randomly chosen LEVs
(Local Encoding Vectors) and get the coded messages.
Finally, the source performs permutation Encryption to get the
cipher text.
Intermediate Recoding:
In intermediate recoding, intermediate node have no
knowledge of PEF (Permutation Encryption Function) key. So
it cannot reconstruct source message. It perform recoding on
encrypted message.
Sink Decoding:
In sink decoding, sink decodes message by performing
permutation decryption. Sink derives the matrix and finally
performs Gaussian elimination on matrix to recover source
message.
1056
Fig.5. Permutation encryption [7]
P-Coding offers the following features: 1) Security: P-
Coding is computationally difficult for a global eavesdropper
to recover any meaningful information 2) Efficiency: Because
of the lightweight nature of permutation encryption, p-coding
is quite efficient to be carried out, which is of special benefit
for resource-constraint systems, such as wireless sensor
networks or MANET. 3) Transparency: P-Coding is
transparent to intermediate coding processes due to the
exchangeability of permutation encryption and symbol- level
linear combination. 4) Scalability: With the increase of
intermediate nodes, the performance of P-Coding does not
degrade [2].
P-coding is efficient in computation and requires minimum
energy for encryption decryption operation.
Enhanced P-coding scheme [1][2]
P-coding scheme is sufficient for small amount of data. If
the large volume of data D need to transmit, then first the
source should divide the data D into generation. If the same
PEF key is used during the whole transmission, single
generation failure may occur, in which accidental key
disclosure in one generation will compromise the secrecy of
the following transmission. This problem can be solved by
randomly perturbing the key used in each generation.
III. COMPARATIVE ANALYSIS
Table 1. Shows the comparative analysis of using network
coding vs. without network coding. If we use network coding
in MANET, then we can achieve less transmission time, less
energy consumption, high throughput, less packet losses.
There are different techniques to provide Security:
x P-coding
x AES
x 3DES
x Homomorphic Encryption Function
Table. 2. Shows the comparison between different types of
encryption scheme. All these techniques provide
confidentiality.
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.

TABLE 1. COMPARATIVE ANALYSIS OF USING NETWORK x 3DES

CODING VS. WITHOUT NETWORK CODING
x Homomorphic Encryption Function
Parameter Using Network Without Network
coding coding Table. 2. Shows the comparison between different types of
encryption scheme. All these techniques provide
Transmission Less More confidentiality.
Time[2] P-coding techniques has no computation overhead, no
space overhead and it is scalable. It takes less encryption time
Energy Less More than all this techniques. It incurs less per byte energy
consumption[2] consumption and gives high throughput.
AES has computation overhead. It takes more encryption
Throughput[4] High Less time than p-coding. It incurs more per byte energy
consumption and gives less throughput than p- coding.
Packet losses[11] less More HEF has computation overhead. It is expensive to
computation and not scalable.
Security[1][2] Yes No 3DES has computation overhead. It takes more encryption
time than AES and p-coding. It gives less throughput than
AES & p-coding.
There are different techniques to provide Security:

x P-coding
x AES
TABLE II. COMPARATIVE ANALYSIS OF ENCRYPTION SCHEME

Encryption scheme P-coding[1][2][4] AES[1][2][4] Homomorphic Encryption 3DES[1][2]

Function[2][5]

Confidentiality Yes Yes Yes Yes

Computational overhead ≈0 O(h.l) O(h3logn) Yes

Space Overhead None None None None

Encryption time 1/3 AES More than p- - More than AES

coding and P-coding

Per byte Energy 0.25μJ[1] 0.8μJ[1] - More than AES

consumption and P-coding

Throughput More than AES Less than p- - Less than AES

&3DES coding & P-coding

IV. CONCLUSION
This paper shows how security can be achieved as well
as energy consumption can be reduced. Also the comparison
of different types of encryption scheme is shown. Network
coding technique can reduce energy consumption by less
transmission and also achieve some security and high
throughput. P-coding is efficient in computation and incurs
less energy consumption for encryption-decryption and it
provides confidentiality.
ACKNOWLEDGEMENT
I thanks to Mr. Fenil Khatiwala, Asst. prof., CE & IT
Dept., CGPIT, Bardoli for their suggestion and for his
encouragement.
REFERENCES
[1] Zhang, Peng, Chuang Lin, Yixin Jiang, Yanfei Fan, and Xuemin Shen.
"A Lightweight Encryption Scheme for Network-Coded Mobile Ad

1057
 This full-text paper was peer-reviewed and accepted to be presented at the IEEE WiSPNET 2016 conference.
Hoc Networks." Parallel and Distributed Systems, IEEE Transactions
on 25, no. 9 (2014): 2211-2221.
[2] Zhang, Peng, Yixin Jiang, Chuang Lin, Yanfei Fan, and Xuemin Shen.
"P-coding: secure network coding against eavesdropping attacks."
InINFOCOM, 2010 Proceedings IEEE, pp. 1-9. IEEE, 2010.
[3] Pallavi s., Santhosh G., “Enhanced P - Coding: An Energy Saving
Encryption scheme for Mobile Ad – hoc Networks,” International
Journal of Advance Research in Science and Engineering IJARSE,
Vol. No. 3, Issue No. 6, June 2014.
[4] Madhavan, P., J. Nandhini, N. Nandhini, and P. Malathi. "Energy
Optimization in MANET using Modified P-Coding scheme,"
International Journal of Science, Engineering and Technology
Research, Vol. 3, Issue 4, April 2014.
[5] Fan, Yanfei, Yixin Jiang, Haojin Zhu, and Xuemin Sherman Shen. "An
efficient privacy-preserving scheme against traffic analysis attacks in
network coding." In INFOCOM 2009, IEEE, pp. 2213-2221. IEEE,
2009.
1058
[6] Bhosle, Amol, and Yogadhar Pandey. "Applying Security to Data
Using Symmetric Encryption in MANET." International Journal of
Emerging Technology and Advanced Engineering 3, no. 1 (2013).
[7] Sonali Kulkarni, M. S. Chaudhari, “ An Energy Efficient Encryption
scheme for Secure transmissions in Mobile Ad-hoc Networks,”
International journal of Advanced Research in Computer Science and
Software Engineering, Vol. 4, Issue 9, September 2014.
[8] Ahlswede, Rudolf, Ning Cai, Shuo-Yen Robert Li, and Raymond W.
Yeung. "Network information flow." Information Theory, IEEE
Transactions on 46, no. 4 (2000): 1204-1216.
[9] Mohsin Khan, Sadaf Hussain, Malik Imran, “Performance Evaluation
of Symmetric Cryptography Algorithms: A Survey,” International
Journal of Information technology and Electrical Engineering,
Vol. No. 2, Issue No. 2, April 2013.
[10] Priyanka Sogani, Aman Jain, “A Survey on Security Issues in
Mobile Ad - hoc Networks,” International Journal of Innovations &
Advancement in Computer Science, Vol. 4, March 2015.