2022
DOI: 10.3390/s22103906
|View full text |Cite
|
Sign up to set email alerts
|

DRiPLOF: An RPL Extension for Multi-Interface Wireless Sensor Networks in Interference-Prone Environments

Abstract: The Routing Protocol for Low-power and Lossy Networks (RPL) is a popular routing layer protocol for multi-hop Wireless Sensor Networks (WSNs). However, typical RPL configurations are based on decade-old assumptions, leading to a mismatch with: (1) advances in wireless hardware; and (2) growing wireless contention. To soften the impact of external stressors (i.e., jamming and interference), we extended RPL to exploit the capabilities of modern multi-interfaced wireless devices. More specifically, our main contr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
23
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(23 citation statements)
references
References 26 publications
0
23
0
Order By: Relevance
“…A RPL Objective Function (OF) dictates how these sets are formed. Reprinted from [27] with permission from the authors and selecting a preferred parent (from the parent set), the RPL node computes the rank it will thereafter advertise (in DIOs) towards nodes that may then become its children.…”
Section: The Routing Layer: Multi-modal Solutions and Challengesmentioning
confidence: 99%
See 4 more Smart Citations
“…A RPL Objective Function (OF) dictates how these sets are formed. Reprinted from [27] with permission from the authors and selecting a preferred parent (from the parent set), the RPL node computes the rank it will thereafter advertise (in DIOs) towards nodes that may then become its children.…”
Section: The Routing Layer: Multi-modal Solutions and Challengesmentioning
confidence: 99%
“…Depending on the OF, rank computation may or may not be part of forming the parent set and selecting a preferred parent. For example, with Objective Function Zero (OF0) [30], for every candidate neighbor, a node first computes (see [27,Equation 1]) what its rank would be if it chose said neighbor as its preferred parent. It then keeps (in its parent set) the two nodes for which its rank would be lowest (provided they comply with universal rules).…”
Section: The Routing Layer: Multi-modal Solutions and Challengesmentioning
confidence: 99%
See 3 more Smart Citations