<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-2-799-1791951385</doi_batch_id>
  <timestamp>20261014041625</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>Journal of Cybersecurity and Information Management</full_title>
    <abbrev_title>JCIM</abbrev_title>
    <issn media_type="print">2769-7851</issn>
    <issn media_type="electronic">2690-6775</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2020</year>
    </publication_date>
    <journal_volume>
     <volume>2</volume>
    </journal_volume>
    <issue>2</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>Modeling of Optimal Adaptive Weighted Clustering Protocol for Vehicular Ad hoc Networks</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>M.</given_name>
      <surname>Elhoseny</surname>
      <affiliations>
       <institution>
        <institution_name>CoVIS Lab, Department of Computer Science and Engineering, University of North Texas, USA</institution_name>
       </institution>
      </affiliations>
     </person_name>
     <person_name sequence="additional" contributor_role="author">
      <given_name>X.</given_name>
      <surname>Yuan</surname>
      <affiliations>
       <institution>
        <institution_name>CoVIS Lab, Department of Computer Science and Engineering, University of North Texas, USA</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>Vehicular ad hoc network (VANET) is a mobile adhoc network widely used in intelligent transportation systems (ITS). Owing to the unique features of VANET like self-organized, recurrent link interruptions, and quick topology modifications, the design of an effective clustering protocol is a challenging problem. The clustering process is considered an optimization problem and can be solved using metaheuristic algorithms. Therefore, this paper presents an adaptive weighted clustering protocol with artificial fish swarm optimization (AWCP-AFSO) algorithm for VANET. The proposed AWCP-AFSO technique aims to select the CHs effectively and thereby accomplishes energy efficiency. To construct clusters, the AWCP-AFSO algorithm derives an objective function from electing an optimal set of CHs. A wide range of simulations are performed, and the results are investigated in terms of several performance measures. The experimental values showcased the betterment of the AWCP-AFSO technique over the recent techniques.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2020</year>
    </publication_date>
    <pages>
     <first_page>68</first_page>
     <last_page>76</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">799</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/JCIM.020204</doi>
     <resource>https://americaspg.com/journal/2/article/799</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://americaspg.com/storage/3997.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
