scholarly journals Random routing scheme with misleading dead ends

Author(s):  
Chitra Rajarama ◽  
Jagadeesha Narasimhamurthy Sugatoor ◽  
Yerri Swamy T

A new method of sink location security in a Wireless Sensor Network is proposed. In the proposed scheme, all the node addresses are encrypted and an attacker cannot determine the real sink address by capturing the packets and analyzing its contents for the final destination. The main contribution of our proposed method is to use random routing scheme with misleading dead ends. This provides security against traffic analysis attack.

Author(s):  
Chitra Rajarama ◽  
Jagadeesha Narasimhamurthy Sugatoor ◽  
Yerri Swamy T

<span>A new method of sink location security in a Wireless Sensor Network is proposed. In the proposed scheme, all the node addresses are encrypted and an attacker cannot determine the real sink address by capturing the packets and analyzing its contents for the final destination. The main contribution of our proposed method is to use random routing scheme with misleading dead ends. This provides security against traffic analysis attack.</span>


Sensors ◽  
2018 ◽  
Vol 18 (3) ◽  
pp. 820 ◽  
Author(s):  
Alessandro Pozzebon ◽  
Irene Cappelli ◽  
Alessandro Mecocci ◽  
Duccio Bertoni ◽  
Giovanni Sarti ◽  
...  

2013 ◽  
Vol 798-799 ◽  
pp. 480-483
Author(s):  
Tao Ma ◽  
Juan Chen

The new method used the node to make up the keyword management tree. The keyword management tree was optimized with renewing the group keyword. In the meanwhile, the use of father nodes and the processing batch method improved the keyword renewing efficiency. The analysis result of theory shows that the method is a high efficiency and extendible group keyword management method which used in the heterogeneous wireless sensor network.


2015 ◽  
Vol 40 (3) ◽  
pp. 203-222 ◽  
Author(s):  
Sohini Roy

Abstract Wireless Sensor Network (WSN) has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS) aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC) algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC).


Sign in / Sign up

Export Citation Format

Share Document