DocumentCode
2503577
Title
Cooperative Power Scheduling for Wireless MIMO Networks
Author
Nokleby, Matthew ; Swindlehurst, A. Lee ; Rong, Yue ; Hua, Yingbo
Author_Institution
Brigham Young Univ., Provo
fYear
2007
fDate
26-30 Nov. 2007
Firstpage
2982
Lastpage
2986
Abstract
We examine signaling strategies for wireless MIMO networks with interference. Previous approaches have focused on maximizing either individual or total throughput, resulting in an inefficient or potentially unfair allocation of resources. We propose two methods motivated by game-theoretic results. First, we extend the non-cooperative Nash equilibrium proposed in previous literature. Second, we present a cooperative method based on the Nash bargaining solution which provides an axiomatic arbitration scheme. Simulation results show that the Nash bargaining solution provides a fair allocation of resources without significantly sacrificing total throughput.
Keywords
MIMO communication; game theory; interference (signal); radio networks; scheduling; telecommunication signalling; Nash bargaining solution; axiomatic arbitration scheme; cooperative power scheduling; game-theoretic results; interference; non-cooperative Nash equilibrium; resources allocation; signaling strategies; wireless MIMO networks; Computer networks; Covariance matrix; Interference; MIMO; Mutual information; Nash equilibrium; Power engineering and energy; Power engineering computing; Throughput; Time division multiple access;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location
Washington, DC
Print_ISBN
978-1-4244-1042-2
Electronic_ISBN
978-1-4244-1043-9
Type
conf
DOI
10.1109/GLOCOM.2007.565
Filename
4411475
Link To Document