On the QoS routing with RPL

Khallef, Walid; Molnár, Miklós; Bensliman, Abderrahim; Durand, Sylvain

doi:10.23919/pemwn.2017.8308028

Cited by 3 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In (Khallef et al, 2017a) the computation of the exact incast hierarchy is presented. To avoid the loss of theoretically reachable nodes, the exact solution does not limit the number of computed and stored feasible and non-dominated paths.…”

Section: Construction Of Multi-constrained Dodagsmentioning

confidence: 99%

“…The random graphs were generated by the Waxman model. The presented results in (Khallef et al, 2017a) and presented also here are the mean values overs 100 instances. The 200 edges of the random graphs having 50 nodes were weighted by m = 2 and in some other cases by m = 4 integer QoS values.…”

Section: Evaluation Of the Propositionsmentioning

confidence: 99%

“…The objective is the implementation of the directed hierarchy at the end of the route computation. This hierarchy can be decomposed into a set of RPL compatible DODAGs (remember, the difference is that in the loop less directed (Khallef, 2017) and (Khallef et al, 2017a) hierarchy, a node can belong to several paths to the root, but can not in an RPL compatible DODAG). To create the routing scheme of the example of Fig.…”

Section: Adaptation Of Rplmentioning

confidence: 99%

“…4 (a) The ratio of missing (uncovered nodes) for different values of CL in the case of m = 4 uncorrelated metrics (b) The non-linear length of the successfully computed paths. Results presented in(Khallef, 2017) and(Khallef et al, 2017a)…”

mentioning

confidence: 99%

See 3 more Smart Citations

QoS Routing for Data Gathering with RPL in WSNs

Molnár

2020

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Generally, data collected by sensors must be sent to a sink node using multi-hop routing. Some applications can raise different requirements, constraints for the quality of data forwarding, for instance on end-to-end delay, jitter, packet loss, etc. Often, a set of constraints must be satisfied. Several proactive and reactive routing protocols have been proposed for WSNs. One of them is the standardized proactive RPL (Routing Protocol for Low-Power and Lossy Networks) designed essentially for many to one communication. For the data gathering a destination oriented directed acyclic graph (DODAG) is used which is mainly a tree directed to the sink. The computation of the tree-like DODAG is based on an Objective Function which can also be defined on QoS metrics but is usually based on one metric. This chapter deals with QoS routing in general and in WSNs using RPL in particular and proposes the analysis of the QoS constrained routes. We demonstrate that the set of QoS routes from sensors to the sink is not always a tree. It corresponds to a generalization of trees: to a hierarchy. The QoS aware hierarchies can be considered as special DODAGs. The routes are directed to the sink, and there is no useless cycle. The configuration of them and the data forwarding need some adjustments of the routing protocol which are also presented.

show abstract

Section: Construction Of Multi-constrained Dodagsmentioning

confidence: 99%

Section: Evaluation Of the Propositionsmentioning

confidence: 99%

Section: Adaptation Of Rplmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations