Optimal bandwidth allocation with dynamic service selection in heterogeneous wireless networks

22Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Bandwidth allocation for different service classes in heterogeneous wireless networks is an important issue for service provider in terms of balancing service quality and profit. It is especially challenging when considering the dynamic competition both among service providers and among users. To address this problem, a two-level game framework is developed in this paper. The underlying dynamic service selection is modeled as an evolutionary game based on replicator dynamics. An upper bandwidth allocation differential game is formulated to model the competition among different service providers. The service selection distribution of the underlying evolutionary game describes the state of the upper differential game. An openloop Nash equilibrium is considered to be the solution of this linear state differential game. The proposed framework can be implemented with minimum communication cost since no information broadcasting is required. Also, we observe that the selfish behavior of service providers can also maximize the social welfare. ©2010 IEEE.

Cite

CITATION STYLE

APA

Zhu, K., Niyato, D., & Wang, P. (2010). Optimal bandwidth allocation with dynamic service selection in heterogeneous wireless networks. In GLOBECOM - IEEE Global Telecommunications Conference. Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/GLOCOM.2010.5683238

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free