Concurrent Transmission Based on Channel Quality in Ad Hoc Networks: A Game Theoretic Approach

被引:0
作者
Chen, Chen [1 ]
Gao, Xinbo [2 ]
Li, Xiaoji
Pei, Qingqi [1 ]
机构
[1] Xidian Univ, Sch Telecommun, Xian, Peoples R China
[2] Xidian Univ, Video & Image Proc Syst VIPS Lab, Sch Elect Engn, Xian, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Ad Hoc networks; game theory; Nash Equilibrium Solution; concurrent transmission; POWER-CONTROL; THROUGHPUT ENHANCEMENT;
D O I
10.1587/transinf.E95.D.462
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a decentralized concurrent transmission strategy in shared channel in Ad Hoc networks is proposed based on game theory. Firstly, a static concurrent transmissions game is used to determine the candidates for transmitting by channel quality threshold and to maximize the overall throughput with consideration of channel quality variation. To achieve NES (Nash Equilibrium Solution), the selfish behaviors of node to attempt to improve the channel gain unilaterally are evaluated. Therefore, this game allows each node to be distributed and to decide whether to transmit concurrently with others or not depending on NES. Secondly, as there are always some nodes with lower channel gain than NES, which are defined as hunger nodes in this paper, a hunger suppression scheme is proposed by adjusting the price function with interferences reservation and forward relay, to fairly give hunger nodes transmission opportunities. Finally, inspired by stock trading, a dynamic concurrent transmission threshold determination scheme is implemented to make the static game practical. Numerical results show that the proposed scheme is feasible to increase concurrent transmission opportunities for active nodes, and at the same time, the number of hunger nodes is greatly reduced with the least increase of threshold by interferences reservation. Also, the good performance on network goodput of the proposed model can be seen from the results.
引用
收藏
页码:462 / 471
页数:10
相关论文
共 24 条
[1]  
Adlakha S., 2007, Competition in wireless systems via bayesian interference games
[2]   The Poisson fading channel [J].
Chakraborty, Kaushik ;
Narayan, Prakash .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (07) :2349-2364
[3]   A case for amplify-forward relaying in the block-fading multiple-access channel [J].
Chen, Deqiang ;
Azarian, Kambiz ;
Laneman, J. Nicholas .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) :3728-3733
[4]  
Daskalakis C., 2006, STOC'06. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, P71, DOI 10.1145/1132516.1132527
[5]  
Heusse M, 2003, IEEE INFOCOM SER, P836
[6]   Link scheduling with power control for throughput enhancement in multihop wireless networks [J].
Jian Tang ;
Xue, Guoliang ;
Chandler, Christopher ;
Zhang, Weiyi .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2006, 55 (03) :733-742
[7]  
Kawadia V, 2003, IEEE INFOCOM SER, P459
[8]  
Krishnaswamy D, 2004, 2004 IEEE 6TH WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING, P107
[9]  
Kumar S., 2006, Ad Hoc Networks, V4, P326, DOI 10.1016/j.adhoc.2004.10.001
[10]   Interference-Aware MAC Protocol for Wireless Networks by a Game-Theoretic Approach [J].
Lee, HyungJune ;
Kwon, Hyukjoon ;
Motskin, Arik ;
Guibas, Leonidas .
IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, :1854-1862