Abstract
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.
This research was supported by the MIC, Korea, under the ITRC support program supervised by the IITA (IITA-2005-C1090-0502-0009).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rangnekar, A., Wang, C., Sivalingam, K., Li, B.: Multiple access protocols and scheduling algorithms of multiple channel wireless networks. In: Handbook of Algorithms for Mobile and Wireless Networking and Computing (2004)
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)
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)
Carpenter, J., Funk, S., Holman, P., Srinivasan, A., Anderson, J., Baruah, S.: A categorization of real-time multiprocessor scheduling problems and algorithms. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapman Hall/CRC Press (2003)
Liu, J.: Real-Time Systems. Prentice-Hall, Englewood Cliffs (2000)
IEEE 802.11-1999: Part 11-Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications (1999)
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)
Lee, J., Kang, M., Park, G.: Design of a hard real-time guarantee scheme for dual ad hoc mode IEEE 802.11 WLANs. In: Syrotiuk, V.R., Chávez, E. (eds.) ADHOC-NOW 2005. LNCS, vol. 3738, pp. 141–152. Springer, Heidelberg (2005)
Damodaran, S., Sivalingam, K.: Scheduling algorithms for multiple channel wireless local area networks. Computer Communications (2002)
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)
Kang, M., Lee, J., Hong, J., Kim, J.: Design of a fast handoff scheme for real-time media application on the IEEE 802.11 wireless LAN. In: International Conference on Computational Science. LNCS. Springer, Heidelberg (accepted, 2006)
Shah, S., 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)
Madden, S., Franklin, M., Hellerstein, J., Hong, W.: The design of an acquisitional query processor for sensor networks. In: ACM SINGMOD 2003 (2003)
Fall, K., Varadhan, K.: Ns notes and documentation. Technical Report. VINT project. UC-Berkeley and LBNL (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, J. et al. (2006). A Real-Time Message Scheduling Scheme Based on Optimal Earliest Deadline First Policy for Dual Channel Wireless Networks. In: Sha, E., Han, SK., Xu, CZ., Kim, MH., Yang, L.T., Xiao, B. (eds) Embedded and Ubiquitous Computing. EUC 2006. Lecture Notes in Computer Science, vol 4096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802167_28
Download citation
DOI: https://doi.org/10.1007/11802167_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36679-9
Online ISBN: 978-3-540-36681-2
eBook Packages: Computer ScienceComputer Science (R0)