Literature Database Entry


Laura Poff, Aniruddha Gokhale and Mark McDonald, "A framework for Broker placement in vehicular ad hoc Networks," Proceedings of 2012 International Conference on Collaboration Technologies and Systems (CTS 2012), Denver, CO, May 2012, pp. 182-189.


Vehicular networks are a classic example of mobile, peer-to-peer networks. The domain of intelligent transportation engineering (ITS) envisions a wide range of services over these vehicular networks. Supporting the different quality of service properties of these services requires effective dynamic resource management solutions in vehicular networks, which cannot be realized using vehicles alone due to factors such as varying vehicular mobility patterns, varying vehicular traffic density, and obstacles. Road side units (RSUs), which serve as event and data brokers among the moving vehicles, can alleviate this problem. To maximize the value proposition offered by RSUs requires their effective placement that holistically accounts for physical factors, such as traffic patterns and mobility, with cyber factors, such as communication protocols and messaging. To address these requirements, this paper presents a design methodology based on the principles of surrogate modeling wherein small-scale, micro-simulations of the ITS cyber-physical system are used to develop training points, which in turn are used to train a surrogate model. The surrogate model is subsequently used to make planning decisions for ITS.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Laura Poff
Aniruddha Gokhale
Mark McDonald

BibTeX reference

    address = {Denver, CO},
    author = {Poff, Laura and Gokhale, Aniruddha and McDonald, Mark},
    booktitle = {2012 International Conference on Collaboration Technologies and Systems (CTS 2012)},
    doi = {10.1109/CTS.2012.6261048},
    month = {5},
    pages = {182-189},
    publisher = {IEEE},
    title = {{A framework for Broker placement in vehicular ad hoc Networks}},
    year = {2012},

Copyright notice

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 proceedings 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

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.