Abstract
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-scale wireless sensor networks with timing constraints. It is rooted in the deterministic network calculus, which it instantiates for WSNs, as well as it generalizes it in some crucial aspects, as for instance in-network processing. Besides presenting these core concepts of the SensorNC, we also discuss the advanced concept of self-modeling of WSNs and efficient tool support for the SensorNC. Furthermore, several applications of the SensorNC methodology, like sink and node placement, as well as TDMA design, are displayed.
Highlights
Many applications of wireless sensor networks (WSN) require timely actuation
As in many of the visions of cyber-physical systems (CPS), using WSNs is an integral part for the sensing requirements, it can hardly be overemphasized that predictable timing is a necessity for WSNs in that context, as well
We start with the necessary background on network calculus, before we introduce its customization in the WSN context
Summary
Many applications of wireless sensor networks (WSN) require timely actuation. For example, industrial process automation typically consists of a multitude of sensors and actuators that are required to interact in a very clearly-defined manner with respect to their timing. Network calculus models the sequence of packets that define a flow’s data arrivals as non-negative, wide-sense increasing functions. These cumulatively count arriving data over time: F0 = f : R+ → R+ | f (0) = 0, ∀s ≤ t : f (t) ≥ f (s). Scaling functions are a very general concept and serve as a model for any kind of data transformation in a network calculus model. Note that they do capture any queueing-related effects; scaling is assumed to be done infinitely quickly. Definition 7. (Scaling curves) Given a scaling function S, two functions S, S ∈ F are minimum and maximum scaling curves of S iff ∀b ≥ 0; it applies that: S(b) ≤ inf {S(b + a) − S(a)}
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
