Abstract
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario where two stations with different deadlines contend for the channel. For this scenario a Markov chain based analytical model is proposed. From the mathematical model, we derive expressions of the saturation throughout and the average medium access delay called service time. Analytical results are validated by simulation results using the ns-2 network simulator. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Korbi, I. E., & Saidane, L. A. (2007). Deadline monotonie policy over 802.11 throughput and average service time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4864 LNCS, pp. 350–362). https://doi.org/10.1007/978-3-540-77024-4_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
