Malek Benslama is Professor at the University of Constantine 1 in Algeria. He is a member of the scientific and technical advisory council for the Algerian Space Agency. His research centers on the field of space and communication networks.Hadj Batatia works at IRIT ENSEEIHT in Toulouse, France.Mohamed Lamine Boucenna works at the University of Constantine 1 in Algeria.

• FOREWORD ixINTRODUCTION xiLIST OF ACRONYMS xvCHAPTER 1. AD HOC NETWORKS: STUDY AND DISCUSSION OF PERFORMANCE 11.1. Introduction 11.2. Concepts specific to ad hoc networks 21.2.1. Topology 21.2.2. Connectivity 31.2.3. Mobility 41.2.4. Networks: wireless mesh network (WMN), wireless sensor networks (WSN) and mobile ad hoc network (MANET) 51.2.5. Routing 71.2.6. Weak security 91.2.7. Access to the environment 91.3. MAC protocols in mobile ad hoc networks 101.3.1. ALOHA 101.3.2. CSMA 151.4. Energy consumption in ad hoc networks 251.4.1. Energy overconsumption and/or waste 281.4.2. Toward more efficient energy consumption 301.5. Conclusion 34CHAPTER 2. GAME THEORY AND COMMUNICATION NETWORKS 352.1. Introduction 352.2. Introductory concepts in game theory 382.2.1. Game 382.2.2. Player 382.2.3. Strategy (pure and mixed) 392.2.4. Utility 402.2.5. General classification of games 412.2.6. Equilibrium 442.3. Nash equilibrium 462.3.1. Definition 462.3.2. Existence 472.3.3. Uniqueness 502.3.4. Specific cases 512.4. Famous games 522.4.1. The prisoner’s dilemma 522.4.2. Cournot duopoly 532.5. Applications to wireless networks 552.5.1. Routing game 562.5.2. Power control game 582.6. Conclusion 60CHAPTER 3. GAMES IN SALOHA NETWORKS 613.1. Introduction 613.2. Functioning of the SALOHA algorithm 643.2.1. Study of stability 683.2.2. Transmission time 723.3. Modeling of node behavior in SALOHA with a strategic coding game 733.3.1. Issues 733.3.2. RS erasure codes 753.3.3. The impact of erasure encoding on SALOHA 793.3.4. Description of game model 803.3.5. Study of utility 833.3.6. Discussion of equilibrium 843.4. SALOHA network performance at Nash equilibrium 863.4.1. Coding cost 863.4.2. Loss rate 873.4.3. Output 883.4.4. Stability 903.4.5. Transmission time 913.5. Conclusion 92CHAPTER 4. GAMES IN CSMA NETWORKS 934.1. Introduction 934.2. CMSA performance 954.3. Sources of problems in CSMA networks 994.4. Modeling of node behavior in CSMA using a strategic coding game 1004.4.1. Game model analysis 1004.4.2. Utility function 1014.4.3. Discussion of equilibrium 1034.5. CSMA performances at equilibrium 1054.5.1. Coding/decoding price (cost) 1054.5.2. Output 1064.5.3. Transmission time 1084.5.4. Energy optimization at equilibrium 1094.6. Conclusion 110CONCLUSION 113BIBLIOGRAPHY 119INDEX 139

Malek Benslama is Professor at the University of Constantine 1 in Algeria. He is a member of the scientific and technical advisory council for the Algerian Space Agency. His research centers on the field of space and communication networks.Hadj Batatia works at IRIT ENSEEIHT in Toulouse, France.Mohamed Lamine Boucenna works at the University of Constantine 1 in Algeria.

• FOREWORD ixINTRODUCTION xiLIST OF ACRONYMS xvCHAPTER 1. AD HOC NETWORKS: STUDY AND DISCUSSION OF PERFORMANCE 11.1. Introduction 11.2. Concepts specific to ad hoc networks 21.2.1. Topology 21.2.2. Connectivity 31.2.3. Mobility 41.2.4. Networks: wireless mesh network (WMN), wireless sensor networks (WSN) and mobile ad hoc network (MANET) 51.2.5. Routing 71.2.6. Weak security 91.2.7. Access to the environment 91.3. MAC protocols in mobile ad hoc networks 101.3.1. ALOHA 101.3.2. CSMA 151.4. Energy consumption in ad hoc networks 251.4.1. Energy overconsumption and/or waste 281.4.2. Toward more efficient energy consumption 301.5. Conclusion 34CHAPTER 2. GAME THEORY AND COMMUNICATION NETWORKS 352.1. Introduction 352.2. Introductory concepts in game theory 382.2.1. Game 382.2.2. Player 382.2.3. Strategy (pure and mixed) 392.2.4. Utility 402.2.5. General classification of games 412.2.6. Equilibrium 442.3. Nash equilibrium 462.3.1. Definition 462.3.2. Existence 472.3.3. Uniqueness 502.3.4. Specific cases 512.4. Famous games 522.4.1. The prisoner’s dilemma 522.4.2. Cournot duopoly 532.5. Applications to wireless networks 552.5.1. Routing game 562.5.2. Power control game 582.6. Conclusion 60CHAPTER 3. GAMES IN SALOHA NETWORKS 613.1. Introduction 613.2. Functioning of the SALOHA algorithm 643.2.1. Study of stability 683.2.2. Transmission time 723.3. Modeling of node behavior in SALOHA with a strategic coding game 733.3.1. Issues 733.3.2. RS erasure codes 753.3.3. The impact of erasure encoding on SALOHA 793.3.4. Description of game model 803.3.5. Study of utility 833.3.6. Discussion of equilibrium 843.4. SALOHA network performance at Nash equilibrium 863.4.1. Coding cost 863.4.2. Loss rate 873.4.3. Output 883.4.4. Stability 903.4.5. Transmission time 913.5. Conclusion 92CHAPTER 4. GAMES IN CSMA NETWORKS 934.1. Introduction 934.2. CMSA performance 954.3. Sources of problems in CSMA networks 994.4. Modeling of node behavior in CSMA using a strategic coding game 1004.4.1. Game model analysis 1004.4.2. Utility function 1014.4.3. Discussion of equilibrium 1034.5. CSMA performances at equilibrium 1054.5.1. Coding/decoding price (cost) 1054.5.2. Output 1064.5.3. Transmission time 1084.5.4. Energy optimization at equilibrium 1094.6. Conclusion 110CONCLUSION 113BIBLIOGRAPHY 119INDEX 139

Malek Benslama is Professor at the University of Constantine 1 in Algeria. He is a member of the scientific and technical advisory council for the Algerian Space Agency. His research centers on the field of space and communication networks.Hadj Batatia works at IRIT ENSEEIHT in Toulouse, France.Mohamed Lamine Boucenna works at the University of Constantine 1 in Algeria.

• FOREWORD ixINTRODUCTION xiLIST OF ACRONYMS xvCHAPTER 1. AD HOC NETWORKS: STUDY AND DISCUSSION OF PERFORMANCE 11.1. Introduction 11.2. Concepts specific to ad hoc networks 21.2.1. Topology 21.2.2. Connectivity 31.2.3. Mobility 41.2.4. Networks: wireless mesh network (WMN), wireless sensor networks (WSN) and mobile ad hoc network (MANET) 51.2.5. Routing 71.2.6. Weak security 91.2.7. Access to the environment 91.3. MAC protocols in mobile ad hoc networks 101.3.1. ALOHA 101.3.2. CSMA 151.4. Energy consumption in ad hoc networks 251.4.1. Energy overconsumption and/or waste 281.4.2. Toward more efficient energy consumption 301.5. Conclusion 34CHAPTER 2. GAME THEORY AND COMMUNICATION NETWORKS 352.1. Introduction 352.2. Introductory concepts in game theory 382.2.1. Game 382.2.2. Player 382.2.3. Strategy (pure and mixed) 392.2.4. Utility 402.2.5. General classification of games 412.2.6. Equilibrium 442.3. Nash equilibrium 462.3.1. Definition 462.3.2. Existence 472.3.3. Uniqueness 502.3.4. Specific cases 512.4. Famous games 522.4.1. The prisoner’s dilemma 522.4.2. Cournot duopoly 532.5. Applications to wireless networks 552.5.1. Routing game 562.5.2. Power control game 582.6. Conclusion 60CHAPTER 3. GAMES IN SALOHA NETWORKS 613.1. Introduction 613.2. Functioning of the SALOHA algorithm 643.2.1. Study of stability 683.2.2. Transmission time 723.3. Modeling of node behavior in SALOHA with a strategic coding game 733.3.1. Issues 733.3.2. RS erasure codes 753.3.3. The impact of erasure encoding on SALOHA 793.3.4. Description of game model 803.3.5. Study of utility 833.3.6. Discussion of equilibrium 843.4. SALOHA network performance at Nash equilibrium 863.4.1. Coding cost 863.4.2. Loss rate 873.4.3. Output 883.4.4. Stability 903.4.5. Transmission time 913.5. Conclusion 92CHAPTER 4. GAMES IN CSMA NETWORKS 934.1. Introduction 934.2. CMSA performance 954.3. Sources of problems in CSMA networks 994.4. Modeling of node behavior in CSMA using a strategic coding game 1004.4.1. Game model analysis 1004.4.2. Utility function 1014.4.3. Discussion of equilibrium 1034.5. CSMA performances at equilibrium 1054.5.1. Coding/decoding price (cost) 1054.5.2. Output 1064.5.3. Transmission time 1084.5.4. Energy optimization at equilibrium 1094.6. Conclusion 110CONCLUSION 113BIBLIOGRAPHY 119INDEX 139