Cover image for Game theory in communication networks : cooperative resolution of interactive networking scenarios
Title:
Game theory in communication networks : cooperative resolution of interactive networking scenarios
Personal Author:
Publication Information:
Boca Raton : CRC Press, c2013
Physical Description:
ix, 146 p. : ill. ; 24 cm.
ISBN:
9781439848081
Abstract:
"Focusing on heterogeneous networks, this book addresses important resource management and security issues found in networks and uses theoretical tools to model them. Although it explores network design and management from the theoretical perspective of game theory and graph theory, the text also provides solutions for each mechanism that needs improvement by presenting a step-by-step approach. The accompanying CD-ROM includes simulation code, so practitioners can use some or all of the proposed models for better network planning. Topics covered include network selection, user-network interaction, network synthesis, and context-aware security provisioning"-- Provided by publisher.

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010302416 TK5102.83 A58 2013 Open Access Book Book
Searching...

On Order

Summary

Summary

A mathematical tool for scientists and researchersnbsp;who work with computer and communication networks, Game Theory in Communication Networks: Cooperative Resolution of Interactive Networking Scenarios addresses the question of how to promote cooperative behavior in interactive situations between heterogeneous entities in communication networking scenarios. It explores network design and management from a theoretical perspective, using game theory and graph theory to analyze strategic situations and demonstrate profitable behaviors of the cooperative entities.

The book promotes the use of Game Theory to address important resource management and security issues found in next generation communications networks, particularly heterogeneous networks, for cases where cooperative interactive networking scenarios can be formulated. It provides solutions for representative mechanisms that need improvement by presenting a theoretical step-by-step approach. The text begins with a presentation of theory that can be used to promote cooperation for the entities in a particular interactive situation. Next, it examines two-player interaction as well as interactions between multiple players. The final chapter presents and examines a performance evaluation framework based on MATLABĀ®.

Each chapter begins by introducing basic theory for dealing with a particular interactive situation and illustrating how particular aspects of game theory can be used to formulate and solve interactive situations that appear in communication networks regularly. The second part of each chapter presents example scenarios that demonstrate the applicability and power of the theory--illustrating a number of cooperative interactions and discussing how they could be addressed within the theoretical framework presented in the first part of the chapter.

The book also includes simulation code that cannbsp;be downloaded so you can use some or all of the proposed models to improve your own network designs. Specific topics covered include network selection, user-network interaction, network synthesis, and context-aware security provisioning.


Author Notes

Josephina Antoniou received her B.A. degree (summa cum laude) in Computer Science and Mathematics from Wartburg College, Iowa, USA in May 2002. She received her M.Sc degree in Advanced Computer Technologies from the University of Cyprus in June 2004. She also received her Ph.D. at the University of Cyprus, in the area of mobile networks. She has been a Research Associate for the University of Cyprus working since June 2002, for the, IST/ICT funded projects: SEACORN, B-BONE, C-MOBILE and CCAST dealing with Enhanced UMTS. MBMS over UMTS, enhanced MBMS over converged networks and currently context-aware multicasting over converged, next generation networks. Her research interests include radio resource management and session management in mobile networks, specifically Access Network Selection algorithms in next generation mobile networks using game theoretic approaches. (http://www.NetRL.ucy.ac.cy)

Andreas Pitsillides is a Professor of Computer Science, University of Cyprus (UCY), serves as Chairman of the Cyprus Research and Academic Network (CYNET), and heads the Networks Research Lab (NetRL) at UCY. His research interests include fixed and wireless Networks (ad-hock and sensor networks, VANETS, WLANs&WMANs, UMTS Third Generation mobile networks and beyond, LTE and enhanced LTE, 4G), flow and congestion control, resource allocation and radio resource management. Also his research interests span the Internet- and Web- of Things, and Internet technologies and their application in Mobile e-Services, e.g. in Tele-Healthcare, and security issues. He has a particular interest in adapting tools from various fields of applied mathematics such as adaptive non-linear control theory, computational intelligence, and recently nature inspired techniques, to solve problems in communication networks. Andreas has published over 230 referred journal papers in flagship IEEE, Elsevier, IFAC, and Springer journals, international conferences, and book chapters, he is the co-editor with Petros Ioannou of the book on Modelling and Control of Complex Systems (CRC Press, ISBN: 978-0-8493-7985-0, 2007), presented invited keynotes and invited lectures at major research organisations and universities, has given short courses at international conferences and short courses to industry. He serves on the editorial boards of the Journal of Computer Networks (COMNET) and International Journal of Handheld Computing Research (IJHCR), served on international conferences as General Chair (MEDHOCNET2012, ICT2011, EuroMedNet'98), Vice General Chair (WiOpt'07), international co-chair (INFOCOM 2003), technical program chair (MCCS05, ISYC06), and on executive committees (e.g. INFOCOM 2001-2003, and ICT98), technical committees, guest co-editor, invited speaker, and as a regular reviewer for conference and journal submissions. He is also a member of the International Federation of Automatic Control (IFAC) Technical Committee (TC 1.5) on Networked Systems, IFAC TC 7.4 on Transportation Systems and the IFIP working group WG 6.3. Andreas is also very active in competitive research projects. He participated in over 30 European Commission, Microsoft Research Labs (Cambridge), and locally funded research projects.

http://www.NetRL.ucy.ac.cy)


Table of Contents

Prefacep. vii
1 Introduction: Game theory as an analytical toolp. 1
1.1 Book structurep. 6
2 Cooperation for two: Prisoner's Dilemma type of gamesp. 15
2.1 Introductionp. 15
2.2 Prisoner's Dilemma and similar two-player gamesp. 16
2.3 Focusing on Prisoner's Dilemmap. 20
2.3.1 Motivating cooperation from repetitionp. 21
2.3.2 Present valuep. 22
2.4 Threats and punishments: The user as an active participant in the networkp. 23
2.4.1 An illustrative scenariop. 23
2.4.2 Incentives, assumptions and requirementsp. 26
2.4.3 No past or future consideration: One-shot user-network interactionp. 28
2.4.4 Considering past and future: Repeated user-network interactionp. 31
2.4.5 The user as an adaptive entityp. 40
2.4.6 Evaluating the gamep. 44
3 Cooperation for two: Dealing with different types of player behaviorp. 53
3.1 Introductionp. 53
3.2 Cooperative behavior through bargainingp. 54
3.3 Bayesian type of gamesp. 55
3.3.1 An example of a Bayesian type of gamep. 56
3.4 When payoffs need to be partitioned: Player truthfulnessp. 58
3.4.1 Scenario overviewp. 58
3.4.2 Cooperative bargaining modelp. 59
3.4.3 A Bayesian form of the payment-partition gamep. 65
3.4.4 Evaluating the gamep. 69
4 Cooperation for many: Spatial Prisoner's Dilemma and games in neighborhoodsp. 77
4.1 Introductionp. 77
4.2 Spatial version of the Prisoner's Dilemma gamep. 78
4.3 Group strategies for the Prisoner's Dilemma gamep. 79
4.4 Spatial games and group strategies: Reducing interference in dense deployments of home wireless networksp. 83
4.4.1 Scenario overviewp. 84
4.4.2 Wireless deployments in urban environmentsp. 85
4.4.3 Cooperative neighborhoodsp. 86
4.4.4 A protocol for cooperative neighborhoodsp. 93
4.5 Conclusions on neighborhood gamesp. 95
5 Cooperation for many: Payoffs to coalitionsp. 97
5.1 Introductionp. 97
5.2 Games of coalitionsp. 98
5.3 The Voting Gamep. 99
5.4 Players' power to affect decisions in a coalition gamep. 102
5.5 The Coordination Gamep. 104
5.6 Cooperation between multiple networks: Coalitions toward network synthesisp. 106
5.6.1 Scenario overviewp. 107
5.6.2 Network Synthesis Gamep. 107
5.6.3 A new power indexp. 111
5.6.4 Evaluating the gamep. 117
5.7 Conclusions on coalitional gamesp. 121
6 MATLAB implementation: Strategies for Iterated Prisoner's Dilemma type of gamesp. 123
6.1 Introductionp. 123
6.2 Initializing the executionp. 124
6.3 Fixed iterations numberp. 124
6.4 Randomized iteration numberp. 126
6.5 Strategies and payoffsp. 127
6.6 Collecting cumulative payoffsp. 127
6.7 A single round of the gamep. 129
6.8 Implementing strategies with non-cooperative naturep. 132
6.9 Implementing a simple modification of the Grim Trigger strategyp. 132
6.10 Implementing adaptive strategiesp. 134
Indexp. 139