Some game-theoretic problems in wireless ad hoc networks
NGI 2005, 1st Conference on Next Generation Internet Networks, Traffic Engineering, April 18-20 2005, Rome, Italy- Selected Papers. Lecture Notes in Computer Science Volume 3427
Wireless Ad-hoc networks are expected to be made up of energy aware entities (nodes) interested in their own perceived performance. We consider a simple random access model for a wireless ad hoc network to address problems of finding an optimal channel access rate and providing incentive for cooperation to forward other nodes traffic. By casting these problems as noncooperative games, we derive conditions for the Nash equilibrium and provide distributed algorithms to learn the Nash equilibrium. Keywords. Game theory, Stochastic approximation algorithm.
| Type: | Conférence |
| Langue: | English |
| Ville: | Rome |
| Pays: | ITALIE |
| Date: | Avril 2005 |
| Département: | Réseaux et Sécurité |
| Eurecom ref: | 1525 |
| Copyright: | © Springer. Personal use of this material is permitted. The definitive version of this paper was published in NGI 2005, 1st Conference on Next Generation Internet Networks, Traffic Engineering, April 18-20 2005, Rome, Italy- Selected Papers. Lecture Notes in Computer Science Volume 3427 and is available at : http://dx.doi.org/10.1007/b107131 |
| Bibtex: | @inproceedings{EURECOM+1525, doi = {http://dx.doi.org/10.1007/b107131}, year = {2005}, title = {{S}ome game-theoretic problems in wireless ad hoc networks}, author = {{A}ltman, {E}itan and {B}orkar, {V}ivek {S} and {K}herani, {A}rzad {A} and {M}ichiardi, {P}ietro and {M}olva, {R}efik}, booktitle = {{NGI} 2005, 1st {C}onference on {N}ext {G}eneration {I}nternet {N}etworks, {T}raffic {E}ngineering, {A}pril 18-20 2005, {R}ome, {I}taly- {S}elected {P}apers. {L}ecture {N}otes in {C}omputer {S}cience {V}olume 3427}, address = {{R}ome, {ITALIE}}, month = {04}, url = {http://www.eurecom.fr/publication/1525} } |
| Voir aussi: |
|
Permalink: http://www.eurecom.fr/publication/1525
