TY - GEN
T1 - Multi-services MAC protocol for wireless Networks
AU - Othman, J. Ben
AU - Castel-Taleb, H.
AU - Mokdad, L.
PY - 2005/1/1
Y1 - 2005/1/1
N2 - Due to random access in wireless networks using CSMA/CA like in Wifi networks, the integration of services with a lot of quality of service needs is impossible. In this paper, we propose to study and to evaluate a new MAC protocol that takes into account different types of traffic(e.g.. voice and data) and for each traffic, different priority levels are considered. To improve the QoS of WIFI MAC protocols, we add a selective reject and push-out mechanisms. To model our protocol, using makov chain is impossible because it provides Markov chain with a large state-space. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a less state-space that allows to compute easily performance measures. We have used stochastic comparisons of Markov chains to prove that the considered access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.
AB - Due to random access in wireless networks using CSMA/CA like in Wifi networks, the integration of services with a lot of quality of service needs is impossible. In this paper, we propose to study and to evaluate a new MAC protocol that takes into account different types of traffic(e.g.. voice and data) and for each traffic, different priority levels are considered. To improve the QoS of WIFI MAC protocols, we add a selective reject and push-out mechanisms. To model our protocol, using makov chain is impossible because it provides Markov chain with a large state-space. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a less state-space that allows to compute easily performance measures. We have used stochastic comparisons of Markov chains to prove that the considered access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.
UR - https://www.scopus.com/pages/publications/33746494470
U2 - 10.1109/AICCSA.2005.1387055
DO - 10.1109/AICCSA.2005.1387055
M3 - Conference contribution
AN - SCOPUS:33746494470
SN - 078038735X
SN - 9780780387355
T3 - 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
SP - 297
EP - 304
BT - 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
PB - IEEE Computer Society
T2 - 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
Y2 - 3 January 2005 through 6 January 2005
ER -