Literature Database Entry

valibak2014twopurpose


A. Valibak, M. Fathy, N. Balouchzahi and A. Akbari, "A two-purpose peer-to-peer structure for vehicle navigating and traffic information disseminating in vehicular networks," Proceedings of 4th International eConference on Computer and Knowledge Engineering (ICCKE 2014), October 2014, pp. 316-321.

Abstract

In this paper, a two purpose structure to simultaneously determine the shortest travel time path for a moving vehicle and efficient packet dissemination for traffic information messages has been presented. In order to reduce traveling time, vehicles are directed to the paths with lower density. Given that, such paths have a higher risk in radio coverage partitioning; it is more likely to reduce successful traffic information packets delivery. Therefore, in order to overcome the network partitioning problem, a solution is sending traffic packets from such dense routes which will increase successful rate on sending messages. For this purpose, it is necessary to assess vehicles distribution in different regions periodically according to the real-time traffic conditions and connectivity, then sending traffic packets from the routes with higher radio and directing vehicles to paths with lower density. For this reason, a peer-to-peer layer has been developed on top of a vehicular ad-hoc network. Important characteristics of the developed peer-to-peer network are high speed, simplicity and low overhead in construction of peer-to-peer layer, as well as the optimal use of limited bandwidth of vehicular network, a good performance in low penetration environments and time., proper efficiency in congested urban conditions that cause to a lower travel

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

A. Valibak
M. Fathy
N. Balouchzahi
A. Akbari

BibTeX reference

@inproceedings{valibak2014twopurpose,
    author = {Valibak, A. and Fathy, M. and Balouchzahi, N. and Akbari, A.},
    title = {{A two-purpose peer-to-peer structure for vehicle navigating and traffic information disseminating in vehicular networks}},
    booktitle = {4th International eConference on Computer and Knowledge Engineering (ICCKE 2014)},
    pages = {316-321},
    keywords = {packet radio networks;path planning;peer-to-peer computing;radionavigation;vehicular ad hoc networks;moving vehicle navigation;network partitioning problem;packet dissemination;peer-to-peer layer;peer-to-peer network;peer-to-peer structure;radio connectivity;radio coverage partitioning;shortest travel time path;traffic information dissemination;traffic information messages;traffic information packet delivery;traveling time;vehicular ad hoc network;vehicular networks;Bandwidth;Information systems;Junctions;Peer-to-peer computing;Roads;Vehicles;Vehicular ad hoc networks;ITS;Navigation;Peer to Peer;Routing;TIS;Two-Purpose;VANET},
    year = {2014},
    month = {October},
    doi = {10.1109/ICCKE.2014.6993334},
   }
   
   

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