Article

Sensor network calculus – a framework for worst case analysis

Authors:

Jens B. Schmitt,

Utz RoedigAuthors Info & Claims

DCOSS'05: Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

Pages 141 - 154

https://doi.org/10.1007/11502593_13

Published: 30 June 2005 Publication History

Abstract

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.

References

[1]

M. Weiser. The computer for the 21st century. Scientific American, 265(3):94-104, September 1991.

[2]

R. Braden, D. Clark, and S. Shenker. Integrated Services in the Internet Architecture: an Overview. RFC 1633, June 1994.

[3]

K. Nichols, S. Blake, F. Baker, and D. Black. Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers. Proposed Standard RFC 2474, December 1998.

Digital Library

[4]

J.-Y. Le Boudec and P. Thiran. Network Calculus - A Theory of Deterministic Queueing Systems for the Internet. Springer, Lecture Notes in Computer Science, LNCS 2050, 2001.

Digital Library

[5]

Chipcon SmartRF CC1000 Data Sheet. Chipcon, www.chipcon.com. 2002.

[6]

Crossbow Technology INC. Smart Dust Training Seminar. Tutorial at the 1st IEEE European Workshop on Wireless Sensor Networks (EWSN2004), Berlin, Germany, January 2004.

[7]

J. Polastre. Design and Implementation of Wireless Sensor Networks for Habitat Monitoring. Masters Thesis. University of California, Berkeley. Berkeley, CA. May 23, 2003.

[8]

A. Barroso, J. Benson, T. Murphy, U. Roedig, C. Sreenan, S. Bellis, K. Delaney, B. OFlynn. The DSYS25 Sensor Platform. Demo at the SenSys 2004. http://www.cs.ucc.ie/~ur1/pages/publications/files/sensys04barroso.pdf

Digital Library

[9]

P. Goyal, S. S. Lam, and H. Vin. Determining End-to-End Delay Bounds in Heterogeneous Networks. In Proceedings of Network and Operating System Support for Digital Audio and Video, 5th International Workshop, NOSSDAV 95, Durham, New Hampshire, USA. Springer LNCS 1018, April 1995.

Digital Library

[10]

D. Stiliadis and A. Varma. Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms. IEEE/ACM Transactions on Networking, 6(5):611624, October 1998.

Digital Library

[11]

Alan Demers, Srinivasan Keshav, and Scott Shenker. Analysis and Simulation of a Fair Queueing Algorithm. In Proceedings of ACM SIGCOMM, pp. 3-12, August 1989.

Digital Library

[12]

B. Karp and H. T. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," in Mobile Computing and Networking, pp. 243-254, 2000.

Digital Library

[13]

Crossbow Technology INC. Mica-2 Data Sheet. Crossbow.

[14]

http://www.xbow.com.

[15]

B. Deb, S. Bhatnagar and B. Nath. ReInForM: Reliable Information Forwarding using Multiple Paths in Sensor Networks. In Proceedings of the 28th Annual IEEE conference on Local Computer Networks (LCN 2003), Bonn, Germany, October 2003.

Digital Library

[16]

U. Roedig, A. Barroso, and C. J. Sreenan. Determination of Aggregation Points in Wireless Sensor Networks. In Proceedings of the 30th Euromicro Conference (EUROMICRO 2004), Rennes, France, IEEE Computer Society Press, August 2004.

Digital Library

[17]

C. Intanagonwiwat, R. Govindan and D. Estrin. Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks In Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (MobiCOM 2000), August 2000, Boston, Massachusetts.

Digital Library

[18]

J. Zhang, K. Premaratne and Peter H. Bauer. Resource Allocation and Congestion Control in Distributed Sensor Networks - a Network Calculus Approach. In Proceedings of Fifteenth International Symposium on Mathematical Theory of Networks and Systems, University of Notre Dame, August 12-16, 2002.

Cited By

Spörk MBoano CRömer KLiu YXing GHe YPicco G(2019)Improving the Timeliness of Bluetooth Low Energy in Noisy RF EnvironmentsProceedings of the 2019 International Conference on Embedded Wireless Systems and Networks10.5555/3324320.3324324(23-34)Online publication date: 25-Feb-2019
https://dl.acm.org/doi/10.5555/3324320.3324324
Adu-Manu KAdam NTapparello CAyatollahi HHeinzelman W(2018)Energy-Harvesting Wireless Sensor Networks (EH-WSNs)ACM Transactions on Sensor Networks10.1145/318333814:2(1-50)Online publication date: 27-Apr-2018
https://dl.acm.org/doi/10.1145/3183338
Amodu OOthman M(2018)A survey of hybrid MAC protocols for machine-to-machine communicationsTelecommunications Systems10.1007/s11235-018-0434-469:1(141-165)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1007/s11235-018-0434-4
Show More Cited By

Sensor network calculus – a framework for worst case analysis
1. General and reference
  1. Cross-computing tools and techniques
2. Networks
  1. Network types

Recommendations

A Comprehensive Worst-Case Calculus for Wireless Sensor Networks with In-Network Processing
RTSS '07: Proceedings of the 28th IEEE International Real-Time Systems Symposium

Today's wireless sensor networks (WSN) focus on energy-efficiency as the main metric to optimize. However, an increasing number of scenarios where sensor networks are considered for time-critical purposes in application sce- narios like intrusion ...
Dimensioning and worst-case analysis of cluster-tree sensor networks

Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under the worst-case conditions and to make the appropriate design choices. This is particular relevant for time-...
The worst-case capacity of wireless sensor networks
IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networks

The key application scenario of wireless sensor networks is data gathering sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of sensor networks is thus characterized by the rate at which information can ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

DCOSS'05: Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

June 2005

423 pages

ISBN:3540264221

Editors:
Viktor K. Prasanna
Department of Electrical Engineering, University of Southern California, Los Angeles, CA
,
Sitharama S. Iyengar
Department of Computer Science, Louisiana State University, Baton Rouge, CA
,
Paul G. Spirakis
Department of Computer Engineering and Informatics, University of Patras, Rio, Patras, CA, Greece
,
Matt Welsh
School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, Greece

Sponsors

IEEE CS TCPP: IEEE Computer Society Technical Committee on Parallel Processing
IEEE Computer Society Technical Committee on Distributed Processing

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 30 June 2005

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Spörk MBoano CRömer KLiu YXing GHe YPicco G(2019)Improving the Timeliness of Bluetooth Low Energy in Noisy RF EnvironmentsProceedings of the 2019 International Conference on Embedded Wireless Systems and Networks10.5555/3324320.3324324(23-34)Online publication date: 25-Feb-2019
https://dl.acm.org/doi/10.5555/3324320.3324324
Adu-Manu KAdam NTapparello CAyatollahi HHeinzelman W(2018)Energy-Harvesting Wireless Sensor Networks (EH-WSNs)ACM Transactions on Sensor Networks10.1145/318333814:2(1-50)Online publication date: 27-Apr-2018
https://dl.acm.org/doi/10.1145/3183338
Amodu OOthman M(2018)A survey of hybrid MAC protocols for machine-to-machine communicationsTelecommunications Systems10.1007/s11235-018-0434-469:1(141-165)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1007/s11235-018-0434-4
Buchholz PVastag S(2018)Toward an analytical method for SLA validationSoftware and Systems Modeling (SoSyM)10.1007/s10270-017-0604-y17:2(527-545)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s10270-017-0604-y
Zhao XLu Z(2017)A Tool for xMAS-Based Modeling and Analysis of Communication Fabrics in SimulinkACM Transactions on Modeling and Computer Simulation10.1145/300544627:3(1-26)Online publication date: 24-Aug-2017
https://dl.acm.org/doi/10.1145/3005446
Petreska NAl-Zubaidy HStaehle BKnorr RGross JLassous IBarba CRazafindralambo T(2016)Statistical Delay Bound for WirelessHART NetworksProceedings of the 13th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, & Ubiquitous Networks10.1145/2989293.2989295(33-40)Online publication date: 13-Nov-2016
https://dl.acm.org/doi/10.1145/2989293.2989295
(2016)Impact of redundant sensor deployment over data gathering performanceJournal of Network and Computer Applications10.1016/j.jnca.2016.03.01267:C(26-42)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1016/j.jnca.2016.03.012
Safa HEl-Hajj WZoubian H(2014)A robust topology control solution for the sink placement problem in WSNsJournal of Network and Computer Applications10.5555/3170014.317016939:C(70-82)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.5555/3170014.3170169
Wang HSchmitt J(2014)End-to-end delay bounds for variable length packet transmissions under flow transformationsProceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools10.4108/icst.Valuetools.2014.258194(31-38)Online publication date: 9-Dec-2014
https://dl.acm.org/doi/10.4108/icst.Valuetools.2014.258194
Kiasari AJantsch ALu Z(2013)Mathematical formalisms for performance evaluation of networks-on-chipACM Computing Surveys10.1145/2480741.248075545:3(1-41)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1145/2480741.2480755
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten