Joint Beacon Power and Beacon Rate Control Based on Game Theoretic Approach in Vehicular Ad Hoc Networks

In vehicular ad hoc networks (VANETs), each vehicle broadcasts its information periodically in its beacons to create awareness for surrounding vehicles aware of their presence. But, the wireless channel is congested by the increase beacons number, packet collision lost a lot of beacons. This paper tackles the problem of joint beaconing power and a beaconing rate in VANETs. A joint utilitybased beacon power and beacon rate game are formulated as a non-cooperative game and a cooperative game. A three distributed and iterative algorithm (Nash Seeking Algorithm, Best Response Algorithm, Cooperative Bargaining Algorithm) for computing the desired equilibrium is introduced, where the optimal values of each vehicle beaconing power and beaconing rate are simultaneously updated at the same step. Extensive simulations show the convergence of a proposed algorithm to the equilibrium and give some insights on how the game parameters may vary the game outcome. It is demonstrated that the Cooperative Bargaining Algorithm is a fast algorithm that converges the equilibrium

A Non-cooperative Game-Theoretic Framework for Sponsoring Content in the Internet Market

Data traffic demand over the Internet is increasing rapidly, and it is changing the pricing model between internet service providers (ISPs), content providers (CPs) and end users. One recent pricing proposal is sponsored data plan, i.e., when CP negotiates with the ISP on behalf of the users to remove the network subscription fees so as to attract more users and increase the number of advertisements. As such, a key challenge is how to provide proper sponsorship in the situation of complex interactions among the telecommunication actors, namely, the advertisers, the content provider, and users. To answer those questions, we explore the potential economic impacts of this new pricing model by modeling the interplay among the advertiser, users, and the CPs in a game theoretic framework. The CP may have either a subscription revenue model (charging end-users) or an advertisement revenue model (charging advertisers). In this work, we design and analyze the interaction among CPs having an advertisement revenue as a non-cooperative game, where each CP determines the proportion of data to sponsor and a level of credibility of content. In turn, the end-users demand for the content of a CP depends not only on their strategies but also upon those proposed by all of its competitors. Through rigorous mathematical analysis, we prove the existence and uniqueness of the Nash equilibrium. Based on the analysis of the game properties, we propose an iterative algorithm, which guarantees to converge to the Nash equilibrium point in a distributed manner. Numerical investigation shows the convergence of a proposed algorithm to the Nash equilibrium point and corroborates the fact that sponsoring content may improve the CPs outcome