Roedig, Utz and Schmitt, Jens (2005) Sensor Network Calculus - A Framework for Worst Case Analysis. In: Distributed Computing in Sensor Systems : First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30 – July 1, 2005. Proceedings. Lecture Notes in Computer Science . Springer Verlag, Berlin, pp. 141-154. ISBN 978-3-540-26422-4Full text not available from this repository.
To our knowledge, at the time of writing no methodology exists to dimension a sensor network so that a worst case traffic scenario can be definitely supported. In this paper, the well known network calculus is tailored so that it can be used as a tool for worst case traffic analysis in sensor networks. To illustrate the usage of the resulting sensor network calculus, typical example scenarios are analyzed by this new methodology. Sensor network calculus provides the ability to derive deterministic statements about supportable operation modes of sensor networks and the design of sensor nodes.
|Item Type:||Contribution in Book/Report/Proceedings|
|Additional Information:||DCOSS is a well known conference on sensor networks which shares PC membership with the leading ACM SenSys and EWSN conferences. The paper describes a methodology that can be used to dimension a sensor network so that worst case traffic scenarios can be definitely supported. The well known network calculus is tailored for use as a tool for worst case traffic analysis in sensor networks. This is the first work that provides a dimensioning tool for sensor networks, and significant for deployment of sensor networks in critical application environments (e.g. traffic control, medical applications or production control) where it must be guaranteed that the required traffic patterns can be supported.|
|Subjects:||?? qa75 ??|
|Departments:||Faculty of Science and Technology > School of Computing & Communications|
|Deposited On:||16 Aug 2012 16:23|
|Last Modified:||25 Mar 2017 02:16|
Actions (login required)