In addition to safety, Vehicular Ad-hoc Networks (VANETs) enable the development of new information-rich applications that disseminate relevant data to vehicles. One key challenge in such networks is to use the available bandwidth efficiently when there is: (i) a short connectivity time due to the rapidly changing road environment, and (ii) bandwidth congestion due to continuous collection and dissemination of data. Numerous solutions were proposed to alleviate bandwidth congestion by using transmission power and beaconing rate control. However, the reduction of data messages transmitted by using priority-based data selection mechanisms has not been fully explored. In this work, we propose a periodic data dissemination protocol for non-safety applications which distributes data utility fairly among vehicles with conflicting data interests. Furthermore, given a defined maximum network load allowed, only the least relevant data is suppressed. Fairness is achieved using the concept of Nash Bargaining from game theory. Simulation results show that our approach leads to an efficient bandwidth utilization in terms of utility per message received and higher fairness index compared with other approaches.
Original Version 
(at publishers web site)
BibTeX 
Ramon S. Schwartz
Anthony E. Ohazulike
Hans Scholten
@inproceedings{schwartz2012achieving,
author = {Schwartz, Ramon S. and Ohazulike, Anthony E. and Scholten, Hans},
title = {{Achieving Data Utility Fairness in Periodic Dissemination for VANETs}},
booktitle = {75st IEEE Vehicular Technology Conference (VTC2012-Spring)},
year = {2012},
month = {May},
address = {Yokohama, Japan},
publisher = {IEEE},
doi = {10.1109/VETECS.2012.6239856},
}
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceeedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
This page was automatically generated using BibDB and bib2web.
