Dynamic router selection and encryption for data secure in Wireless Sensor Networks

Rohini, G.

doi:10.1109/icices.2013.6508249

Cited by 3 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…https://www.indjst.org/ According to Figure 5 and Figure 6, the proposed lightweight key generation method required minimum time and energy for data encryption and decryption. It shows almost 20.50% lower energy consumption than other encryption mechanisms such as (10,12) .…”

Section: Resultsmentioning

confidence: 95%

“…Standard and Rivest Shamir Adleman algorithm: (10) 1 to 10 23 64 Tropea M. (12) 1 to 12 25 and 46 64 and 128 Anurag Yadav (11) 1 to 8 21 and 39 64 and 128 Zhou L. (9) 1 to 5 9 and 17 32 and 64 Lightweight (proposed) 1 to 5, 10 8, 13 and 34 32,64 and 128…”

Section: Resultsmentioning

confidence: 99%

“…This table demonstrates proposed system required minimum time for key generation using all 32-, 64-and 128-bit encryption methods. It also requires minimum time compare to other key generation techniques such as (9)(10)(11)(12)(13)(14)(15)(16)(17)(18) .…”

Section: Resultsmentioning

confidence: 99%

“…https://www.indjst.org/ In (10) , created a system to produce randomly chosen multi path routes. The "shares" of various packets follow distinct routes under this arrangement, which changes over time.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Lightweight Cryptography Using Pairwise Key Generation and Malicious Node Detection in Large Wireless Sensor Network

Sall,

Bansode

2023

IJST

View full text Add to dashboard Cite

Objectives: To design and develop pairwise key generation techniques for malicious node detection in wireless sensor network. Method: The lightweight key generation method has been used for data encryption with the collaboration of the sender node, entry node and destination. The unique identity of the destination server has utilized for data encryption and decryption as a master key. The proposed method generates a concise key length that reduces encryption and decryption time. It also helps to detect the misbehaviour of internal nodes when it takes higher time for data decryption and transmission. Findings: The proposed system reduces end to end delay around 10%, the packet delivery ratio improves by 3.30%, throughput by 9.87, and energy consumption by 20.50% than Advanced Encryption Standard and Rivest Shamir Adleman algorithm. The proposed encryption algorithm compresses the cypher data, reducing the network overhead, and detecting malicious nodes, providing higher security from internal and external intruders. This simulation obtains better results than existing systems that enhance around 7-9% throughput with all QoS parameters. Novelty: The proposed system eliminates network overhead of key transmission to the destination. Using this approach, the sender node generates a lightweight key for data encryption using the destination node, which means only the destination node can decrypt the data using the generation of similar keys. When any random node tries to generate such keys, it violates time-bound, and system detects as a malicious node.

show abstract

Section: Resultsmentioning

confidence: 95%