Data networks
Analysis and design of effective and low-overhead transmission power control for VANETs
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
PeerTIS: a peer-to-peer traffic information system
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
A hybrid approach for content-based publish/subscribe in vehicular networks
Pervasive and Mobile Computing
Exploration of adaptive beaconing for efficient intervehicle safety communication
IEEE Network: The Magazine of Global Internetworking
Exploiting the wisdom of the crowd: localized, distributed information-centric VANETs
IEEE Communications Magazine
EURASIP Journal on Wireless Communications and Networking - Special issue on simulators and experimental testbeds design and development for wireless networks
Bidirectionally Coupled Network and Road Traffic Simulation for Improved IVC Analysis
IEEE Transactions on Mobile Computing
Utility-based fair bandwidth sharing in vehicular networks (extended)
Wireless Communications & Mobile Computing
The scalability problem of vehicular ad hoc networks and how to solve it
IEEE Wireless Communications
Information dissemination in self-organizing intervehicle networks
IEEE Transactions on Intelligent Transportation Systems
A social node model for realising information dissemination strategies in delay tolerant networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
| Hi-index | 0.00 |
Vehicular Ad hoc Networks (VANETs) are expected to serve as support to the development of not only safety applications but also information-rich applications that disseminate relevant data to vehicles. Due to the continuous collection, processing, and dissemination of data, one crucial requirement is the efficient use of the available bandwidth. Firstly, the rate of message transmissions must be properly controlled in order to limit the amount of data inserted into the network. Secondly, messages must be carefully selected to maximize the utility (benefit) gain of vehicles in the neighborhood. We argue that such selection must aim at a fair distribution of data utility, given the possible conflicting data interests among vehicles. In this work, we propose a data dissemination protocol for VANETs that distributes data utility fairly over vehicles while adaptively controlling the network load. The protocol relies only on local knowledge to achieve fairness with concepts of Nash Bargaining from game theory. We show the applicability of the protocol by giving example of utility functions for two Traffic Information Systems (TIS) applications: (i) parking-related and (ii) traffic information applications. The protocol is validated with both real-world experiments and simulations of realistic large-scale networks. The results show that our protocol presents a higher fairness index and yet it maintains a high level of bandwidth utilization efficiency compared to other approaches.