Clustering algorithm based on minimal path loss ratio for vehicular communication

Harikrishnan, Y. and He, J. (2013). Clustering algorithm based on minimal path loss ratio for vehicular communication. IN: 2013 International Conference on Computing, Networking and Communications, ICNC 2013. UNSPECIFIED.

Abstract

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.

Event Title: 2013 International Conference on Computing, Networking and Communications
Event Type: Other
Event Location: San Diego, CA
Event Dates: 2013-01-28 - 2013-01-31
ISBN: 978-1-4673-5287-1
Published Date: 2013
Authors: Harikrishnan, Y.
He, J.

Download

Item under embargo.

Export / Share Citation


Statistics

Additional statistics for this record