Parallel Swarm Optimization Based Cluster for Emergency Message Dissemination in VANETs

Authors

  • Dongxu Jin Department of Computer Science, Yonsei University, Seoul, Korea.
  • Jeongwon Yang Department of Computer Science, Yonsei University, Seoul, Korea.
  • Jooseok Song Department of Computer Science, Yonsei University, Seoul, Korea.

Keywords:

Emergency Message Dissemination, Rebroadcast Suppression, Cluster, Density Adopted,

Abstract

In intelligent transportation system, emergency message has to be disseminated rapidly and extensively in order to inform as many vehicles in limited time. Hence, the broadcast storm problem is prone to occur in vehicular ad hoc networks. In the past, several approaches have been proposed to solve the problem. They are counter-, distance-, location-, cluster-, and probabilistic-based schemes. In this paper, we analyze existing cluster based protocols and present a novel scheme that is designed to form stable clusters, reduce the overhead of cluster maintenance during emergency message dissemination. The proposed clustering algorithm uses particle swarm optimization to assigns weight values for different factors during the cluster head election and cluster formation. It ensures the dissemination of the emergency message onto every part of the road, and when there is no relay vehicle, the emergency message will be reactivated. We use the GrooveNet simulator to demonstrate that the proposed scheme has a low collision probability, low overhead, more stable cluster, and a short end-to-end latency.

Downloads

Published

2017-06-01

How to Cite

Jin, D., Yang, J., & Song, J. (2017). Parallel Swarm Optimization Based Cluster for Emergency Message Dissemination in VANETs. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(2-4), 77–82. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2362