Abstract
The vulnerability of wireless networks to selfish and misbehaving nodes is a well known problem. The TitFor-Tat (TFT) strategy has been proposed as a game theoretic solution to the problem, however the TFT suffers from a deadlock
vulnerability. We present a modified TFT algorithm, the Resilient Tit-For-Tat (RTFT) algorithm in which we introduce the concept of alternative strategies to complement the default strategy. This combination enables us to model a non-cooperative game in which nodes are able change their strategies in order to maximize their utilities in selfish and misbehaviour scenarios. We demonstrate
the viability of our proposal through the use of simulations
vulnerability. We present a modified TFT algorithm, the Resilient Tit-For-Tat (RTFT) algorithm in which we introduce the concept of alternative strategies to complement the default strategy. This combination enables us to model a non-cooperative game in which nodes are able change their strategies in order to maximize their utilities in selfish and misbehaviour scenarios. We demonstrate
the viability of our proposal through the use of simulations
| Original language | English |
|---|---|
| Title of host publication | Procs 11th Int Wireless Communication & Mobile Computing Conference |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Number of pages | 6 |
| ISBN (Print) | 978-1-4799-5344-8 |
| Publication status | Published - Aug 2015 |
| Event | 11th International Wireless Communication & Mobile Computing Conference - Dubrovnik , Croatia Duration: 24 Aug 2015 → 28 Aug 2015 |
Conference
| Conference | 11th International Wireless Communication & Mobile Computing Conference |
|---|---|
| Country/Territory | Croatia |
| City | Dubrovnik |
| Period | 24/08/15 → 28/08/15 |