Abstract
In this paper, to avoid congestion in the wireless channel of vehicular ad hoc networks (VANETs), a joint beaconing rate and beaconing power based on game theory are proposed in this paper. The game is formulated as a non-cooperative game, a Bayesian game, and a cooperative game. Three distributed and iterative algorithms (Best Response Algorithm, Fictitious Play Algorithm, and Cooperative Bargaining Algorithm) are proposed for computing the beaconing power and beaconing rate of each vehicle. Extensive simulations show the convergence of a proposed algorithm to the equilibrium beaconing power and beaconing rate and give some insights on how the game parameters may vary the game outcome.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
