DOI: XXXXXXXXXXXXXXXXX ISSNp: 2488-9229; ISSNe: 3027-1118

IJSGS FUGUSAU VOL10 (2) WEBSITE: https://fugus-ijsgs.com.ng

INTERNATIONAL JOURNAL OF SCIENCE FOR GLOBAL SUSTAINABILITY
(A publication of Faculty of Science, Federal University Gusau)

A New Lightweight Cryptographic Cipher for Detection and

Prevention of Replay Attacks in Wireless Sensor Networks
*1
Ibrahim Abubakar, 2Muhammad Sani, 3Yusuf Surajo
*1
Computer Science Department, Federal University, Gusau, Nigeria
2
Department of Statistics, Federal University Dutsin-ma, Katsina, Nigeria.
3
Computer Science Department, Federal University Dutsin-ma, Katsina, Nigeria

Corresponding Author’s Email: [email protected]

Received on: April, 2024 Revised and Accepted on: May, 2024 Published on: July, 2024
ABSTRACT
Security concerns have been brought up by the electronics industry's widespread use of ubiquitous gadgets. The
limitations of power consumption, space, and speed make it impractical to construct a full-fledged cryptographic
environment using traditional encryption techniques in embedded systems like the Internet of Things. Lightweight
cryptography is the main focus in order to get over these obstacles. This study proposes a new lightweight
cryptography cipher that modifies the original PRESENT cipher by introducing a new layer between the S-box
layer and P-layer of the current encryption-decryption process, lowering the encryption round, and changing the
Key Register updating technique. The delta value function of the lightweight cipher known as the Modified Tiny
Encryption Algorithm (MTEA) is added to the key register to update its encryption value. By adding an additional
layer, we are able to lower the PRESENT round from 31 to 25, which is the bare requirement for security.
Encrypting the key register increases the suggested algorithm's efficiency. By using MATLAB2022a and
SIMULINK2022a are product of math work, widely used for mathematical computing algorithm development,
data analysis, visualization and simulation.
Keywords: New lightweight cryptography cipher, NLCC Security, MTEA, LSA.
1. INTRODUCTION quality. WSN integration with the Internet has received
These days, the popularity of wireless sensor networks a lot of attention lately (Gubbi et al, 2013). WSNs are
(WSNs) and their many application fields is growing vulnerable to a variety of attack types that target
due to their low cost, flexibility, ease of deployment, various network levels. Due to various limitations
and capacity for self-organization (Rawat et al., 2014). (such as haphazard deployment in unmonitored areas)
In a wireless sensor network (WSN), sensor nodes and restrictions on energy, computing, and storage
gather relevant environmental data (such as: resources, adopting strong and intricate security
temperature, humidity, and image quality) and send measures is extremely difficult when it comes to sensor
messages to the base station (BS) via wireless and network security (Saleem et al, 2023).
multi-hop communications. As seen in figure 1, the BS
is a downstream of all data originating from the sensor One of the most damaging attacks known to target the
nodes. originality attribute of network messages is the replay
(man-in-the-middle) technique. Typically, the attacker
only replays the application data and signalling
information many times, which can result in missing or
erroneous alarms depending on how the message is
repeated. In fact, the attacker might be more cunning
and replay the message's data field alone. In wireless
sensor networks, where sensed data is frequently
sensitive and must be unique, as shown in Figure 1, this
novel repeat attack scenario is far riskier.

Figure 1: WSN Architecture

In many applications, including healthcare systems,

intelligent agriculture, battlefield monitoring, home
and industrial automation, and real-time reporting and
response, WSN offer significant benefits. These
applications result in significantly higher service Figure 2: Replay Attack
 DOI: XXXXXXXXXXXXXXXXX ISSNp: 2488-9229; ISSNe: 3027-1118

IJSGS FUGUSAU VOL10 (2) WEBSITE: https://fugus-ijsgs.com.ng

of power and is susceptible to other attacks, according
A number of studies, have been carried out to prevent to the data.
replay attacks in WSNs. In general, the cryptographic
solutions are the emphasis of these publications. It is A lightweight hybrid cryptographic system for WSNs
appropriate to use cryptographic techniques to improve called the Modified Playfair Cypher (AMPC) and AES
WSN security (Jha et al, 2019; Khair et al, 2016). It were proposed by Anwar and Maha (Anwar and Maha,
would be challenging to implement fully functional 2020). It was suggested that AMPC improve WSN
cryptographic algorithms in sensor nodes due to security by using two cryptographic algorithms,
limitations in computing time, resource efficiency, modified PlayFair and AES, for data security and the
energy consumption, and security. This dissertation first method, Diffie-Hellman, to secure the key
proposes a new lightweight cryptographic cypher to exchange process. Despite increased protection, there
address the aforementioned issues. It does this by was a noticeable increase in power consumption.
reducing the encryption round, altering the Key However, because LSA uses a finite number of rounds
Register updating technique, and adding a new layer and each round uses a unique key to ensure security,
between the S-box layer and P-layer of the current the suggested algorithm will use less power when
encryption decryption process. The modified transmitting data.
lightweight PRESENT cypher was proposed by
Chatterjee and Chakrabort in 2020. In order to properly Additionally, a modified lightweight PRESENT
identify and avoid replay attacks in WSN, the new cypher was proposed by Chatterjee and Chakrabort
proposed cipher will use Modified TEA (MTEA) (2020). This cypher differs from the original
(Leon et al, 2019), as opposed to the Modified PRESENT cypher (Bogdanov et al, 2007) in that it
PRESENT cypher, which uses the TEA algorithm for adds a new layer between the S-box layer and P-layer
updating the key register. of the current encryption decryption process, reduces
the encryption round, and modifies the Key Register
2. RELATED WORKS updating technique. The Tiny Encryption Algorithm,
Numerous studies have been carried out on or TEA, cypher is used to update the key register. The
cryptographic methods to safeguard users' data during PRESENT round is lowered from 31 to 25 in the
the wireless sensor network (WSN) data transfer modified PRESENT technique to increase processing
process. (Tripathy et al, 2021) introduced the Hybrid power and enhance performance. The suggested
Encryption Technique (HET), a novel method that algorithm demonstrates its advantages over current
examines the attainment of data security in sensor lightweight cryptography methods. However,
networks using both two-key and single encryption. according to Adriaanse et al. (2021) TEA is vulnerable
The Elliptic Curve Cryptography (ECC) technique is a to equivalent key and related key attacks.
sophisticated encoding method that is used in the HET Additionally, a novel Lightweight Hybrid
approach to reduce the amount of the ciphertext. The Cryptography (LWHC) was constructed by Prakash et
Lempel-Ziv-Welch (LZW) compression technique is al. (2019). This LWHC combines the Speck compact
used to compress the data. The HET approach assures key scheduling technique with the PRESENT cypher
data security by protecting security primitives like and Lightweight Encryption Device (LED) cypher.
integrity, confidentiality, and authentication. The The PRESENT, RECTANGLE, and LED S-Boxes are
method uses very little power and takes very little time utilised to encrypt data. Using a 64-bit plain text as
for encryption and decryption. input, the method encrypts plain data and executes an
XOR operation with a 128-bit scheduling key. The
Additionally, (Sachin et al, 2020) combined symmetric LED encryption method uses the conventional key
and asymmetric algorithms to create a novel hybrid technique, which is vulnerable to key attacks; in
encoding method that offers excellent security with contrast, the LWHC makes use of the 128-bit key
less key management. Asymmetric and symmetric scheduling methodology, which makes it lightweight
cryptography techniques are combined in the newly and secure against various key-related attacks. This
proposed hybrid resilient encryption method. The updated method makes use of 128-bit keys that XOR
effective method for preventing clone node assaults on with the 64-bit plain-text block to guarantee
wireless sensor network communication that has been
suggested. The hybrid technique makes use of hash Yue et al, 2019 integrated the qualities of high
algorithms for Message Digest 5 (MD5) and encoding efficiency of symmetric encryption
sophisticated cryptography standards including Dual techniques and high encoding intensity of asymmetric
Rivest-Shamir-Adleman (RSA), Byte-oriented encryption techniques to propose a new hybrid
Substitution-Permutation Network (BSDN), and encryption algorithm based on wireless sensor
Advances Encryption Standard (AES). The technology networks after analysing the security vulnerabilities of
performs better than its competitors in terms of WSNs. Using the ECC asymmetric encryption
encryption and decryption time, but it consumes a lot technique and the AES symmetric encryption
algorithm, this technique first encodes the plaintext
 DOI: XXXXXXXXXXXXXXXXX ISSNp: 2488-9229; ISSNe: 3027-1118

IJSGS FUGUSAU VOL10 (2) WEBSITE: https://fugus-ijsgs.com.ng

blocks. It then uses data compression to obtain the
cypher blocks. Finally, it connects the Media Access Mahlake et al. (2022) developed a hybrid Lightweight
Control (MAC) address and the AES key encoded Security Algorithm (LSA) that combines the Secure
through ECC to form the complete ciphertext message. IoT (SIT) encryption technique with the Security
The technique can reduce the total running time Protocol for Sensor Networks (SPINS) to improve
complexity, decryption time, and encryption time WSN data security while lowering the attack threshold
without compromising security, as shown by the results and minimising power consumption in WSNs without
of its description and implementation. compromising network performance. The simulation
findings show that the suggested LSA technique
Additionally, the Hamming Residue Method (HRM) outperformed the widely used Feistel and Substitution-
was suggested by (Alotaibi, 2019) as a defence against Permutation Network (SPN) lightweight cryptography
hostile attacks on WSNs. Given the unreliability of the algorithms. Nevertheless, the SIT cryptographic
wireless network, the HRM was suggested as a means cypher will perform poorly in terms of execution time
of preventing unauthorised parties from jeopardising and memory usage. The aim of this research work is
the secrecy of the data. Hamming codes are used to to develop a new lightweight cryptographic cipher
identify and correct errors, therefore all which uses the modified PRESENT cipher and MTEA
communication systems are aware of these codes. algorithm so as to effectively detect and prevent replay
Since WSNs are self-sufficient and energy-efficient, attacks in WSN.
these codes can be employed to secure WSN networks
without requiring additional infrastructure. Although 3. NEWLIGHTWEIGHT CRYPTOGRAPHIC
the HRM approach increases the security of WSNs, it CIPHER (NLCC)
also consumes more power. Additionally, the A modified version of the PRESENT cypher (Thorat
computational complexity was overlooked, whereas and Inamdar, 2018), one of the most well-liked
the suggested hybrid solution will minimise power lightweight algorithms and one that is frequently
consumption and computational complexity by merely utilised in industries where the security of lightweight
employing devices has been taken into consideration, is included
in the proposed New Lightweight Cryptographic
The authors suggested a lightweight security technique Cypher. The NLCC cypher that has been suggested is
that relies on Proxy Mobile Internet Protocol version 6 less intricate and more effective than the PRESENT
(PMIPv6) (Anandhavalli and Bhuvaneswari, 2019). cypher in terms of detection precision, power usage,
The Diffie-Hellman authentication strategy that is data transfer rate, and overall latency. The proposed
integrated into the PMIPv6 protocol has been replaced technique requires an 80-bit key and 64-bit textual
with the suggested security authentication mechanism input. Additionally, 64-bit encrypted text is produced.
for WSNs. Consequently, a modified MAC address- Fig. 3.2 shows the suggested algorithm's general
based session key initialization protocol and a seed- structure. There are two components to the current
based random number session key mechanism are PRESENT cipher's change. These two components
presented and assessed. Power usage was minimal and increase the suggested algorithm's strength and
production was subpar despite the reasonable level of efficiency significantly.
protection.

Figure 4: Block diagram of NLCC key register updating

Figure 3: Block diagram of NLCC algorithm method
 DOI: XXXXXXXXXXXXXXXXX ISSNp: 2488-9229; ISSNe: 3027-1118

IJSGS FUGUSAU VOL10 (2) WEBSITE: https://fugus-ijsgs.com.ng

3.2 NLCC Extra Layer for Substitution-Box

Right rotate 32 bits left key
Additionally, an additional layer is inserted between
the S-Box layer and the Permutation Layer, altering the
PRESENT encryption procedure. The S-box output
4 4 4 4 4 4 4 4 1st was split into two 32-bit portions by the proposed
NLCC cypher. The 32-bit left and right keys will be
split into eight subkeys, each of which will be right-
2nd rotated eight times in the opposite scenario, as
4 4 4 4 4 4 4 4
illustrated in Fig. 3. Subsequently, the left half is
updated by XOR-ing the right component. Finally,
combine the two halves to create a new combination of
64 bits. The procedure of decryption is identical to that
4 4 4 4 4 4 4 4 7th of encryption; the rotation is done from left to right.
The block diagram for the new layer is shown in Figure
7. The completed outcome fed into the subsequent
Permutation layer. The two modifications increased the
4 4 4 4 4 4 4 4 8th efficacy of the NLCC. There are 25 rounds in the
Figure 5: New Key Scheduling NLCC.

3.1 NLCC Key Register Updating Method

The 64-bit round key (derived from the MSB position)
in the original PRESENT cypher method is taken out
of the 80-bit key register and applied to the XOR
operation with the plaintext. The key register is then
refreshed. This key register updating technique was
altered by the suggested NLCC algorithm. The steps
are detailed in Fig. 3.3. Initially, the 64-bit key that was
taken out of the key register split into two 32-bit keys.
Using a Delta value addition approach borrowed from
the lightweight cypher TEA, the right half key begins
at MSB and is encrypted (Shepherd, 2007).
Nonetheless, TEA is vulnerable to related key assaults
and equivalent key attacks. The NLCC algorithm
suggested changing the subkeys of TEA (ETEA) on
each round to increase security.

Figure 7: Block diagram of the new layer

Figure 6: Pseudo code of NLCC Key Register Updating

Algorithm

Fig. 8 presents the pseudocode of NLCC Stuffing Extra

Layer.
 DOI: XXXXXXXXXXXXXXXXX ISSNp: 2488-9229; ISSNe: 3027-1118

IJSGS FUGUSAU VOL10 (2) WEBSITE: https://fugus-ijsgs.com.ng

4. RESULT AND DISCUSSION

The simulation experiment was conducted to validate
the effectiveness of the NLCC algorithm. The Analysis
was conducted to compare the performance of the
proposed NLCC algorithm with the recently proposed
lightweight cryptographic ciphers Modified PRESENT
cipher (Chatterjee and Chakrabort, 2020) and LSA
cipher (Mahlake et al, 2022). Revealed that Modified
PRESENT and LSA ciphers perform better than
existing lightweight cryptographic ciphers for
detecting attacks in WSN, therefore in this work the
performance of NLCC is compared with that of
Modified PRESENT and LSA ciphers.
Figure 9: Energy Consumption across Sensor Nodes
The performance metrics used for the evaluation of the
proposed NLCC, Modified PRESENT and LSA
ciphers are: (1) Energy Consumption (EC), is the Table 1: Energy Consumption Comparison between
amount of energy required by sensor nodes to perform LSA, Modified PRESENT and NLCC
encryption, decryption, and replay attack detection Energy Consumption (PJ)
processes. (2) Execution Time (ET), represents the Number LSA Modified NLCC
time taken to complete the encryption, decryption, and of Sensor Present
replay attack detection processes. (3) Memory Usage nodes
(MU), is the amount of memory required by the sensor 10 12.02 10.45 8.23
nodes to store the encryption keys, intermediate values, 20 22.11 18.66 15.04
and any additional data structures needed for the 30 32.24 26.69 22.38
cryptographic operations. (4) Detection Rate (DR), 40 42.55 34.44 30.44
measures the effectiveness of the replay attack 50 52.63 42.12 37.14
detection mechanism. It is quantified by the rate of 60 61.02 49.09 44.88
correctly detected replay attacks versus false positives 70 71.17 57.21 50.36
and missed detections. During the simulation, the 80 80.09 64.65 56.70
results have been analyzed using 10, 20, 30, 40, 50, 60, 90 89.67 71.22 62.62
70, 80, 90, and 100 sensor nodes. 100 98.55 78.08 68.43
4.1 Energy Consumption (EC) Comparison of The LSA cipher, representing the baseline in this
NLCC, Modified Present And LSA
comparison, consumes the highest amount of energy.
The results presented in Figure 4.1 and Table 4.1,
This high energy consumption is due to less efficient
demonstrate a clear trend in energy consumption across
encryption processes and potentially higher
different sensor nodes for the NLCC, Modified
computational demands. The clear separation between
PRESENT, and LSA ciphers. As the number of sensor
the energy consumption curves of the proposed cipher
nodes increases from 10 to 100, all three ciphers exhibit
and the other two ciphers underscores the effectiveness
a rise in energy consumption. However, the rate of
of the modifications introduced by the NLCC
increase and the absolute values of energy
algorithm. The results suggest that NLCC cipher not
consumption vary significantly among the ciphers. The
only enhances security by preventing replay attacks but
NLCC cipher consistently shows the lowest energy
also significantly reduces energy consumption, which
consumption across all node values, indicating its
is critical in resource-constrained environments like
superior efficiency in terms of energy usage. This
Wireless Sensor Networks. These findings validate the
efficiency can be attributed to the optimized encryption
proposed cipher's potential for practical deployment in
rounds and the improved key register updating
WSNs, where energy efficiency and security are
technique introduced in the proposed algorithm. The
paramount.
modified PRESENT cipher, while better than the LSA
cipher, still consumes more energy than the proposed
5. EXECUTION TIME (ET) COMPARISON
cipher, highlighting the incremental but notable
OF NLCC, MODIFIED PRESENT AND LSA
improvements made by further modifications in the
The results presented in Figure 10 and Table 2,
proposed method.
illustrates the total execution time of three different
ciphers—NLCC Cipher, Modified PRESENT Cipher,
and LSA Cipher—across varying number of sensor
nodes ranging from 10 to 100. As the number of sensor
nodes increases, the total execution time for all ciphers
 DOI: XXXXXXXXXXXXXXXXX ISSNp: 2488-9229; ISSNe: 3027-1118

IJSGS FUGUSAU VOL10 (2) WEBSITE: https://fugus-ijsgs.com.ng

also increases. This is expected as more nodes require memory usage for all three ciphers shows an upward
more data processing, encryption, and communication trend, reflecting the increased computational and
overhead. storage demands associated with processing and
securing larger amounts of data.

Figure 10: Execution Time across Sensor Nodes

Table 2: Execution Time comparison between LSA,

Modified PRESENT and NLCC
Execution Time (ms) Figure 11: Memory Usage across Sensor Nodes
Number LSA Modified NLCC
of Sensor PRESENT Table 3: Memory Usage comparison between LSA,
nodes Modified PRESENT and NLCC
10 8.05 6.05 5.12 Memory Usage (KB)
20 16.24 12.33 10.08 Number LSA Modified NLCC
30 24.68 18.50 14.87 of Sensor PRESENT
40 32.66 24.42 21.04 nodes
50 40.05 30.82 25.43 10 39 34 30
60 48.10 36.60 29.98 20 68 58 55
70 56.13 42.12 35.33 30 102 89 82
80 64.77 48.90 41.08 40 141 121 101
90 72.78 54.44 45.16 50 177 150 124
100 80.61 60.25 50.06 60 223 176 148
70 255 209 175
The NLCC Cipher consistently shows the lowest 80 302 239 202
execution time among the three, demonstrating its 90 338 268 223
efficiency. For instance, at 100 sensor nodes, the 100 381 301 247
Proposed Cipher has an execution time of 50.06ms,
compared to 60.25ms for the Modified PRESENT The NLCC cipher demonstrates significantly better
Cipher and 80.61ms for the LSA Cipher. This superior performance in terms of memory efficiency compared
performance can be attributed to the optimization to the modified PRESENT and LSA ciphers. For
techniques such as reduced encryption rounds and instance, with 100 sensor nodes, the NLCC cipher uses
improved key register updating mechanism. The 247KB of memory, while the modified PRESENT
Modified PRESENT Cipher performs better than the cipher uses 301 KB, and the LSA cipher uses 381 KB.
LSA Cipher but not as well as the NLCC Cipher. The This reduction in memory usage is crucial for WSNs,
LSA Cipher shows the highest execution time, where nodes often have limited computational
indicating it is less efficient for larger networks. These resources. The NLCC cipher's lower memory footprint
results highlight the Proposed Cipher's advantage in can lead to longer operational lifetimes for sensor
scenarios where quick data encryption and nodes, more efficient data processing, and overall
transmission are crucial, making it highly suitable for enhanced network performance. This efficiency is
resource-constrained WSN environments. achieved through the optimization techniques
incorporated in the NLCC cipher, such as reduced
6. MEMORY USAGE (MU) COMPARISON encryption rounds and an improved key register
OF NLCC, MODIFIED PRESENT AND LSA updating mechanism.
The results presented in Figure 11 and Table 3, proves
the total memory usage across different numbers of V) DETECTION RATE (DR) COMPARISON OF
sensor nodes for three different ciphers: the NLCC NLCC, MODIFIED PRESENT AND LSA
cipher, the modified PRESENT cipher, and the LSA The results presented in Figure 12 and Table 4,
cipher. As the number of sensor nodes increases, the illustrates the detection rates of the NLCC cipher,
 DOI: XXXXXXXXXXXXXXXXX ISSNp: 2488-9229; ISSNe: 3027-1118

IJSGS FUGUSAU VOL10 (2) WEBSITE: https://fugus-ijsgs.com.ng

modified PRESENT cipher, and LSA cipher across
different numbers of sensor nodes. As shown in the 7. CONCLUSION
graph, the NLCC cipher consistently outperforms both A new lightweight cryptographic cipher for detection
the modified PRESENT cipher and the LSA cipher, and prevention of replay attacks in wireless sensor
demonstrating higher detection rates across all node networks has been modified. The proposed method
counts. This superior performance can be attributed to also includes a little bit idea taken from another
the enhanced encryption mechanisms, such as the lightweight cipher TEA. Software parameter analysis
modified key register updating technique and the using Cryptool proves the efficiency of the modified
additional layer between the S-box and P-layer, which PRESENT compare to the original PRESENT cipher
improve the cipher's ability to detect and prevent replay using MATLAB/Simulink R2022a. Histogram and
attacks. floating frequency test also produce an effective graph
for Modified PRESENT. The result of different test has
justified that proposed modified PRESENT enhance
the performance of original PRESENT method.

The performance metrics used for the evaluation of the

proposed NLCC, Modified PRESENT and LSA
ciphers are: (1) Energy Consumption (EC), is the
amount of energy required by sensor nodes to perform
encryption, decryption, and replay attack detection
processes. (2) Execution Time (ET), represents the
time taken to complete the encryption, decryption, and
replay attack detection processes. (3) Memory Usage
(MU), is the amount of memory required by the sensor
nodes to store the encryption keys, intermediate values,
and any additional data structures needed for the
cryptographic operations. (4) Detection Rate (DR),
measures the effectiveness of the replay attack
Figure 12: Detection Rate across Sensor Nodes detection mechanism. It is quantified by the rate of
correctly detected replay attacks versus false positives
Table 4: Detection Rate comparison between LSA, and missed detections. During the simulation, the
Modified PRESENT and NLCC results have been analyzed using: 10, 20, 30, 40, 50,
Detection Rate (%) 60, 70, 80, 90, and 100 sensor nodes.
Number LSA Modified NLCC
of Sensor PRESENT
nodes
10 0.782 0.872 0.950 REFERENCES
20 0.768 0.853 0.939 Ahmed Rami, Raniyah wazirali, Tarik Abu-Ain
30 0.752 0.837 0.932 (2021). presented a secure AODV mechanism for
40 0.734 0.829 0.921 detecting and preventing replay attacks in WSN
50 0.721 0.802 0.914 based on the plaintext and a hash function in their
60 0.702 0.790 0.905 work, "Secure AODV Protocol to Avoid Packet
70 0.699 0.786 0.897 Dropping and Replay Attack in WSNs."Int J Adv
80 0.688 0.772 0.883 Eng. sci inf Techno; 5(5):1-23
90 0.675 0.765 0.871 Amar, Abdelkrim, and Bouabdallah (2019) presented a
100 0.662 0.753 0.862 new secure AODV protocol in their work, "Secure
and Efficient AODV Protocol for Wireless Sensor
The detection rate of the NLCC cipher remains Networks." Their approach uses a new concept of a
significantly high, starting at 95% for 10 nodes and freshness factor combined with a dynamic secret
gradually decreasing to 86% for 100 nodes. In shared key to detect and prevent replay attacks.
comparison, the modified PRESENT cipher starts at International journal of pure and applied
87% and drops to 75%, while the LSA cipher begins at mathematics 119(10c), 231-236
78% and falls to 66%. This trend indicates that while Amin, M., Mumtaz, S., & Liaqat, S. (2023). Detection
all ciphers experience a slight decline in detection rates and prevention of replay attack in Wireless Sensor
as the number of nodes increases, the proposed cipher's Network: A secure approach using hybrid intelligent
advanced features provide a more robust and reliable system. Computers & Electrical Engineering, 86,
detection mechanism, making it a better choice for 106854.
securing wireless sensor networks against replay Badaran M Awad (2022). proposed a novel approach
attacks. for securing the AODV protocol against replay
 DOI: XXXXXXXXXXXXXXXXX ISSNp: 2488-9229; ISSNe: 3027-1118

IJSGS FUGUSAU VOL10 (2) WEBSITE: https://fugus-ijsgs.com.ng

attacks in their work, "A Secure and Efficient AODV
mechanism for Wireless Sensor Networks." Their Wang, L., & Zhang, H. (2023). "Secure AODV with
approach improves the security of AODV Delayed Occurrence Detection for Replay Attack
mechanism in WSN by incorporating a security Prevention in WSNs." International Journal of
token in the routing request messages to detect and Communication Networks and Information Security,
prevent replay attacks. International journal of 15(2).
omputing, 345-349 Wu, W., & Ye, D. (2022). A Secure Routing Scheme
Das, A., Nath, M., & Bandyopadhyay, S. (2023). A Against Flooding Attack in AODV. Journal of
Trust-Based Secure AODV Routing Protocol in Theoretical and Applied Information Technology,
MANET. International Journal of Computer 76(3), 481-487.
Applications, 102(14), 23-27. Xie Tongy (2018). presented a secure and efficient
Eshkabilov S. L. (2020). Practical MATLAB Modeling AODV protocol for WSN in their work, "A Secure
with Simulink. Apress Berkeley, CA. D. DOI: Ad Hoc On-Demand Distance Vector Routing
10.1007/978-1-4842-5799-9 Protocol for Wireless Sensor Networks." Jornal of
In the work "Securing AODV Routing Protocol for Advanced Research in computer and communication
Wireless Sensor Networks," Adib et al. proposed a engineering 5(3), 1089-1092
hybrid security approach for AODV that combines Zhong , H ,Wang(2023) secure AODV with Delayed
pre-distributed keys and digital signatures to detect occurrence detection for replay Attack prevention in
and prevent replay attacks. WSN” International journal of communication
Jelena, M., Milena, M., & Dejan, S. (2021). Enhancing Networks and information security, 15(2).
Security of the AODV Routing Protocol in Wireless Zhu, Shouhuai xu, Sanjeev setia (2019). presented a
Ad Hoc Networks. Computers & Electrical secure and energy-efficient routing mechanism in
Engineering, 68, 577-59 their work, "Secured and Energy-Efficient Routing
Karthikeyan, D., & Krishnan, G. (2021). Detection and for Wireless Sensor Network Based on AODV
prevention of adaptive replay attacks in AODV- Algorithm." Department of information and
based wireless sensor networks using residual computer science, university of California Irvine,
energy. Ad Hoc Networks, 63, 27-41. Irvine CA92697
Kaur N and Rattan. A critical review of intrusion
detection system in WSN: challenges and future
directions. AnnRomanion Soc Cell Biol
2021:25:3020-3028"
Kaur, S., & Singh, N. (2021). Improving Security of
AODV Routing Protocol in MANET. International
Journal of Advanced Research in Computer and
Communication Engineering, 5(3), 1089-1092.
Khalid et al. proposed an enhanced AODV protocol,
"Extended Efficient Secure AODV Protocol for
Wireless Sensor Networks" that uses a combined
approach of digital signature and symmetric
cryptography to preserve data confidentiality,
integrity, and availability, and prevent replay attacks.
Kha, Ahamad khaliq , Nazar .A.Sadiq.(2021) proposed
an enhanced secure version of AODV protocol, "E-
SecureAODV" in their work, which uses an
authentication mechanism based on shared secret
keys to detect and prevent replay attacks, ensure data
confidentiality, integrity, and authenticity.
International Journal of communication network, 63,
27-4.
Raghavendra, C. S., Prakash, E. N., & Agustiawan, W.
(2022). A secure method of detection and prevention
of replay attack in AODV routing protocol.
International Journal of Network Security, 14(3),
134-140.
Shamir, A., Bhende, C., & Bhargava, B. (2021).
Securing AODV Routing Protocol against Attacks.
International Journal of Computer Applications,
70(7), 7-13.