By Topic

Multi-User Multi-Service Rate Allocation Scheme Using Nash Bargaining Solution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zelang Wang ; Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou, China ; Huifang Chen ; Lei Xie

How to allocate rate to users with multiple services efficiently and fairly is an important issue in the wireless network. To ensure the quality of service required by multiple services of a user, efficient resource management becomes paramount. On the other hand, the fairness between users is also necessary. In this paper, we propose a bandwidth allocation scheme named as Efficiency and Inter-user Fairness (EIF). In the EIF scheme, the well-known game theoretic concept of Nash bargaining solution is deployed to allocate the total network bandwidth to users fairly and dispatch rate from user to services efficiently by maximizing the user's utility. We also propose a distributed algorithm for implementing the convex optimization problem in the EIF scheme. Simulation results show that the EIF scheme outperforms the compared schemes in that it considers both the system efficiency and the user's fairness, while other schemes only maximizes the total utility of all of the services or considers the user's fairness.

Published in:

Vehicular Technology Conference (VTC Fall), 2011 IEEE

Date of Conference:

5-8 Sept. 2011