Efficient resource allocation for delay-sensitive traffic, such as telephony and video streaming, in Orthogonal Frequency Division Multiple Access (OFDMA) networks is needed to increase system performance. In our system, users try to achieve a low queuing delay and buffer space usage by competing for transmission over the subchannels. We formulate this problem as a bargaining game and use the Nash Bargaining Solution (NBS) to realize a fair and efficient subchannel allocation for the users. Simulation results show performance improvements, with regard to packet dropping and delay distribution, over other algorithms.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Hui DENG, Xiaoming TAO, Youzheng WANG, Jianhua LU, "Subchannel Allocation with Nash Bargaining Solutions for Delay Sensitive Traffic in OFDMA Networks" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 4, pp. 1110-1113, April 2011, doi: 10.1587/transcom.E94.B.1110.
Abstract: Efficient resource allocation for delay-sensitive traffic, such as telephony and video streaming, in Orthogonal Frequency Division Multiple Access (OFDMA) networks is needed to increase system performance. In our system, users try to achieve a low queuing delay and buffer space usage by competing for transmission over the subchannels. We formulate this problem as a bargaining game and use the Nash Bargaining Solution (NBS) to realize a fair and efficient subchannel allocation for the users. Simulation results show performance improvements, with regard to packet dropping and delay distribution, over other algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.1110/_p
Copy
@ARTICLE{e94-b_4_1110,
author={Hui DENG, Xiaoming TAO, Youzheng WANG, Jianhua LU, },
journal={IEICE TRANSACTIONS on Communications},
title={Subchannel Allocation with Nash Bargaining Solutions for Delay Sensitive Traffic in OFDMA Networks},
year={2011},
volume={E94-B},
number={4},
pages={1110-1113},
abstract={Efficient resource allocation for delay-sensitive traffic, such as telephony and video streaming, in Orthogonal Frequency Division Multiple Access (OFDMA) networks is needed to increase system performance. In our system, users try to achieve a low queuing delay and buffer space usage by competing for transmission over the subchannels. We formulate this problem as a bargaining game and use the Nash Bargaining Solution (NBS) to realize a fair and efficient subchannel allocation for the users. Simulation results show performance improvements, with regard to packet dropping and delay distribution, over other algorithms.},
keywords={},
doi={10.1587/transcom.E94.B.1110},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Subchannel Allocation with Nash Bargaining Solutions for Delay Sensitive Traffic in OFDMA Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1110
EP - 1113
AU - Hui DENG
AU - Xiaoming TAO
AU - Youzheng WANG
AU - Jianhua LU
PY - 2011
DO - 10.1587/transcom.E94.B.1110
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2011
AB - Efficient resource allocation for delay-sensitive traffic, such as telephony and video streaming, in Orthogonal Frequency Division Multiple Access (OFDMA) networks is needed to increase system performance. In our system, users try to achieve a low queuing delay and buffer space usage by competing for transmission over the subchannels. We formulate this problem as a bargaining game and use the Nash Bargaining Solution (NBS) to realize a fair and efficient subchannel allocation for the users. Simulation results show performance improvements, with regard to packet dropping and delay distribution, over other algorithms.
ER -