Boosting sensor network calculus by thoroughly bounding cross-traffic

@article{Bondorf2015BoostingSN,
  title={Boosting sensor network calculus by thoroughly bounding cross-traffic},
  author={Steffen Bondorf and Jens B. Schmitt},
  journal={2015 IEEE Conference on Computer Communications (INFOCOM)},
  year={2015},
  pages={235-243}
}
Sensor Network Calculus (SensorNC) provides a framework for worst-case analysis of wireless sensor networks. The analysis proceeds in two steps: For a given flow, (1) the network is reduced to a tandem of nodes by computing the arrival bounds of cross-traffic; (2) the flow is separated from the cross-traffic by subtracting cross-flows and concatenating nodes on its path. While the second step has seen much treatment, the first step has not at all. This is in sharp contrast to the fact that… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
15 Extracted Citations
20 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 15 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 20 references

Network Calculus: A Theory of Deterministic Queuing Systems for the Internet

  • J.-Y. Le Boudec, P. Thiran
  • 2001
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…