Scheduling Communication in Real-Time Sensor Applications

  • Authors:
  • Affiliations:
  • Venue:
  • RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a class of wireless sensor applications-such as mobile robotics-that impose timeliness constraints. We assume that these applications are built usingcommodity 802.11 wireless networks and focus on theproblem of providing qualitatively-better QoS during networktransmission of sensor data. Our techniques are designedto explicitly avoid network collisions and minimizethe completion time to transmit a set of sensor messages. Weargue that this problem is NP-complete and present threeheuristics, based on edge coloring, to achieve these goals.Our simulations results show that the minimum weight colorheuristic is robust to increases in communication densityand yields results that are close to the optimal solution.