EditA Scalable and Efficient Approach to Obtain Measurements in CAN-based Control Systems
Björn Andersson, Nuno Pereira, Wilfried Elmenreich, Eduardo Tovar, Filipe Pacheco and Nuno Cruz
Accepted for publication in IEEE Transactions on Industrial Informatics (TII)
[pdf]
The availability of small inexpensive sensor elements enables the employment of large wired or wireless sensor networks for feeding control systems. Unfortunately, the need to transmit a large number of sensor measurements over a network negatively affects the timing parameters of the control loop. This paper presents a solution to this problem by representing sensor measurements with an approximate representation - an interpolation of sensor measurements as a function of space coordinates. A priority-based medium access control (MAC) protocol is used to select the sensor messages with high information content. Thus, the information from a large number of sensor measurements is conveyed within a few messages. This approach greatly reduces the time for obtaining a snapshot of the environment state and therefore supports the real-time requirements of feedback control loops.
EditExploiting a Prioritized MAC Protocol to Efficiently Compute Min and Max in Multihop Networks
Björn Andersson, Nuno Pereira and Eduardo Tovar
5th Workshop on Intelligent Solutions in Embedded Systems, Madrid, Spain, June 2007
[pdf]
Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take sensor readings but individual sensor readings are not very important. It is important however to compute aggregated quantities of these sensor readings. The minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. We propose an algorithm for computing the min or max of sensor reading in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter.
EditExploiting a Prioritized MAC Protocol to Efficiently Compute Interpolations
Björn Andersson, Nuno Pereira and Eduardo Tovar
12th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'07)
[pdf]
Consider a network where all nodes share a single
broadcast domain such as a wired broadcast network.
Nodes take sensor readings but individual sensor readings
are not the most important pieces of data in the system.
Instead, we are interested in aggregated quantities of
the sensor readings such as minimum and maximum values,
the number of nodes and the median among a set of
sensor readings on different nodes. In this paper we show
that a prioritized medium access control (MAC) protocol
may advantageously be exploited to efficiently compute
aggregated quantities of sensor readings. In this context,
we propose a distributed algorithm that has a very low
time and message-complexity for computing certain aggregated
quantities. Importantly, we show that if every
sensor node knows its geographical location, then sensor
data can be interpolated with our novel distributed algorithm,
and the message-complexity of the algorithm is independent
of the number of nodes. Such an interpolation
of sensor data can be used to compute any desired function;
for example the temperature gradient in a room (e.g.,
industrial plant) densely populated with sensor nodes, or
the gas concentration gradient within a pipeline or traffic
tunnel.
EditA Two-Competitive Approximate Schedulability Analysis of CAN
Björn Andersson, Nuno Pereira and Eduardo Tovar
12th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'07)
[pdf]
Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.
EditUsing a Prioritized MAC Protocol to Efficiently Compute Aggregated Quantities
Björn Andersson, Nuno Pereira, Eduardo Tovar
5th Intl Workshop on Real Time Networks (RTN'06)
[pdf]
Consider a distributed computer system such that every computer node can perform a wireless broadcast and when it does so, all other nodes receive this message. The computer nodes take sensor readings but individual sensor readings are not very important. It is important however to compute the aggregated quantities of these sensor readings. We show that a prioritized medium access control (MAC) protocol for wireless broadcast can compute simple aggregated quantities in a single transaction, and more complex quantities with many (but still a small number of) transactions. This leads to significant improvements in the time-complexity and as a consequence also similar reduction in energy “consumption”.