Traffic and Security using Randomized Dispersive Routes in Heterogeneous Sensor Network
P.Karunakaran, Dr.C.Venkatesh

TL;DR
This paper proposes a secure, scalable routing and key management scheme for heterogeneous sensor networks using randomized dispersive routes and elliptic curve cryptography to enhance security and efficiency.
Contribution
It introduces a novel key management scheme with neighbor-only shared keys and a randomized multipath routing mechanism for improved security and scalability in sensor networks.
Findings
Routes are highly dispersive and energy-efficient.
The scheme reduces communication overhead and enhances security.
It effectively bypasses malicious backholes at low energy cost.
Abstract
Generally traffic and the sensor network security have many challenges in the transmission of data in the network. The existing schemes consider homogeneous sensor networks which have poor performance and scalability. Due to many-to-one traffic pattern, sensors may communicate with small portion of its neighbours. Key management is the critical process in sensor nodes to secure the data. Most existing schemes establish shared keys for all the sensors no matter whether they are communicating or not. Hence it leads to large storage overhead. Another problem in sensor network is compromised node attack and denial of service attack which occurs because of its wireless nature. Existing multi path routing algorithms are vulnerable to these attacks. So once an adversary acquires the routing algorithm, it can compute the same routes known to the source, and hence endanger all information sent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Mobile Ad Hoc Networks
