The P2 algorithm for dynamic calculation of quantiles and histograms without storing observations
Communications of the ACM
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON)
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Feedback Control of Computing Systems
Feedback Control of Computing Systems
Comparison of routing metrics for static multi-hop wireless networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Reliability constrained routing in QoS networks
IEEE/ACM Transactions on Networking (TON)
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Analyzing the Yield of ExScal, a Large-Scale Wireless Sensor Network Experiment
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Traffic-aware routing for real-time communications in wireless multi-hop networks: Research Articles
Wireless Communications & Mobile Computing - Medium Access Control Protocols for Wireless Ad Hoc Networks
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Reliable bursty convergecast in wireless sensor networks
Computer Communications
Energy efficient routing with delay guarantee for sensor networks
Wireless Networks
Two techniques for fast computation of constrained shortest paths
IEEE/ACM Transactions on Networking (TON)
Multiconstrained QoS multipath routing in wireless sensor networks
Wireless Networks
Link Estimation and Routing in Sensor Network Backbones: Beacon-Based or Data-Driven?
IEEE Transactions on Mobile Computing
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Towards Stable Network Performance in Wireless Sensor Networks
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Dynamic route recomputation considered harmful
ACM SIGCOMM Computer Communication Review
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems
Comparison of Data-Driven Link Estimation Methods in Low-Power Wireless Networks
IEEE Transactions on Mobile Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey Paper: A survey on the communication architectures in smart grid
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS issues in ad hoc wireless networks
IEEE Communications Magazine
QoS-aware routing based on bandwidth estimation for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Communication systems for grid integration of renewable energy resources
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Real-time routing is a basic element of closed-loop, real-time sensing and control, but it is challenging due to dynamic, uncertain link/path delays. The probabilistic nature of link/path delays makes the basic problem of computing the probabilistic distribution of path delays NP-hard, yet quantifying probabilistic path delays is a basic element of real-time routing and may well have to be executed by resource-constrained devices in a distributed manner; the highly-varying nature of link/path delays makes it necessary to adapt to in-situ delay conditions in real-time routing, but it has been observed that delay-based routing can lead to instability, estimation error, and low data delivery performance in general. To address these challenges, we propose the Multi-Timescale Estimation (MTE) method; by accurately estimating the mean and variance of per-packet transmission time and by adapting to fast-varying queueing in an accurate, agile manner, MTE enables accurate, agile, and efficient estimation of probabilistic path delay bounds in a distributed manner. Based on MTE, we propose the Multi-Timescale Adaptation (MTA) routing protocol; MTA integrates the stability of an ETX-based directed-acyclic-graph (DAG) with the agility of spatiotemporal data flow control within the DAG to ensure real-time data delivery in the presence of dynamics and uncertainties. We also address the challenges of implementing MTE and MTA in resource-constrained devices such as TelosB motes. We evaluate the performance of MTA using the NetEye and Indriya sensor network testbeds. We find that MTA significantly outperforms existing protocols, e.g., improving deadline success ratio by 89% and reducing transmission cost by a factor of 9.7.