Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Armand Naessens

dblp:305/9249 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 61% Wireless networking · 39%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › mobile ad hoc networks
multi-hop communication
0.512021
Algorithm for Distributed Duty Cycle Adherence in Multi-Hop RPL Networks · SenSys 2021
Internet of things and sensor networks › low-power wireless › low-power and lossy networks
RPL
0.512021
Algorithm for Distributed Duty Cycle Adherence in Multi-Hop RPL Networks · SenSys 2021
Internet of things and sensor networks
wireless sensor network
0.512021
Algorithm for Distributed Duty Cycle Adherence in Multi-Hop RPL Networks · SenSys 2021
Wireless networking › cognitive radio
spectrum access
0.112021
Algorithm for Distributed Duty Cycle Adherence in Multi-Hop RPL Networks · SenSys 2021

Methods — techniques the papers use, named apart from their topics

simulation · 0.5distributed algorithm · 0.5
YearPublicationVenuePosition
2021 Algorithm for Distributed Duty Cycle Adherence in Multi-Hop RPL Networks
abstract
Wireless Sensor Networks (WSNs) operating in unlicensed frequency bands or employing battery-less devices, require a Duty Cycle (DC) limit to ensure fair spectrum access or limit energy consumption. However, in multi-hop networks, it is up to the network protocol to ensure that all devices comply with such DC restrictions. We therefore developed a distributed DC adherence algorithm that limits the DC of all devices without introducing any additional packet overhead. This paper presents a brief description of the algorithm and evaluates its performance through simulation. Our results show that the algorithm can limit the DC of all devices to ensure no devices must switch off. Our algorithm therefore provides a solution for WSNs where nodes must operate below a DC limit.
Dries Van Leemput, Armand Naessens, Robbe Elsas, Jeroen Hoebeke, Eli De Poorter
SenSys2