This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2013 International Conference on Information Networking (ICOIN)
Transformation based low complexity algorithm for Nash bargaining solutions in dynamic networks
Bangkok Thailand
January 28-January 30
ISBN: 978-1-4673-5740-1
Eunhye Choi, Multimedia Communications and Networking Laboratory Ewha Womans University, Seoul, Korea
Hyunggon Park, Multimedia Communications and Networking Laboratory Ewha Womans University, Seoul, Korea
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.
Index Terms:
Intra NBS,Multimedia resource fair allocation,Nash bargaining solution (NBS),gradual bargaining
Citation:
Eunhye Choi, Hyunggon Park, "Transformation based low complexity algorithm for Nash bargaining solutions in dynamic networks," icoin, pp.365-370, 2013 International Conference on Information Networking (ICOIN), 2013
Usage of this product signifies your acceptance of the Terms of Use.