­
­
­
­

Inventi Impact - Digital Multimedia Broadcasting

Articles

  • Inventi:edmb/59/14
    A DISTANCE-AWARE SAFETY-RELATED MESSAGE BROADCASTING ALGORITHM FOR VEHICULAR NETWORKS
    Xiaohuan Li, Bin-jie Hu, Hongbin Chen, Jin Ye

    A new distance-aware broadcasting algorithm was proposed to enhance the propagation distance in the latency time of safetyrelated message broadcasting. The IEEE 802.11p standard states that if the medium is detected as idle, a station would defer its transmission within a backoff time to avoid collisions with other stations.The backoff times follow uniform distribution over [0, CW]. In this way, fairness among all the stations can be guaranteed. However, propagation distance was ignored and in safetyrelated message broadcasting fairness is not the most important issue. In the proposed algorithm, the lengths of backoff times are generated from a nonuniform distribution.They are related with the distances between the source station and its forwarding stations.The farthest forwarding station has the highest probability to forwardmessages. Performance of the proposed algorithmis analyzed by using a 2D Markov chain. Analytical and simulation results demonstrate that the proposed algorithm can enhance the performance of safety-related message broadcasting in terms of propagation distance, which is reflected by the successful transmission probability. The proposed algorithm does not need additional waiting time, RTS/CTS, and ACK, therefore having better compatibility with the IEEE 802.11p standard than earlier distance-aware algorithms

    How to Cite this Article
    CC Compliant Citation: Xiaohuan Li, Bin-jie Hu, Hongbin Chen, and Jin Ye, “A Distance-Aware Safety-Related Message Broadcasting Algorithm for Vehicular Networks,” International Journal of Distributed Sensor Networks, vol. 2014, Article ID 139857, 11 pages, 2014. doi:10.1155/2014/139857. Copyright © 2014 Xiaohuan Li et al. This is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
    Download Full Text