A Comprehensive Survey of Potential Game Approaches to Wireless Networks

Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on Communications, vol. E98-B, no. 9, Sept. 201

Game theory for collaboration in future networks

Cooperative strategies have the great potential of improving network performance and spectrum utilization in future networking environments. This new paradigm in terms of network management, however, requires a novel design and analysis framework targeting a highly flexible networking solution with a distributed architecture. Game Theory is very suitable for this task, since it is a comprehensive mathematical tool for modeling the highly complex interactions among distributed and intelligent decision makers. In this way, the more convenient management policies for the diverse players (e.g. content providers, cloud providers, home providers, brokers, network providers or users) should be found to optimize the performance of the overall network infrastructure. The authors discuss in this chapter several Game Theory models/concepts that are highly relevant for enabling collaboration among the diverse players, using different ways to incentivize it, namely through pricing or reputation. In addition, the authors highlight several related open problems, such as the lack of proper models for dynamic and incomplete information games in this area.info:eu-repo/semantics/acceptedVersio

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)

Interference Mitigation in Multi-Hop Wireless Networks with Advanced Physical-Layer Techniques

In my dissertation, we focus on the wireless network coexistence problem with advanced physical-layer techniques. For the first part, we study the problem of Wireless Body Area Networks (WBAN)s coexisting with cross-technology interference (CTI). WBANs face the RF cross-technology interference (CTI) from non-protocol-compliant wireless devices. Werst experimentally characterize the adverse effect on BAN caused by the CTI sources. Then we formulate a joint routing and power control (JRPC) problem, which aims at minimizing energy consumption while satisfying node reachability and delay constraints. We reformulate our problem into a mixed integer linear programing problem (MILP) and then derive the optimal results. A practical JRPC protocol is then proposed. For the second part, we study the coexistence of heterogeneous multi-hop networks with wireless MIMO. We propose a new paradigm, called cooperative interference mitigation (CIM), which makes it possible for disparate networks to cooperatively mitigate the interference to/from each other to enhance everyone\u27s performance. We establish two tractable models to characterize the CIM behaviors of both networks by using full IC (FIC) and receiver-side IC (RIC) only. We propose two bi-criteria optimization problems aiming at maximizing both networks\u27 throughput, while cooperatively canceling the interference between them based on our two models. In the third and fourth parts, we study the coexistence problem with MIMO from a different point of view: the incentive of cooperation. We propose a novel two-round game framework, based on which we derive two networks\u27 equilibrium strategies and the corresponding closed-form utilities. We then extend our game-theoretical analysis to a general multi-hop case, specifically the coexistence problem between primary network and multi-hop secondary network in the cognitive radio networks domain. In the final part, we study the benefits brought by reconfigurable antennas (RA). We systematically exploit the pattern diversity and fast reconfigurability of RAs to enhance the throughput of MWNs. Werst propose a novel link-layer model that captures the dynamic relations between antenna pattern, link coverage and interference. Based on our model, a throughput optimization framework is proposed by jointly considering pattern selection and link scheduling, which is formulated as a mixed integer non-linear programming problem

A Coalition-Formation Game Model for Energy-Efficient Routing in Mobile Ad-hoc Network

One of the most routing problems in Mobile Ad-hoc Network is the node’s selfishness. Nodes are generally selfish and try to maximize their own benefit; hence these nodes refuse to forward packet on behalf of others to preserve their limited energy resources. This selfishness may lead to a low efficiency of routing. Therefore, it is important to study mechanisms which can be used encourage cooperation among nodes, to maintain the network efficiency. In this paper, we propose a cooperative game theoretic model to support more energy-aware and available bandwidth routing in MANET. We introduce a novel framework from coalitional-formation game theory, called hedonic coalition-formation game. We integrate this model to OLSR protocol that is an optimization over the classical link state protocol for the MANETs. Within each coalition, a coalition coordinator acts as a special MPR node to improve the energy efficient and the packet success rate of the transmission. Simulation results show how the proposed algorithm improve the performance in terms of the percentage of selected MPR nodes in the network, the percentage of alive nodes by time, and the Packet Delivery Ratio. Which prove that our proposed model leads, to better results compared to the classical OLSR

The Game Theory: Applications in the Wireless Networks

Recent years have witnessed a lot of applications in the computer science, especially in the area of the wireless networks. The applications can be divided into the following two main categories: applications in the network performance and those in the energy efficiency. The game theory is widely used to regulate the behavior of the users; therefore, the cooperation among the nodes can be achieved and the network performance can be improved when the game theory is utilized. On the other hand, the game theory is also adopted to control the media access control protocol or routing protocol; therefore, the energy exhaust owing to the data collision and long route can be reduced and the energy efficiency can be improved greatly. In this chapter, the applications in the network performance and the energy efficiency are reviewed. The state of the art in the applications of the game theory in wireless networks is pointed out. Finally, the future research direction of the game theory in the energy harvesting wireless sensor network is presented