Enhanced Ant Colony Optimization for Vehicular Ad Hoc Networks Using Fittest Node Clustering Article Swipe
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.3390/su152215903
Vehicular ad hoc networks (VANETs) are a rapidly evolving field at the intersection of intelligent transportation systems, emphasizing the need for a stable and scalable VANET topology to accommodate growing vehicular densities. The intricate challenge of route selection calls for advanced clustering protocols to bolster road safety and message routing. This research introduces a novel approach to intelligent clustering routing protocols, leveraging heuristic-based solutions built upon an enhanced ant colony optimizer (ACO) framework. The study unfolds in two stages: the creation of a dynamic search space model and the election of cluster heads (CHs). The innovative dynamic aware transmission range parallel Euclidean distance (DA-TRPED) technique establishes a dynamic search space using the parallel Euclidean distance (PED) concept. This approach evaluates vehicular nodes by estimating PED values, reducing the search process’s complexity. Subsequently, an intelligent cluster head is selected by enhancing the dynamic evaporation factor (DEF) within the ACO technique. The experimental validation of the DA-TRPED technique takes place in NS2 simulations, demonstrating superior performance compared to conventional ACO. This enhancement is evident in metrics such as packet delivery, packet drop, throughput, end-to-end delay, and the lifetime analysis of clustered nodes. The proposed approach holds promise for optimizing VANETs, enhancing their stability and scalability while promoting road safety and efficient message routing.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3390/su152215903
- https://www.mdpi.com/2071-1050/15/22/15903/pdf?version=1699924186
- OA Status
- gold
- Cited By
- 19
- References
- 39
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4388661057
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4388661057Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3390/su152215903Digital Object Identifier
- Title
-
Enhanced Ant Colony Optimization for Vehicular Ad Hoc Networks Using Fittest Node ClusteringWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-11-14Full publication date if available
- Authors
-
Akhilesh Bijalwan, Iqram Hussain, Kamlesh Chandra Purohit, M. Anand KumarList of authors in order
- Landing page
-
https://doi.org/10.3390/su152215903Publisher landing page
- PDF URL
-
https://www.mdpi.com/2071-1050/15/22/15903/pdf?version=1699924186Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.mdpi.com/2071-1050/15/22/15903/pdf?version=1699924186Direct OA link when available
- Concepts
-
Computer science, Scalability, Ant colony optimization algorithms, Cluster analysis, Network packet, Computer network, Heuristic, Vehicular ad hoc network, Distributed computing, Throughput, Intelligent transportation system, Node (physics), Routing (electronic design automation), Wireless ad hoc network, Routing protocol, Engineering, Wireless, Artificial intelligence, Civil engineering, Telecommunications, Structural engineering, DatabaseTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
19Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 9, 2024: 10Per-year citation counts (last 5 years)
- References (count)
-
39Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4388661057 |
|---|---|
| doi | https://doi.org/10.3390/su152215903 |
| ids.doi | https://doi.org/10.3390/su152215903 |
| ids.openalex | https://openalex.org/W4388661057 |
| fwci | 3.15179406 |
| type | article |
| title | Enhanced Ant Colony Optimization for Vehicular Ad Hoc Networks Using Fittest Node Clustering |
| biblio.issue | 22 |
| biblio.volume | 15 |
| biblio.last_page | 15903 |
| biblio.first_page | 15903 |
| topics[0].id | https://openalex.org/T10761 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 1.0 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2208 |
| topics[0].subfield.display_name | Electrical and Electronic Engineering |
| topics[0].display_name | Vehicular Ad Hoc Networks (VANETs) |
| topics[1].id | https://openalex.org/T11099 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9861000180244446 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2203 |
| topics[1].subfield.display_name | Automotive Engineering |
| topics[1].display_name | Autonomous Vehicle Technology and Safety |
| topics[2].id | https://openalex.org/T10764 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9828000068664551 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Privacy-Preserving Technologies in Data |
| is_xpac | False |
| apc_list.value | 2200 |
| apc_list.currency | CHF |
| apc_list.value_usd | 2382 |
| apc_paid.value | 2200 |
| apc_paid.currency | CHF |
| apc_paid.value_usd | 2382 |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.7491620779037476 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C48044578 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6913841962814331 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q727490 |
| concepts[1].display_name | Scalability |
| concepts[2].id | https://openalex.org/C40128228 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6565081477165222 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q460851 |
| concepts[2].display_name | Ant colony optimization algorithms |
| concepts[3].id | https://openalex.org/C73555534 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6143323183059692 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q622825 |
| concepts[3].display_name | Cluster analysis |
| concepts[4].id | https://openalex.org/C158379750 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5772098302841187 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q214111 |
| concepts[4].display_name | Network packet |
| concepts[5].id | https://openalex.org/C31258907 |
| concepts[5].level | 1 |
| concepts[5].score | 0.562446653842926 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[5].display_name | Computer network |
| concepts[6].id | https://openalex.org/C173801870 |
| concepts[6].level | 2 |
| concepts[6].score | 0.5581649541854858 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q201413 |
| concepts[6].display_name | Heuristic |
| concepts[7].id | https://openalex.org/C192448918 |
| concepts[7].level | 4 |
| concepts[7].score | 0.538975179195404 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q682677 |
| concepts[7].display_name | Vehicular ad hoc network |
| concepts[8].id | https://openalex.org/C120314980 |
| concepts[8].level | 1 |
| concepts[8].score | 0.5261732339859009 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[8].display_name | Distributed computing |
| concepts[9].id | https://openalex.org/C157764524 |
| concepts[9].level | 3 |
| concepts[9].score | 0.5124145150184631 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1383412 |
| concepts[9].display_name | Throughput |
| concepts[10].id | https://openalex.org/C47796450 |
| concepts[10].level | 2 |
| concepts[10].score | 0.5117875933647156 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q508378 |
| concepts[10].display_name | Intelligent transportation system |
| concepts[11].id | https://openalex.org/C62611344 |
| concepts[11].level | 2 |
| concepts[11].score | 0.4800582826137543 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q1062658 |
| concepts[11].display_name | Node (physics) |
| concepts[12].id | https://openalex.org/C74172769 |
| concepts[12].level | 2 |
| concepts[12].score | 0.43695613741874695 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q1446839 |
| concepts[12].display_name | Routing (electronic design automation) |
| concepts[13].id | https://openalex.org/C94523657 |
| concepts[13].level | 3 |
| concepts[13].score | 0.4291796088218689 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q4085781 |
| concepts[13].display_name | Wireless ad hoc network |
| concepts[14].id | https://openalex.org/C104954878 |
| concepts[14].level | 3 |
| concepts[14].score | 0.426987886428833 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q1648707 |
| concepts[14].display_name | Routing protocol |
| concepts[15].id | https://openalex.org/C127413603 |
| concepts[15].level | 0 |
| concepts[15].score | 0.1636762022972107 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[15].display_name | Engineering |
| concepts[16].id | https://openalex.org/C555944384 |
| concepts[16].level | 2 |
| concepts[16].score | 0.14294859766960144 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q249 |
| concepts[16].display_name | Wireless |
| concepts[17].id | https://openalex.org/C154945302 |
| concepts[17].level | 1 |
| concepts[17].score | 0.1332497000694275 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[17].display_name | Artificial intelligence |
| concepts[18].id | https://openalex.org/C147176958 |
| concepts[18].level | 1 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q77590 |
| concepts[18].display_name | Civil engineering |
| concepts[19].id | https://openalex.org/C76155785 |
| concepts[19].level | 1 |
| concepts[19].score | 0.0 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q418 |
| concepts[19].display_name | Telecommunications |
| concepts[20].id | https://openalex.org/C66938386 |
| concepts[20].level | 1 |
| concepts[20].score | 0.0 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q633538 |
| concepts[20].display_name | Structural engineering |
| concepts[21].id | https://openalex.org/C77088390 |
| concepts[21].level | 1 |
| concepts[21].score | 0.0 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q8513 |
| concepts[21].display_name | Database |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.7491620779037476 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/scalability |
| keywords[1].score | 0.6913841962814331 |
| keywords[1].display_name | Scalability |
| keywords[2].id | https://openalex.org/keywords/ant-colony-optimization-algorithms |
| keywords[2].score | 0.6565081477165222 |
| keywords[2].display_name | Ant colony optimization algorithms |
| keywords[3].id | https://openalex.org/keywords/cluster-analysis |
| keywords[3].score | 0.6143323183059692 |
| keywords[3].display_name | Cluster analysis |
| keywords[4].id | https://openalex.org/keywords/network-packet |
| keywords[4].score | 0.5772098302841187 |
| keywords[4].display_name | Network packet |
| keywords[5].id | https://openalex.org/keywords/computer-network |
| keywords[5].score | 0.562446653842926 |
| keywords[5].display_name | Computer network |
| keywords[6].id | https://openalex.org/keywords/heuristic |
| keywords[6].score | 0.5581649541854858 |
| keywords[6].display_name | Heuristic |
| keywords[7].id | https://openalex.org/keywords/vehicular-ad-hoc-network |
| keywords[7].score | 0.538975179195404 |
| keywords[7].display_name | Vehicular ad hoc network |
| keywords[8].id | https://openalex.org/keywords/distributed-computing |
| keywords[8].score | 0.5261732339859009 |
| keywords[8].display_name | Distributed computing |
| keywords[9].id | https://openalex.org/keywords/throughput |
| keywords[9].score | 0.5124145150184631 |
| keywords[9].display_name | Throughput |
| keywords[10].id | https://openalex.org/keywords/intelligent-transportation-system |
| keywords[10].score | 0.5117875933647156 |
| keywords[10].display_name | Intelligent transportation system |
| keywords[11].id | https://openalex.org/keywords/node |
| keywords[11].score | 0.4800582826137543 |
| keywords[11].display_name | Node (physics) |
| keywords[12].id | https://openalex.org/keywords/routing |
| keywords[12].score | 0.43695613741874695 |
| keywords[12].display_name | Routing (electronic design automation) |
| keywords[13].id | https://openalex.org/keywords/wireless-ad-hoc-network |
| keywords[13].score | 0.4291796088218689 |
| keywords[13].display_name | Wireless ad hoc network |
| keywords[14].id | https://openalex.org/keywords/routing-protocol |
| keywords[14].score | 0.426987886428833 |
| keywords[14].display_name | Routing protocol |
| keywords[15].id | https://openalex.org/keywords/engineering |
| keywords[15].score | 0.1636762022972107 |
| keywords[15].display_name | Engineering |
| keywords[16].id | https://openalex.org/keywords/wireless |
| keywords[16].score | 0.14294859766960144 |
| keywords[16].display_name | Wireless |
| keywords[17].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[17].score | 0.1332497000694275 |
| keywords[17].display_name | Artificial intelligence |
| language | en |
| locations[0].id | doi:10.3390/su152215903 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S10134376 |
| locations[0].source.issn | 2071-1050 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2071-1050 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Sustainability |
| locations[0].source.host_organization | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.mdpi.com/2071-1050/15/22/15903/pdf?version=1699924186 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Sustainability |
| locations[0].landing_page_url | https://doi.org/10.3390/su152215903 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5022521584 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Akhilesh Bijalwan |
| authorships[0].countries | IN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I60054993 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of CSE, Graphic Era Deemed to Be University Dehradun, Uttarakhand 248002, India |
| authorships[0].institutions[0].id | https://openalex.org/I60054993 |
| authorships[0].institutions[0].ror | https://ror.org/03wqgqd89 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I60054993 |
| authorships[0].institutions[0].country_code | IN |
| authorships[0].institutions[0].display_name | Graphic Era University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Akhilesh Bijalwan |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of CSE, Graphic Era Deemed to Be University Dehradun, Uttarakhand 248002, India |
| authorships[1].author.id | https://openalex.org/A5061804141 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-5183-7631 |
| authorships[1].author.display_name | Iqram Hussain |
| authorships[1].countries | US |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I205783295 |
| authorships[1].affiliations[0].raw_affiliation_string | Department of Anesthesiology, Weill Cornell Medicine, Cornell University, New York, NY 10065, USA |
| authorships[1].institutions[0].id | https://openalex.org/I205783295 |
| authorships[1].institutions[0].ror | https://ror.org/05bnh6r87 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I205783295 |
| authorships[1].institutions[0].country_code | US |
| authorships[1].institutions[0].display_name | Cornell University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Iqram Hussain |
| authorships[1].is_corresponding | True |
| authorships[1].raw_affiliation_strings | Department of Anesthesiology, Weill Cornell Medicine, Cornell University, New York, NY 10065, USA |
| authorships[2].author.id | https://openalex.org/A5065671552 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-3188-529X |
| authorships[2].author.display_name | Kamlesh Chandra Purohit |
| authorships[2].countries | IN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I60054993 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of CSE, Graphic Era Deemed to Be University Dehradun, Uttarakhand 248002, India |
| authorships[2].institutions[0].id | https://openalex.org/I60054993 |
| authorships[2].institutions[0].ror | https://ror.org/03wqgqd89 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I60054993 |
| authorships[2].institutions[0].country_code | IN |
| authorships[2].institutions[0].display_name | Graphic Era University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Kamlesh Chandra Purohit |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Department of CSE, Graphic Era Deemed to Be University Dehradun, Uttarakhand 248002, India |
| authorships[3].author.id | https://openalex.org/A5089213155 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-0394-7008 |
| authorships[3].author.display_name | M. Anand Kumar |
| authorships[3].countries | IN |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I157674215 |
| authorships[3].affiliations[0].raw_affiliation_string | School of Information Science, Presidency University, Bengaluru 700073, India |
| authorships[3].institutions[0].id | https://openalex.org/I157674215 |
| authorships[3].institutions[0].ror | https://ror.org/04xgbph11 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I157674215 |
| authorships[3].institutions[0].country_code | IN |
| authorships[3].institutions[0].display_name | Presidency University |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | M. Anand Kumar |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | School of Information Science, Presidency University, Bengaluru 700073, India |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.mdpi.com/2071-1050/15/22/15903/pdf?version=1699924186 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Enhanced Ant Colony Optimization for Vehicular Ad Hoc Networks Using Fittest Node Clustering |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10761 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 1.0 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2208 |
| primary_topic.subfield.display_name | Electrical and Electronic Engineering |
| primary_topic.display_name | Vehicular Ad Hoc Networks (VANETs) |
| related_works | https://openalex.org/W2027636740, https://openalex.org/W2062688728, https://openalex.org/W2061231656, https://openalex.org/W2771454953, https://openalex.org/W3046762796, https://openalex.org/W3202102306, https://openalex.org/W3046260513, https://openalex.org/W2998294818, https://openalex.org/W45347327, https://openalex.org/W2020269557 |
| cited_by_count | 19 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 9 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 10 |
| locations_count | 1 |
| best_oa_location.id | doi:10.3390/su152215903 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S10134376 |
| best_oa_location.source.issn | 2071-1050 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2071-1050 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Sustainability |
| best_oa_location.source.host_organization | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.mdpi.com/2071-1050/15/22/15903/pdf?version=1699924186 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Sustainability |
| best_oa_location.landing_page_url | https://doi.org/10.3390/su152215903 |
| primary_location.id | doi:10.3390/su152215903 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S10134376 |
| primary_location.source.issn | 2071-1050 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2071-1050 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Sustainability |
| primary_location.source.host_organization | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.mdpi.com/2071-1050/15/22/15903/pdf?version=1699924186 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Sustainability |
| primary_location.landing_page_url | https://doi.org/10.3390/su152215903 |
| publication_date | 2023-11-14 |
| publication_year | 2023 |
| referenced_works | https://openalex.org/W4379260301, https://openalex.org/W4385814175, https://openalex.org/W3172693615, https://openalex.org/W2472493131, https://openalex.org/W2460379932, https://openalex.org/W3211089035, https://openalex.org/W3206939630, https://openalex.org/W2980424388, https://openalex.org/W2885874908, https://openalex.org/W3013388798, https://openalex.org/W6807630435, https://openalex.org/W4312334862, https://openalex.org/W6811483353, https://openalex.org/W4361801022, https://openalex.org/W2925063426, https://openalex.org/W6847811201, https://openalex.org/W2793926620, https://openalex.org/W4292791624, https://openalex.org/W4293106539, https://openalex.org/W414544266, https://openalex.org/W4210812621, https://openalex.org/W2793643983, https://openalex.org/W2604366761, https://openalex.org/W2612198333, https://openalex.org/W3047334206, https://openalex.org/W3039463159, https://openalex.org/W2553067200, https://openalex.org/W3152126440, https://openalex.org/W2736037228, https://openalex.org/W2767086322, https://openalex.org/W3097641306, https://openalex.org/W2944464036, https://openalex.org/W4385666174, https://openalex.org/W4386416067, https://openalex.org/W3007754307, https://openalex.org/W4316193617, https://openalex.org/W4210815602, https://openalex.org/W4310730770, https://openalex.org/W4226124799 |
| referenced_works_count | 39 |
| abstract_inverted_index.a | 6, 21, 53, 82, 106 |
| abstract_inverted_index.ad | 1 |
| abstract_inverted_index.an | 66, 132 |
| abstract_inverted_index.as | 175 |
| abstract_inverted_index.at | 10 |
| abstract_inverted_index.by | 122, 138 |
| abstract_inverted_index.in | 76, 158, 172 |
| abstract_inverted_index.is | 136, 170 |
| abstract_inverted_index.of | 13, 35, 81, 90, 152, 187 |
| abstract_inverted_index.to | 27, 43, 56, 165 |
| abstract_inverted_index.ACO | 147 |
| abstract_inverted_index.NS2 | 159 |
| abstract_inverted_index.PED | 124 |
| abstract_inverted_index.The | 32, 73, 94, 149, 190 |
| abstract_inverted_index.and | 23, 47, 87, 183, 201, 207 |
| abstract_inverted_index.ant | 68 |
| abstract_inverted_index.are | 5 |
| abstract_inverted_index.for | 20, 39, 195 |
| abstract_inverted_index.hoc | 2 |
| abstract_inverted_index.the | 11, 18, 79, 88, 111, 127, 140, 146, 153, 184 |
| abstract_inverted_index.two | 77 |
| abstract_inverted_index.ACO. | 167 |
| abstract_inverted_index.This | 50, 117, 168 |
| abstract_inverted_index.head | 135 |
| abstract_inverted_index.need | 19 |
| abstract_inverted_index.road | 45, 205 |
| abstract_inverted_index.such | 174 |
| abstract_inverted_index.upon | 65 |
| abstract_inverted_index.(ACO) | 71 |
| abstract_inverted_index.(DEF) | 144 |
| abstract_inverted_index.(PED) | 115 |
| abstract_inverted_index.VANET | 25 |
| abstract_inverted_index.aware | 97 |
| abstract_inverted_index.built | 64 |
| abstract_inverted_index.calls | 38 |
| abstract_inverted_index.drop, | 179 |
| abstract_inverted_index.field | 9 |
| abstract_inverted_index.heads | 92 |
| abstract_inverted_index.holds | 193 |
| abstract_inverted_index.model | 86 |
| abstract_inverted_index.nodes | 121 |
| abstract_inverted_index.novel | 54 |
| abstract_inverted_index.place | 157 |
| abstract_inverted_index.range | 99 |
| abstract_inverted_index.route | 36 |
| abstract_inverted_index.space | 85, 109 |
| abstract_inverted_index.study | 74 |
| abstract_inverted_index.takes | 156 |
| abstract_inverted_index.their | 199 |
| abstract_inverted_index.using | 110 |
| abstract_inverted_index.while | 203 |
| abstract_inverted_index.(CHs). | 93 |
| abstract_inverted_index.colony | 69 |
| abstract_inverted_index.delay, | 182 |
| abstract_inverted_index.factor | 143 |
| abstract_inverted_index.nodes. | 189 |
| abstract_inverted_index.packet | 176, 178 |
| abstract_inverted_index.safety | 46, 206 |
| abstract_inverted_index.search | 84, 108, 128 |
| abstract_inverted_index.stable | 22 |
| abstract_inverted_index.within | 145 |
| abstract_inverted_index.VANETs, | 197 |
| abstract_inverted_index.bolster | 44 |
| abstract_inverted_index.cluster | 91, 134 |
| abstract_inverted_index.dynamic | 83, 96, 107, 141 |
| abstract_inverted_index.evident | 171 |
| abstract_inverted_index.growing | 29 |
| abstract_inverted_index.message | 48, 209 |
| abstract_inverted_index.metrics | 173 |
| abstract_inverted_index.promise | 194 |
| abstract_inverted_index.rapidly | 7 |
| abstract_inverted_index.routing | 59 |
| abstract_inverted_index.stages: | 78 |
| abstract_inverted_index.unfolds | 75 |
| abstract_inverted_index.values, | 125 |
| abstract_inverted_index.(VANETs) | 4 |
| abstract_inverted_index.DA-TRPED | 154 |
| abstract_inverted_index.advanced | 40 |
| abstract_inverted_index.analysis | 186 |
| abstract_inverted_index.approach | 55, 118, 192 |
| abstract_inverted_index.compared | 164 |
| abstract_inverted_index.concept. | 116 |
| abstract_inverted_index.creation | 80 |
| abstract_inverted_index.distance | 102, 114 |
| abstract_inverted_index.election | 89 |
| abstract_inverted_index.enhanced | 67 |
| abstract_inverted_index.evolving | 8 |
| abstract_inverted_index.lifetime | 185 |
| abstract_inverted_index.networks | 3 |
| abstract_inverted_index.parallel | 100, 112 |
| abstract_inverted_index.proposed | 191 |
| abstract_inverted_index.reducing | 126 |
| abstract_inverted_index.research | 51 |
| abstract_inverted_index.routing. | 49, 210 |
| abstract_inverted_index.scalable | 24 |
| abstract_inverted_index.selected | 137 |
| abstract_inverted_index.superior | 162 |
| abstract_inverted_index.systems, | 16 |
| abstract_inverted_index.topology | 26 |
| abstract_inverted_index.Euclidean | 101, 113 |
| abstract_inverted_index.Vehicular | 0 |
| abstract_inverted_index.challenge | 34 |
| abstract_inverted_index.clustered | 188 |
| abstract_inverted_index.delivery, | 177 |
| abstract_inverted_index.efficient | 208 |
| abstract_inverted_index.enhancing | 139, 198 |
| abstract_inverted_index.evaluates | 119 |
| abstract_inverted_index.intricate | 33 |
| abstract_inverted_index.optimizer | 70 |
| abstract_inverted_index.promoting | 204 |
| abstract_inverted_index.protocols | 42 |
| abstract_inverted_index.selection | 37 |
| abstract_inverted_index.solutions | 63 |
| abstract_inverted_index.stability | 200 |
| abstract_inverted_index.technique | 104, 155 |
| abstract_inverted_index.vehicular | 30, 120 |
| abstract_inverted_index.(DA-TRPED) | 103 |
| abstract_inverted_index.clustering | 41, 58 |
| abstract_inverted_index.densities. | 31 |
| abstract_inverted_index.end-to-end | 181 |
| abstract_inverted_index.estimating | 123 |
| abstract_inverted_index.framework. | 72 |
| abstract_inverted_index.innovative | 95 |
| abstract_inverted_index.introduces | 52 |
| abstract_inverted_index.leveraging | 61 |
| abstract_inverted_index.optimizing | 196 |
| abstract_inverted_index.protocols, | 60 |
| abstract_inverted_index.technique. | 148 |
| abstract_inverted_index.validation | 151 |
| abstract_inverted_index.accommodate | 28 |
| abstract_inverted_index.complexity. | 130 |
| abstract_inverted_index.emphasizing | 17 |
| abstract_inverted_index.enhancement | 169 |
| abstract_inverted_index.establishes | 105 |
| abstract_inverted_index.evaporation | 142 |
| abstract_inverted_index.intelligent | 14, 57, 133 |
| abstract_inverted_index.performance | 163 |
| abstract_inverted_index.process’s | 129 |
| abstract_inverted_index.scalability | 202 |
| abstract_inverted_index.throughput, | 180 |
| abstract_inverted_index.conventional | 166 |
| abstract_inverted_index.experimental | 150 |
| abstract_inverted_index.intersection | 12 |
| abstract_inverted_index.simulations, | 160 |
| abstract_inverted_index.transmission | 98 |
| abstract_inverted_index.Subsequently, | 131 |
| abstract_inverted_index.demonstrating | 161 |
| abstract_inverted_index.transportation | 15 |
| abstract_inverted_index.heuristic-based | 62 |
| cited_by_percentile_year.max | 99 |
| cited_by_percentile_year.min | 98 |
| corresponding_author_ids | https://openalex.org/A5061804141 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 4 |
| corresponding_institution_ids | https://openalex.org/I205783295 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/11 |
| sustainable_development_goals[0].score | 0.49000000953674316 |
| sustainable_development_goals[0].display_name | Sustainable cities and communities |
| citation_normalized_percentile.value | 0.91771469 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |