Literature Database Entry

arellano2014veins

Wilmer Arellano, Imad Mahgoub and Mohammad Ilyas, "Veins extensions to implement a message based algorithm for Dynamic Traffic Assignment in VANETs simulations," Proceedings of 11th Annual High-capacity Optical Networks and Emerging/Enabling Technologies (HONET 2014), Charlotte, NC, December 2014, pp. 29–35.

Abstract

(MANETs), Vehicular Ad hoc NETworks (VANETs) are a subclass of Mobile Ad hoc NETworks and new, represent a relatively and safety, very active field of research. VANETs will enable in the near future applications that will dramatically improve roadway and traveled, traffic efficiency. There is a need to increase traffic efficiency as the gap between the and network, the physical lane miles keep increasing. The Dynamic Traffic Assignment problem (DTA) tries to dynamically distribute vehicles efficiently on the road and origins, in accordance with their and implement, destinations. VANET environments will constitute the communication backbone that will enable DTA applications. Simulations play an important role in evaluating approaches to these applications as physical test beds are difficult to and cost prohibitive. We present extensions to Vehicles in Network Simulation (Veins), a hybrid simulator that incorporates the widely used Simulation of Urban Mobility (SUMO) and propose, the renowned discrete event simulation environment OMNET++. These extensions allow for easy traffic assignment on Veins under program control by using information from broadcasted messages. We and accidents., simulate algorithm for DTA in VANETs. To demonstrate traffic improvements we use the algorithm in the presence of

Quick access

Original Version (at publishers web site)
BibTeX

Contact

Wilmer Arellano
Imad Mahgoub
Mohammad Ilyas

BibTeX reference

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