Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/optimal-forwarding-for-wireless-ad-hoc-networks-with-game-theory-mR8Syqifi5
References (30)
-
P. Michiardi, R. Molva (2005)
Analysis of coalition formation and cooperation strategies in mobile ad hoc networksAd Hoc Networks, 3
-
Fei Xue, Lu Yan (2007)
Formal approach to fault diagnosis in distributed discrete event systems with OBDDInnovations in Systems and Software Engineering, 3
-
M. Osborne, Ariel Rubinstein (1995)
A Course in Game Theory, 1
-
S. Zhong, Jiang Chen, Y. Yang (2003)
Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networksIEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 3
-
Luzi Anderegg, S. Eidenbenz (2003)
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents -
L. Dasilva, Vivek Srivastava (2004)
Node Participation in Ad Hoc and Peer-to-Peer Networks: A Game-Theoretic Formulation -
V. Srinivasan, P. Nuggehalli, C. Chiasserini, R. Rao (2003)
Cooperation in wireless ad hoc networksIEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2
-
V. Georgiev (2008)
Using Game Theory to Analyze Wireless Ad Hoc Networks . ” -
R. Hoffmann (2000)
Twenty Years on: The Evolution of Cooperation RevisitedJ. Artif. Soc. Soc. Simul., 3
-
Z. Fang, B. Bensaou (2004)
Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networksIEEE INFOCOM 2004, 2
-
F. Milan, J. Jaramillo, R. Srikant (2006)
Achieving cooperation in multihop wireless networks of selfish nodes -
G. Hardin (1968)
Tragedy of the CommonsScience, 162
-
Tirthankar Ghosh, N. Pissinou, S. Makki (2005)
Towards Designing a Trusted Routing Solution in Mobile Ad Hoc NetworksMobile Networks and Applications, 10
-
Lu Yan, S. Hailes, L. Capra (2008)
Analysis of Packet Relaying Models and Incentive Strategies in Wireless Ad Hoc Networks with Game Theory22nd International Conference on Advanced Information Networking and Applications (aina 2008)
-
M. Nowak, K. Sigmund (1992)
Tit for tat in heterogeneous populationsNature, 355
-
D. Quercia, M. Lad, S. Hailes, L. Capra, S. Bhatti (2006)
STRUDEL: supporting trust in the dynamic establishment of peering coalitionsProceedings of the 2006 ACM symposium on Applied computing
-
J. Smith, G. Price (1973)
The Logic of Animal ConflictNature, 246
-
M. Refaei, Vivek Srivastava, L. Dasilva, M. Eltoweissy (2005)
A reputation-based mechanism for isolating selfish nodes in ad hoc networksThe Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
-
S. Buchegger, J. Boudec (2002)
Performance analysis of the CONFIDANT protocol -
D. Ashlock, Eun-Youn Kim, N. Leahy (2006)
Understanding representational sensitivity in the iterated prisoner's dilemma with fingerprintsIEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 36
-
Takamasa Shishido, H. Shishido (2001)
Alternating continuous Prisoner's Dilemma2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236), 2
-
S. Marti, T. Giuli, Kevin Lai, Mary Baker (2000)
Mitigating routing misbehavior in mobile ad hoc networks -
L. Buttyán, J. Hubaux (2000)
Enforcing service availability in mobile ad-hoc WANs2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444)
-
Qi He, D. Wu, P. Khosla (2004)
SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), 2
-
G. Mailath, L. Samuelson (2006)
Repeated Games and Reputations -
Xiaoqi Li, Gigi Cse, J. Jaramillo, R. Srikant, Adaptive Distributed (2007)
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks -
M. Nowak, K. Sigmund (1993)
A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner's Dilemma gameNature, 364
-
G. Sugihara, R. May (1990)
Nonlinear forecasting as a way of distinguishing chaos from measurement error in time seriesNature, 344
-
Robert May (1981)
The evolution of cooperationNature, 292
-
B. Raghavan, A. Snoeren (2003)
Priority Forwarding in Ad Hoc Networks with Self-Interested Parties
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd. All rights reserved
- ISSN
- 1754-8632
- eISSN
- 1754-8640
- DOI
- 10.1504/IJAACS.2008.021491
- Publisher site
- See Article on Publisher Site
Abstract
Every node in a wireless ad hoc network is both end host (it generates its own data and routing traffic) and infrastructure (it forwards traffic for others), but rational nodes have no incentive to cooperatively forward traffic for others, since this kind of forwarding is not costless. In this article, we use game theory to analyse cooperative mechanisms and derive optimal criteria in forwarding. Distinguished from previous works, we take the consideration of realistic scenarios such as noise, non-simultaneously, non-perfect measurement and different strategies by the nodes.
Journal
International Journal of Autonomous and Adaptive Communications Systems – Inderscience Publishers
Published: Jan 1, 2008