distributed computer systems

The project, started in April 2008 under a grant from the DFG, aims to improve network calculus to aid in the dimensioning of sensor networks for environmental monitoring.

To this end, we will search for refinements to traditional network calculus that take into account the peculiarities of sensor networks, and thus try to refine the obtained bounds. Those results will be verified using an experimental testbed based on MicaZ radio motes, and CMUCam camera modules.

As a result, we plan to extend the DISCO Deterministic Network Calculator with new-found and refined techniques, on the way to a comprehensive tool for network planning and dimensioning.

Network Calculus

Work on the analytic framework will be roughly separated in two parts. First, we will refine the deterministic NC. In a second step, we will take into consideration stochastic extensions to achieve tighter, but less accurate bounds.

To support the project, we collected relevant work in the field in a Network Calculus Bibliography.

Experimental Network

To have a realistic testbed for the project, we plan to build a sensor network based on MicaZ motes, equipped with cameras. We have chosen the CMUCam3 cameras.

With those components, we plan to develop and deploy a small-scale building surveillance system to gather real-world data, and test dimensioning results for nontrivial network loads. This will enable us to research a range of variables, like the trade-off between sending complete images vs. performing varying amounts of pre-processing on the sensors.


Some Important Publications of SeNeCa

  • S. Bondorf and J. B. Schmitt. Boosting Sensor Network Calculus by Thoroughly Bounding Cross-Traffic. In Proceedings of the 34th IEEE International Conference on Computer Communications (INFOCOM 2015), Hong Kong, April 2015.
  • F. Ciucu, J. B. Schmitt, and H. Wang. On Expressing Networks with Flow Transformations in Convolution-Form. In Proceedings of the 30th IEEE International Conference on Computer Communications (INFOCOM 2011), Shanghai, China, April 2011.
  • J. B. Schmitt, N. Gollan, S. Bondorf, and I. Martinovic. Pay Bursts Only Once Holds for (Some) Non-FIFO Systems. In Proceedings of the 30th IEEE International Conference on Computer Communications (INFOCOM 2011), Shanghai, China, April 2011.
  • W. Y. Poe, M. Beck, and J. B. Schmitt. Planning the Trajectories of Multiple Mobile Sinks in Large-Scale, Time-Sensitive WSNs. In Proceedings of the 7th IEEE International Conference on Distributed Computing in Sensor Systems (IEEE DCOSS 2011), Barcelona, Spain, Juni 2011.
  • H. Wang, J. B. Schmitt, and I. Martinovic. Dynamic Demultiplexing in Network Calculus – Theory and Application. Performance Evaluation, Elsevier, 68(2):201-219, February 2011.
  • P. Suriyachai, U. Roedig, A. Scott, N. Gollan, and J. B. Schmitt. Dimensioning of Time-Critical WSNs – Theory, Implementation and Evaluation. In Journal of Communications (JCM), Special Issue on New Advances in Wireless Sensor Networks, 6(5), 2011.
  • A. Kiefer, N. Gollan, and J. B. Schmitt. Searching for Tight Performance Bounds in Feed-Forward Networks. In B. Muller-Clostermann, K. Echtle, und E. P. Rathgeb, editors, 15th International GI/ITG Conference on “Measurement, Modelling and Evaluation of Computing Systems” and “Dependability and Fault Tolerance” (MMB/DFT 2010), Lecture Notes in Computer Science 5987, Essen, Germany, March 2010. GI/ITG, Springer.  
  • J. B. Schmitt, F. A. Zdarsky, and M. Fidler. Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch .... In Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM 2008), Phoenix, AZ, USA, April 2008.

The above and further publications for SeNeCa can also be found in Disco's publication list.

Project Staff

Further Project Members


Please see the personal pages above for contact details.

University of Kaiserslautern

Write your thesis with a disco advisor

We offer a variety of bachelor and master theses at any point in the academic year. Also check out some of our completed theses. Read more...

Go to top