Transformation based low complexity algorithm for Nash bargaining solutions in dynamic networks

Eunhye Choi, Hyunggon Park

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Efficient and fast resource allocation has become important as the multimedia applications are deployed over multi-user and resource constrained networks. In order to ensure the Quality of Service (QoS) and the collaboration among users resource management strategies based on the cooperative game theory have been proposed. Specifically, we deploy the Nash bargaining solution (NBS) for fair and optimal resource allocation while explicitly considering delay constraints, minimum quality and multimedia characteristics of each user. Moreover, we consider a time-varying channel condition where a fast resource allocation is essential for ensuring QoS. In order to reduce the computational complexity required to find the NBS, we propose a low complexity algorithm based on a transformation that exploits the relationship between feasible utility sets adjacent over time. We show that the complexity required to find the NBS based on the proposed algorithm can be significantly reduced with improved accuracy.

Original languageEnglish
Title of host publicationInternational Conference on Information Networking 2013, ICOIN 2013
Pages365-370
Number of pages6
DOIs
StatePublished - 2013
Event27th International Conference on Information Networking, ICOIN 2013 - Bangkok, Thailand
Duration: 27 Jan 201330 Jan 2013

Publication series

NameInternational Conference on Information Networking
ISSN (Print)1976-7684

Conference

Conference27th International Conference on Information Networking, ICOIN 2013
Country/TerritoryThailand
CityBangkok
Period27/01/1330/01/13

Keywords

  • gradual bargaining
  • Intra NBS
  • Multimedia resource fair allocation
  • Nash bargaining solution (NBS)

Fingerprint

Dive into the research topics of 'Transformation based low complexity algorithm for Nash bargaining solutions in dynamic networks'. Together they form a unique fingerprint.

Cite this