DocumentCode :
1800357
Title :
Non-cooperative power scheduling for wireless MIMO networks
Author :
Zhou, Chao ; Xu, Yizhi ; Oanh, Bui Thi ; Xu, Pingping
Author_Institution :
Nat. Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China
fYear :
2010
fDate :
20-22 Oct. 2010
Firstpage :
164
Lastpage :
167
Abstract :
This paper presents a non-cooperative method to maximize the throughput of a set of distributed links in wireless MIMO ad hoc networks. The space-time power scheduling in each link is built into a non-cooperative game where its utility function is identified and maximized. The link quality is introduced into the pricing function in order to obtain Pareto improvement. The gradient projection methods are compared with the proposed game theoretic approach by simulations, and the results show that the proposed method provides a distributed scheduling of resources with low computational complexity and without significantly sacrificing the network throughput.
Keywords :
MIMO communication; Pareto analysis; ad hoc networks; computational complexity; game theory; gradient methods; scheduling; Pareto improvement; computational complexity; distributed links; game theory; gradient projection methods; link quality; network throughput; noncooperative game; noncooperative power scheduling; pricing function; space-time power scheduling; utility function; wireless MIMO ad hoc networks; Ad hoc networks; Covariance matrix; Games; MIMO; Nash equilibrium; Pricing; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Technologies for Communications (ATC), 2010 International Conference on
Conference_Location :
Ho Chi Minh City
Print_ISBN :
978-1-4244-8875-9
Type :
conf
DOI :
10.1109/ATC.2010.5672742
Filename :
5672742
Link To Document :
بازگشت