Throughput quantitative analysis of EDCA 802.11e in different scenarios

This document presents a quantitative analysis of the direct and relative throughput of IEEE 802.11e. The global throughput of an 802.11e WLAN is determined by EDCA (Enhanced Distributed Channel Access) parameters, among other aspects, that are usually configured with predetermined and static values. This study carefully evaluates the Quality of Service (QoS) of Wi-Fi with EDCA in several realistic scenarios with noise and a blend of wireless traffic (e.g., voice, video, and best effort, with Pareto distribution). The metrics of the benefits obtained in each case are compared, and the differentiated impact of network dynamics on each case is quantified. The results obtained show that the default settings are not optimal, and that with an appropriate selection, can be achieved improvements of the order of 25 %, according to the type of traffic. In addition, it could be shown the quantitative impact of each parameter EDCA on the overall performance. This study proposes a new experimental scenario based on the relative proportion of traffic present in the network. Stations have been simulated using the Möbius tool, which supports an extension of SPN (Stochastic Petri Networks), known as HSAN (Hierarchical Stochastic Activity Networks).Facultad de Informátic

Generalised Nonblocking

This paper studies the nonblocking check used in supervisory control of discrete event systems and its limitations. Different examples with different liveness requirements are discussed. It is shown that the standard nonblocking check can be used to specify most requirements of interest, but that it lacks expressive power in a few cases. A generalised nonblocking check is proposed to overcome the weakness, and its relationship to standard nonblocking is explored. Results suggest that generalised nonblocking, while having the same useful properties with respect to synthesis and compositional verification, can provide for more concise problem representations in some cases

The language of certain conflicts of a nondeterministic process

The language of certain conflicts is the most general set of behaviours of a nondeterministic process, which certainly lead to a livelock or deadlock when accepted by another process running in parallel. It is of great use in model checking to detect livelocks or deadlocks in very large systems, and in process-algebra to obtain abstractions preserving livelock and deadlock. Unfortunately, the language of certain conflicts is difficult to compute and has only been approximated in previous work. This paper presents an effective algorithm to calculate the language of certain conflicts for any given nondeterministic finite-state process and discusses its properties. The algorithm is shown to be correct and of exponential complexity

Vérification formelle de conditions d'ordonnancabilité de tâches temps réel périodiques strictes

National audienceNous formalisons en Coq le problème de l'ordonnancement de tâches périodiques strictes non préemptives et prouvons formellement le théorème dû à Jan Korst donnant la condition nécessaire et suffisante pour l'ordonnançabilité de telles tâches

Constant-Loop Dominators for Single-Path Code Optimization

Single-path code is a code generation technique specifically designed for real-time systems. It guarantees that programs execute the same instruction sequence regardless of runtime conditions. Single-path code uses loop bounds to ensure all loops iterate a fixed number of times equal to their upper loop bound. When the lower and upper bounds are equal, the loop must iterate the same number of times, which we call a constant loop. In this paper, we present the constant-loop dominance relation on control-flow graphs. It is a variation of the traditional dominance relation that considers constant loops to find basic blocks that are always executed the same number of times. Using this relation, we present an optimization that reduces the code needed to manage single-path code. Our evaluation shows significant performance improvements, with one example of up to 90%, with mostly minor effects on code size

Simulation-aided Design of Thread Milling Cutter

AbstractThread milling has become quite popular in recent years as an alternative to tapping or other forms of threading because of diversity and complexity of parts and flexibility of the process in industries such as biomedical applications, aerospace and die-mold manufacturing. Today the design of the tooth profile is, however, predominantly feasible by the expertise and “trial and error” principle. Presented in this paper are a novel methodology to design the tooth profile of the thread mill by comparing the “to-be” thread profile and the “as-is” thread profile which is analyzed by means of NC cutting simulation. The simulation kernel enables to continually subtract the swept volume of thread milling cutter undergoing helical movement from the workpiece and to calculate the virtual workpiece (VWP). Combined with the standardized “to-be” thread profile, the tooth profile of to-be-designed thread mill is adaptively modified until the thread profile on VWP and the “to-be” thread profile become congruent with each other. The proposed methodology could be integrated into CAD/CAM systems

A simple method for guaranteed deadline of periodic messages in 802.15.4 cluster cells for automation control applications

International audienceWe propose the implementation of a wireless sensor network applied to automation control applications, when the guarantee of a delay delivery for the complete reception of messages is necessary. The 802.15.4 wireless standard network offers possibilities of management of the bandwidth. This paper presents the method to guarantee the deadline transmission of periodic messages. For external messages (crossing the network from clusters to its destination), this average latency is used as a parameter of the routing protocol decision balance between energy saving and delay transmission. In this last case, a QoS method all over the network has to be installed to maintain a bounded end to end transmission delay. This work is still in progress. A specific Matlab simulator has been developed, principles of this routing method are mentioned at the end of this paper