Ad Hoc Networks Telecommunications and Game Theory

<p>FOREWORD ix</p>
<p>INTRODUCTION xi</p>
<p>LIST OF ACRONYMS xv</p>
<p>CHAPTER 1. AD HOC NETWORKS: STUDY AND DISCUSSION OF PERFORMANCE 1</p>
<p>1.1. Introduction 1</p>
<p>1.2. Concepts specific to ad hoc networks 2</p>
<p>1.2.1. Topology 2</p>
<p>1.2.2. Connectivity 3</p>
<p>1.2.3. Mobility 4</p>
<p>1.2.4. Networks: wireless mesh network (WMN), wireless sensor networks (WSN) and mobile ad hoc network (MANET) 5</p>
<p>1.2.5. Routing 7</p>
<p>1.2.6. Weak security 9</p>
<p>1.2.7. Access to the environment 9</p>
<p>1.3. MAC protocols in mobile ad hoc networks 10</p>
<p>1.3.1. ALOHA 10</p>
<p>1.3.2. CSMA 15</p>
<p>1.4. Energy consumption in ad hoc networks 25</p>
<p>1.4.1. Energy overconsumption and/or waste 28</p>
<p>1.4.2. Toward more efficient energy consumption 30</p>
<p>1.5. Conclusion 34</p>
<p>CHAPTER 2. GAME THEORY AND COMMUNICATION NETWORKS 35</p>
<p>2.1. Introduction 35</p>
<p>2.2. Introductory concepts in game theory 38</p>
<p>2.2.1. Game 38</p>
<p>2.2.2. Player 38</p>
<p>2.2.3. Strategy (pure and mixed) 39</p>
<p>2.2.4. Utility 40</p>
<p>2.2.5. General classification of games 41</p>
<p>2.2.6. Equilibrium 44</p>
<p>2.3. Nash equilibrium 46</p>
<p>2.3.1. Definition 46</p>
<p>2.3.2. Existence 47</p>
<p>2.3.3. Uniqueness 50</p>
<p>2.3.4. Specific cases 51</p>
<p>2.4. Famous games 52</p>
<p>2.4.1. The prisoner s dilemma 52</p>
<p>2.4.2. Cournot duopoly 53</p>
<p>2.5. Applications to wireless networks 55</p>
<p>2.5.1. Routing game 56</p>
<p>2.5.2. Power control game 58</p>
<p>2.6. Conclusion 60</p>
<p>CHAPTER 3. GAMES IN SALOHA NETWORKS 61</p>
<p>3.1. Introduction 61</p>
<p>3.2. Functioning of the SALOHA algorithm 64</p>
<p>3.2.1. Study of stability 68</p>
<p>3.2.2. Transmission time 72</p>
<p>3.3. Modeling of node behavior in SALOHA with a strategic coding game 73</p>
<p>3.3.1. Issues 73</p>
<p>3.3.2. RS erasure codes 75</p>
<p>3.3.3. The impact of erasure encoding on SALOHA 79</p>
<p>3.3.4. Description of game model 80</p>
<p>3.3.5. Study of utility 83</p>
<p>3.3.6. Discussion of equilibrium 84</p>
<p>3.4. SALOHA network performance at Nash equilibrium 86</p>
<p>3.4.1. Coding cost 86</p>
<p>3.4.2. Loss rate 87</p>
<p>3.4.3. Output 88</p>
<p>3.4.4. Stability 90</p>
<p>3.4.5. Transmission time 91</p>
<p>3.5. Conclusion 92</p>
<p>CHAPTER 4. GAMES IN CSMA NETWORKS 93</p>
<p>4.1. Introduction 93</p>
<p>4.2. CMSA performance 95</p>
<p>4.3. Sources of problems in CSMA networks 99</p>
<p>4.4. Modeling of node behavior in CSMA using a strategic coding game 100</p>
<p>4.4.1. Game model analysis 100</p>
<p>4.4.2. Utility function 101</p>
<p>4.4.3. Discussion of equilibrium 103</p>
<p>4.5. CSMA performances at equilibrium 105</p>
<p>4.5.1. Coding/decoding price (cost) 105</p>
<p>4.5.2. Output 106</p>
<p>4.5.3. Transmission time 108</p>
<p>4.5.4. Energy optimization at equilibrium 109</p>
<p>4.6. Conclusion 110</p>
<p>CONCLUSION 113</p>
<p>BIBLIOGRAPHY 119</p>
<p>INDEX 139</p>