Literature Database Entry


Z. Doukha and S. Moussaoui, "A SDMA-based Mechanism for Accurate and Efficient Neighborhood Discovery Link Layer Service," IEEE Transactions on Vehicular Technology, vol. 65 (2), February 2015.


Neighborhood discovery Link Layer service is provided by beaconing which denotes the process of periodically broadcasting status information. It allows vehicles to be aware of their surroundings. The availability of neighborhood knowledge guarantees accurate estimation of safety-related situations and helps to make strategic decisions based on assumed fresh information. Beacon messages share the same channel (Control Channel) as safety messages and are sent without any schedule; this may lead to severe contention and packet loss which can be dramatic for safety applications. The main goal of this work is to provide a method to synchronize beacons sending in a distributed manner, so that all nodes proceed to their sending within a beacon session which takes place in one control channel interval. Simulation results demonstrate the feasibility of the method and provide a high level of accuracy and efficiency compared to the standard.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Z. Doukha
S. Moussaoui

BibTeX reference

    author = {Doukha, Z. and Moussaoui, S.},
    doi = {10.1109/TVT.2015.2404933},
    issn = {0018-9545},
    journal = {IEEE Transactions on Vehicular Technology},
    month = {2},
    number = {2},
    publisher = {Institute of Electrical and Electronics Engineers},
    title = {{A SDMA-based Mechanism for Accurate and Efficient Neighborhood Discovery Link Layer Service}},
    volume = {65},
    year = {2015},

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.