Paper Info
Title
Selfishness, Not Always A Nightmare: Modeling Selfish MAC Behaviors in Wireless Mobile Ad Hoc Networks
Abstract
In wireless mobile ad hoc networks where nodes are selfish and non-cooperative, a natural and crucial question is how well or how bad the MAC layer protocol IEEE 802.11 DCF performs. In this paper, we study this question by modeling the selfish MAC protocol as a non- cooperative repeated game where players follow the TIT- FOR-TAT (TFT) strategy which is regarded as the best strategy in such environments. We show for single-hop ad hoc networks the game admits a number of Nash Equilibria (NE). We then perform NE refinement to eliminate the inefficient NE and show that there exists one efficient NE maximizing both local and global payoff. We also propose an algorithm to approach the efficient NE. We then extend our efforts to multi-hop case by showing that the game converges to a NE which may not be globally optimal but quasi- optimal in the sense that the global payoff is only slightly less than the optimal case. As conclusion, we answer the posed question by showing that selfishness does not always lead to network collapse. On the contrary, it can help the network operate at a NE globally which is optimal or quasi-optimal under the condition that players are long-sighted and follow the TFT strategy.
Year
DOI
Venue
2007
10.1109/ICDCS.2007.138
ICDCS
Keywords
Field
DocType
ieee 802.11 dcf,wireless mobile ad hoc network,optimal case,noncooperative repeated game,efficient ne,global payoff,tit-for-tat strategy,nash equilibria,game theory,mobile radio,crucial question,modeling selfish mac behaviors,access protocols,single-hop ad hoc network,tft strategy,ad hoc networks,game converges,wireless lan,best strategy,wireless mobile ad hoc,inefficient ne,ne refinement,mac layer protocol,feedback,mobile ad hoc networks,ad hoc network,wireless ad hoc network,global optimization,tit for tat strategy,stability,wireless application protocol,markov chain,predictive models,tit for tat,repeated game,thin film transistors,mobile ad hoc network,spread spectrum communication
Mobile ad hoc network,Tit for tat,Computer science,Computer network,Repeated game,Game theory,Selfishness,Wireless ad hoc network,Nash equilibrium,Stochastic game,Distributed computing
Conference
ISSN
ISBN
Citations 
1063-6927 E-ISBN : 0-7695-2837-3
0-7695-2837-3
19
PageRank 
References 
Authors
1.00
7
2
Name
Order
Citations
PageRank
Lin Chen131231.64
Jean Leneutre220317.73