Distributed and fair beaconing rate adaptation for congestion control in vehicular networks
•
0 likes•29 views
Networking Domain title 2016-2017 Shakas Technologies Provides, 2016-2017 Project titles, Real time project titles, IEEE Project Titles 2016-2017, NON-IEEE Project Titles, Latest project titles 2016, MCA Project titles, Final Year Project titles 2016-2017.. Contact As: Shakas Technologies #13/19, 1st Floor, Municipal Colony, Kangeyanellore Road, Gandhi Nagar, Vellore-632006, Cell: 9500218218 Mobile: 0416-2247353 / 6066663
Recommended
Recommended
More Related Content
Similar to Distributed and fair beaconing rate adaptation for congestion control in vehicular networks
Similar to Distributed and fair beaconing rate adaptation for congestion control in vehicular networks (20)
More from Shakas Technologies
More from Shakas Technologies (20)
Recently uploaded
Recently uploaded (20)
Distributed and fair beaconing rate adaptation for congestion control in vehicular networks
- 1. #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar, Vellore – 6. Off: 0416-2247353 / 6066663 Mo: +91 9500218218 Website: www.shakastech.com, Email - id: shakastech@gmail.com, info@shakastech.com DISTRIBUTED AND FAIR BEACONING RATE ADAPTATION FOR CONGESTION CONTROL IN VEHICULAR NETWORKS ABSTRACT: Cooperative inter-vehicular applications rely on the exchange of broadcast single-hop status messages among vehicles, called beacons. The aggregated load on the wireless channel due to periodic beacons can prevent the transmission of other types of messages, what is called channel congestion due to beaconing activity. In this paper we approach the problem of controlling the beaconing rate on each vehicle by modeling it as a Network Utility Maximization (NUM) problem. This allows us to formally apply the notion of fairness of a beaconing rate allocation in vehicular networks and to control the trade-off between efficiency and fairness. The NUM methodology provides a rigorous framework to design a broad family of simple and decentralized algorithms, with proved convergence guarantees to a fair allocation solution. In this context, we focus exclusively in beaconing rate control and propose the Fair Adaptive Beaconing Rate for Intervehicular Communications (FABRIC) algorithm, which uses a particular scaled gradient projection algorithm to solve the dual of the NUM problem. The desired fairness notion in the allocation can be established with an algorithm parameter. Simulation results validate our approach and show that FABRIC converges to fair rate allocations in multi-hop and dynamic scenarios.