2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications 2014
DOI: 10.1109/isdea.2014.103
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Hash Table Based Routing Algorithm for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…A new memory based approach called hash table has been considered to evaluate the security and performance of energy consumption in WSNs [25]. In this process, the individual node can be distributed over the entire internet and each node can be controlled using whole resource space and related index information.…”
Section: Hash Based Node Authentication Algorithmmentioning
confidence: 99%
“…A new memory based approach called hash table has been considered to evaluate the security and performance of energy consumption in WSNs [25]. In this process, the individual node can be distributed over the entire internet and each node can be controlled using whole resource space and related index information.…”
Section: Hash Based Node Authentication Algorithmmentioning
confidence: 99%
“…P2P need to have better structured overlay algorithm for P2P due to the increasing number of users in P2P network [3]. DHT is one of the distributed memory method where it distributes the contructions of hash table [4]. In DHT based system, identifier (Id) for each peer and item is generated using hash function.…”
Section: Introductionmentioning
confidence: 99%