An Implicit Prioritized Access Protocol for Wireless Sensor Networks
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
On Real-Time Capacity Limits of Multihop Wireless Sensor Networks
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Real-Time Resource Reservation Protocol for Wireless Mobile Ad Hoc Networks
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
A Spatiotemporal Communication Protocol for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Mobile Computing
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Robust implicit EDF: A wireless MAC protocol for collaborative real-time systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
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
Real-time wireless sensor networks
Real-time wireless sensor networks
Censor networks: a critique of "sensor networks" from a systems perspective
ACM SIGCOMM Computer Communication Review
Real-Time Communications Over Cluster-Tree Sensor Networks with Mobile Sink Behaviour
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Sensor network calculus – a framework for worst case analysis
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Error modeling schemes for fading channels in wireless communications: A survey
IEEE Communications Surveys & Tutorials
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Demo: Automatic personal identification system for security in critical services: a case study
Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems
Real-time routing and retry strategies for low-latency 802.15.4 control networks
ACM SIGBED Review - Special Issue on the 10th International Workshop on Real-time Networks (RTN 2011)
| Hi-index | 0.00 |
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-sensitive WSN applications, where the timing behavior of the network protocols (message transmission must respect deadlines) impacts on the correct operation of these applications. In that direction this article contributes with a methodology based on Network Calculus, which enables quick and efficient worst-case dimensioning of static or even dynamically changing cluster-tree WSNs where the data sink can either be static or mobile. We propose closed-form recurrent expressions for computing the worst-case end-to-end delays, buffering and bandwidth requirements across any source-destination path in a cluster-tree WSN. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study using commercially available technology, namely TelosB motes running TinyOS.