A unified wireless LAN architecture for real-time and non-real-time communication services
IEEE/ACM Transactions on Networking (TON)
An Implicit Prioritized Access Protocol for Wireless Sensor Networks
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Fair Real-Time Traffic Scheduling over a Wireless LAN
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Scheduling Communication in Real-Time Sensor Applications
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Dynamic bandwidth management in single-hop ad hoc wireless networks
Mobile Networks and Applications
Distributed Fair Scheduling in a Wireless LAN
IEEE Transactions on Mobile Computing
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Design of a hard real-time guarantee scheme for dual ad hoc mode IEEE 802.11 WLANs
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Scheduling algorithms for multiple channel wireless local area networks
Computer Communications
Hi-index | 0.00 |
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.11WLAN. 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.