View : 15 Download: 0

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

Title
Transformation based low complexity algorithm for Nash bargaining solutions in dynamic networks
Authors
Choi E.Park H.
Ewha Authors
박형곤
SCOPUS Author ID
박형곤scopus
Issue Date
2013
Journal Title
International Conference on Information Networking
ISSN
1976-7684JCR Link
Citation
pp. 365 - 370
Indexed
SCOPUS scopus
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. © 2013 IEEE.
DOI
10.1109/ICOIN.2013.6496405
ISBN
9781467357401
Appears in Collections:
엘텍공과대학 > 전자공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE