Dual-mode real-time MAC protocol for wireless sensor networks: a validation/simulation approach
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
Minimizing latency in wireless sensor networks: a survey
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Validating the sensor network calculus by simulations
WICON '07 Proceedings of the 3rd international conference on Wireless internet
A data collection protocol for real-time sensor applications
Pervasive and Mobile Computing
CFlood: A Constrained Flooding Protocol for Real-time Data Delivery in Wireless Sensor Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Transport protocol for real-time communication in Wireless Sensor Networks
International Journal of Ad Hoc and Ubiquitous Computing
Modeling and evaluating reliable real-time degree in multi-hop wireless sensor networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Information Sciences: an International Journal
Analysis of audio streaming capability of Zigbee networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Dimensioning and worst-case analysis of cluster-tree sensor networks
ACM Transactions on Sensor Networks (TOSN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cross-layer analysis of the end-to-end delay distribution in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Multihop wireless sensor networks have recently emerged as an important embedded computing platform. This paper defines a quantitative notion of real-time capacity of a wireless network. Real-time capacity describes how much real-time data the network can transfer by their deadlines. A capacity bound is derived that can be used as a sufficient schedulability condition for a class of fixed-priority packet scheduling algorithms. Using this bound, a designer can perform capacity planning prior to network deployment to ensure satisfaction of applicationsý real-time requirements.