Loading...
275 results
Search Results
Now showing 1 - 10 of 275
- XDense: A Dense Grid Sensor Network for Distributed Feature ExtractionPublication . Loureiro, João; Rangarajan, Raghuraman; Tovar, EduardoInvestigate architectural and communication issues for a large-scale dense sensor network, addressing issues like network topology, medium access control, routing and in-network data processing. • Design of distributed processing strategies for detecting events with low latency which is essential to meet the requirements of RT control systems
- Energy and delay trade-off of the GTS allocation mechanism in IEEE 802.15.4 for wireless sensor networksPublication . Koubâa, Anis; Alves, Mário; Tovar, EduardoThe IEEE 802.15.4 protocol proposes a flexible communication solution for Low-Rate Wireless Personal Area Networks (LR-WPAN) including wireless sensor networks (WSNs). It presents the advantage to fit different requirements of potential applications by adequately setting its parameters. When in beaconenabled mode, the protocol can provide timeliness guarantees by using its Guaranteed Time Slot (GTS) mechanism. However, power-efficiency and timeliness guarantees are often two antagonistic requirements in wireless sensor networks. The purpose of this paper is to analyze and propose a methodology for setting the relevant parameters of IEEE 802.15.4-compliant WSNs that takes into account a proper trade-off between power-efficiency and delay bound guarantees. First, we propose two accurate models of service curves for a GTS allocation as a function of the IEEE 802.15.4 parameters, using Network Calculus formalism. We then evaluate the delay bound guaranteed by a GTS allocation and express it as a function of the duty cycle. Based on the relation between the delay requirement and the duty cycle, we propose a power-efficient superframe selection method that simultaneously reduces power consumption and enables meeting the delay requirements of real-time flows allocating GTSs. The results of this work may pave the way for a powerefficient management of the GTS mechanism in an IEEE 802.15.4 cluster.
- Buffer-Aware Scheduling for UAV Relay Networks with Energy FairnessPublication . Emami, Yousef; Li, Kai; Tovar, EduardoFor assisting data communications in human-unfriendly environments, Unmanned Aerial Vehicles (UAVs) are employed to relay data for ground sensors thanks to UAVs' flexible deployment, high mobility, and line-of-sight communications. In UAV relay networks, energy efficient data relay is critical due to limited battery of the ground sensing devices. In this paper, we propose a butter-aware transmission scheduling optimization to minimize the energy consumption of the ground devices under constraints of butter overflows and energy cost fairness on the ground devices. Moreover, we show that the problem is NP-complete and propose a heuristic algorithm to approximate the optimal scheduling solution in polynomial time. The performance of the proposed algorithm is evaluated in terms of network sizes, packet arrival rates, and fairness of the energy consumption. Numerical results confirm that the proposed scheduling algorithm reduces the energy consumption of the ground devices in a fair fashion, while the butter overflow constraint holds.
- An Exact Schedulability Test for Global FP Using State Space PruningPublication . Burmyakov, Artem; Bini, Enrico; Tovar, EduardoWe propose an exact schedulability test for sporadic realtime tasks with constrained deadlines, scheduled by Global Fixed Priority (GFP). Our test is faster and less memory consuming than other state-of-the-art exact tests. We achieve such results by employing a set of techniques that cut down the state space of the analysis, which extend the prior work by Bonifaci and Marchetti-Spaccamela. Our test is implemented in C++ code, and it is publicly available.
- Communication response time in P-NET networks: worst-case analysis considering the actual token utilisationPublication . Tovar, Eduardo; Vasques, Francisco; Burns, AlanFieldbus networks aim at the interconnection of field devices such as sensors, actuators and small controllers. Therefore, they are an effective technology upon which Distributed Computer Controlled Systems (DCCS) can be built. DCCS impose strict timeliness requirements to the communication network. In essence, by timeliness requirements we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit, which means that in the worst-case the communication response time could be derived considering that the token is fully utilised by all stations. However, such analysis can be proved to be quite pessimistic. In this paper we propose a more sophisticated P-NET timing analysis model, which considers the actual token utilisation by different masters. The major contribution of this model is to provide a less pessimistic, and thus more accurate, analysis for the evaluation of the worst-case communication response time in P-NET fieldbus networks.
- On the adaptation of broadcast transactions in token-passing fieldbus networks with heterogeneous transmission mediaPublication . Alves, Mário; Tovar, Eduardo; Vasques, FranciscoBroadcast networks that are characterised by having different physical layers (PhL) demand some kind of traffic adaptation between segments, in order to avoid traffic congestion in linking devices. In many LANs, this problem is solved by the actual linking devices, which use some kind of flow control mechanism that either tell transmitting stations to pause (the transmission) or just discard frames. In this paper, we address the case of token-passing fieldbus networks operating in a broadcast fashion and involving message transactions over heterogeneous (wired or wireless) physical layers. For the addressed case, real-time and reliability requirements demand a different solution to the traffic adaptation problem. Our approach relies on the insertion of an appropriate idle time before a station issuing a request frame. In this way, we guarantee that the linking devices’ queues do not increase in a way that the timeliness properties of the overall system turn out to be unsuitable for the targeted applications.
- Response time analysis of multiframe mixed-criticality systems with arbitrary deadlinesPublication . Hussain, Ishfaq; Awan, Muhammad Ali; Souto, Pedro; Bletsas, Konstantinos; Akesson, Benny; Tovar, EduardoThe well-known model of Vestal aims to avoid excessive pessimism in the quantifcation of the processing requirements of mixed-criticality systems, while still guaranteeing the timeliness of higher-criticality functions. This can bring important savings in system costs, and indirectly help meet size, weight and power constraints. This efciency is promoted via the use of multiple worst-case execution time (WCET) estimates for the same task, with each such estimate characterized by a confdence associated with a diferent criticality level. However, even this approach can be very pessimistic when the WCET of successive instances of the same task can vary greatly according to a known pattern, as in MP3 and MPEG codecs or the processing of ADVB video streams. In this paper, we present a schedulability analysis for the new multiframe mixed-criticality model, which allows tasks to have multiple, periodically repeating, WCETs in the same mode of operation. Our work extends both the analysis techniques for Static Mixed-Criticality scheduling (SMC) and Adaptive Mixed-Criticality scheduling (AMC), on one hand, and the schedulability analysis for multiframe task systems on the other. A constrained-deadline model is initially targeted, and then extended to the more general, but also more complex, arbitrary-deadline scenario. The corresponding optimal priority assignment for our schedulability analysis is also identifed. Our proposed worst-case response time (WCRT) analysis for multiframe mixed-criticality systems is considerably less pessimistic than applying the static and adaptive mixed-criticality scheduling tests oblivious to the WCET variation patterns. Experimental evaluation with synthetic task sets demonstrates up to 20% and 31.4% higher scheduling success ratio (in absolute terms) for constrained-deadline analyses and arbitrary-deadline analyses, respectively, when compared to the best of their corresponding frame-oblivious tests.
- Work-in-Progress: A Holistic Approach to WCRT Analysis for Multicore SystemsPublication . Arora, Jatin; Rashid, Syed Aftab; Maia, Cláudio; Nelissen, Geoffrey; Tovar, EduardoMulticore platforms share the hardware resources such as caches, interconnects, and main memory among all the cores. Due to such sharing, tasks running on different cores compete to access these shared resources which increases the execution times of those tasks in a non-deterministic manner. This is problematic for systems that run applications with stringent timing requirements. To address this issue, we propose a holistic analysis to bound the maximum inter-core contention that can be suffered by tasks from tasks running on other cores.
- A scalable and efficient approach for obtaining measurements in CAN-Based control systemsPublication . Andersson, Björn; Pereira, Nuno; Elmenreich, Wilfried; Tovar, Eduardo; Pacheco, Filipe; Cruz, NunoThe 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.
- sMapReduce: a programming pattern for wireless sensor networksPublication . Gupta, Vikram; Tovar, Eduardo; Pinho, Luís Miguel; Kim, Junsung; Lakshmanan, Karthik; Rajkumar, Ragunathan (Raj)Wireless Sensor Networks (WSNs) are increasingly used in various application domains like home-automation, agriculture, industries and infrastructure monitoring. As applications tend to leverage larger geographical deployments of sensor networks, the availability of an intuitive and user friendly programming abstraction becomes a crucial factor in enabling faster and more efficient development, and reprogramming of applications. We propose a programming pattern named sMapReduce, inspired by the Google MapReduce framework, for mapping application behaviors on to a sensor network and enabling complex data aggregation. The proposed pattern requires a user to create a network-level application in two functions: sMap and Reduce, in order to abstract away from the low-level details without sacrificing the control to develop complex logic. Such a two-fold division of programming logic is a natural-fit to typical sensor networking operation which makes sensing and topological modalities accessible to the user.