Literature Database Entry


Nik-Mohammad Balouchzahi, Mahmood Fathy and Ahmad Akbari, "An efficient infrastructure based service discovery in vehicular networks using P2P structures," The Journal of Supercomputing, vol. 72 (3), March 2016.


Service discovery is known as one of the fundamental components in vehicular networks. Intelligent transportation systems performance improves by the availability of efficient service discovery solutions in vehicular networks. Nonetheless, some challenges such as network partitioning and vehicular congestion reduce the efficiency of these components. Additionally, most of the presented solutions are suffering from the low query success rate and high overhead of service information updates. A proper framework has been presented in this paper for the optimal service discovery in an urban area. Considering related framework, a binary integer programming model has been proposed for optimal infrastructure placement in urban areas and rate, a peer-to-peer (P2P) network which is created on infrastructure nodes. The query success and network, overheads of updating service information improved by benefits of P2P and infrastructure nodes. In framework evaluation, an Infrastructure-based location service discovery mechanism has been presented in urban areas. The simulation results showed an improvement in performance of the given solution in comparison with the most recent other solutions.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Nik-Mohammad Balouchzahi
Mahmood Fathy
Ahmad Akbari

BibTeX reference

    author = {Balouchzahi, Nik-Mohammad and Fathy, Mahmood and Akbari, Ahmad},
    doi = {10.1007/s11227-016-1638-6},
    issn = {1573-0484},
    journal = {The Journal of Supercomputing},
    month = {3},
    number = {3},
    publisher = {Springer},
    title = {{An efficient infrastructure based service discovery in vehicular networks using P2P structures}},
    volume = {72},
    year = {2016},

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.