Quality and cost of deterministic network calculus: Design and evaluation of an accurate and fast analysis

S Bondorf, P Nikolaus, JB Schmitt - … of the ACM on Measurement and …, 2017 - dl.acm.org
Networks are integral parts of modern safety-critical systems and certification demands the
provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can …

Red de sensores inalámbricos multisalto para sistemas domóticos de bajo costo y área extendida

E Mendoza, P Fuentes, I Benítez, D Reina… - … de Automática e …, 2020 - riunet.upv.es
[ES] Las redes de sensores inalámbricos disponen de un campo muy amplio de
aplicaciones y aún muchos desafíos pendientes, especialmente aquellos relacionados con …

Calculating accurate end-to-end delay bounds-you better know your cross-traffic

S Bondorf, J Schmitt - Proceedings of the 9th EAI International …, 2016 - dl.acm.org
Bounds on the end-to-end delay of data flows play a crucial role in different areas, ranging
from certification of hard real-time communication capabilities to quality of experience …

Iterative probabilistic performance prediction for multiple iot applications in contention

A Kocian, S Chessa - IEEE Internet of Things Journal, 2022 - ieeexplore.ieee.org
Internet of Things (IoT) has become omnipresent in many applications, such as healthcare,
vehicles, and precision farming. They sense data from dozens of sensors scheduled …

Boosting sensor network calculus by thoroughly bounding cross-traffic

S Bondorf, JB Schmitt - 2015 IEEE Conference on Computer …, 2015 - ieeexplore.ieee.org
Sensor Network Calculus (SensorNC) provides a framework for worst-case analysis of
wireless sensor networks. The analysis proceeds in two steps: For a given flow,(1) the …

[HTML][HTML] The sensor network calculus as key to the design of wireless sensor networks with predictable performance

J Schmitt, S Bondorf, WY Poe - Journal of Sensor and Actuator Networks, 2017 - mdpi.com
In this article, we survey the sensor network calculus (SensorNC), a framework continuously
developed since 2005 to support the predictable design, control and management of large …

Improving cross-traffic bounds in feed-forward networks–there is a job for everyone

S Bondorf, J Schmitt - … Modelling and Evaluation of Dependable Computer …, 2016 - Springer
Network calculus provides a mathematical framework for deterministically bounding backlog
and delay in packet-switched networks. The analysis is compositional and proceeds in …

Three connected dominating set algorithms for wireless sensor networks

N Al-Nabhan, B Zhang, X Cheng… - … Journal of Sensor …, 2016 - inderscienceonline.com
Computing connected dominating sets (CDSs) have been widely used to construct virtual
backbones in wireless sensor networks, in order to control topology, facilitate routing and …

Two connected dominating set algorithms for wireless sensor networks

N Al-Nabhan, B Zhang, M Al-Rodhaan… - … , and Applications: 7th …, 2012 - Springer
In this work, we present the design of two novel algorithms for constructing connected
dominating set (CDS) in wireless sensor networks (WSNs). Both algorithms are intended to …

Worst-Case Performance Analysis of Feed-Forward Networks–An Efficient and Accurate Network Calculus

S Bondorf - 2016 - kluedo.ub.rptu.de
Distributed systems are omnipresent nowadays and networking them is fundamental for the
continuous dissemination and thus availability of data. Provision of data in real-time is one of …