Open AccessTwo‐dimensional distributed coordination function model with finite buffer sizes
Author(s) -
You Zihao,
Lu ITai
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.1227
Subject(s) - computer science , markov chain , throughput , network packet , function (biology) , distributed coordination function , collision , buffer (optical fiber) , markov process , distributed computing , algorithm , mathematical optimization , mathematics , computer network , machine learning , wireless , statistics , telecommunications , computer security , evolutionary biology , ieee 802.11 , biology
This study presents an unsaturated two‐dimensional (2D) Markov model to analyse the packet collision probability and the throughput performances of the stations (STAs) in a distributed coordination function network. Compared with the previous 2D models, it takes the flexible buffer size of the STA into consideration. Compared with the 3D models, it has the advantage of low complexity by avoiding matrix operations. From the numerical results, the authors explain the approximations used in the analytical models proposed in the common existing literatures, and discuss their effect on the model accuracy.