View : 12 Download: 0

Efficient resource allocation strategies based on nash bargaining solution with linearized constraints

Title
Efficient resource allocation strategies based on nash bargaining solution with linearized constraints
Authors
Choi J.Jung S.Park H.
Ewha Authors
박형곤
SCOPUS Author ID
박형곤scopus
Issue Date
2016
Journal Title
Transactions of the Korean Institute of Electrical Engineers
ISSN
1975-8359JCR Link
Citation
vol. 65, no. 3, pp. 463 - 468
Keywords
Convex optimizationNash bargaining solutionPiecewise linearResource management
Publisher
Korean Institute of Electrical Engineers
Indexed
SCOPUS; KCI scopus
Abstract
The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach. Copyright ©The Korean Institute of Electrical Engineers.
DOI
10.5370/KIEE.2016.65.3.463
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