View : 8 Download: 0

Direction Vector-Based Algorithm for the Nash Bargaining Solution in Dynamic Networks

Title
Direction Vector-Based Algorithm for the Nash Bargaining Solution in Dynamic Networks
Authors
Choi J.Park H.
Ewha Authors
박형곤
SCOPUS Author ID
박형곤scopus
Issue Date
2018
Journal Title
IEEE Communications Letters
ISSN
1089-7798JCR Link
Citation
vol. 22, no. 7, pp. 1342 - 1345
Keywords
direction vectordynamic networksNash bargaining solutionResource allocation
Publisher
Institute of Electrical and Electronics Engineers Inc.
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
It is essential for multiuser networks to determine how to efficiently and fairly allocate shared and limited resources. Moreover, it is critical to optimally allocate these resources while ensuring quality of service requirements for users who require tolerable levels of quality. In this letter, we adopt a game-theoretic approach, referred to as the Nash bargaining solution (NBS), for resource allocation across multiple users. While the NBS can provide a fair and optimal resource allocation, finding the NBS is generally a computationally-intensive task, which becomes even more difficult in dynamic networks. We propose a direction vector-based approach that finds accurate solutions to a bargaining problem with relatively low and consistent complexity requirements. The proposed approach exploits the relationship between the direction vectors of utility functions of each user and is used to reduce the search space of the feasible utility set. The simulation results confirm that the proposed approach can efficiently compute the NBS even for a considerable number of users and resources with better accuracy. © 1997-2012 IEEE.
DOI
10.1109/LCOMM.2018.2819644
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