An Efficient Broadcast Scheme for Disseminating Emergency Message in Urban Vehicular Ad-Hoc Networks 


Vol. 38,  No. 7, pp. 605-611, Jul.  2013


PDF
  Abstract

If an accident vehicle propagates emergency messages to other vehicles close to it, the other drivers may realize and avoid the accident spot. In this letter, we propose a broadcast scheme to propagate emergency messages fast in urban VANETs (Vehicular Ad-Hoc Networks) with the help of GPS (Global Position System). In our scheme, a transmitting vehicle chooses the farthest node as the next relay vehicle to propagate emergency messages. And, we suggest an algorithm for intersection recognition and SCF (Store-Carry-Forward) task by taking advantage of periodic hello packets to reduce the propagation time and enhance the delivery ratio

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Lee, K. Han, K. Cho, Y. Baek, J. Kim, "An Efficient Broadcast Scheme for Disseminating Emergency Message in Urban Vehicular Ad-Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 7, pp. 605-611, 2013. DOI: .

[ACM Style]

Kyu-chang Lee, Ki-jun Han, Keu-chul Cho, Young-mi Baek, and Jun-hyung Kim. 2013. An Efficient Broadcast Scheme for Disseminating Emergency Message in Urban Vehicular Ad-Hoc Networks. The Journal of Korean Institute of Communications and Information Sciences, 38, 7, (2013), 605-611. DOI: .

[KICS Style]

Kyu-chang Lee, Ki-jun Han, Keu-chul Cho, Young-mi Baek, Jun-hyung Kim, "An Efficient Broadcast Scheme for Disseminating Emergency Message in Urban Vehicular Ad-Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 7, pp. 605-611, 7. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880