Date Added: Apr 2010
As wireless sensor networks mature, they are increasingly being used in real-time applications. Many of these applications require reliable transmission within latency bounds. Achieving this goal is very difficult because of link burstiness and interference. Based on significant empirical evidence of 21 days and over 3,600,000 packets transmission per link, the authors propose a scheduling algorithm that produces latency bounds of the real-time periodic streams and accounts for both link bursts and interference.