2021
DOI: 10.1002/ett.4224
|View full text |Cite
|
Sign up to set email alerts
|

CTrust‐RPL: A control layer‐based trust mechanism for supporting secure routing in routing protocol for low power and lossy networks‐based Internet of Things applications

Abstract: Internet of Things (IoT) fostered a new epoch of innovation by interconnecting digital devices to make human life more convenient and attractive. These smart objects are largely deployed as low power and lossy networks (LLNs) and use routing protocol for LLNs (RPL) for routing. Unfortunately, it is extremely vulnerable to a large variety of external and internal attacks to cause devastating and calamitous effects. However, this article's scope revolves around internal attacks only, where nodes are already part… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 31 publications
(14 citation statements)
references
References 50 publications
(52 reference statements)
0
14
0
Order By: Relevance
“…The topology finder module finds the topology and nodes of the underlying device layer (Figure 2). It creates destination-oriented directed acyclic graphs (DODAGs) based on an objective function (OF), for instance, delay, energy used, or hop count [34]. Generally, each RPL instance has an optimization goal that depends on the application goal.…”
Section: Topology Finder Modulementioning
confidence: 99%
“…The topology finder module finds the topology and nodes of the underlying device layer (Figure 2). It creates destination-oriented directed acyclic graphs (DODAGs) based on an objective function (OF), for instance, delay, energy used, or hop count [34]. Generally, each RPL instance has an optimization goal that depends on the application goal.…”
Section: Topology Finder Modulementioning
confidence: 99%
“…Laplacian matrix L , is diagonalized by the eigenvector matrix 𝒳 = [𝜒 0 , ⋯ , 𝜒 𝑁−1 ]so that ℒ = 𝒳Λ𝒳 𝑇 , where is the diagonal eigenvalue matrix. ℒ = 𝐼 𝑁 − 𝐷 −1/2 𝒻𝐷 −1/2 is a normalised version [1,1]. Instead of complex exponentials, the eigenvectors {𝜒 ℓ } /=0 𝑁−1 of the Laplacian matrix L that meet the orthogonality criterion are employed as decomposition bases for graphstructured data.…”
Section: Algorithm 1: Construction Of Gridmentioning
confidence: 99%
“…which {𝜃 𝑘 } 𝑘=0 𝐾 is the polynomial order, and Ki is a vector of polynomial coefficients. K is is a normalised version [1,1]. Instead of complex exponentials, the eigenvectors {χ } N−1 /=0 of the Laplacian matrix L that meet the orthogonality criterion are employed as decomposition bases for graphstructured data.…”
Section: Algorithm 1: Construction Of Gridmentioning
confidence: 99%
See 1 more Smart Citation
“…In [10], the authors propose a lightweight heartbeat protocol, in which the root node detects the malicious node by periodically exchanging an echo signal with all its children nodes. In [29], authors introduce a control layer to achieve the hierarchical trust-based mechanism "CTrust-RPL" to monitor the nodes' behaviors. These centralized detection mechanisms are often energy-efficient since only a limited number of nodes are involved for behavior monitoring.…”
Section: B Rpl Network Defensesmentioning
confidence: 99%