A Robust Real-Time Message Scheduling Scheme Capable of Handling Channel Errors in Wireless Local Area Networks

  • Junghoon Lee
  • Mikyung Kang
  • Gyung-Leen Park
  • In-Hye Shin
  • Hanil Kim
  • Sang-Wook Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4707)


This paper proposes and analyzes the performance of a robust real-time message scheduling scheme capable of handling channel errors by exploiting an auxiliary schedule on the IEEE 802.11 WLAN. While the primary schedule is derived from the legacy EDF (Earliest Deadline First) scheme, the auxiliary schedule is generated based on the slack and arrival times of each message stream. During runtime, with the support of a channel probing functionality, the access point dynamically switches the two polling schedules according to the channel status, giving a temporaily unreachable stream more chances to meet its time constraints. Simulation results show that the proposed scheme improves the success ratio by up to 8.56 % and performs well even if the length of error duration gets larger, demonstrating that it is also robust to the bursty errors.


Wireless Sensor Network Medium Access Control Wireless Local Area Network Success Ratio Packet Error Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Carley, T., Ba, M., Barua, R., Stewart, D.: Contention-free periodic message scheduler medium access control in wireless sensor/actuator networks. In: Proc. IEEE Real-Time Systems Symposium, pp. 298–307 (2003)Google Scholar
  2. 2.
    Li, H., Shenoy, P., Ramamritham, K.: Scheduling communication in real-time sensor applications. In: Proc. 10th IEEE Real-time Embedded Technology and Applications Symposium, pp. 2065–2080 (2004)Google Scholar
  3. 3.
    Lee, J., Kang, M., Park, G.: Design of a hard real-time guarantee scheme for dual ad hoc mode IEEE 802. In: Syrotiuk, V.R., Chávez, E. (eds.) ADHOC-NOW 2005. LNCS, vol. 3738, pp. 141–152. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Vaida, N., Dugar, A., Gupta, S., Bahl, P.: Distributed fair scheduling in a wireless LAN. IEEE Transactions on Mobile Computers 4(6), 616–629 (2005)CrossRefGoogle Scholar
  5. 5.
    Liu, J.: Real-Time Systems. Prentice Hall, Englewood Cliffs (2000)Google Scholar
  6. 6.
    Adamou, M., Khanna, S., Lee, I., Shin, I., Zhou, S.: Fair real-time traffic scheduling over a wireless LAN. In: Proc. IEEE Real-Time Systems Symposium, pp. 279–288 (2001)Google Scholar
  7. 7.
    Rangnekar, A., Wang, C., Sivalingam, K., Li, B.: Multiple access protocols and scheduling algorithms of multiple channel wireless networks. Handbook of Algorithms for Mobile and Wireless Networking and Computing (2004)Google Scholar
  8. 8.
    IEEE 802.11-1999: Part 11-Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications (1999)Google Scholar
  9. 9.
    Caccamo, M., Zhang, L., Sha, L., Buttazzo, G.: An implicit prioritized access protocol for wireless sensor networks. In: Proc. IEEE Real-Time Systems Symposium (2002)Google Scholar
  10. 10.
    Choi, S., Shin, K.: A unified wireless LAN architecture for real-time and non-real-time communication services. IEEE/ACM Trans. on Networking 8, 44–59 (2000)CrossRefGoogle Scholar
  11. 11.
    Damodaran, S., Sivalingam, K.: Scheduling algorithms for multiple channel wireless local area networks. Computer Communications (2002)Google Scholar
  12. 12.
    Shah, S.H., Chen, K., Nahrstedt, K.: Dynamic bandwidth management for single-hop ad hoc wireless networks. ACM/Kluwer Mobile Networks and Applications (MONET) Journal 10, 199–217 (2005)CrossRefGoogle Scholar
  13. 13.
    Madden, S., Franklin, M., Hellerstein, J., Hong, W.: The design of an acquisitional query processor for sensor networks. In: ACM SINGMOD (2003)Google Scholar
  14. 14.
    Lee, J., Kang, M., Park, G., Kim, I., Kim, C., Park, J., Hong, J.: A real-time message scheduling scheme based on optimal earliest deadline first policy for dual channel wireless networks. In: Sha, E., Han, S.-K., Xu, C.-Z., Kim, M.H., Yang, L.T., Xiao, B. (eds.) EUC 2006. LNCS, vol. 4096, pp. 264–273. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  15. 15.
    Fall, K., Varadhan, K.: Ns notes and documentation. Technical Report. VINT project. UC-Berkeley and LBNL (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Junghoon Lee
    • 1
  • Mikyung Kang
    • 2
  • Gyung-Leen Park
    • 1
  • In-Hye Shin
    • 1
  • Hanil Kim
    • 1
  • Sang-Wook Kim
    • 3
  1. 1.Dept. of Computer Science and Statistics, Cheju National University 
  2. 2.Information Sciences Institute East, University of Southern California 
  3. 3.College of Information and Communications, Hanyang University 

Personalised recommendations