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
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
Design of a fast handoff scheme for real-time media application on the IEEE 802.11 wireless LAN
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
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
A fair scheduling scheme for a time-sensitive traffic over the dual-channel wireless network
Proceedings of the 2007 ACM symposium on Applied computing
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Hi-index | 0.00 |
This paper addresses the problem of scheduling time sensitive messages on dual channel wireless sensor networks. Besides the bandwidth expansion, partitioning evenly the transmission time makes it possible to inherit the optimality of EDF scheduling scheme on the dual channels based on fixed-size time slots synchronized across the two channels. Slot rearrangement also maximizes the number of switchable pairs, so the allocation can be switched dynamically between the channels according to the current channel status, enhancing the reliability of timely message delivery. Simulation results show that the rearrangement scheme can generate 70 % of switchable pairs even when the utilization reaches the saturation point, improving the ratio of successful transmission by up to 18 % when the packet error rate exceeds 0.4, compared with global EDF or NCASP