Coalitional Game Theoretic Approach for Cooperative Transmission in Vehicular Networks

Cooperative transmission in vehicular networks is studied by using coalitional game and pricing in this paper. There are several vehicles and roadside units (RSUs) in the networks. Each vehicle has a desire to transmit with a certain probability, which represents its data burtiness. The RSUs can enhance the vehicles' transmissions by cooperatively relaying the vehicles' data. We consider two kinds of cooperations: cooperation among the vehicles and cooperation between the vehicle and RSU. First, vehicles cooperate to avoid interfering transmissions by scheduling the transmissions of the vehicles in each coalition. Second, a RSU can join some coalition to cooperate the transmissions of the vehicles in that coalition. Moreover, due to the mobility of the vehicles, we introduce the notion of encounter between the vehicle and RSU to indicate the availability of the relay in space. To stimulate the RSU's cooperative relaying for the vehicles, the pricing mechanism is applied. A non-transferable utility (NTU) game is developed to analyze the behaviors of the vehicles and RSUs. The stability of the formulated game is studied. Finally, we present and discuss the numerical results for the 2-vehicle and 2-RSU scenario, and the numerical results verify the theoretical analysis.Comment: accepted by IEEE ICC'1

Proposing an Effective Retransmission Using the Relaying Nodes for Multihop Networks

Coop MAC has been recently proposed as a possible implementation of cooperation protocols in the medium access control (MAC) layer of a wireless network. However, some nodes may refrain from cooperation for selfish purposes, e.g. in order to save energy, in what is called selfish behavior or misbehavior. This protocol violation worsens other nodes’ performance and can be avoided if other nodes detect and punish (e.g. banning from the network) misbehaving nodes. However, fading and interference may prevent nodes from cooperating even if they are willing, therefore it is not trivial to identify misbehaving nodes. In a fading scenario where an automatic repeat request (ARQ) protocol is used, we propose a mechanism that allows detecting misbehaving nodes. Two approaches, either based on the uniformly most powerful (UMP) test or on the sequential probability ratio test (SPRT) are considered. The two techniques are characterized and compared in terms of their average detection delay and resulting network performance. Index Terms: Ad-hoc networks, cooperative diversity, medium access control, MIMO systems, security, privacy, and authentication

Distributed Relay Selection and Power Allocation Using Stackelberg and Auction Games in Multi-user Multi-relay Networks

This paper focuses on the problem of distributed relay selection and power allocation problem in a multi-user multi-relay network, aims to maximize users’ achievable rate while consume less power of relays which are selected for helping users transmit information. At first, we use the auction game theory to choose the relays for each user preliminarily, then for each user and the selected relays, we model the interaction between them as a two-level Stackelberg game, the relays modeled as the service provider and the users modeled as customers who will buy power from the providers. Based on this game model, we get the relays at relatively better locations for each user and the optimal power need to buy from them. Otherwise, as the users will not exchange information between themselves, we recalculate the power allocated to each user for relays the power users buy from it exceeds the maximizing transmit power. Simulation results show the effectiveness of our proposed scheme

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

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

Game theory for cooperation in multi-access edge computing

Cooperative strategies amongst network players can improve network performance and spectrum utilization in future networking environments. Game Theory is very suitable for these emerging scenarios, since it models high-complex interactions among distributed decision makers. It also finds the more convenient management policies for the diverse players (e.g., content providers, cloud providers, edge providers, brokers, network providers, or users). These management policies optimize the performance of the overall network infrastructure with a fair utilization of their resources. This chapter discusses relevant theoretical models that enable cooperation amongst the players in distinct ways through, namely, pricing or reputation. In addition, the authors highlight open problems, such as the lack of proper models for dynamic and incomplete information scenarios. These upcoming scenarios are associated to computing and storage at the network edge, as well as, the deployment of large-scale IoT systems. The chapter finalizes by discussing a business model for future networks.info:eu-repo/semantics/acceptedVersio