Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks Export

@inproceedings{citeulike:801078, abstract = {In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: firstly, a throughput model based on Markovian analysis is proposed for the CSMA/CA network with a general topology. Simulation investigations are presented to verify its performance. Secondly, fairness issues in CSMA/CA networks are discussed based on the throughput model. The origin of unfairness is explained and the trade-off between throughput and fairness is illustrated. Thirdly, throughput approximations based on local topology information are proposed and their performances are investigated. Fourthly, three different fairness metrics are presented and their distributed implementations, based on the throughput approximation, are proposed.}, author = {Wang, Xin and Kar, K.}, citeulike-article-id = {801078}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1497875}, journal = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE}, keywords = {ad-hoc, fairness}, pages = {23--34 vol. 1}, posted-at = {2006-08-14 18:04:35}, priority = {2}, title = {Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1497875}, volume = {1}, year = {2005} }

TY - CONF ID - citeulike:801078 L3 - citeulike-article-id:801078 N2 - In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: firstly, a throughput model based on Markovian analysis is proposed for the CSMA/CA network with a general topology. Simulation investigations are presented to verify its performance. Secondly, fairness issues in CSMA/CA networks are discussed based on the throughput model. The origin of unfairness is explained and the trade-off between throughput and fairness is illustrated. Thirdly, throughput approximations based on local topology information are proposed and their performances are investigated. Fourthly, three different fairness metrics are presented and their distributed implementations, based on the throughput approximation, are proposed. JF - INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE EP - 34 vol. 1 TI - Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks VL - 1 SP - 23 KW - ad-hoc KW - fairness AU - Wang, Xin AU - Kar, K PY - 2005/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1497875 ER -