Clustering algorithm based on minimal path loss ratio for vehicular communication

Y. Harikrishnan, J. He

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publication2013 International Conference on Computing, Networking and Communications, ICNC 2013
Pages745-749
Number of pages5
ISBN (Electronic)978-1-4673-5286-4
DOIs
Publication statusPublished - 2013
Event9th International conference on Computing, Networking and Communications - San Diego, CA, United States
Duration: 28 Jan 201331 Jan 2013

Conference

Conference9th International conference on Computing, Networking and Communications
Abbreviated titleICNC 2013
CountryUnited States
CitySan Diego, CA
Period28/01/1331/01/13

Fingerprint

Clustering algorithms
Communication
Simulators
Quality of service
Internet

Bibliographical note

© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Cite this

Harikrishnan, Y., & 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 (pp. 745-749) https://doi.org/10.1109/ICCNC.2013.6504181
Harikrishnan, Y. ; He, J. / Clustering algorithm based on minimal path loss ratio for vehicular communication. 2013 International Conference on Computing, Networking and Communications, ICNC 2013. 2013. pp. 745-749
@inproceedings{5bbd3461050d4c10a25dd4ba80ffc68c,
title = "Clustering algorithm based on minimal path loss ratio for vehicular communication",
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.",
author = "Y. Harikrishnan and J. He",
note = "{\circledC} 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.",
year = "2013",
doi = "10.1109/ICCNC.2013.6504181",
language = "English",
isbn = "978-1-4673-5287-1",
pages = "745--749",
booktitle = "2013 International Conference on Computing, Networking and Communications, ICNC 2013",

}

Harikrishnan, Y & 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. pp. 745-749, 9th International conference on Computing, Networking and Communications, San Diego, CA, United States, 28/01/13. https://doi.org/10.1109/ICCNC.2013.6504181

Clustering algorithm based on minimal path loss ratio for vehicular communication. / Harikrishnan, Y.; He, J.

2013 International Conference on Computing, Networking and Communications, ICNC 2013. 2013. p. 745-749.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Clustering algorithm based on minimal path loss ratio for vehicular communication

AU - Harikrishnan, Y.

AU - He, J.

N1 - © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84877612891&partnerID=8YFLogxK

UR - http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6504181

U2 - 10.1109/ICCNC.2013.6504181

DO - 10.1109/ICCNC.2013.6504181

M3 - Conference contribution

AN - SCOPUS:84877612891

SN - 978-1-4673-5287-1

SP - 745

EP - 749

BT - 2013 International Conference on Computing, Networking and Communications, ICNC 2013

ER -

Harikrishnan Y, He J. Clustering algorithm based on minimal path loss ratio for vehicular communication. In 2013 International Conference on Computing, Networking and Communications, ICNC 2013. 2013. p. 745-749 https://doi.org/10.1109/ICCNC.2013.6504181