<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta> 
<article-id pub-id-type="publisher-id">17620</article-id>
<article-id pub-id-type="doi">10.32604/CMC.2021.017620</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Context and Machine Learning Based Trust Management Framework for Internet of Vehicles</article-title>
<alt-title alt-title-type="left-running-head">Context and Machine Learning Based Trust Management Framework for Internet of Vehicles</alt-title>
<alt-title alt-title-type="right-running-head">Context and Machine Learning Based Trust Management Framework for Internet of Vehicles</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Rehman</surname><given-names>Abdul</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western">
<surname>Hassan</surname><given-names>Mohd Fadzil</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western">
<surname>Hooi</surname><given-names>Yew Kwang</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western">
<surname>Qureshi</surname><given-names>Muhammad Aasim</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western">
<surname>Chung</surname><given-names>Tran Duc</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western">
<surname>Akbar</surname><given-names>Rehan</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Safdar</surname><given-names>Sohail</given-names></name>
<xref ref-type="aff" rid="aff-5">5</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Computer and Information Science Department, Centre for Research and Data Science (CeRDaS), Universiti Teknologi PETRONAS</institution>, <addr-line>32610, Seri Iskandar, Perak Darul Ridzuan</addr-line>, <country>Malaysia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science, Bahria University</institution>, <country>Pakistan</country></aff>
<aff id="aff-3"><label>3</label><institution>Computing Fundamental Department, FPT University, Hoa Lac Hi-Tech Park</institution>, <addr-line>Hanoi</addr-line>, <country>Vietnam</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Information Systems, Universiti Tunku Abdul Rahman</institution>, <country>Malaysia</country></aff>
<aff id="aff-5"><label>5</label><institution>Information Technology Department College of IT, AHLIA University</institution>, <country>Bahrain</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Abdul Rehman. Email: <email>abdul_18000023@utp.edu.my</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-04-02"><day>02</day><month>04</month><year>2021</year></pub-date>
<volume>68</volume>
<issue>3</issue>
<fpage>4125</fpage>
<lpage>4142</lpage>
<history>
<date date-type="received"><day>05</day><month>02</month><year>2021</year></date>
<date date-type="accepted"><day>22</day><month>03</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Rehman et al.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Rehman et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_17620.pdf"></self-uri>
<abstract>
<p>Trust is one of the core components of any ad hoc network security system. Trust management (TM) has always been a challenging issue in a vehicular network. One such developing network is the Internet of vehicles (IoV), which is expected to be an essential part of smart cities. IoV originated from the merger of Vehicular ad hoc networks (VANET) and the Internet of things (IoT). Security is one of the main barriers in the on-road IoV implementation. Existing security standards are insufficient to meet the extremely dynamic and rapidly changing IoV requirements. Trust plays a vital role in ensuring security, especially during vehicle to vehicle communication. Vehicular networks, having a unique nature among other wireless ad hoc networks, require dedicated efforts to develop trust protocols. Current TM schemes are inflexible and static. Predefined scenarios and limited parameters are the basis for existing TM models that are not suitable for vehicle networks. The vehicular network requires agile and adaptive solutions to ensure security, especially when it comes to critical messages. The vehicle network&#x0027;s wireless nature increases its attack surface and exposes the network to numerous security threats. Moreover, internet involvement makes it more vulnerable to cyber-attacks. The proposed TM framework is based on context-based cognition and machine learning to be best suited to IoV dynamics. Machine learning is the best solution to utilize the big data produced by vehicle sensors. To handle the uncertainty Bayesian machine learning statistical model is used. The proposed framework can adapt scenarios dynamically and infer using the maximum possible parameter available. The results indicated better performance than existing TM methods. Furthermore, for future work, a high-level machine learning model is proposed.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Internet of vehicles (IoV)</kwd>
<kwd>trust management (TM)</kwd>
<kwd>vehicular ad hoc network (VANET)</kwd>
<kwd>machine learning</kwd>
<kwd>context awareness</kwd>
<kwd>bayesian learning</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label><title>Introduction</title>
<p>The coming era is of high-speed communications and the Internet of things (IoT). By 2025, IoT will be connecting up to 21 billion devices [<xref ref-type="bibr" rid="ref-1">1</xref>]. The Vehicular ad hoc network (VANET) is one of the research areas shifting towards IoT, such as the Internet of vehicles IoV [<xref ref-type="bibr" rid="ref-2">2</xref>&#x2013;<xref ref-type="bibr" rid="ref-6">6</xref>]. Since the IoV is not yet standardized, a few studies have been carried out in this field. Security in wireless networks has always been a core challenge, especially ad hoc networks where each time distinct nodes are likely to involve in network formation [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>]. Similarly, the biggest threat for IoV is a security breach [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>], which can cause a catastrophic sequence of chain accidents, traffic congestions, and diverting traffic to a specific path. The vehicular network has unique properties, unlike other wireless networks. The vehicle network&#x0027;s dynamic topology increases the attack-surface [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>], allowing malicious nodes to launch an attack through a security breach. Moreover, the vehicle networks have no geographical limits that make vehicle to vehicle communication very critical. Trust plays an essential role in ensuring security in wireless networks.</p>
<p>Several models have been proposed for trust evaluation in VANET/Intelligent transport system (ITS) over the years, and each model has adopted different techniques and methods. Due to the heterogeneous nature, many factors need to be considered while evaluating the trust, which is missing in existing static models. Every model has one thing in common; they have selected set parameters or scenarios that are not ideal for changing vehicle networks. In a small experimental setting, most models have attempted to solve such issues that work only if significant changes are not made. In conclusion, the vehicle network is a complex system for which the available models are unable to provide an adaptive solution. The proposed TM framework uses the context-aware cognitive approach to solve the problem. Our work is motivated to fill that gap where TM is flexible and static. The framework constructs a scenario-based context for every other critical message received. The framework is subsequently structured to adopt the appropriate trust module for each scenario.</p>
<p>The vehicular network TM schemes must be adaptive to the environment. Artificial intelligence (AI) is the core approach to developing context-awareness. AI techniques are the most effective for building context [<xref ref-type="bibr" rid="ref-13">13</xref>]. Cognitive inferencing is used for context-awareness in the presented TM framework. Besides context-awareness, machine learning is another suitable technology to be implemented on IoV gathered data. Taking full use of IoV big data is one of this study&#x0027;s goals, which requires machine learning solutions. Machine learning is the best approach to single out the malicious nodes from VANET [<xref ref-type="bibr" rid="ref-14">14</xref>,<xref ref-type="bibr" rid="ref-15">15</xref>]. Machine learning algorithms proved dynamic properties to assure security in VANETS [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>]. The vehicular network has not taken full use of machine learning yet. Trust is one of the areas that can be managed using machine learning. Within the trust, uncertainty is the critical issue faced by the vehicular network during trust evaluation. The framework uses a statistical machine learning technique; Bayesian machine learning (BML) evaluates trust under uncertainty. BML provides multilevel adaptive features to match the dynamic nature of IoV [<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>An overview of the IoV architecture is presented in <?A3B2 "fig1",5,"anchor"?><xref ref-type="fig" rid="fig-1">Fig. 1</xref>. The centralized data repository is managed through cloud services. Vehicle nodes are equipped with an On board unit (OBU) that simultaneously function as fog nodes with a local data repository called OBUfog. The local data repository is synchronized parodically with a centralized repository. The trust value of all nodes is stored and updated in a centralized database. The framework uses a local data repository for immediate data access, and it is useful in case of the unavailability of internet access or disconnection from the centralized system. The unavailability of a centralized system is a frequent issue with vehicular networks. The use of a decentralized approach is equally helpful to deal with critical issues in communication security.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>An overview of the IoV architecture, with all nodes equipped with OBUfog and local data repository, connected to a centralized cloud database using BTSRsu</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_17620-fig-1.png"/></fig>
<p>The rest of the paper is organized as Section 2 is the literature review, Section 3 explains the proposed framework. Section 4 discusses the trust evaluation process Section 5 is performance analysis. The last section concludes the research study.</p>
</sec>
<sec id="s2">
<label>2</label><title>Literature Review</title>
<p>The security of any information system has always been a critical concern. In a study [<xref ref-type="bibr" rid="ref-4">4</xref>] on the upcoming challenges of IoV, authors identify security as a critical challenge to overcome. IoV is the future of intelligent vehicular communication and smart cities [<xref ref-type="bibr" rid="ref-19">19</xref>]. Multidimensional security problems occur within IoV, making security one of the main challenges for ad hoc networks. Available models for trust evaluation and management in IoV do not provide the ultimate solution and thus require improvement [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-20">20</xref>]. Many trust models for vehicle networks have been proposed; we discuss some of the renowned models in this section. Most of the trust models available are based on VANETs or ITS. A few recent works can be found on IoV considering trust [<xref ref-type="bibr" rid="ref-21">21</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>]. The existing models can be classified by trust measuring type and categorized into three: data-centric, entity-centric, and hybrid models.</p>
<sec id="s2_1">
<label>2.1</label><title>Trust Models</title>
<p>Trust is determined by the received messages in data-centric models. In a data-centric model, neighboring nodes share their trust opinions on specific events and calculating the trust by majority estimate [<xref ref-type="bibr" rid="ref-23">23</xref>]. The key downside of such models is, they neglect information relevant to the node [<xref ref-type="bibr" rid="ref-11">11</xref>]. Entity-centric models are based on trust credit building. In these models, the interaction experience is an important characteristic. When measuring trust in real-time, inter-node interaction experience is taken into account [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-25">25</xref>]. In one of the entity-centric trust models, the level of trust is determined by fuzzy logic [<xref ref-type="bibr" rid="ref-25">25</xref>]. Another such model presented by [<xref ref-type="bibr" rid="ref-26">26</xref>] work on prior experience, Certificate authority (CA) and, neighbor opinion. The key issue with these models is that they presume that the malicious activity cannot be performed when the node is authenticated. The second drawback is the dependency on CA. Overall entity centric models are a very powerful tool for evaluating trust. However, these models miss the useful aspects of data centric.</p>
<p>Hybrid models incorporate properties of data and entity to determine trust. Most of these models evaluate the data trustworthiness and keep track of the node trust. A combination of role-based and experience is one such popular model [<xref ref-type="bibr" rid="ref-27">27</xref>]. Another hybrid model evaluates trust by neighbor opinion and similarity-trust [<xref ref-type="bibr" rid="ref-28">28</xref>]. In a research study, researchers used social-trust while evaluating trust [<xref ref-type="bibr" rid="ref-29">29</xref>]. Some researchers have used probability methods, such as the law of Bayes, the theory of evidence, and the theory of Markov [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-30">30</xref>]. For handling the uncertainty during TM, a couple of hybrid models have been proposed [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-31">31</xref>]. Even though the hybrid models are a combination of data and entity, their dynamic integration is still missing [<xref ref-type="bibr" rid="ref-11">11</xref>]. However, to the depth of study, there is no such trust model that uses all the available information during the event. All the models evaluate trust based on specific predefined parameters and scenarios.</p>
</sec>
<sec id="s2_2">
<label>2.2</label><title>Machine Learning in Vehicular Networks</title>
<p>Machine learning has notable coherence with IoV due to its ability to generate big data. Significant research work has been conducted so far on VANET using machine learning. A research study investigated different aspects of detecting misbehaving vehicles by machine learning and found machine learning an effective method for vehicular network security [<xref ref-type="bibr" rid="ref-14">14</xref>]. The VANET and machine learning have strong coherence, explored in a comparative study between machine learning and VANETS [<xref ref-type="bibr" rid="ref-15">15</xref>]. Researchers in their work used machine learning to detect DDOS attacks in vehicular networks, the study concluded with positive results [<xref ref-type="bibr" rid="ref-32">32</xref>]. Another research work on VANET security worked on false node position attacks and applied a machine-learning algorithm to solve the problem [<xref ref-type="bibr" rid="ref-33">33</xref>]. Most of the studies have shown promising results.</p>
</sec>
<sec id="s2_3">
<label>2.3</label><title>Context Awareness</title>
<p>The main aim of using context-awareness is to add flexibility by making maximum use of the available data. Authors in a review study elaborate on the potential need for an AI approach for the trust evaluation in vehicular networks; coherence between VANET security and AI solutions exists [<xref ref-type="bibr" rid="ref-20">20</xref>]. A context is a form of knowledge that relates to the problem-solving ability of humans [<xref ref-type="bibr" rid="ref-34">34</xref>]. AI techniques are suitable for context development [<xref ref-type="bibr" rid="ref-35">35</xref>].</p>
<p>The proposed TM framework relies on a hybrid approach using both data and entity properties. On the other hand, it is also worth mentioning that all the available models are for VANETS/ITS. In contrast, our model is a novel trust model for IoV that works on context adaption and machine learning. To the best of our knowledge, no such trust model is presented in the field yet. Our proposed trust evaluation framework is based on context-awareness.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label><title>Proposed TM Framework</title>
<p>The proposed IoV TM framework is intended to fill the gaps in trust evaluation. The framework works by establishing a context for an event using a cognitive approach. <?A3B2 "fig2",5,"anchor"?><xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows the proposed TM framework. The framework has three key components: input parameters, context building, and trust evaluation. The framework proposed designs on the best practices of VANET, implemented by notable trust models [<xref ref-type="bibr" rid="ref-24">24</xref>&#x2013;<xref ref-type="bibr" rid="ref-25">25</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>,<xref ref-type="bibr" rid="ref-28">28</xref>,<xref ref-type="bibr" rid="ref-36">36</xref>]. The framework components are derived from the generic context-aware flow model [<xref ref-type="bibr" rid="ref-34">34</xref>,<xref ref-type="bibr" rid="ref-37">37</xref>,<xref ref-type="bibr" rid="ref-38">38</xref>]. Once a critical incident alert is received from nearby vehicles, next, it requires the sender&#x0027;s authentication. The is responsible for carrying out the authentication process using the public key infrastructure (PKI). Since it needs cryptography and exceeds the scope of our work, we have already considered existing solutions.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Proposed TM framework with three main modules: input parameters, context building, and trust evaluation</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_17620-fig-2.png"/></fig>
<sec id="s3_1">
<label>3.1</label><title>Parameter Input Layer</title>
<p>After the authentication process, the second task is parameter management, as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. Information about an event is filtered out to obtain parameters from the received message token. For ease, the framework classifies all the possible parameters. The information obtained from the node is formalized in &#x201C;cues,&#x201D; the cues are fed into the context layer for context building. Parameter prioritization is the main task since some parameters have a more valid source and weight than others.</p>
</sec>
<sec id="s3_2">
<label>3.2</label><title>Context Building Layer</title>
<p>This layer is responsible for building a context around the road event. Context building is the responsibility of the inference engine. The immediately available data is called a low-level context that is transformed into a high-level context. Context data is interconnected information set mostly containing uncertainty. The uncertainty must be handled before submitting it to the context inference process [<xref ref-type="bibr" rid="ref-34">34</xref>]. First, to create a context, the raw data is used, and it is a prerequisite for the development of the context [<xref ref-type="bibr" rid="ref-35">35</xref>]. The perimeter module is responsible for providing available information in the form of readable &#x201C;cues&#x201D; to the context module. Context offers complete information to evaluate trust in an event. The context management module is responsible for handling context information obtained from the previous layer.</p>
</sec>
<sec id="s3_3">
<label>3.3</label><title>Trust Evaluation Layer</title>
<p>The responsibility of this layer is to calculate the trust level. Since the proposed framework is based on the cognitive context approach, the inference engine and trust evaluation modules continuously exchanged information. The trust evaluation layer consists of different modules. In the proposed TM framework, the trust evaluation process is adaptive. The most used approaches are experience-based, role-based, opinion-based, cluster-based, thread-based, as illustrated in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. Different scenarios require different evaluation modules to evaluate the trust. The proposed trust framework matches the most suitable trust evaluation module with an event&#x0027;s scenario using context-awareness.</p>
</sec>
<sec id="s3_4">
<label>3.4</label><title>Trust Metric</title>
<p>It is essential to define trust metrics before moving towards the trust framework. All existing models have taken into consideration different paraments as metrics. Experience is one of the most used parameters by many models [<xref ref-type="bibr" rid="ref-25">25</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>,<xref ref-type="bibr" rid="ref-28">28</xref>]. Different models also use parameters such as time, location, distance, and others. The goal of our work is to use the maximum available parameters to evaluate trust. The set of trust metrics is made adaptive for this purpose.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label><title>Trust Evaluation Process</title>
<p>The proposed TM framework evaluates trust based on a critical road event. Trust evaluation revolves around the road-event. The event is denoted by Event ID (Ev_ID). The reporting vehicle that has evident the event itself is Reporter-vehicle (Rp_veh). The vehicles that are not evident in the event still carry the message for hopping or beaconing they are denoted as Carrier-vehicle (Cr_veh). The road event is illustrated in <?A3B2 "fig3",5,"anchor"?><xref ref-type="fig" rid="fig-3">Fig. 3</xref>. Local database and centralized data repositories are denoted as Local-database (Loc_DB) and Centralized-database (Cnt_DB). Tr &#x1D4F5;&#x1D4FF; denotes the trust level value.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Illustration of road event, with the participation of reporting and carrier vehicles, in hopping</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_17620-fig-3.png"/></fig>
<p>The trust level of a specific event is represented by Ev_ID_Tr &#x1D4F5;&#x1D4FF;, and the trust level value of any node is represented by Veh_ID_Tr &#x1D4F5;&#x1D4FF;. The unique ID identifies every vehicle in the network. The trust level value is updated after the completion of the event in both local and centralized databases.</p>
<sec id="s4_1">
<label>4.1</label><title>Assumptions</title>
<p>The following assumptions are made to ensure the proper functioning of the proposed TM framework:
<list list-type="bullet">
<list-item><p>All the vehicles in the network are equipped with OBUFog.</p></list-item>
<list-item><p>All vehicles have a uniform communication platform.</p></list-item>
<list-item><p>A third-party CA manages the PKI.</p></list-item>
</list></p>
</sec>
<sec id="s4_2">
<label>4.2</label><title>Context Ontology</title>
<p>Ontology is one of the promising methods for context building, which is based on formal logic. With the help of ontology, the context information is built around a road-event. An ontology is an explicit, systematic definition of concepts in a discourse domain. A brief ontology of TM framework is shown in <?A3B2 "fig4",5,"anchor"?><xref ref-type="fig" rid="fig-4">Fig. 4</xref>, which illustrates the hierarchical classes and instances of the concept. It is not obligatory to store all relationships with ontology; existing triplets can generate new facts. Together with a collection of individual class instances, an ontology forms a knowledge-base [<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Hierarchical taxonomy, classes, and instances of IoV TM ontology</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_17620-fig-4.png"/></fig>
<p>The taxonomic relationship of ontology includes the following classes: <italic>Vehicle</italic>, <italic>EvaluationModule</italic>, and <italic>Event</italic>. All the trust evaluation modules are subclasses of class <italic>EvaluationModule</italic>, namely: <italic>ExperienceModule</italic>, <italic>SpecialVehicle</italic>, <italic>Opinion</italic>, <italic>ClusterBased</italic>, <italic>ThreadBased</italic>, and <italic>Uncertainty</italic>. Rep_veh, Carr_veh, and Special_veh are the instances of the class vehicle. The class is disjoint to avoid conceptual overlapping by the reasoner. The instances are associated with the vehicular ID, event ID, location, time, and other data properties.</p>
</sec>
<sec id="s4_3">
<label>4.3</label><title>Trust Level Threshold</title>
<p>The Trust level (Tr &#x1D4F5;&#x1D4FF;) is measured between 0 and 1, an untrustworthy report is denoted as 0, and the highest level of trust is represented by 1 [<xref ref-type="bibr" rid="ref-27">27</xref>,<xref ref-type="bibr" rid="ref-39">39</xref>]. All the values between 0 and 1 are considered as different levels of trust. Initially, all the vehicles are assigned with Tr &#x1D4F5;&#x1D4FF; 0 in Cnt_DB by CA. Unlike common nodes, Tr &#x1D4F5;&#x1D4FF; of special vehicles (ambulance, police, fire brigade) initialized with 0.5. Likewise, the trust of an event Ev_ID_Tr &#x1D4F5;&#x1D4FF; is evaluated and managed during the event. The centralized and local database also store and update event trust value for future verification and trust management. A reported event&#x0027;s trust is also measured between 0 and 1, where 1 represents the highest trust level and 0 for untrusted. The weight allocation <?A3B2 "tbl1",5,"anchor"?><xref ref-type="table" rid="table-1">Tab. 1</xref> represents: initial trust, previous trust (experience), and trust reward.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption><title>Trust weight allocation table</title></caption>
<table>
<thead>
<tr>
<th align="left">Module</th>
<th align="left">Trust score allocation</th>
<th></th>
</tr>
</thead>
<tbody>
<tr>
<td>Experience-based</td>
<td>Initial node experience (trust score) &#x003D; 0<break/>Initial special node (trust score) &#x003D; 0.5<break/>After true report<break/>Rep_vehicle&#x003D; &#x002B;&#x2009;0.1<break/>Special_vehicle&#x003D; &#x002B;&#x2009;0.1</td>
<td></td>
</tr>
<tr>
<td>Role-based</td>
<td>Initial special_vehicle experience (trust score) &#x003D;&#x2009;0.5<break/>After true report<break/>Special_vehicle&#x003D; &#x002B;&#x2009;0.1</td>
<td></td>
</tr>
<tr>
<td>Opinion-based<break/>(beaconing)</td>
<td>After true report<break/>Carrier_vehicle&#x003D; &#x002B;&#x2009;0.05 (beaconing)</td>
<td></td>
</tr>
<tr>
<td>Cluster-based</td>
<td>After true report<break/>Rep_vehicle&#x003D; &#x002B;&#x2009;0.1<break/>Special_vehicle&#x003D; &#x002B;&#x2009;0.1</td>
<td></td>
</tr>
<tr>
<td>Thread-based<break/>(hopping)</td>
<td>After true report<break/>Rep_vehicle&#x003D; &#x002B;&#x2009;0.1<break/>Carrier vehicle&#x003D; &#x002B;&#x2009;0.01 (hopping)</td>
<td></td>
</tr>
<tr>
<td>Uncertainty</td>
<td>After true report<break/>Rep_vehicle&#x003D; &#x002B;&#x2009;0.1<break/>Special_vehicle&#x003D; &#x002B;&#x2009;0.1<break/>Carrier_vehicle&#x003D; &#x002B;&#x2009;0.01</td>
<td></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The accumulated trust value is the combination of multiple trust values obtained from different modules. The Tr &#x1D4F5;&#x1D4FF; 1 is the mean trust value of all reporting vehicles obtained by <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>. Reporting vehicles for an event, include general and special vehicles.
<disp-formula id="eqn-1"><label>(1)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-1.png"/>--><!--<tex-math id="tex-eqn-1"><![CDATA[$\begin{equation}\textrm{Tr}lv1 = \frac{{\textrm{Rp}\_\textrm{veh}\_\textrm{Tr}lv\textrm{&#x00A0; }({1 + 2 + 3 \ldots \textrm{n}} )}}{n}\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mi>v</mml:mi><mml:mn>1</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Rp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext>veh</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mi>v</mml:mi><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:math><!--</alternatives>--></disp-formula>
Carrier vehicles have two types based on hopping and beaconing. <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> is used to obtain the mean trust Tr &#x1D4F5;&#x1D4FF; 2 from carrier vehicles involved in beaconing, whereas carrier vehicles involved in hopping participate in the thread module, discussed in the related section.
<disp-formula id="eqn-2"><label>(2)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-2.png"/>--><!--<tex-math id="tex-eqn-2"><![CDATA[$\begin{equation}\textrm{Tr}lv2 = \frac{{\textrm{Cr}\_\textrm{veh}\_\_\textrm{bec}\_\textrm{Tr}lv\textrm{&#x00A0; }({1 + 2 + 3 \ldots \textrm{n}} )}}{n}\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mi>v</mml:mi><mml:mn>2</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Cr</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext>veh</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext>bec</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mi>v</mml:mi><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:math><!--</alternatives>--></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-3.png"/>--><!--<tex-math id="tex-eqn-3"><![CDATA[$\begin{equation}\textrm{Tr}lv3 = \frac{{\textrm{Spe}\_\textrm{veh}\_\_\textrm{Tr}lv\textrm{&#x00A0; }({1 + 2 + 3 \ldots \textrm{n}} )}}{n}\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mi>v</mml:mi><mml:mn>3</mml:mn><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Spe</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext>veh</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mi>v</mml:mi><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:math><!--</alternatives>--></disp-formula>
In certain situations where the special vehicle is involved, the mean trust value Tr &#x1D4F5;&#x1D4FF; 3 of all Spe_ &#x1D4FF;&#x1D4EE;&#x1D4F1; can be obtained by <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>. Since the TM framework is adaptive and context-based, the TM might use different trust modules each time. The accumulated trust value of an event Ev_ID_Tr &#x1D4F5;&#x1D4FF; is obtained by <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>.
<disp-formula id="eqn-4"><label>(4)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-4.png"/>--><!--<tex-math id="tex-eqn-4"><![CDATA[$\begin{equation}\textrm{Ev\_ID\_Tr}lv = \textrm{Tr}l{v_{\bf{1}}} + \textrm{Tr}l{v_{\bf{2}}} + \textrm{Tr}l{v_{\bf{3}}}\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mtext>Ev\_ID\_Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>Tr</mml:mtext></mml:mrow><mml:mi>l</mml:mi><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mrow><mml:mn mathvariant="bold">3</mml:mn></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math><!--</alternatives>--></disp-formula>
</p>
<p><xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref> serves as the fundamental method for evaluating the trust during the modules: experience, role-base, and opinion-based trust evaluation, each with related specifications. At this point, it is necessary to mention that <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref> involves only those vehicles having a higher or equal experience level than 0.5. Those vehicles with less than 0.5 trust experiences are filtered out and used in other inferencing modules, depending on the context.</p>
</sec>
<sec id="s4_4">
<label>4.4</label><title>Cluster Module</title>
<p>The cluster-based module is used only for those vehicles that follow the same route daily, In these situations the cluster approach is the most appropriate. The urban traffic mostly follows a pattern by the same vehicle daily. Cluster lists are managed on Cnt_DB and Loc_Db. The reports are broadcasted to all the vehicles in the specific cluster. In combination with other modules, the cluster module is used to determine the trust level according to the context.</p>
</sec>
<sec id="s4_5">
<label>4.5</label><title>Thread Based/Hopping</title>
<p>This module is likely to be used where there are hopping in higher numbers than reports and opinions. It is one of the effective techniques used by some models. The basic concept of this module is to use multiple threads of hops. The trust level depends on the thread level (thr_<italic>lev</italic>). This module requires at least two <italic>Rp_vhs.</italic> The level of the thread increases with the intersection of two threads of a single report. The Cr_<italic>vh</italic>, when receives the report with the same thread, considers it as thr_<italic>lev</italic> 1. The level of a thread increases only if a new thread is found. An increment at each level consequently increases the trust level of the report by 0.2.</p>
</sec>
<sec id="s4_6">
<label>4.6</label><title>Uncertainty Using Statistical Bayesian Machine Learning</title>
<p>Mostly, uncertainty occurs in scenarios where the number of nodes is small. Uncertainty is one of the challenges of evaluating trust. Some TM models vaguely discuss uncertainty in their methodology, such as [<xref ref-type="bibr" rid="ref-30">30</xref>,<xref ref-type="bibr" rid="ref-39">39</xref>]. Using a simple probability is one of the approaches used to handle uncertainty, which is unrealistic. Some approaches include Dempster Shafer theory. The proposed TM framework uses the BML approach to deal with uncertainty. Though BML is one of the rarely used machine learning techniques, it is a constructive statistical method that matches the uncertainty in IoV. Using BML allows combining multiple prior evidence and matches the nature of the problem under discussion. The Bayes rule helps to measure the likelihood of a message being true or false. The experience property must be less than 0.5, as used in <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>. The probability of a report being false can be obtained by <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>. In some circumstances, Rp_vh with less experience is considered under uncertainty. <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref> calculates the trustworthiness of a report.
<disp-formula id="eqn-5"><label>(5)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-5.png"/>--><!--<tex-math id="tex-eqn-5"><![CDATA[$\begin{equation}\textrm{P}(\textrm{rep}\_flase&#x00A0; |\textrm{exp}\_ \lt 0.5)\textrm{&#x00A0; } = \frac{{\textrm{P}({\textrm{exp}\_\langle{0.5} |\textrm{rep}\_flase} ).\textrm{P}({\textrm{rep}\_flase} )\textrm{&#x00A0; &#x00A0; &#x00A0; &#x00A0; }}}{{P(\textrm{exp}\_ \lt 0.5)}}\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:mn>0.5</mml:mn></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0; &#x00A0; &#x00A0; &#x00A0;&#xA0;</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math><!--</alternatives>--></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-6.png"/>--><!--<tex-math id="tex-eqn-6"><![CDATA[$\begin{equation}\textrm{P}(\textrm{rep}\_true&#x00A0; |\textrm{exp}\_ \lt 0.5)\textrm{&#x00A0; } = 1 + \textrm{P}(\textrm{rep}\_flase\mid{\exp}\_\lt 0.5) = \frac{{\textrm{P}({\textrm{exp}\_\langle{0.5} |\textrm{rep}\_flase} ).\textrm{P}({\textrm{rep}\_flase} )}}{{P(\textrm{exp}\_ \lt 0.5)}}\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x2223;</mml:mo><mml:mrow><mml:mi>exp</mml:mi></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:mn>0.5</mml:mn></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math><!--</alternatives>--></disp-formula>
</p>
<p>The TM framework performs one step further to be more accurate and use additional available information to infer the trust level of a report. The framework uses BML with multiple evidence; this lets the system infer cognitively when more contextual information is available. <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref> uses multiple evidence BML by adding the direction of the node in <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>.
<disp-formula id="eqn-7"><label>(7)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-7.png"/>--><!--<tex-math id="tex-eqn-7"><![CDATA[$\begin{equation}\textrm{P}(\textrm{rep}\_flase&#x00A0; |\textrm{exp}\_ \lt 0.5&#x00A0;\wedge&#x00A0; \textrm{dir}\_from)\textrm{&#x00A0; &#x00A0; } = \frac{{\textrm{P}(\textrm{ex}{\textrm{p}_{ \lt 0.5}}\wedge\textrm{di}{\textrm{r}_{from}}|\textrm{re}{\textrm{p}_{flase}}).\textrm{P}({\textrm{re}{\textrm{p}_{flase}}} )\textrm{&#x00A0; &#x00A0; &#x00A0; &#x00A0; }}}{{P({\textrm{di}{\textrm{r}_{from}}\wedge\textrm{&#x00A0; ex}{\textrm{p}_{ \lt 0.5}}} )}}\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn><mml:mspace width="thickmathspace" /><mml:mo>&#x2227;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mtext>dir</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0; &#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mrow><mml:mtext>di</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>re</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>re</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0; &#x00A0; &#x00A0; &#x00A0;&#xA0;</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>di</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mrow><mml:mtext>&#x00A0; ex</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math><!--</alternatives>--></disp-formula>
</p>
<p>The co-occurrence of multiple evidence is calculated by <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>. The P (exp_&#x003C;0.5 &#x2227; dir_from) is obtained by <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>.
<disp-formula id="eqn-8"><label>(8)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-8.png"/>--><!--<tex-math id="tex-eqn-8"><![CDATA[$\begin{equation}\textrm{P}({\textrm{dir}\_from \wedge \textrm{exp}\_\langle{0.5} |\textrm{rep}\_flase} )\textrm{&#x00A0; } = \textrm{&#x00A0; P}(\textrm{dir}\_from\textrm{&#x00A0; }|\textrm{rep}\_flase)\textrm{&#x00A0; P}({\textrm{exp}\_\langle{0.5} |\textrm{rep}\_flase} )\textrm{&#x00A0; &#x00A0; }\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>dir</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:mn>0.5</mml:mn></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext>&#x00A0; P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>dir</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0; P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mo fence="false" stretchy="false">&#x27E8;</mml:mo><mml:mrow><mml:mn>0.5</mml:mn></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0; &#x00A0;&#xA0;</mml:mtext></mml:mrow></mml:math><!--</alternatives>--></disp-formula>
<disp-formula id="eqn-9"><label>(9)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-9.png"/>--><!--<tex-math id="tex-eqn-9"><![CDATA[$\begin{equation}\begin{array}{ccccc} \textrm{P}({{{\exp }_{ \lt 0.5}}\textrm{di}{\textrm{r}_{from}}} )& = \textrm{P}(\textrm{exp}\_0.5&#x00A0; |\textrm{rep}\_flase)\textrm{&#x00A0; P}(\textrm{dir}\_from\textrm{&#x00A0; }|\textrm{rep}\_flase)\textrm{&#x00A0; P}({\textrm{rep}\_flase} )\\ & \quad + \textrm{P}(\textrm{exp}\_0.5\textrm{&#x00A0; }|\textrm{rep}\_true)\textrm{P}(\textrm{dir}\_from\textrm{&#x00A0; }|\textrm{rep}\_true)\textrm{P}({\textrm{rep}\_true} )\end{array}\end{equation}$]]></tex-math>--><mml:math id="mml-eqn-9" display="block"><mml:mtable columnalign="center center center center center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>exp</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mtext>di</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mtd><mml:mtd><mml:mo>=</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mn>0.5</mml:mn><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0; P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>dir</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#x00A0; P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mn>0.5</mml:mn><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>dir</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math><!--</alternatives>--></disp-formula>
<disp-formula id="eqn-10"><label>(10)</label><!--<alternatives><graphic mimetype="image" mime-subtype="png" xlink:href="eqn-10.png"/>--><!--<tex-math id="tex-eqn-10"><![CDATA[$\begin{array}{ccccc} \textrm{P}({\textrm{rep}{\__{false}}\textrm{|ex}{\textrm{p}_ \lt }0.5\wedge\textrm{dir}{\__{from}}} )& = \displaystyle\frac{{\textrm{P}({\textrm{re}{\textrm{p}_\_}_{flase}} ).\textrm{P}({\textrm{exp}{\__{ \lt 0.5}}\textrm{|re}{\textrm{p}_\_}_{\textrm{flase}}} ).}}{{\textrm{P}({\textrm{re}{\textrm{p}_\_}_{flase}} )\textrm{P}({\textrm{exp}{\__{ \lt 0.5}}\textrm{|re}{\textrm{p}_\_}_{\textrm{flase}}} )\textrm{P}({\textrm{di}{\textrm{r}_\_}_{\textrm{from}}\textrm{|re}{\textrm{p}_\_}_{\textrm{flase}}} )}}\\[5pt] &\quad + \displaystyle\frac{{\textrm{&#x00A0; P}(\textrm{dir}{\__{\textrm{from}}}\textrm{&#x00A0; }|\textrm{rep}{\__{\textrm{flase}}})}}{{\textrm{&#x00A0; P}({\textrm{rep}{\__{\textrm{true}}}} )\textrm{P}(\textrm{ex}{\textrm{p}_{ \lt 0.5}}|\textrm{re}{\textrm{p}_{\textrm{true}}})\textrm{P}(\textrm{dir}{\__{\textrm{from}}}|\textrm{rep}{\__{\textrm{true}}})}} \end{array}$]]></tex-math>--><mml:math id="mml-eqn-10" display="block"><mml:mtable columnalign="center center center center center" rowspacing="0.9em 0.4em" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mtext>|ex</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mo>&#x003C;</mml:mo></mml:msub></mml:mrow><mml:mn>0.5</mml:mn><mml:mo>&#x2227;</mml:mo><mml:mrow><mml:mtext>dir</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mtd><mml:mtd><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>re</mml:mtext></mml:mrow><mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mtext>|re</mml:mtext></mml:mrow><mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>flase</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>re</mml:mtext></mml:mrow><mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>exp</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mtext>|re</mml:mtext></mml:mrow><mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>flase</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>di</mml:mtext></mml:mrow><mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>from</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mtext>|re</mml:mtext></mml:mrow><mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mtext>flase</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>&#x00A0; P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>dir</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mtext>from</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mtext>&#x00A0;&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mtext>flase</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>&#x00A0; P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mtext>true</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>ex</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>re</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>true</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>P</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext>dir</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mtext>from</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mtext>rep</mml:mtext></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mrow><mml:mtext>true</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math><!--</alternatives>--></disp-formula></p>
<p>Thus, <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref> is obtained by employing <xref ref-type="disp-formula" rid="eqn-8">Eqs. (8)</xref> and <xref ref-type="disp-formula" rid="eqn-9">(9)</xref> to <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>. The uniqueness of the presented framework is a context where we can add further evidence to infer trust.</p>
<p>Alg. 1 shows the algorithm for a reported event, where a new event report is received. The event is matched with the previous event list, synchronized if the event is previously available; otherwise, a new event is created. Furthermore, the algorithm explains the management of the overall report.</p>
<table-wrap id="table-3"><label>Algorithm 1</label>
<caption><title>Trust Evaluation Algorithm</title></caption>
<table>
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<tbody>
<tr>
<td align="left"><bold>Pseudocode of event trust evaluation algorithm</bold></td>
</tr>
<tr>
<td align="left">1.&#x2003;&#x2003;<bold>Initialize</bold></td>
</tr>
<tr>
<td align="left">2.&#x2003;&#x2003;&#x2003;Event Message received</td>
</tr>
<tr>
<td align="left">3.&#x2003;&#x2003;&#x2003;Ev_ID retrieved</td>
</tr>
<tr>
<td align="left">4.&#x2003;&#x2003;&#x2003;Ev_ID_Trlv &#x003D; 0</td>
</tr>
<tr>
<td align="left">5.&#x2003;&#x2003;&#x2003;Number of nRp_veh&#x003D;0</td>
</tr>
<tr>
<td align="left">6.&#x2003;&#x2003;&#x2003;Number of nCr_veh &#x003D;0</td>
</tr>
<tr>
<td align="left">7.&#x2003;&#x2003;<bold>If</bold> (Ev_ID !&#x003D; exists) <bold>than</bold></td>
</tr>
<tr>
<td align="left">8.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;start Ev_ID as new event</td>
</tr>
<tr>
<td align="left">9.&#x2003;&#x2003;&#x2003;&#x2003;<bold>else</bold></td>
</tr>
<tr>
<td align="left">10.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;merge Veh_ID_Trlv retrieved from Cnt_DB and Loc_DB</td>
</tr>
<tr>
<td align="left">11.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;merge Cr_veh_Trlv retrieved from Cnt_DB and Loc_DB</td>
</tr>
<tr>
<td align="left">12.&#x2003;&#x2003;<bold>end If</bold></td>
</tr>
<tr>
<td align="left">13.&#x2003;&#x2003;<bold>If</bold> (message receive form Rp_veh) <bold>than</bold></td>
</tr>
<tr>
<td align="left">14.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;nRp_veh &#x2190; nRp_veh&#x002B;1</td>
</tr>
<tr>
<td align="left">15.&#x2003;&#x2003;&#x2003;<bold>else</bold></td>
</tr>
<tr>
<td align="left">16.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;nCr_veh &#x2190; nCr_veh&#x002B;1</td>
</tr>
<tr>
<td align="left">17.&#x2003;&#x2003;<bold>end If</bold></td>
</tr>
<tr>
<td align="left">18.&#x2003;&#x2003;<bold>If</bold> (nRp_veh&#x003E;2) &#x0026;&#x0026; (Rp_veh_exp&#x003E;0.5) <bold>than</bold></td>
</tr>
<tr>
<td align="left">19.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;opt for experience module</td>
</tr>
<tr>
<td align="left">20.&#x2003;&#x2003;&#x2003;<bold>elseIf</bold> (special Rp_veh in system) <bold>than</bold></td>
</tr>
<tr>
<td align="left">21.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;opt for role-based module</td>
</tr>
<tr>
<td align="left">22.&#x2003;&#x2003;&#x2003;<bold>elseIf</bold> (nCr_veh &#x003E;nRp_veh) &#x0026;&#x0026;</td>
</tr>
<tr>
<td align="left">23.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;(Cp_veh_exp&#x003E;0.5) <bold>than</bold></td>
</tr> 
<tr>
<td align="left"> 24.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;opt for Opinion module</td>
</tr>
<tr>
<td align="left">25.&#x2003;&#x2003;&#x2003;<bold>elseIf</bold> (vehicles share same path frequently) t<bold>han</bold></td>
</tr>
<tr>
<td align="left">26.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;opt for Cluster module</td>
</tr>
<tr>
<td align="left">27.&#x2003;&#x2003;&#x2003;<bold>elseIf</bold> (nCr_veh &#x003E;nRp_veh) &#x0026;&#x0026;</td>
</tr>
<tr>
<td align="left">28.&#x2003;&#x2003;&#x00A0;&#x2003;&#x2003;&#x2003;&#x2003;(Cp_veh with high hopping) <bold>than</bold></td>
</tr>
<tr>
<td align="left">29.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;opt for thread-based module</td>
</tr>
<tr>
<td align="left">30.&#x2003;&#x2003;&#x2003;<bold>elseIf</bold> (uncertain condition) <bold>than</bold></td>
</tr>
<tr>
<td align="left">31.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;opt for uncertainty module</td>
</tr>
<tr>
<td align="left">32.&#x2003;&#x2003;<bold>endIf</bold></td>
</tr>
<tr>
<td align="left">33.&#x2003;&#x2003;Ev_ID_Trlv &#x2190; (Rp_veh(mean)&#x002B;Cr_veh(mean) &#x002B; Spe_veh(mean)&#x002B; trust value)</td>
</tr>
<tr>
<td align="left">34.&#x2003;&#x2003;<bold>If</bold> (Ev_ID_Trlv&#x003E;0.5) <bold>than</bold></td>
</tr>
<tr>
<td align="left">35.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;perform action,</td>
</tr>
<tr>
<td align="left">36.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;update in Cnt_DB and Loc_DB</td>
</tr>
<tr>
<td align="left">37.&#x2003;&#x2003;&#x2003;&#x2003;&#x2003;broadcast Ev_ID is trustworthy with Ev_ID_Trlv</td>
</tr>
<tr>
<td align="left">38.&#x2003;&#x2003;<bold>else</bold></td>
</tr>
<tr>
<td align="left">39.&#x2003;&#x2003;&#x2003;discard event</td>
</tr>
<tr>
<td align="left">40.&#x2003;&#x2003;&#x2003;update in Cnt_DB and Loc_DB</td>
</tr>
<tr>
<td align="left">41.&#x2003;&#x2003;&#x2003;broadcast Ev_ID is untrustworthy with Ev_ID_Trlv</td>
</tr>
<tr>
<td align="left">42.&#x2003;&#x2003;<bold>&#x00A0;End</bold></td>
</tr>
</tbody>
</table> 
</table-wrap>
</sec>
<sec id="s4_7">
<label>4.7</label><title>Message Token</title>
<p>For the TM framework, a token is designed that contains all related information and the message itself. The token is divided into two parts in <?A3B2 "tbl2",5,"anchor"?><xref ref-type="table" rid="table-2">Tab. 2</xref>: the header contains all information related to vehicle and message. The &#x201C;message&#x201D; portion only contains information related to road-event. The token is associated and identified with &#x201C;vehicle ID&#x201D;. The critical messages can be categorized into four categories: accident, traffic congestion, work in progress, and diversion, defined in the event description.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Message token</title></caption>
<table>
<colgroup>
<col align="left" charoff="3"/>
<col align="left" charoff="3"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left" charoff="5"/>
<col align="left" charoff="3"/>
<col align="left" charoff="3"/>
<col/>
</colgroup>
<tbody> 
<tr>
<td colspan="11" align="center"><bold>Header</bold></td>
</tr>
<tr>
<td>Vehicle ID</td>
<td>Event ID</td>
<td>Report</td>
<td>Time</td>
<td>Location</td>
<td>Hop</td>
<td>Beaconing</td>
<td>Direction/ Indirect report</td>
<td>Average Speed</td>
<td>Vehicle type</td>
<td/>
</tr> 
<tr>
<td colspan="10"><bold>Message</bold></td>
</tr> 
<tr>
<td colspan="2">Event Location</td>
<td colspan="3">Event Description</td>
<td colspan="3">Time viewed</td>
<td colspan="2">Opinion</td>
<td/>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_8">
<label>4.8</label><title>Simulation</title>
<p>The simulation is conducted using MATLAB R2020a and Protege&#x2212;5.5.0 with the &#x201C;HermiT 1.4.3 456&#x201D; reasoner. Depending on the simulation model&#x0027;s scenario, the number of nodes in each random event varies from 2 to 50. The special nodes are set to a maximum of 10&#x0025;, rest of the 90&#x0025; nodes are general vehicles. The node trust is initialized by 0 experience, and the special nodes with trust experience by 0.5. A significant concern about simulations relates to outcome variation; outcomes at each attempt may vary due to the experiment&#x0027;s random design. There can be a considerable variation between the same simulation instances in the wireless topology and the network&#x0027;s design. General nodes include reporting and carrier vehicles. In the road network, road incidents occur at random in the experiment. Each scenario runs 100 iterations to exhaust the simulation.</p>
<p>The framework is tested using scenario-based simulation. The scenarios are divided into three categories to get maximum performance and exhaust the simulation. 1. Heavy traffic: These scenario patterns are often found during rush hours or congestion in urban traffic. These scenarios take up to 50 nodes into consideration. Numerous reports of an incident can be found in these scenarios, making it easy to determine any reported event&#x0027;s level of trust. Most of the trust models perform well in these scenarios. 2. Moderate traffic: 11 to 25 nodes, taken into consideration in these scenarios. These scenarios are typically found during low rush hours in urban areas or on highways. The amount of information available in these situations is also moderate. The proposed framework takes full advantage of the available data, unlike other models that work under limited information. 3. Low traffic: This depicts a traffic pattern found on highways, towns, and rural areas. 2 to 10 nodes are involved in this type of scenario. The lack of information makes these the most critical scenarios. Most of the trust models fail in these scenarios due to the little information available. These scenarios contain maximum uncertainty, which is a significant issue during the trust evaluation.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label><title>Performance Analysis and Discussion</title>
<p>The module distribution by generating random road events up to 50 nodes can be observed in <?A3B2 "fig5",5,"anchor"?><xref ref-type="fig" rid="fig-5">Fig. 5a</xref>. The experience-based module is more likely to occur, and the reason might be the experience property of all the vehicles; this is a significant finding in understanding the type of vehicle involved in the trust evaluation process. The variation of the trust evaluation module can be observed in <xref ref-type="fig" rid="fig-5">Fig. 5a</xref>. With the smaller number of nodes involved, the opinion module is the highest. In comparison, the moderate node involvement experience module is highly observed. Another notable finding is that the thread-based module requires a higher number of nodes, shows in <xref ref-type="fig" rid="fig-5">Fig. 5a</xref>. Nonetheless, we believe that it is well justified that uncertainty is high with low node density, which reveals the relations between less information and uncertainty. Depicted in <xref ref-type="fig" rid="fig-5">Fig. 5b</xref>, involving 10 nodes in the different events, show the &#x201C;opinion&#x201D; is with the highest occurrence followed by the experience, the reports with uncertainty are also high. <xref ref-type="fig" rid="fig-5">Fig. 5c</xref> shows the increment in the number of nodes up to 25 involved in an event. Experience and opinion are almost equal, whereas uncertainty is decreasing. Finally, <xref ref-type="fig" rid="fig-5">Fig. 5d</xref> shows that the uncertainty is almost inversely proportional to the number of nodes involved in the event.</p>
<p><?A3B2 "fig6",5,"anchor"?><xref ref-type="fig" rid="fig-6">Fig. 6a</xref> shows the trust level evaluated under the experience module. One of the essential features of this framework is the confidence score. Even in the case of high trust, there might be a low confidence score. This feature makes the report more elaborative. <xref ref-type="fig" rid="fig-6">Fig. 6b</xref> shows the thread module outcomes; a gradual trend during the trust-building phase can be observed. The trust is directly proportional to the thread level. Here it is significant to explain that the level of a thread is not the hop level, which can be observed in <xref ref-type="fig" rid="fig-6">Fig. 6b</xref>. The results in <xref ref-type="fig" rid="fig-6">Fig. 6c</xref> show the opinion-based trust evaluation; the confidence line in <xref ref-type="fig" rid="fig-6">Fig. 6c</xref> supports the legitimacy of trust value. A significant aspect is noted here the confidence score has no coherence with the level of trust. The behavior of &#x201C;confidence&#x201D; as an independent variable helps the system make better decisions during trust evaluation. The involvement of special vehicles makes the event more legitimate. A relatively higher trust level can be observed in <xref ref-type="fig" rid="fig-6">Fig. 6d</xref>, where a special vehicle is involved in trust evaluation. The more special vehicles involved, the higher the level of trust that can be achieved. <xref ref-type="fig" rid="fig-6">Fig. 6e</xref> summarizes the findings by the uncertainty module. The number of discarded reports is low, and a gradual decrease is observed with an increase in the number of nodes. The use of big data will probably improve the module&#x0027;s precision over time due to the increased information availability.</p>
<fig id="fig-5">
<label>Figure 5</label><caption><title>Trust evaluation module and node variation. (a) Relationship of the number of events and nodes under different modules. (b, c, d) Relationship of node variation and different modules</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_17620-fig-5.png"/>
</fig>
<fig id="fig-6"><label>Figure 6</label><caption><title>Level of trust and confidence score under different trust evaluation modules. (a) Trust and confidence under experience. (b) Trust under thread-based evaluation module. (c) Opinion module trust and confidence. (d) Special vehicle involvement and trust</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_17620-fig-6.png"/></fig> 
<sec id="s5_1">
<label>5.1</label><title>Limitations</title>
<p>The following limitations must be considered for this TM framework:
<list list-type="bullet">
<list-item><p>The experiment is conducted using a limited number of nodes, and a large-scale experiment will further improve the accuracy of the results.</p></list-item>
<list-item><p>The simulation has shown promising results. An on-road experiment still needs to be conducted.</p></list-item>
<list-item><p>The framework does not take the human factor into account.</p></list-item>
<list-item><p>The analysis of big data and its involvement in trust evaluation will improve accuracy. A machine learning model is presented in future work that needs to be implemented for further investigation.</p></list-item>
</list></p>
</sec>
<sec id="s5_2">
<label>5.2</label><title>A High-level Machine Learning Inference Model as Future Research Direction</title>
<p>In a short time, the IoV can produce big data; every node generates multiple sensor data. Given this study&#x0027;s limited scope, a high-level machine-learning model as future work is illustrated by <?A3B2 "fig7",5,"anchor"?><xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The process begins with data inputs from centralized DB. The second phase is the preprocessing involving: data quality assessment, data cleaning, finding relations, normalization, and feature scaling to specify a range of variables. A mix of supervised and unsupervised learning is suitable to achieve maximum knowledge extraction [<xref ref-type="bibr" rid="ref-40">40</xref>]. The use of regression is ideal for continuous variable prediction. Linear support vector machine (LVSM) is the most suitable because of the trust threshold value [<xref ref-type="bibr" rid="ref-41">41</xref>].</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>A high-level machine learning model for the inference of trust as a future research direction</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_17620-fig-7.png"/></fig>
<p>An artificial neural network (ANN) is recommended to automate huge sensor data. Similarities in road events are the main reason to use ANN. Malicious node detection is a crucial issue in IoV; the clustering technique is more appropriate and efficient to solve this issue. For clustering, the Gaussian mixture model (GMM) is highly recommended [<xref ref-type="bibr" rid="ref-42">42</xref>]. The reason behind this is the two parameters description method [<xref ref-type="bibr" rid="ref-43">43</xref>]. The training and testing are the subsequent phases to be carried out for regression by the adapting 70:30 general rule. To achieve maximum accuracy of the model, precision, recall, and F-1 score are recommended in the validation phase.</p>
</sec>
</sec>
<sec id="s6">
<label>6</label><title>Conclusion</title>
<p>Soon, IoV will play a significant role in smart cities and ITS. Many areas of IoV need to be standardized before implementing it as real-time road networks. Trust management is a primary component of vehicle network security, helping prevent a breach of security. In this article, a TM framework is presented for IoV to ensure secure on-road vehicle communication. The proposed trust framework is based on context-awareness, thus use maximum available information resources. The framework works well in critical scenarios where other models fail. The framework intelligently chooses between different trust evaluation modules, thereby allowing full use of available information to determine the received message&#x0027;s trustworthiness. The results indicate that the framework will contribute to trust management security in the vehicle network. The use of the Bayesian method of machine learning was effective when dealing with uncertainty. Our presented trust framework shows promising results. To the best of our knowledge, the work is novel, and no cognitive trust management scheme for IoV has been proposed. The proposed framework is equally beneficial for IoT security.</p>
</sec>
</body>
<back>
<ack>
<p>We would like to acknowledge the multinational collaboration made in this research.</p>
</ack>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement</bold>: The work is partially funded by CGS Universiti Teknologi PETRONAS, Malaysia.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Cao</surname></string-name> and <string-name><given-names>A. V.</given-names> <surname>Vasilakos</surname></string-name></person-group>, &#x201C;<article-title>Secure and privacy preserving protocol for cloud-based vehicular DTNs</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics Security and Communication Networks</source>, vol. <volume>10</volume>, no. <issue>6</issue>, pp. <fpage>1299</fpage>&#x2013;<lpage>1314</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Xie</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>He</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Cai</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Stm32-based vehicle data acquisition system for internet-of-vehicles</article-title>,&#x201D; <conf-name>presented at the 16th IEEE Int. Conf. on Computer and Information Science (ICIS)</conf-name>, <conf-loc>China</conf-loc>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K. M.</given-names> <surname>Alam</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Saini</surname></string-name> and <string-name><given-names>A.</given-names> <surname>El Saddik</surname></string-name></person-group>, &#x201C;<article-title>Toward social internet of vehicles: Concept, architecture, and applications</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>3</volume>, no. <issue>1</issue>, pp. <fpage>343</fpage>&#x2013;<lpage>357</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Fangchun</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Shangguang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Jinglin</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Zhihan</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Qibo</surname></string-name></person-group>, &#x201C;<article-title>An overview of internet of vehicles</article-title>,&#x201D; <source>China Communications</source>, vol. <volume>11</volume>, no. <issue>10</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Sharma</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Kaushik</surname></string-name></person-group>, &#x201C;<article-title>A survey on internet of vehicles: Applications, security issues &#x0026; solutions</article-title>,&#x201D; <source>Vehicular Communications</source>, vol. <volume>20</volume>, no. <issue>2</issue>, pp. <fpage>100182</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Xiao</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>Q.</given-names> <surname>Pei</surname></string-name></person-group>, &#x201C;<article-title>GAS: A group acknowledgment strategy for popular content distribution in internet of vehicle</article-title>,&#x201D; <source>Vehicular Communications</source>, vol. <volume>17</volume>, no. <issue>1</issue>, pp. <fpage>35</fpage>&#x2013;<lpage>49</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Hasrouny</surname></string-name>, <string-name><given-names>A. E.</given-names> <surname>Samhat</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Bassil</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Laouiti</surname></string-name></person-group>, &#x201C;<article-title>VANet security challenges and solutions: A survey</article-title>,&#x201D; <source>Vehicular Communications</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>7</fpage>&#x2013;<lpage>20</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Zhao</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Bai</surname></string-name></person-group>, &#x201C;<article-title>A fair blind signature scheme to revoke malicious vehicles in VANETs</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>58</volume>, no. <issue>1</issue>, pp. <fpage>249</fpage>&#x2013;<lpage>262</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T. A.</given-names> <surname>Butt</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Iqbal</surname></string-name>, <string-name><given-names>S. C.</given-names> <surname>Shah</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Umar</surname></string-name></person-group>, &#x201C;<article-title>Social internet of vehicles: Architecture and enabling technologies</article-title>,&#x201D; <source>Computers &#x0026; Electrical Engineering</source>, vol. <volume>69</volume>, no. <issue>3</issue>, pp. <fpage>68</fpage>&#x2013;<lpage>84</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Duan</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Tian</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhou</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Cooperative channel assignment for VANETs based on dual reinforcement learning</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>66</volume>, no. <issue>2</issue>, pp. <fpage>2127</fpage>&#x2013;<lpage>2140</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Yao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Ning</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Using trust model to ensure reliable data acquisition in VANETs</article-title>,&#x201D; <source>Ad Hoc Networks</source>, vol. <volume>55</volume>, no. <issue>4</issue>, pp. <fpage>107</fpage>&#x2013;<lpage>118</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Cui</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Gang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Xiaofeng</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Feng</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Liang</surname></string-name></person-group>, &#x201C;<article-title>An efficient certificateless aggregate signature scheme designed for VANET</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>63</volume>, no. <issue>2</issue>, pp. <fpage>725</fpage>&#x2013;<lpage>742</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Kofod-Petersen</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Cassens</surname></string-name></person-group>, &#x201C;<article-title>Using activity theory to model context awareness</article-title>,&#x201D; <conf-name>presented at the Int. Workshop on Modeling and Retrieval of Context</conf-name>, <publisher-loc>Edinburgh, UK</publisher-loc>, <year>2005</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Grover</surname></string-name>, <string-name><given-names>N. K.</given-names> <surname>Prajapati</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Laxmi</surname></string-name> and <string-name><given-names>M. S.</given-names> <surname>Gaur</surname></string-name></person-group>, &#x201C;<article-title>Machine learning approach for multiple misbehavior detection in VANET</article-title>,&#x201D; <conf-name>in presented at the Int. Conf. on Advances in Computing and Communications</conf-name>, <publisher-loc>India</publisher-loc>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Ftaimi</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Mazri</surname></string-name></person-group>, &#x201C;<article-title>A comparative study of machine learning algorithms for VANET networks</article-title>,&#x201D; presented at the the <conf-name>3rd Int. Conf. on Networking, in Information Systems &#x0026; Security</conf-name>, <publisher-loc>Morocco</publisher-loc>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A.</given-names> <surname>Hossain</surname></string-name>, <string-name><given-names>R. M.</given-names> <surname>Noor</surname></string-name>, <string-name><given-names>K. -L. A.</given-names> <surname>Yau</surname></string-name>, <string-name><given-names>S. R.</given-names> <surname>Azzuhri</surname></string-name>, <string-name><given-names>M. R.</given-names> <surname>Z&#x0027;aba</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Comprehensive survey of machine learning approaches in cognitive radio-based vehicular ad hoc networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, no. <issue>1</issue>, pp. <fpage>78054</fpage>&#x2013;<lpage>78108</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Yan</surname></string-name></person-group>, &#x201C;<article-title>AATMS: An anti-attack trust management scheme in VANET</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, no. <issue>2</issue>, pp. <fpage>21077</fpage>&#x2013;<lpage>21090</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Bocquet</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Brajard</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Carrassi</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Bertino</surname></string-name></person-group>, &#x201C;<article-title>Bayesian inference of chaotic dynamics by merging data assimilation, machine learning and expectation-maximization</article-title>,&#x201D; <source>ArXiv Mathematical Sciences</source>, vol. <volume>2</volume>, no. <issue>1</issue>, pp. <fpage>55</fpage>&#x2013;<lpage>80</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Wazid</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Das</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Bhat</surname></string-name> and <string-name><given-names>A. V.</given-names> <surname>Vasilakos</surname></string-name></person-group>, &#x201C;<article-title>LAM-Ciot: Lightweight authentication mechanism in cloud-based IoT environment</article-title>,&#x201D; <source>Journal of Network and Computer Applications</source>, vol. <volume>150</volume>, no. <issue>2</issue>, pp. <fpage>102496</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Sumithra</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Vadivel</surname></string-name></person-group>, &#x201C;<article-title>An overview of various trust models for VANET security establishment,&#x201D; presented at the <italic>9th Int. Conf. on Computing</italic></article-title>, in <conf-name>Communication and Networking Technologies (ICCCNT)</conf-name>, <conf-loc>India</conf-loc>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>U.</given-names> <surname>Javaid</surname></string-name>, <string-name><given-names>M. N.</given-names> <surname>Aman</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Sikdar</surname></string-name></person-group>, &#x201C;<article-title>A scalable protocol for driving trust management in internet of vehicles with blockchain</article-title>,&#x201D; <source>IEEE Internet of Things Journal</source>, vol. <volume>7</volume>, no. <issue>12</issue>, pp. <fpage>11815</fpage>&#x2013;<lpage>11829</lpage>, <year>2020</year>.</mixed-citation></ref> 
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P. K.</given-names> <surname>Singh</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Singh</surname></string-name>, <string-name><given-names>S. K.</given-names><surname>Nandi</surname></string-name>, <string-name><given-names>K. Z.</given-names> <surname>Ghafoor</surname></string-name>, <string-name><given-names>D. B.</given-names> <surname>Rawat</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Blockchain-based adaptive trust management in internet of vehicles using smart contract</article-title>,&#x201D; <conf-name>IEEE Transactions on Intelligent Transportation Systems</conf-name>, vol. <volume>21</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>15</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>U. F.</given-names> <surname>Minhas</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Tran</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Cohen</surname></string-name></person-group>, &#x201C;<article-title>Towards expanded trust management for agents in vehicular ad-hoc networks</article-title>,&#x201D; <source>International Journal of Computational Intelligence: Theory and Practice (IJCITP)</source>, vol. <volume>5</volume>, no. <issue>1</issue>, pp. <fpage>03</fpage>&#x2013;<lpage>15</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Gazdar</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Belghith</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Abutair</surname></string-name></person-group>, &#x201C;<article-title>An enhanced distributed trust computing protocol for VANETs</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, pp. <fpage>380</fpage>&#x2013;<lpage>392</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. A.</given-names> <surname>Soleymani</surname></string-name>, <string-name><given-names>A. H.</given-names> <surname>Abdullah</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Zareei</surname></string-name>, <string-name><given-names>M. H.</given-names> <surname>Anisi</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Vargas-Rosales</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>A secure trust model based on fuzzy logic in vehicular ad hoc networks with fog computing</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>5</volume>, no. <issue>1</issue>, pp. <fpage>15619</fpage>&#x2013;<lpage>15629</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. G.</given-names> <surname>M&#x00E1;rmol</surname></string-name> and <string-name><given-names>G. M.</given-names> <surname>P&#x00E9;rez</surname></string-name></person-group>, &#x201C;<article-title>TRIP, a trust and reputation infrastructure-based proposal for vehicular ad hoc networks</article-title>,&#x201D; <source>Journal of Network and Computer Applications</source>, vol. <volume>35</volume>, no. <issue>3</issue>, pp. <fpage>934</fpage>&#x2013;<lpage>941</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Ahmad</surname></string-name>, <string-name><given-names>V. N.</given-names> <surname>Franqueira</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Adnane</surname></string-name></person-group>, &#x201C;<article-title>TEAM: A trust evaluation and management framework in context-enabled vehicular ad-hoc networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, no. <issue>1</issue>, pp. <fpage>28643</fpage>&#x2013;<lpage>28660</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Ahmed</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Al-Rubeaai</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Tepe</surname></string-name></person-group>, &#x201C;<article-title>Novel trust framework for vehicular networks</article-title>,&#x201D; <source>IEEE Transactions on Vehicular Technology</source>, vol. <volume>66</volume>, no. <issue>10</issue>, pp. <fpage>9498</fpage>&#x2013;<lpage>9511</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Nawaz</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Lee</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Son</surname></string-name></person-group> <conf-loc>and</conf-loc> <person-group person-group-type="author"><string-name><given-names>J. T.</given-names> <surname>Seo</surname></string-name></person-group>, &#x201C;<article-title>A hybrid trust management framework for vehicular social networks</article-title>,&#x201D; <conf-name>presented at the Int. Conf. on computational social networks</conf-name>, <publisher-loc>Viet Nam</publisher-loc>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D. B.</given-names> <surname>Rawat</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Yan</surname></string-name>, <string-name><given-names>B. B.</given-names> <surname>Bista</surname></string-name> and <string-name><given-names>M. C.</given-names> <surname>Weigle</surname></string-name></person-group>, &#x201C;<article-title>Trust on the security of wireless vehicular Ad-hoc networking</article-title>,&#x201D; <source>Ad Hoc &#x0026; Sensor Wireless Networks</source>, vol. <volume>24</volume>, no. <issue>3&#x2013;4</issue>, pp. <fpage>283</fpage>&#x2013;<lpage>305</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Wei</surname></string-name>, <string-name><given-names>F. R.</given-names> <surname>Yu</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Boukerche</surname></string-name></person-group>, &#x201C;<article-title>Trust based security enhancements for vehicular ad hocnetworks</article-title>,&#x201D; <conf-name>presented at the 4th ACM Int. Symp.on Development and Analysis of Intelligent Vehicular Networks and Applications</conf-name>, <publisher-loc>Canada</publisher-loc>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A. M.</given-names> <surname>Alrehan</surname></string-name> and <string-name><given-names>F. A.</given-names> <surname>Alhaidari</surname></string-name></person-group>, &#x201C;<article-title>Machine learning techniques to detect DDoS attacks on VANET system: a survey</article-title>,&#x201D; <conf-name>presented at the 2nd International Conference on Computer Applications &#x0026; Information Security (ICCAIS)</conf-name>, <publisher-loc>Riyadh</publisher-loc>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P. K.</given-names> <surname>Singh</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Vashistha</surname></string-name>, <string-name><given-names>S. K.</given-names> <surname>Nandi</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Nandi</surname></string-name></person-group> &#x201C;<article-title>Machine learning based approach to detect position falsification attack in vanets</article-title>,&#x201D; <conf-name>presented at the Int. Conf. on Security &#x0026; Privacy</conf-name>, <publisher-loc>India</publisher-loc>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Paganelli</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Bianchi</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Giuli</surname></string-name></person-group>, &#x201C;<article-title>A context model for context-aware system design towards the ambient intelligence vision: Experiences in the eTourism domain</article-title>,&#x201D; <source>in Universal Access in Ambient Intelligence Environments: Springer</source>, pp. <fpage>173</fpage>&#x2013;<lpage>191</lpage>, <year>2007</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names><surname>Schmidt</surname></string-name></person-group>, &#x201C;<article-title>Ubiquitous computing-computing in context</article-title>,&#x201D; <comment>Ph.D. Thesis, Computing Department, Lancaster University Lancaster University, U.K.</comment>, <year>2003</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Biswas</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Sanzgiri</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Upadhyaya</surname></string-name></person-group>, in &#x201C;<article-title>Building Long Term Trust in Vehicular Networks</article-title>,&#x201D; <conf-name>Presented at the IEEE 83rd Vehicular Technology Conf. (VTC Spring)</conf-name>, <publisher-loc>China</publisher-loc>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>&#x00D6;.</given-names> <surname>Y&#x00FC;r&#x00FC;r</surname></string-name>, <string-name><given-names>C. H.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Sheng</surname></string-name>, <string-name><given-names>V. C.</given-names> <surname>Leung</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Moreno</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Context-awareness for mobile sensing: A survey and future directions</article-title>,&#x201D; <source>IEEE Communications Surveys &#x0026; Tutorials</source>, vol. <volume>18</volume>, no. <issue>1</issue>, pp. <fpage>68</fpage>&#x2013;<lpage>93</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Bettini</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Brdiczka</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Henricksen</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Indulska</surname></string-name>, <string-name><given-names>D.</given-names><surname>Nicklas</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>A survey of context modelling and reasoning techniques</article-title>,&#x201D; <source>Pervasive and Mobile Computing</source>, vol. <volume>6</volume>, no. <issue>2</issue>, pp. <fpage>161</fpage>&#x2013;<lpage>180</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Ya</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Shihui</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Bin</surname></string-name></person-group>, &#x201C;<article-title>Trusted GPSR protocol without reputation faking in VANET</article-title>,&#x201D; <source>the Journal of China Universities of Posts and Telecommunications</source>, vol. <volume>22</volume>, no. <issue>5</issue>, pp. <fpage>22</fpage>&#x2013;<lpage>55</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Alloghani</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Al-Jumeily</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Mustafina</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Hussain</surname></string-name> and <string-name><given-names>A. J.</given-names> <surname>Aljaaf</surname></string-name></person-group>, &#x201C;<article-title>A systematic review on supervised and unsupervised machine learning algorithms for data science</article-title>,&#x201D; <source>Supervised and Unsupervised Learning for Data Science</source>, pp. <fpage>3</fpage>&#x2013;<lpage>21</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Z. F.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>H. R.</given-names> <surname>Ibraheem</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Alsajri</surname></string-name>, <string-name><given-names>A. H.</given-names> <surname>Ali</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Ismail</surname></string-name></person-group> <italic>et al.</italic>, &#x201C;<article-title>A new model for iris data set classification based on linear support vector machine parameter&#x0027;s optimization</article-title>,&#x201D; <source>International Journal of Electrical and Computer Engineering</source>, vol. <volume>10</volume>, no. <issue>1</issue>, pp. <fpage>1079</fpage>&#x2013;<lpage>1084</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. V.</given-names> <surname>Covioli</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Coppotelli</surname></string-name></person-group>, <italic>In</italic> &#x201C;<article-title>on the use of Gaussian Mixture Models for Automated Modal Parameters Estimation</article-title>,&#x201D; in <source>AIAA Scitech 2021 Forum</source>, <publisher-loc>Virginia, USA</publisher-loc>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Touati</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Mignotte</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Dahmane</surname></string-name></person-group>, &#x201C;<article-title>Anomaly feature learning for unsupervised change detection in heterogeneous images: A deep sparse residual model</article-title>,&#x201D; <source>IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing</source>, vol. <volume>13</volume>, no. <issue>1</issue>, pp. <fpage>588</fpage>&#x2013;<lpage>600</lpage>, <year>2020</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
