We address the challenge of how to share the limited wireless channel capacity for the exchange of safety-related information in a fully deployed vehicular ad hoc network (VANET). In particular, we study the situation that arises when the number of nodes sending periodic safety messages is too high in a specific area. In order to achieve a good performance of safety-related protocols, we propose to limit the load sent to the channel using a strict fairness criterion among the nodes. A formal definition of this problem is presented in terms of a max-min optimization problem with an extra condition on per-node maximality. Furthermore, we propose FPAV, a power control algorithm which finds the optimum transmission range of every node, and formally prove its validity under idealistic conditions. Simulations are performed to visualize the result of FPAV in a couple of road situations. Finally, we discuss the issues that must be taken into account when implementing FPAV.
%0 Conference Paper
%1 1080762
%A Torrent-Moreno, Marc
%A Santi, Paolo
%A Hartenstein, Hannes
%B VANET '05: Proceedings of the 2nd ACM international workshop on Vehicular ad hoc networks
%C New York, NY, USA
%D 2005
%I ACM
%K MAC-protocols car-to-car communication-protocols
%P 49--58
%R http://doi.acm.org/10.1145/1080754.1080762
%T Fair sharing of bandwidth in VANETs
%U http://portal.acm.org/citation.cfm?id=1080762
%X We address the challenge of how to share the limited wireless channel capacity for the exchange of safety-related information in a fully deployed vehicular ad hoc network (VANET). In particular, we study the situation that arises when the number of nodes sending periodic safety messages is too high in a specific area. In order to achieve a good performance of safety-related protocols, we propose to limit the load sent to the channel using a strict fairness criterion among the nodes. A formal definition of this problem is presented in terms of a max-min optimization problem with an extra condition on per-node maximality. Furthermore, we propose FPAV, a power control algorithm which finds the optimum transmission range of every node, and formally prove its validity under idealistic conditions. Simulations are performed to visualize the result of FPAV in a couple of road situations. Finally, we discuss the issues that must be taken into account when implementing FPAV.
%@ 1-59593-141-4
@inproceedings{1080762,
abstract = {We address the challenge of how to share the limited wireless channel capacity for the exchange of safety-related information in a fully deployed vehicular ad hoc network (VANET). In particular, we study the situation that arises when the number of nodes sending periodic safety messages is too high in a specific area. In order to achieve a good performance of safety-related protocols, we propose to limit the load sent to the channel using a strict fairness criterion among the nodes. A formal definition of this problem is presented in terms of a max-min optimization problem with an extra condition on per-node maximality. Furthermore, we propose FPAV, a power control algorithm which finds the optimum transmission range of every node, and formally prove its validity under idealistic conditions. Simulations are performed to visualize the result of FPAV in a couple of road situations. Finally, we discuss the issues that must be taken into account when implementing FPAV.},
added-at = {2008-03-28T18:01:17.000+0100},
address = {New York, NY, USA},
author = {Torrent-Moreno, Marc and Santi, Paolo and Hartenstein, Hannes},
biburl = {https://www.bibsonomy.org/bibtex/2a0d3cb400e940bc5a24be2529c13735c/viv},
booktitle = {VANET '05: Proceedings of the 2nd ACM international workshop on Vehicular ad hoc networks},
description = {Fair sharing of bandwidth in VANETs},
doi = {http://doi.acm.org/10.1145/1080754.1080762},
interhash = {d7834e1ec40d1bb17f88362412ddd6da},
intrahash = {a0d3cb400e940bc5a24be2529c13735c},
isbn = {1-59593-141-4},
keywords = {MAC-protocols car-to-car communication-protocols},
location = {Cologne, Germany},
pages = {49--58},
publisher = {ACM},
timestamp = {2008-03-28T18:01:18.000+0100},
title = {Fair sharing of bandwidth in VANETs},
url = {http://portal.acm.org/citation.cfm?id=1080762},
year = 2005
}