DocumentCode
3435726
Title
Contention Access Game Method in Wireless Ad-Hoc Networks
Author
He, Xuansen ; Tan, Linghong
Author_Institution
Coll. of Comput. & Commun., Hunan Univ., Changsha
fYear
2008
fDate
12-14 Oct. 2008
Firstpage
1
Lastpage
4
Abstract
We models the contention access as an N-person non- cooperative game firstly, then the game is transformed into a constrained optimization problem, each node in the network chooses the optimal probability to maximize its utility function, finally an algorithm is presented for solving the Nash equilibrium. Through simulation and comparison, the contention access game method can reduce the collision probability and improve the system throughput.
Keywords
ad hoc networks; game theory; optimisation; probability; radio access networks; Nash equilibrium; constrained optimization; contention access game; optimal probability; wireless ad-hoc networks; Ad hoc networks; Computer networks; Constraint optimization; Distributed computing; Educational institutions; Helium; Media Access Protocol; Multiaccess communication; Nash equilibrium; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
Conference_Location
Dalian
Print_ISBN
978-1-4244-2107-7
Electronic_ISBN
978-1-4244-2108-4
Type
conf
DOI
10.1109/WiCom.2008.597
Filename
4678505
Link To Document