TY - JOUR
T1 - Fairness-Constrained Maximum Sum Rate of Multi-Rate CSMA Networks
AU - Sun, Xinghua
AU - Dai, Lin
PY - 2017/3/1
Y1 - 2017/3/1
N2 - This paper presents the sum rate analysis of a saturated M-group multi-rate carrier sense multiple access network, where nodes in different groups have distinct packet transmission rates. An explicit expression of the network sum rate is derived, based on which the maximum sum rate is obtained by optimizing the transmission probabilities of nodes. It is found that to achieve the maximum sum rate, only the group of nodes with the largest transmission rate is allowed to access the channel, which leads to severe unfairness. To ensure certain fairness, two constraints, namely, throughput fairness (TF) and data-rate fairness (DF), are proposed, with which each node acquires a target proportion of the network throughput and the network sum rate, respectively. Explicit expressions of the network maximum sum rate with TF and DF are derived, which show that by including the fairness constraints, the network maximum sum rate becomes inferior to that without fairness constraints as long as there is difference in the transmission rates of nodes. The analysis is further applied to IEEE 802.11 networks, where the optimal initial backoff window sizes of nodes to achieve the network maximum sum rates with both fairness constraints are derived.
AB - This paper presents the sum rate analysis of a saturated M-group multi-rate carrier sense multiple access network, where nodes in different groups have distinct packet transmission rates. An explicit expression of the network sum rate is derived, based on which the maximum sum rate is obtained by optimizing the transmission probabilities of nodes. It is found that to achieve the maximum sum rate, only the group of nodes with the largest transmission rate is allowed to access the channel, which leads to severe unfairness. To ensure certain fairness, two constraints, namely, throughput fairness (TF) and data-rate fairness (DF), are proposed, with which each node acquires a target proportion of the network throughput and the network sum rate, respectively. Explicit expressions of the network maximum sum rate with TF and DF are derived, which show that by including the fairness constraints, the network maximum sum rate becomes inferior to that without fairness constraints as long as there is difference in the transmission rates of nodes. The analysis is further applied to IEEE 802.11 networks, where the optimal initial backoff window sizes of nodes to achieve the network maximum sum rates with both fairness constraints are derived.
KW - CSMA networks
KW - Fairness
KW - maximum sum rate
UR - http://www.scopus.com/inward/record.url?scp=85015329672&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85015329672&origin=recordpage
U2 - 10.1109/TWC.2017.2653113
DO - 10.1109/TWC.2017.2653113
M3 - RGC 21 - Publication in refereed journal
SN - 1536-1276
VL - 16
SP - 1741
EP - 1754
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 3
M1 - 7817890
ER -