Validating the sensor network calculus by simulations
In , they extend the network calculus to sink-tree sensor networks and propose a general framework, called sensor network calculus, for analyzing the performance.
The framework illustrates the various trade-offs between node power consumption, buffer requirement, and the data transfer delay bound.
NC analyzes the performance characteristics of the system based on min-plus algebra and has been widely used in numerous applications to provide deterministic delay and backlog bounds.
Some wireless sensor networks must meet high reliability and real-time requirements.
We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM.
Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method.
We propose two methods to compute the maximum delay bound of the flow of interest and discuss which one of the methods has the tighter delay bound.
Experiments show that our proposed methods are effective and scalable.
Section 5 introduces our proposed end-to-end delay bound analysis methods and the corresponding comparative analysis. Schmitt and Roedig present a series of works on the analysis of sensor networks.For example, in industrial wireless sensor networks, sensor data must be transmitted to their destination before a deadline; otherwise, terrible disasters may happen.So the performance analysis of the data flow is very important at design time. There have been some works on using NC to analyze network performance, for example, [3–6].But the original network calculus can only model the single-mode wireless sensor network.In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component.