{"id":"https://openalex.org/W1965810121","doi":"https://doi.org/10.1109/iccnc.2013.6504181","title":"Clustering algorithm based on minimal path loss ratio for vehicular communication","display_name":"Clustering algorithm based on minimal path loss ratio for vehicular communication","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1965810121","doi":"https://doi.org/10.1109/iccnc.2013.6504181","mag":"1965810121"},"language":"en","primary_location":{"id":"doi:10.1109/iccnc.2013.6504181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccnc.2013.6504181","pdf_url":null,"source":{"id":"https://openalex.org/S4306497840","display_name":"2013 International Conference on Computing, Networking and Communications (ICNC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Computing, Networking and Communications (ICNC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://publications.aston.ac.uk/id/eprint/23592/3/clustering_algorithm.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015113817","display_name":"Yamini Harikrishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139030","display_name":"Samsung (India)","ror":"https://ror.org/04cpx2569","country_code":"IN","type":"company","lineage":["https://openalex.org/I2250650973","https://openalex.org/I4210139030"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Y. Harikrishnan","raw_affiliation_strings":["Samsung, India","Samsung, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Samsung, India","institution_ids":["https://openalex.org/I4210139030"]},{"raw_affiliation_string":"Samsung, India#TAB#","institution_ids":["https://openalex.org/I4210139030"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014610561","display_name":"Jianhua He","orcid":"https://orcid.org/0000-0002-5738-8507"},"institutions":[{"id":"https://openalex.org/I169199633","display_name":"Aston University","ror":"https://ror.org/05j0ve876","country_code":"GB","type":"education","lineage":["https://openalex.org/I169199633"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J. He","raw_affiliation_strings":["School of Engineering and Applied Science, Aston University, UK","School of Engineering & Applied Science, Aston University, UK"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Science, Aston University, UK","institution_ids":["https://openalex.org/I169199633"]},{"raw_affiliation_string":"School of Engineering & Applied Science, Aston University, UK","institution_ids":["https://openalex.org/I169199633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015113817"],"corresponding_institution_ids":["https://openalex.org/I4210139030"],"apc_list":null,"apc_paid":null,"fwci":7.1748,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.97821187,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"745","last_page":"749"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7661502957344055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7539365291595459},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6350792050361633},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.608805775642395},{"id":"https://openalex.org/keywords/packet-loss","display_name":"Packet loss","score":0.5876272320747375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5315636992454529},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.45642563700675964},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4562467634677887},{"id":"https://openalex.org/keywords/path-loss","display_name":"Path loss","score":0.455024778842926},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4432603120803833},{"id":"https://openalex.org/keywords/data-loss","display_name":"Data loss","score":0.4412415027618408},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.26329314708709717},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13348954916000366},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09230735898017883}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7661502957344055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7539365291595459},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6350792050361633},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.608805775642395},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.5876272320747375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5315636992454529},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.45642563700675964},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4562467634677887},{"id":"https://openalex.org/C194273485","wikidata":"https://www.wikidata.org/wiki/Q1478845","display_name":"Path loss","level":3,"score":0.455024778842926},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4432603120803833},{"id":"https://openalex.org/C193519340","wikidata":"https://www.wikidata.org/wiki/Q891179","display_name":"Data loss","level":2,"score":0.4412415027618408},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.26329314708709717},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13348954916000366},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09230735898017883}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/iccnc.2013.6504181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccnc.2013.6504181","pdf_url":null,"source":{"id":"https://openalex.org/S4306497840","display_name":"2013 International Conference on Computing, Networking and Communications (ICNC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Computing, Networking and Communications (ICNC)","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.aston.ac.uk:23592","is_oa":true,"landing_page_url":"https://publications.aston.ac.uk/view/author/1e6d4a6dc6857ae65cf40ca9a3a5b6f2.html>","pdf_url":"https://publications.aston.ac.uk/id/eprint/23592/3/clustering_algorithm.pdf","source":{"id":"https://openalex.org/S4306400483","display_name":"Aston Publications Explorer (Aston University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169199633","host_organization_name":"Aston University","host_organization_lineage":["https://openalex.org/I169199633"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:discovery.dundee.ac.uk:openaire_cris_publications/ec6efd09-cff7-416a-a6e7-1de447f04e6c","is_oa":false,"landing_page_url":"http://publications.aston.ac.uk/id/eprint/19902/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"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. < http://publications.aston.ac.uk/id/eprint/19902/ >","raw_type":"info:eu-repo/semantics/bookPart"},{"id":"pmh:oai:discovery.dundee.ac.uk:publications/ec6efd09-cff7-416a-a6e7-1de447f04e6c","is_oa":false,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/ec6efd09-cff7-416a-a6e7-1de447f04e6c","pdf_url":null,"source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"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. < http://publications.aston.ac.uk/id/eprint/19902/ >","raw_type":"info:eu-repo/semantics/bookPart"},{"id":"pmh:oai:publications.aston.ac.uk:19902","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6504181","pdf_url":null,"source":{"id":"https://openalex.org/S4306400483","display_name":"Aston Publications Explorer (Aston University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169199633","host_organization_name":"Aston University","host_organization_lineage":["https://openalex.org/I169199633"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"}],"best_oa_location":{"id":"pmh:oai:publications.aston.ac.uk:23592","is_oa":true,"landing_page_url":"https://publications.aston.ac.uk/view/author/1e6d4a6dc6857ae65cf40ca9a3a5b6f2.html>","pdf_url":"https://publications.aston.ac.uk/id/eprint/23592/3/clustering_algorithm.pdf","source":{"id":"https://openalex.org/S4306400483","display_name":"Aston Publications Explorer (Aston University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169199633","host_organization_name":"Aston University","host_organization_lineage":["https://openalex.org/I169199633"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G3383882937","display_name":null,"funder_award_id":"EP/I010157/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3546027146","display_name":null,"funder_award_id":"EP/I010157/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1965810121.pdf"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W136559985","https://openalex.org/W2037508129","https://openalex.org/W2063304847","https://openalex.org/W2065672848","https://openalex.org/W2086976228","https://openalex.org/W2116568543","https://openalex.org/W2159691338","https://openalex.org/W2167462578","https://openalex.org/W2252033127","https://openalex.org/W2460613189","https://openalex.org/W2498558572","https://openalex.org/W7020928135"],"related_works":["https://openalex.org/W2137811827","https://openalex.org/W2117750089","https://openalex.org/W3199712142","https://openalex.org/W2134402536","https://openalex.org/W3215409016","https://openalex.org/W2130358998","https://openalex.org/W1984254555","https://openalex.org/W15825834","https://openalex.org/W3034677812","https://openalex.org/W2109223296"],"abstract_inverted_index":{"Emerging":[0],"vehicular":[1,84],"comfort":[2],"applications":[3],"pose":[4],"a":[5,60],"host":[6],"of":[7,11,31,40,99,108,110,115,144,146,175,181],"completely":[8],"new":[9],"set":[10],"requirements":[12],"such":[13,43],"as":[14,44,93,132],"maintaining":[15],"end-to-end":[16],"connectivity,":[17],"packet":[18,46],"routing,":[19],"and":[20,76,117,156,165,178],"reliable":[21],"communication":[22],"for":[23,141],"internet":[24],"access":[25],"while":[26,48],"on":[27,64],"the":[28,32,51,81,94,100,126,135,142,153,160,173,176,179,182],"move.":[29],"One":[30],"biggest":[33],"challenges":[34],"is":[35,104,149,157,187],"to":[36,134],"provide":[37],"good":[38,170],"quality":[39],"service":[41],"(QoS)":[42],"low":[45],"delay":[47],"coping":[49],"with":[50,159,190,193],"fast":[52],"topological":[53],"changes.":[54],"In":[55],"this":[56],"paper,":[57],"we":[58],"propose":[59],"clustering":[61,102],"algorithm":[62,103,155,177],"based":[63],"minimal":[65,88],"path":[66,89],"loss":[67,90],"ratio":[68],"(MPLR)":[69],"which":[70,86,151],"should":[71],"help":[72],"in":[73,80,169],"spectrum":[74],"efficiency":[75],"reduce":[77],"data":[78,129],"congestion":[79],"network.":[82],"The":[83,97,163,184],"nodes":[85],"experience":[87],"are":[91,130,168],"selected":[92],"cluster":[95,111,119,147],"heads.":[96],"performance":[98],"MPLR":[101,154,185,194],"calculated":[105],"by":[106],"rate":[107,143],"change":[109,145],"heads,":[112],"average":[113,118],"number":[114],"clusters":[116],"size.":[120],"Vehicular":[121],"traffic":[122],"models":[123],"derived":[124,150],"from":[125],"Traffic":[127],"Wales":[128],"fed":[131],"input":[133],"motorway":[136],"simulator.":[137,183],"A":[138],"mathematical":[139,164],"analysis":[140],"head":[148],"validates":[152],"compared":[158,189],"simulated":[161,166],"results.":[162],"results":[167],"agreement":[171],"indicating":[172],"stability":[174],"accuracy":[180],"system":[186,192,195],"also":[188],"V2R":[191],"performing":[196],"better.":[197]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}