<?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">19502</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.019502</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Cross-Layer Hidden Markov Analysis for Intrusion Detection</article-title>
<alt-title alt-title-type="left-running-head">Cross-Layer Hidden Markov Analysis for Intrusion Detection</alt-title>
<alt-title alt-title-type="right-running-head">Cross-Layer Hidden Markov Analysis for Intrusion Detection</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western">
<surname>Venkatachalam</surname>
<given-names>K.</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>Prabu</surname>
<given-names>P.</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western">
<surname>Saravana Balaji</surname>
<given-names>B.</given-names>
</name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western">
<surname>Kang</surname>
<given-names>Byeong-Gwon</given-names>
</name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<contrib id="author-5" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Nam</surname>
<given-names>Yunyoung</given-names>
</name>
<xref ref-type="aff" rid="aff-4">4</xref><email>ynam@sch.ac.kr</email>
</contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western">
<surname>Abouhawwash</surname>
<given-names>Mohamed</given-names>
</name>
<xref ref-type="aff" rid="aff-5">5</xref>
<xref ref-type="aff" rid="aff-6">6</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science and Engineering, CHRIST (Deemed to be University)</institution>, <addr-line>Bangalore, 560074</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science, CHRIST (Deemed to be University)</institution>, <addr-line>Bangalore, 560029</addr-line>, <country>India</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Information Technology, Lebanese French University</institution>, <addr-line>Erbil, 44001, KR</addr-line>, <country>Iraq</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of ICT Convergence, Soonchunhyang University</institution>, <addr-line>Asan, 31538</addr-line>, <country>Korea</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Mathematics, Faculty of Science, Mansoura University</institution>, <addr-line>Mansoura, 35516</addr-line>, <country>Egypt</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Computational Mathematics, Science, and Engineering (CMSE), Michigan State University</institution>, <addr-line>East Lansing, 48824, MI</addr-line>, <country>USA</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Yunyoung Nam. Email: <email>ynam@sch.ac.kr</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-09-13"><day>13</day><month>9</month><year>2021</year></pub-date>
<volume>70</volume>
<issue>2</issue>
<fpage>3685</fpage>
<lpage>3700</lpage>
<history>
<date date-type="received"><day>14</day><month>4</month><year>2021</year>
</date>
<date date-type="accepted"><day>15</day><month>5</month><year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Venkatachalam et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Venkatachalam 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_19502.pdf"></self-uri>
<abstract>
<p><italic>Ad hoc</italic> mobile cloud computing networks are affected by various issues, like delay, energy consumption, flexibility, infrastructure, network lifetime, security, stability, data transition, and link accomplishment. Given the issues above, route failure is prevalent in <italic>ad hoc</italic> mobile cloud computing networks, which increases energy consumption and delay and reduces stability. These issues may affect several interconnected nodes in an <italic>ad hoc</italic> mobile cloud computing network. To address these weaknesses, which raise many concerns about privacy and security, this study formulated clustering-based storage and search optimization approaches using cross-layer analysis. The proposed approaches were formed by cross-layer analysis based on intrusion detection methods. First, the clustering process based on storage and search optimization was formulated for clustering and route maintenance in <italic>ad hoc</italic> mobile cloud computing networks. Moreover, delay, energy consumption, network lifetime, and link accomplishment are highly addressed by the proposed algorithm. The hidden Markov model is used to maintain the data transition and distributions in the network. Every data communication network, like <italic>ad hoc</italic> mobile cloud computing, faces security and confidentiality issues. However, the main security issues in this article are addressed using the storage and search optimization approach. Hence, the new algorithm developed helps detect intruders through intelligent cross layer analysis with the Markov model. The proposed model was simulated in Network Simulator 3, and the outcomes were compared with those of prevailing methods for evaluating parameters, like accuracy, end-to-end delay, energy consumption, network lifetime, packet delivery ratio, and throughput.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Data transition</kwd>
<kwd>end-to-end delay</kwd>
<kwd>energy consumption</kwd>
<kwd>flexibility</kwd>
<kwd>hidden Markov model</kwd>
<kwd>intrusion detection</kwd>
<kwd>link optimization</kwd>
<kwd>packet delivery ratio</kwd>
<kwd>privacy</kwd>
<kwd>security</kwd>
<kwd>searching</kwd>
<kwd>throughput</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p><italic>Ad hoc</italic> mobile cloud computing networks are arranged with several wireless communicating nodes [<xref ref-type="bibr" rid="ref-1">1</xref>]. These networks define a concept from a source to targeting approach for on-demand contact to pooled services. The ongoing review of the system&#x2019;s operational state is necessary to identify performance degradations and malfunctioning resources as fast as possible to manage the resources effectively. Any change in the load, computer state, or software code may affect the device status from regular to irregular. These changes deteriorate the service efficiency and quality. The supervision of <italic>Ad hoc</italic> mobile cloud computing networks is decentralized, and the nodes can move randomly [<xref ref-type="bibr" rid="ref-2">2</xref>]. Here, data transition and distributions from one node to another are achieved using a wireless link. This process facilitates the route identification for intruders in the network. Generally, the nodes in adhoc mobile cloud computing networks communicate without nearby base stations. For instance, the routing protocols in adhoc networks regulate the possible path for good communication through the participating mobile nodes [<xref ref-type="bibr" rid="ref-3">3</xref>]. Adhoc mobile cloud computing networks are utilized for many applications because of their decentralized peer-to-peer system. These networks are arranged in clusters from which one node is selected as the mobile cloud head, and the rest of the participating nodes are the cloud member nodes. Furthermore, mobile cloud clustering is applied to distinguish the decentralized peer-to-peer system from interconnected infrastructure, namely, adhoc mobile cloud computing networks. Each network in a particular environment has a mobile node, which is denoted as the mobile cloud head and performs the network route organizer&#x2019;s function [<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>Additionally, intrusion detection methods are required to address security issues and confidentiality concerns. The hidden Markov model works with high stability in terms of exact data transition and distributions. This model helps identify and prevent intrusions to address the security issues and confidentiality concerns of adhoc mobile cloud computing networks [<xref ref-type="bibr" rid="ref-5">5</xref>]. Several protocols, like the <italic>ad hoc</italic> on-demand distance vector, the border gateway protocol, location aided routing, optimized link state routing, open shortest path first, the routing information protocol, and the zone routing protocol, are used to enhance data communication. However, they fail to decrease the routing overhead. Thus, the developed clustering-based storage and search optimization approach model has enhanced adhoc features, such as addressing delay, energy consumption, and flexibility, and our main research analysis is based on the following questions:
<list list-type="order">
<list-item>
<p>How can node stability be maintained while transferring data in an adhoc network during failure?</p></list-item>
<list-item>
<p>How are intruders in the network who are waiting to attack at failure nodes analyzed?</p></list-item>
</list></p>
<p><bold><italic>Contribution</italic></bold></p>
<p>In this paper, a new clustering-based storage and search optimization approach using cross-layer analysis based on intrusion detection methods is proposed. To avoid the delay in data packet of the cloud environment and a significant increase in the route efficiency of adhoc mobile cloud computing networks, the following contributions are made in our research work:
<list list-type="bullet">
<list-item>
<p>First, this research quantification converts individual mobile nodes into mobile cluster nodes using the proposed clustering approach based on the storage and search optimization technique.</p></list-item>
<list-item>
<p>Second, this study helps address security issues and improve confidentiality without losing the delay, energy consumption, network lifetime, and link accomplishment characteristics.</p></list-item>
<list-item>
<p>Finally, the hidden Markov model is used for stable data transition and distributions by preventing intrusions. This model helps address the security issues and confidentiality concerns of the adhoc mobile cloud computing network.</p></list-item>
</list></p>
<p>The remainder of the paper is organized as follows. In Section 2, the previous clustering approach, the storage and search optimization approach, and the hidden Markov model are discussed. In Section 3, we describe the proposed cross-layer analysis of intrusion detection methods using the clustering approach based on the storage and search optimization approach employed to enhance the adhoc mobile cloud computing network&#x2019;s performance. The experimental results are presented in Section 4, and the conclusions are shown in Section 5.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<p>Storage using an autonomous mobile infrastructure-based phoenix technique allows a system to make opportunistic use of mobile computing devices and adhoc networking to provide quick storage services to clients in a localized geographical region. A large amount of potential data is lost due to node mobility. An internode communication system can overcome the potential data loss through distributed communication and a storage protocol.</p>
<p>Pudlewski et al. [<xref ref-type="bibr" rid="ref-6">6</xref>] proposed a cross-layer perspective scheme for video transmission over lossy wireless networks. Li et al. [<xref ref-type="bibr" rid="ref-7">7</xref>] presented the construction of a dynamic cloudlet-assisted energy-saving routing mechanism for mobile adhoc networks. This approach detects the target nodes, where the intrusion is happening in network. Zhang et al. [<xref ref-type="bibr" rid="ref-8">8</xref>] proposed a communication workflow technology known as lightweight service-oriented architecture (SOA)-based multi-engine architecture for mobile smart devices.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Problem Definition and System Model</title>
<sec id="s3_1">
<label>3.1</label>
<title>Problem Definition</title>
<p>Panta et al. [<xref ref-type="bibr" rid="ref-9">9</xref>] proposed an opportunistic system combined with mobile computing and <italic>ad hoc</italic> networking for quick storage services. However, the hidden Markov model suppresses the slope current and interferes with adhoc mobile cloud computing networks [<xref ref-type="bibr" rid="ref-10">10</xref>]. A standard clustering-based optimization model is required to allow the nodes to recover the original route and energy during transmission. This requirement affects issues, such as delay, energy consumption, network lifetime, and link accomplishment. This paper presents a simple and effective way of solving this problem and improving the cross-layer analysis based on the intrusion detection performance.</p>
<p>The main objectives of the proposed technique are as follows:
<list list-type="bullet">
<list-item>
<p>To propose a new clustering-based storage and search optimization technique to enhance the delay, the energy consumption, the network lifetime, and the link accomplishment for routing.</p></list-item>
<list-item>
<p>To introduce a cross-layer analysis method based on the intrusion detection technique to improve the data transition and distributions and help identify and prevent intrusions.</p></list-item>
</list></p>
<p>This article discusses the cross-layer analysis of intrusion detection methods using the clustering approach based on the storage and search optimization approach.
<list list-type="bullet">
<list-item>
<p>Clustering-based storage and searching optimization model: we utilize the hybrid storage, search optimization, and clustering technique to maintain the delay, energy consumption, network lifetime, and link accomplishment characteristics.</p></list-item>
<list-item>
<p>Here, the participating mobile nodes are first clustered using clustering-based storage. Then, the destination nodes are searched using the search optimization approach.</p></list-item>
<list-item>
<p>The hidden Markov model is used to obtain the required data transition ratio for the entire routing process. The main motivation behind utilizing the hidden Markov model is to improve the identification and prevention of intrusions.</p></list-item>
<list-item>
<p>The proposed approach can analyze intruders with a different route. The performance of the proposed approach is compared with that of existing state-of-art techniques in terms of accuracy, end-to-end delay, energy consumption, network lifetime, packet delivery ratio, and throughput.</p></list-item>
</list></p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>System Model</title>
<p>In recent years, adhoc mobile cloud computing networks have become an efficient and exciting technology due to the rapid proliferation of communication devices in the wireless medium. Many mobile nodes wish to use adhoc mobile cloud computing network, but only restriction is high CPU power consumption and less battery life [<xref ref-type="bibr" rid="ref-11">11</xref>]. Here, routing protocols can be used to enhance the adhoc network communication, but several security issues remain as the main flaws. Route maintenance is another critical issue faced by adhoc networks and involves route search and storage [<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p>Finding and recovering the exact route is challenging, because cross-layer analysis of intrusion detection methods uses Hidden Markov model for identifying and preventing intrusion in network [<xref ref-type="bibr" rid="ref-13">13</xref>]. Also, this method uses the clustering approach to rectify the security and confidentiality issues without losing data packets.</p>
<p>This research developed an innovative cross-layer analysis of intrusion detection methods for transmitting data in adhoc mobile networks. When the communication between nodes starts, cross layer focuses on clustering and route maintenance [<xref ref-type="bibr" rid="ref-14">14</xref>]. The proposed cross-layer analysis using clustering based on the storage and searching optimization approach is shown in <?A3B2 "fig1",5,"anchor"?><xref ref-type="fig" rid="fig-1">Fig. 1</xref> and explained in the following section [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>].</p>
<p>Clustering can be facilitated by the cluster head nodes, which is energy-consuming, while data are transmitting in a wide range. Hence, a novel clustering algorithm is developed to reduce the energy utilization and improve the network lifetime.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Proposed System Architecture</title>
<p>The proposed adhoc mobile cloud computing network is established using cross-layer analysis-based intrusion detection methods with hidden Markova model [<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>]. This cross-layer analysis runs on cloud computing mechanisms and mobile adhoc networks, which extend the functionality of the analysis. Here, a practical mobile adhoc network denotes data sharing between different mobile nodes on a cloud environment [<xref ref-type="bibr" rid="ref-19">19</xref>]. The node&#x2019;s size is static for fast access between the cluster head and the nodes [<xref ref-type="bibr" rid="ref-20">20</xref>]. Hence, deciding which data should be present in the cloud or the mobile <italic>ad hoc</italic> network during interaction is crucial. Any mobile node can transfer stored data to the cloud. This facility allows unauthorized data (attacker data) to be stored in the cloud [<xref ref-type="bibr" rid="ref-21">21</xref>]. Each unauthorized data stored in the cloud will have a different token, which must be stored in the cloud [<xref ref-type="bibr" rid="ref-22">22</xref>]. The proposed clustering-based storage and search optimization approach (cross-layer analysis based on intrusion detection methods) was implemented on Network Simulator 3 (NS-3) [<xref ref-type="bibr" rid="ref-23">23</xref>]. This research employed the cross-layer analysis of intrusion detection (CLAID) methods as our key system for transferring and distributing data to the other nodes. Each node is identified by a token of its public/private key [<xref ref-type="bibr" rid="ref-24">24</xref>]. The complete application stack of any nearby node is illustrated in <?A3B2 "fig2",5,"anchor"?><xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<p><xref ref-type="fig" rid="fig-2">Fig. 2</xref> describes the complete application stack of the node with smart routing using cloud software codes. These codes helps in verifying detail about any transmission and raise the token [<xref ref-type="bibr" rid="ref-25">25</xref>]. The CLAID cluster tool is used to coordinate nodes between the authorized mobile device and different nodes.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Proposed cross-layer analysis intrusion detection model</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-1.png"/>
</fig>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Complete application stack of the node illustration</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-2.png"/>
</fig>
<p>CLAID is the content-addressable cloud environment&#x2019;s transmission model. This model is used to maintain the data transaction within the linked node on the cloud environment and unify all data transactions that link to the decentralized peer-to-peer cloud system [<xref ref-type="bibr" rid="ref-26">26</xref>]. Whenever the decentralized peer-to-peer cloud system receives a request from the clustering-based search optimization, the hidden Markov model first handles this request [<xref ref-type="bibr" rid="ref-27">27</xref>]. Further, CLAID forwards the request to the clustering-based storage and search optimization for the allocation of the route in the adhoc mobile cloud computing network. Later CLAID replies to its route history in network [<xref ref-type="bibr" rid="ref-28">28</xref>]. The data communication between the two authorized mobile devices is processed using the route request/route response (RREQ/RRES) signal. This system is distinguished for the hidden Markov Model based on the intrusion detection system&#x2019;s cross-layer analysis [<xref ref-type="bibr" rid="ref-29">29</xref>,<xref ref-type="bibr" rid="ref-30">30</xref>].</p>
<p>The route between the source node and the destination/target node is connected by the cloud head for the clustering-based storage and search optimization [<xref ref-type="bibr" rid="ref-31">31</xref>&#x2013;<xref ref-type="bibr" rid="ref-33">33</xref>]. This storage model allows decentralized routing peer-to-peer applications based on the following key terms:
<list list-type="bullet">
<list-item>
<p>Clustering-based Storage: Data is stored in the interaction history.</p></list-item>
<list-item>
<p>Clustering-based Searching: The content is store and organized during routing. The result based on the clustering-based storage is returned.</p></list-item>
<list-item>
<p>Optimization model: Optimization is a data rendering tool through which users perform query operations.</p></list-item>
</list></p>
<sec id="s4_1">
<label>4.1</label>
<title>Clustering-Based Storage and Search Optimization Model</title>
<p>The model is an automatic process in router configuration that allows the tokens from one source node to another neighbor node to be used securely within an adhoc mobile cloud computing network [<xref ref-type="bibr" rid="ref-34">34</xref>]. When a token is generated, the individual routing identification related to any route interaction in the CLAID must be stored inside the adhoc mobile cloud computing network history. This approach helps improve the node routing integrity and security [<xref ref-type="bibr" rid="ref-35">35</xref>]. Conventionally, the actual route is generally referred to as the &#x201C;authorized mobile device communication.&#x201D;</p>
<p>Given that the proposed model calculates each node&#x2019;s distance in the network for transmitting data, the proposed cluster and route maintenance sets the distance between nodes to 0.2 which is next nearest value for alternate route calculation [<xref ref-type="bibr" rid="ref-36">36</xref>]. If the distance is greater than the condition, then the nodes are ignored [<xref ref-type="bibr" rid="ref-37">37</xref>,<xref ref-type="bibr" rid="ref-38">38</xref>]. Current routing activities are stored in the decentralized peer-to-peer system to be publicly accessible to the routing process for efficiency. Neighbor node token verification and route detection can decrease the waiting time for precise route confirmation [<xref ref-type="bibr" rid="ref-39">39</xref>]. In last few decades the decentralized peer-to-peer system helps to scale intruders by allowing suspectable attackers to form an unauthorized data transmission through the clustering-based storage and search optimization protocol.</p>
<p>The storage and search optimization algorithm can find nearby nodes by intending (route) to move toward a specific new_next_route node [<xref ref-type="bibr" rid="ref-40">40</xref>]. Search optimization equates the route nodes to the new_next_route nodes of the cloud server&#x2019;s cluster. If the storage and search optimization ends with the specific target discovery, then the remaining data are transferred to the nearby nodes. This process helps increases the data transmission speed and the routing efficiency [<xref ref-type="bibr" rid="ref-41">41</xref>&#x2013;<xref ref-type="bibr" rid="ref-43">43</xref>].</p>
<p>The processing time of storage and search optimization is taken and compared with the transmission and RREQ/RRES times. Moreover, the adhoc mobile cloud computing network is a separate routing network connected to its source cluster using two-way communication. This communication is considered as the future communication, which allows node tokens and some other node properties to be used securely from source to destination. <?A3B2 "fig3",5,"anchor"?><xref ref-type="fig" rid="fig-3">Fig. 3</xref> represents how data is stored in CLAID using two-way communication [<xref ref-type="bibr" rid="ref-44">44</xref>].</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Flow chart for storage and searching optimization algorithm</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-3.png"/>
</fig>
<p>CLAID provides efficient route communication using a novel clustering-based storage and search optimization approach [<xref ref-type="bibr" rid="ref-45">45</xref>,<xref ref-type="bibr" rid="ref-46">46</xref>]. This method checks whether the communicating node is active or not. If the node is inactive, then transmission overload occurs in the routing path; otherwise, temporal death occurs. This process results in imperfect packet broadcasting. The intrusion node suddenly changes in performance and reduces the packet delivery ratio.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Anomaly Detection with the Hidden Markov Model</title>
<p>Identification of abnormal behaviors: Identifying abnormalities is disturbed by detecting an anomaly as per the standard routing behaviors. A broad range of techniques, like clustering-based storage and search optimization, adhoc mobile cloud computing network, and hidden Markov models, have been prospected as distinct ways of accepting an anomaly identification challenge. Established attacks provide outlier-based elucidation to avoid interruption in the real-time networks. It also helps to examine the procedure-based attacks and multidimensional routing traffic in networks.</p>
<p>The hidden-Markov-models-based identification of abnormalities in connection with CLAID-HMM creates two premises.
<list list-type="bullet">
<list-item>
<p>First, all the mobile nodes count actual conditions in the cloud environment depending merely on the initial condition, forming a complex structure in the cloud environment.</p></list-item>
<list-item>
<p>Second, the efficiency of metrics depends on the authenticated source node hidden in the cloud server. This efficiency of metrics must account for this route history statement&#x2019;s incredibly low validity.</p></list-item>
<list-item>
<p>CPU utilization: According to the percentage of availability in utility of CPU, the collection of CPU utilization, interpretation of quantitative sending data and probability of expected outcome route to estimate population parameters are calculated for usage.</p></list-item>
<list-item>
<p>Available Memory (stored data and memory): This measure covers all the available memory on the virtual machine and is automatically accessible to applications. The free memory reflects the potential capability for additional instances of applications.</p></list-item>
<list-item>
<p>Disk RREQ/RRES: The total numbers of observed RREQ/RRES operations on a disk per second is determined by <xref ref-type="disp-formula" rid="eqn-1">Eqs. (1)</xref> and <xref ref-type="disp-formula" rid="eqn-2">(2)</xref>.</p></list-item>
</list></p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">M</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:mrow><mml:mtext>node</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mtext>RREQ:RRES</mml:mtext></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mtext>Var-low(Deprivation)</mml:mtext></mml:mrow></mml:msub></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">U</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">M</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:mrow><mml:mtext>node</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mtext>RREQ:RRES</mml:mtext></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mtext>Var-high(Malfunction)</mml:mtext></mml:mrow></mml:msub></mml:math>
</disp-formula></p>
<p>CUnode refers to the CPU utilization nodes, MSnode refers to the memory (stored data) node, and CCERREQ: RRES is the Cluster_count_Entry (RREQ/RRES). <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mrow><mml:mi mathvariant="bold">M</mml:mi><mml:mi mathvariant="bold">S</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">n</mml:mi><mml:mi mathvariant="bold">o</mml:mi><mml:mi mathvariant="bold">d</mml:mi><mml:mi mathvariant="bold">e</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is a three-dimensional vector that represents the observed current state of Observe Storage, where 0 denotes a normal route and 1 denotes an abnormal route.</p>
<p>The crucial findings such as height of performance indicators causing anomalous conditions does not appear rapidly. Before performances achieved, the proportions of resource usage increase slowly toward the next_route point and it has potential for anomaly increases. A simple simulation scheme for changing the sampling distances dynamically depending on the degree of risk is introduced. The next _route _point is defined as follows: (<xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>):</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="bold">n</mml:mi><mml:mi mathvariant="bold">e</mml:mi><mml:mi mathvariant="bold">x</mml:mi><mml:mi mathvariant="bold">t</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">route</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mtext mathvariant="bold">point</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mrow><mml:mi mathvariant="bold">M</mml:mi><mml:mi mathvariant="bold">S</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">node</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi mathvariant="bold">C</mml:mi><mml:mi mathvariant="bold">C</mml:mi><mml:mi mathvariant="bold">E</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">RREQ:RRES</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mfrac><mml:mo>&#x2217;</mml:mo><mml:mn>100.</mml:mn></mml:math>
</disp-formula></p>
<fig id="fig-9"><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-9.png"/></fig>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Result and Discussion</title>
<p>The developed clustering-based storage and search optimization approach (cross-layer analysis based on intrusion detection methods) is simulated using NS-3 to calculate the performance parameters, like the end-to-end delay, the energy consumption, the network lifetime, the packet delivery ratio, and the throughput. The simulation details using the proposed CLAID methods by the clustering approach based on the storage and search optimization approach are provided in <?A3B2 "tbl1",5,"anchor"?><xref ref-type="table" rid="table-1">Tab. 1</xref>.</p>
<p><bold><italic>Performance Metrics</italic></bold></p>
<p>The existing approaches such as MZBIDS [<xref ref-type="bibr" rid="ref-47">47</xref>] and EA-ICA [<xref ref-type="bibr" rid="ref-48">48</xref>] are compared with proposed CLAID technique which is based on storage and search optimization. CLAID calculates the QoS performance, such as the end-to-end delay, the energy consumption, the network lifetime, the packet delivery ratio, and the throughput. In addition, the area under the curve (AUC) is plotted for binary classification problems. AUC is the measure of a router&#x2019;s ability to distinguish between routes and summarize the score chart.</p>
<p>AUC Chart: An accurate system will detect the chart&#x2019;s intrusion, showing different values and stating the entire false positive and true positive rate (<?A3B2 "fig4",5,"anchor"?><xref ref-type="fig" rid="fig-4">Fig. 4</xref>). In addition, the system also provides the accuracy of the proposed algorithm stated on the chart. With this data, the number of packets containing intrusion attacks is identified. To describe the efficiency established by CLAID methods&#x2019;, fine-tuned accuracy is evaluated based on the following action to achieve an accurate result [<xref ref-type="bibr" rid="ref-49">49</xref>].</p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mtext>Accuracy</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>True Negative</mml:mtext><mml:mo>+</mml:mo><mml:mtext>True Positive</mml:mtext></mml:mrow><mml:mrow><mml:mtext>True Negative</mml:mtext><mml:mo>+</mml:mo><mml:mtext>True Positive</mml:mtext><mml:mo>+</mml:mo><mml:mtext>False Negative</mml:mtext><mml:mo>+</mml:mo><mml:mtext>False Positive</mml:mtext></mml:mrow></mml:mfrac></mml:math>
</disp-formula></p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>AUC chart</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-4.png"/>
</fig>
<p><?A3B2 "fig5",5,"anchor"?><xref ref-type="fig" rid="fig-5">Fig. 5</xref> indicates that accuracy is assessed using <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> for storage and route sustentation, employing the proposed CLAID. Using the existing methods MZBIDS and EA-ICA in <xref ref-type="table" rid="table-1">Tab.1</xref>, the proposed CLAID&#x2019;s efficacy is approximately 97.76%. Furthermore, an accuracy of nearly 97% was achieved by our proposed CLAID [<xref ref-type="bibr" rid="ref-49">49</xref>].</p>
<p>Packet is measured using <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>:</p>
<p><disp-formula id="eqn-6">
<label>(5)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mi mathvariant="italic">p</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">c</mml:mi><mml:mi mathvariant="italic">k</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">s</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="italic">T</mml:mi><mml:mi mathvariant="italic">o</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">l</mml:mi></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">r</mml:mi><mml:mi mathvariant="italic">a</mml:mi><mml:mi mathvariant="italic">n</mml:mi><mml:mi mathvariant="italic">s</mml:mi><mml:mi mathvariant="italic">m</mml:mi><mml:mi mathvariant="italic">i</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">t</mml:mi><mml:mi mathvariant="italic">e</mml:mi><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mn>100.</mml:mn></mml:math>
</disp-formula></p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Accuracy comparison chart</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-5.png"/>
</fig>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Accuracy comparison</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Node&#x2019;s counts</th>
<th>MZBIDS [<xref ref-type="bibr" rid="ref-47">47</xref>]</th>
<th>EA-ICA [<xref ref-type="bibr" rid="ref-48">48</xref>]</th>
<th>Proposed CLAID</th>
</tr>
</thead>
<tbody>
<tr>
<td>10</td>
<td>87.67</td>
<td>95.65</td>
<td>97.933</td>
</tr>
<tr>
<td>20</td>
<td>83.98</td>
<td>94.76</td>
<td>97.900</td>
</tr>
<tr>
<td>30</td>
<td>83.1</td>
<td>93.59</td>
<td>97.857</td>
</tr>
<tr>
<td>40</td>
<td>82.78</td>
<td>93.06</td>
<td>97.833</td>
</tr>
<tr>
<td>50</td>
<td>82.56</td>
<td>92.84</td>
<td>97.790</td>
</tr>
<tr>
<td>60</td>
<td>81.75</td>
<td>92.45</td>
<td>97.765</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><?A3B2 "tbl2",5,"anchor"?><xref ref-type="table" rid="table-2">Tab. 2</xref> proves that the proposed CLAID method can achieve a high packet delivery ratio. The evaluated measures indicate that the existing MZBIDS obtains 92% in packet delivery ratio, whereas CLAID obtains 97% in packet delivery ratio. Furthermore, a high PDR value of 97.856% was obtained by the proposed method, which is more powerful than the other methods (<?A3B2 "fig6",5,"anchor"?><xref ref-type="fig" rid="fig-6">Fig. 6</xref>) [<xref ref-type="bibr" rid="ref-50">50</xref>].</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Packet delivery ratio (%) comparison</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Node&#x2019;s counts</th>
<th>MZBIDS [<xref ref-type="bibr" rid="ref-47">47</xref>]</th>
<th>EA-ICA [<xref ref-type="bibr" rid="ref-48">48</xref>]</th>
<th>Proposed CLAID</th>
</tr>
</thead>
<tbody>
<tr>
<td>10</td>
<td>87.56</td>
<td>94.87</td>
<td>97.856</td>
</tr>
<tr>
<td>20</td>
<td>88.98</td>
<td>93.93</td>
<td>97.856</td>
</tr>
<tr>
<td>30</td>
<td>87.75</td>
<td>93.54</td>
<td>97.570</td>
</tr>
<tr>
<td>40</td>
<td>85.83</td>
<td>94</td>
<td>96.361</td>
</tr>
<tr>
<td>50</td>
<td>84.67</td>
<td>95.5</td>
<td>94.680</td>
</tr>
<tr>
<td>60</td>
<td>83.87</td>
<td>92.56</td>
<td>93.489</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Packet delivery ratio (%) comparison chart</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-6.png"/>
</fig>
<p><?A3B2 "tbl3",5,"anchor"?><xref ref-type="table" rid="table-3">Tab. 3</xref> shows the throughput value of the proposed CLAID (<?A3B2 "fig7",5,"anchor"?><xref ref-type="fig" rid="fig-7">Fig. 7</xref>). Throughputs of approximately 30 and 43 kbps are achieved through existing approaches, such as MZBIDS and EA-ICA. The efficiency of the proposed CLAID is also higher than the throughput performance of nearly 121 kbps. <?A3B2 "fig8",5,"anchor"?><xref ref-type="fig" rid="fig-8">Fig. 8</xref> and <?A3B2 "tbl4",5,"anchor"?><xref ref-type="table" rid="table-4">Tab. 4</xref> describe the adequate energy used for any node in the transmission path and show the measured values. Furthermore, the comparisons between energy usage and current approaches are based on the comparison in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Throughput (kbps) comparison table</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Node&#x2019;s counts</th>
<th>MZBIDS [<xref ref-type="bibr" rid="ref-47">47</xref>]</th>
<th>EA-ICA [<xref ref-type="bibr" rid="ref-48">48</xref>]</th>
<th>Proposed CLAID</th>
</tr>
</thead>
<tbody>
<tr>
<td>10</td>
<td>10</td>
<td>10</td>
<td>16.416</td>
</tr>
<tr>
<td>20</td>
<td>15</td>
<td>17</td>
<td>19.426</td>
</tr>
<tr>
<td>30</td>
<td>18</td>
<td>21</td>
<td>112.416</td>
</tr>
<tr>
<td>40</td>
<td>23</td>
<td>27</td>
<td>116.433</td>
</tr>
<tr>
<td>50</td>
<td>26</td>
<td>34</td>
<td>119.426</td>
</tr>
<tr>
<td>60</td>
<td>30</td>
<td>43</td>
<td>121.333</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Energy consumption comparison chart</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-7.png"/>
</fig>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Network lifetime comparison chart</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_19502-fig-8.png"/>
</fig>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Energy consumption comparison table</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Node&#x2019;s counts</th>
<th>MZBIDS [<xref ref-type="bibr" rid="ref-47">47</xref>]</th>
<th>EA-ICA [<xref ref-type="bibr" rid="ref-48">48</xref>]</th>
<th>Proposed CLAID</th>
</tr>
</thead>
<tbody>
<tr>
<td>10</td>
<td>98</td>
<td>110</td>
<td>127.133</td>
</tr>
<tr>
<td>20</td>
<td>115</td>
<td>140</td>
<td>277.324</td>
</tr>
<tr>
<td>30</td>
<td>140</td>
<td>186</td>
<td>397.199</td>
</tr>
<tr>
<td>40</td>
<td>167</td>
<td>230</td>
<td>507.199</td>
</tr>
<tr>
<td>50</td>
<td>198</td>
<td>267</td>
<td>557.613</td>
</tr>
<tr>
<td>60</td>
<td>220</td>
<td>350</td>
<td>627.133</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The energy consumption of the nodes is estimated depending on the simulation time. The proposed CLAID model consumes minimal energy due to the minimal, efficient route. In an adhoc mobile cloud computing network, one of the required metrics to achieve successful connectivity is network lifetime. When the nodes&#x2019; energy consumption is high, connecting with nodes to impact the network&#x2019;s lifespan is impossible. The energy consumption is minimal in this suggested method, indicating that the network&#x2019;s lifespan increased.</p>
<p><?A3B2 "fig9",5,"anchor"?><xref ref-type="fig" rid="fig-8">Fig. 8</xref> and <?A3B2 "tbl5",5,"anchor"?><xref ref-type="table" rid="table-5">Tab. 5</xref> <?A3B2 "tbl6",5,"anchor"?>describe the network lifetime for many nodes and the testing with predominant approaches. When sending messages across 60 nodes, the existing MZBIDS and EA-ICA have network lifetimes of 220 and 350 s, but the proposed CLAID method&#x2019;s maximum network lifetime 627.133 s. The delay is measured to identify the time required to reach the destination of the transmitted data. The ratio of time consumed for receiving packets to the time consumed by the transmitted packets is measured using <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>.</p>
<p><disp-formula id="eqn-5">
<label>(6)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mtext>End-to-end delay</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>Time Duration&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mtext>Received data packet</mml:mtext><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mtext>Time Duration&#xA0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mtext>Transmitted data packets</mml:mtext><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math>
</disp-formula></p>
<p>End-to-end delay value of the proposed CLAID method and compares the value with those of existing techniques. Here, MZBIDS and EA-ICA obtain delay values of approximately 59 and 43 s, respectively. The proposed CLAID method also obtains a delay value of 14 ms. In comparison, the proposed CLAID obtains a lower delay value of 0.6 s when transmitting 10 nodes.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Network lifetime comparison table</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Node&#x2019;s counts</th>
<th>MZBIDS [<xref ref-type="bibr" rid="ref-47">47</xref>]</th>
<th>EA-ICA [<xref ref-type="bibr" rid="ref-48">48</xref>]</th>
<th>Proposed CLAID</th>
</tr>
</thead>
<tbody>
<tr>
<td>10</td>
<td>98</td>
<td>110</td>
<td>127.133</td>
</tr>
<tr>
<td>20</td>
<td>115</td>
<td>140</td>
<td>277.324</td>
</tr>
<tr>
<td>30</td>
<td>140</td>
<td>186</td>
<td>397.199</td>
</tr>
<tr>
<td>40</td>
<td>167</td>
<td>230</td>
<td>507.199</td>
</tr>
<tr>
<td>50</td>
<td>198</td>
<td>267</td>
<td>557.613</td>
</tr>
<tr>
<td>60</td>
<td>220</td>
<td>350</td>
<td>627.133</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>Adhoc mobile cloud computing networks face various issues, like delay, energy consumption, flexibility, infrastructure, network lifetime, security, stability, data transition, and link accomplishment issues. This research proposes the CLAID methods using the clustering approach based on the storage and search optimization approach to overcome the above issues against the routing in the cloud environment. These approaches are formed by cross-layer analysis is based on intrusion detection methods for clustering and route maintenance in an adhoc mobile cloud computing network. Hence, the developed clustering-based storage and search optimization approach model was evaluated using NS-3, and the outcomes were compared with those of existing methods, such as MZBIDS and EA-ICA, to evaluate parameters, like accuracy, end-to-end delay, energy consumption, network lifetime, packet delivery ratio, and throughput.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other">
<p><bold>Ethical Approval:</bold> This article does not contain any studies with human participants or animals performed by any authors.</p>
</fn>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> This research was supported by Korea Institute for Advancement of Technology (KIAT) grant funded by the Korea Government (MOTIE) (P0012724, The Competency Development Program for Industry Specialist) and the Soonchunhyang University Research Fund.</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>B.</given-names> <surname>Brik</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Lagraa</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Tamani</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Lakas</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Ghamri-Doudane</surname></string-name></person-group>, &#x201C;<article-title>Renting out cloud services in mobile vehicular cloud</article-title>,&#x201D; <source>IEEE Transactions on Vehicular Technology</source>, vol. <volume>67</volume>, no. <issue>10</issue>, pp. <fpage>9882</fpage>&#x2013;<lpage>9895</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>A. V.</given-names> <surname>Dastjerdi</surname></string-name>, <string-name><given-names>R. N.</given-names> <surname>Calheiros</surname></string-name>, <string-name><given-names>S. N.</given-names> <surname>Srirama</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Buyya</surname></string-name></person-group>, &#x201C;<article-title>Mcloud: Acontext-aware offloading framework for heterogeneous mobile cloud</article-title>,&#x201D; <source>IEEE Transactions on Services Computing</source>, vol. <volume>10</volume>, no. <issue>5</issue>, pp. <fpage>797</fpage>&#x2013;<lpage>810</lpage>, <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>B.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Jia</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Lu</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>Cloud-assisted safety message dissemination in VANET-cellular heterogeneous wireless network</article-title>,&#x201D; <source>IEEE Systems Journal</source>, vol. <volume>11</volume>, no. <issue>1</issue>, pp. <fpage>128</fpage>&#x2013;<lpage>139</lpage>, <year>2017</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>C. A.</given-names> <surname>Ardagna</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Conti</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Leone</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Stefa</surname></string-name></person-group>, &#x201C;<article-title>An anonymous end-to-end communication protocol for mobile cloud environments</article-title>,&#x201D; <source>IEEE Transactions on Services Computing</source>, vol. <volume>7</volume>, no. <issue>3</issue>, pp. <fpage>373</fpage>&#x2013;<lpage>386</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>C.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Deng</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Yao</surname></string-name></person-group>, &#x201C;<article-title>Resource allocation in vehicular cloud computing systems with heterogeneous vehicles and roadside units</article-title>,&#x201D; <source>IEEE Internet of Things Journal</source>, vol. <volume>5</volume>, no. <issue>5</issue>, pp. <fpage>3692</fpage>&#x2013;<lpage>3700</lpage>, <year>2018</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>S.</given-names> <surname>Pudlewski</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Cen</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Guan</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Melodia</surname></string-name></person-group>, &#x201C;<article-title>Video transmission over lossy wireless networks: A cross-layer perspective</article-title>,&#x201D; <source>IEEE Journal of Selected Topics in Signal Processing</source>, vol. <volume>9</volume>, no. <issue>1</issue>, pp. <fpage>6</fpage>&#x2013;<lpage>21</lpage>, <year>2015</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>M.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Deep tensor fusion network for multimodal ground-based cloud classification in weather station networks</article-title>,&#x201D; <source>Ad Hoc Networks</source>, vol. <volume>96</volume>, no. <issue>1</issue>, pp. <fpage>456</fpage>, <year>2020</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>F.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Deng</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Liang</surname></string-name></person-group>, &#x201C;<article-title>An optimal real-time distributed algorithm for utility maximization of mobile ad hoc cloud</article-title>,&#x201D; <source>IEEE Communications Letters</source>, vol. <volume>22</volume>, no. <issue>4</issue>, pp. <fpage>824</fpage>&#x2013;<lpage>827</lpage>, <year>2018</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>R. K.</given-names> <surname>Panta</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Jana</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>Y. R.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>V. A.</given-names> <surname>Vaishampayan</surname></string-name></person-group>, &#x201C;<article-title>Phoenix: Storage using an autonomous mobile infrastructure</article-title>,&#x201D; <source>IEEE Transactions on Parallel and Distributed Systems</source>, vol. <volume>24</volume>, no. <issue>9</issue>, pp. <fpage>1863</fpage>&#x2013;<lpage>1873</lpage>, <year>2013</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>C.</given-names> <surname>Tham</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Cao</surname></string-name></person-group>, &#x201C;<article-title>Stochastic programming methods for workload assignment in an Ad hoc mobile cloud</article-title>,&#x201D; <source>IEEE Transactions on Mobile Computing</source>, vol. <volume>17</volume>, no. <issue>7</issue>, pp. <fpage>1709</fpage>&#x2013;<lpage>1722</lpage>, <year>2018</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>B. D.</given-names> <surname>Deebak</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Al-Turjman</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Mostarda</surname></string-name></person-group>, &#x201C;<article-title>Seamless secure anonymous authentication for cloud-based mobile edge computing</article-title>,&#x201D; <source>Computers &#x0026; Electrical Engineering</source>, vol. <volume>87</volume>, no. <issue>1</issue>, pp. <fpage>2346</fpage>, <year>2020</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>F.</given-names> <surname>Chi</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Cai</surname></string-name> and <string-name><given-names>V. C. M.</given-names> <surname>Leung</surname></string-name></person-group>, &#x201C;<article-title>Ad-Hoc cloudlet based cooperative cloud gaming</article-title>,&#x201D; <source>IEEE Transactions on Cloud Computing</source>, vol. <volume>6</volume>, no. <issue>3</issue>, pp. <fpage>625</fpage>&#x2013;<lpage>639</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Afaq</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Iqbal</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Ahmed</surname></string-name>, <string-name><given-names>I. U.</given-names> <surname>Islam</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Khan</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Towards 5G network slicing for vehicular ad-hoc networks an end-to-end approach</article-title>,&#x201D; <source>Computer Communications</source>, vol. <volume>149</volume>, no. <issue>1</issue>, pp. <fpage>252</fpage>&#x2013;<lpage>258</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Hou</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhou</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Cooperative task scheduling for computation offloading in vehicular cloud</article-title>,&#x201D; <source>IEEE Transactions on Vehicular Technology</source>, vol. <volume>67</volume>, no. <issue>11</issue>, pp. <fpage>11049</fpage>&#x2013;<lpage>11061</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Alarifi</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Tolba</surname></string-name></person-group>, &#x201C;<article-title>Optimizing the network energy of cloud assisted internet of things by using the adaptive neural learning approach in wireless sensor networks</article-title>,&#x201D; <source>Computers in Industry</source>, vol. <volume>106</volume>, no. <issue>1</issue>, pp. <fpage>133</fpage>&#x2013;<lpage>141</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Bazyd&#x0142;o</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Niewiadomska-Szynkiewicz</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Czerwi&#x0144;ski</surname></string-name> and <string-name><given-names>P.</given-names> <surname>R&#x0119;kawek</surname></string-name></person-group>, &#x201C;<chapter-title>Simulation-based design of mobile ad Hoc network for tracking and monitoring</chapter-title>,&#x201D; <conf-name>Int. Conf. on Automation ICA 2016</conf-name>, <conf-loc>Warsaw, Poland</conf-loc>, vol. <volume>440</volume>, pp. <fpage>573</fpage>&#x2013;<lpage>586</lpage>, <year>2016</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>F.</given-names> <surname>Hagenauer</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Higuchi</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Altintas</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Dressler</surname></string-name></person-group>, &#x201C;<article-title>Efficient data handling in vehicular micro clouds</article-title>,&#x201D; <source>Ad Hoc Networks</source>, vol. <volume>91</volume>, no. <issue>1</issue>, pp. <fpage>2134</fpage>, <year>2019</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>J.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Song</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>F. R.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Du</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Context-aware object detection for vehicular networks based on edge-cloud cooperation</article-title>,&#x201D; <source>IEEE Internet of Things Journal</source>, vol. <volume>7</volume>, no. <issue>7</issue>, pp. <fpage>5783</fpage>&#x2013;<lpage>5791</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>J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Gao</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Dynamic cloudlet-assisted energy-saving routing mechanism for mobile ad hoc networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>5</volume>, pp. <fpage>20908</fpage>&#x2013;<lpage>20920</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Klauck</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Kirsche</surname></string-name></person-group>, &#x201C;<article-title>Combining mobile XMPP entities and cloud services for collaborative post-disaster management in hybrid network environments</article-title>,&#x201D; <source>Mobile Networks and Applications</source>, vol. <volume>18</volume>, no. <issue>2</issue>, pp. <fpage>253</fpage>&#x2013;<lpage>270</lpage>, <year>2013</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>J.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Zhong</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Zhang</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Aeronautical $Ad&#x007E;Hoc$ networking for the internet-above-the-clouds</article-title>,&#x201D; <source>Proc. of the IEEE</source>, vol. <volume>107</volume>, no. <issue>5</issue>, pp. <fpage>868</fpage>&#x2013;<lpage>911</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Gu</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>A Distributed caching scheme using non-cooperative game for mobile edge networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>142747</fpage>&#x2013;<lpage>142757</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>S.</given-names> <surname>Kaja</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Elhadi</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Yasar</surname></string-name></person-group>, &#x201C;<article-title>Enhanced cloud acknowledgement scheme for a node network</article-title>,&#x201D; <source>Procedia Computer Science</source>, vol. <volume>175</volume>, no. <issue>155</issue>, pp. <fpage>369</fpage>&#x2013;<lpage>377</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>I. J.</given-names> <surname>Jebadurai</surname></string-name>, <string-name><given-names>E. B.</given-names> <surname>Rajsingh</surname></string-name> and <string-name><given-names>G. J. L.</given-names> <surname>Paulraj</surname></string-name></person-group>, &#x201C;<article-title>A novel node collusion method for isolating sinkhole nodes in mobile ad Hoc cloud</article-title>,&#x201D; in <conf-name>Advances in Big Data and Cloud Computing, Advances in Intelligent Systems and Computing</conf-name>, <publisher-loc>Coimbatore, India</publisher-loc>, <publisher-name>Springer</publisher-name>, vol. <volume>645</volume>, pp. <fpage>319</fpage>&#x2013;<lpage>329</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>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>M. Q.</given-names> <surname>Meng</surname></string-name></person-group>, &#x201C;<article-title>A hierarchical auction-based mechanism for real-time resource allocation in cloud robotic systems</article-title>,&#x201D; <source>IEEE Transactions on Cybernetics</source>, vol. <volume>47</volume>, no. <issue>2</issue>, pp. <fpage>473</fpage>&#x2013;<lpage>484</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>L.</given-names> <surname>Vigneri</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Spyropoulos</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Barakat</surname></string-name></person-group>, &#x201C;<article-title>Quality of experience-aware mobile edge caching through a vehicular cloud</article-title>,&#x201D; <source>IEEE Transactions on Mobile Computing</source>, vol. <volume>19</volume>, no. <issue>9</issue>, pp. <fpage>2174</fpage>&#x2013;<lpage>2188</lpage>, <year>2020</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>Y.</given-names> <surname>Lai</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Wang</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>CASQ: Adaptive and cloud-assisted query processing in vehicular sensor networks</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>94</volume>, no. <issue>1</issue>, pp. <fpage>237</fpage>&#x2013;<lpage>249</lpage>, <year>2019</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>C.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Liye</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Hengliang</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Youlong</surname></string-name></person-group>, &#x201C;<article-title>Mobile user behavior-based topology formation and optimization in ad hoc mobile cloud</article-title>,&#x201D; <source>Journal of Systems and Software</source>, vol. <volume>148</volume>, no. <issue>1</issue>, pp. <fpage>132</fpage>&#x2013;<lpage>147</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Bharathisindhu</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Selva Brunda</surname></string-name></person-group>, &#x201C;<article-title>An improved model based on genetic algorithm for detecting intrusion in mobile ad hoc network</article-title>,&#x201D; <source>Cluster Computing</source>, vol. <volume>22</volume>, no. <issue>1</issue>, pp. <fpage>265</fpage>&#x2013;<lpage>275</lpage>, <year>2019</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>C.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Quan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>L. A.</given-names> <surname>Grieco</surname></string-name></person-group>, &#x201C;<article-title>Grimes: Green information-centric multimedia streaming framework in vehicular ad Hoc networks</article-title>,&#x201D; <source>IEEE Transactions on Circuits and Systems for Video Technology</source>, vol. <volume>28</volume>, no. <issue>2</issue>, pp. <fpage>483</fpage>&#x2013;<lpage>498</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wei</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Jia</surname></string-name></person-group>, &#x201C;<article-title>Mobile vehicles as fog nodes for latency optimization in smart cities</article-title>,&#x201D; <source>IEEE Transactions on Vehicular Technology</source>, vol. <volume>69</volume>, no. <issue>9</issue>, pp. <fpage>9364</fpage>&#x2013;<lpage>9375</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Zhao</surname></string-name></person-group>, &#x201C;<chapter-title>Control channel management in dynamic spectrum access-based ad hoc networks</chapter-title>,&#x201D; in <source>Cognitive Radio Mobile Ad Hoc Networks</source>. <publisher-loc>New York</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>181</fpage>&#x2013;<lpage>205</lpage>, <year>2011</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>J. F.</given-names> <surname>Bravo-Torres</surname></string-name>, <string-name><given-names>M.</given-names> <surname>L&#x00F3;pez-Nores</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Blanco-Fern&#x00E1;ndez</surname></string-name>, <string-name><given-names>J. J.</given-names> <surname>Pazos-Arias</surname></string-name> and <string-name><given-names>F. E.</given-names> <surname>Ordi&#x00F3;&#x00F1;ez-Morales</surname></string-name></person-group>, &#x201C;<chapter-title>Leveraging ad-hoc networking and mobile cloud computing to exploit short-lived relationships among users on the move</chapter-title>,&#x201D; in <conf-name>Intelligent Cloud Computing ICC 2014</conf-name>, <comment>Lecture Notes in Computer Science</comment>, <conf-loc>Muscat, Oman</conf-loc>, <publisher-name>Springer</publisher-name>, vol. <volume>8993</volume>, <year>2015</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>Y.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Wolfson</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Xu</surname></string-name></person-group>, &#x201C;<chapter-title>The mobi-dik approach to searching in mobile ad hoc network databases</chapter-title>,&#x201D; in <source>Handbook of Peer-to-Peer Networking</source>. <publisher-loc>USA</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>1105</fpage>&#x2013;<lpage>1123</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Ma</surname></string-name>, <string-name><given-names>D.</given-names> <surname>He</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Kumar</surname></string-name> and <string-name><given-names>K. R.</given-names> <surname>Choo</surname></string-name></person-group>, &#x201C;<article-title>An efficient and provably secure authenticated key agreement protocol for fog-based vehicular ad-hoc networks</article-title>,&#x201D; <source>IEEE Internet of Things Journal</source>, vol. <volume>6</volume>, no. <issue>5</issue>, pp. <fpage>8065</fpage>&#x2013;<lpage>8075</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Cui</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Han</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>K. C.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>C. C.</given-names> <surname>Chang</surname></string-name></person-group>, &#x201C;<article-title>ARFV: An efficient shared data auditing scheme supporting revocation for fog-assisted vehicular ad-hoc networks</article-title>,&#x201D; <source>IEEE Transactions on Vehicular Technology</source>, vol. <volume>69</volume>, no. <issue>12</issue>, pp. <fpage>15815</fpage>&#x2013;<lpage>15827</lpage>, <year>2020</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>H.</given-names> <surname>Tseng</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Sheu</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Shih</surname></string-name></person-group>, &#x201C;<article-title>Rotational listening strategy for IEEE 802.15.4 wireless body networks</article-title>,&#x201D; <source>IEEE Sensors Journal</source>, vol. <volume>11</volume>, no. <issue>9</issue>, pp. <fpage>1841</fpage>&#x2013;<lpage>1855</lpage>, <year>2011</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>M.</given-names> <surname>Radenkovic</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Crowcroft</surname></string-name> and <string-name><given-names>M. H.</given-names> <surname>Rehmani</surname></string-name></person-group>, &#x201C;<article-title>Towards low-costprototyping of mobile opportunistic disconnection tolerant networks and systems</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>4</volume>, no. <issue>1</issue>, pp. <fpage>5309</fpage>&#x2013;<lpage>5321</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Pinte</surname></string-name>, <string-name><given-names>A. L.</given-names> <surname>Carreton</surname></string-name>, <string-name><given-names>E. G.</given-names> <surname>Boix</surname></string-name> and <string-name><given-names>W. De</given-names> <surname>Meuter</surname></string-name></person-group>, &#x201C;<article-title>Ambient clouds: Reactive asynchronous collections for mobile ad hoc network applications</article-title>,&#x201D; in <conf-name>IFIP Int. Conf. on Distributed Applications and Interoperable Systems</conf-name>, <conf-loc>Kongens Lyngby, Denmark</conf-loc>, <publisher-name>Springer</publisher-name>, pp. <fpage>85</fpage>&#x2013;<lpage>98</lpage>, <year>2013</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>Qiu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Dai</surname></string-name> and <string-name><given-names>A. V.</given-names> <surname>Vasilakos</surname></string-name></person-group>, &#x201C;<article-title>Loop parallelism maximization for multimedia data processing in mobile vehicular clouds</article-title>,&#x201D; <source>IEEE Transactions on Cloud Computing</source>, vol. <volume>7</volume>, no. <issue>1</issue>, pp. <fpage>250</fpage>&#x2013;<lpage>258</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Maly</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Kriz</surname></string-name></person-group>, &#x201C;<chapter-title>An Ad Hoc mobile cloud and its dynamic loading of modules into a mobile device running google android</chapter-title>,&#x201D; in <source>New Trends in Intelligent Information and Database Systems</source>. <publisher-loc>Gdynia, Poland</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>191</fpage>&#x2013;<lpage>198</lpage>, <year>2015</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>E.</given-names> <surname>Yaqoob</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Ahmed</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Gani</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mokhtar</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Imran</surname></string-name></person-group>, &#x201C;<article-title>Heterogeneity-aware task allocation in mobile ad hoc cloud</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>5</volume>, no. <issue>4</issue>, pp. <fpage>1779</fpage>&#x2013;<lpage>1795</lpage>, <year>2017</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>M.</given-names> <surname>Usman</surname></string-name>, <string-name><given-names>A. A.</given-names> <surname>Gebremariam</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Raza</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Granelli</surname></string-name></person-group>, &#x201C;<article-title>A software-defined device-to-device communication architecture for public safety applications in 5G networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>3</volume>, no. <issue>3</issue>, pp. <fpage>1649</fpage>&#x2013;<lpage>1654</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kim</surname></string-name></person-group>, &#x201C;<article-title>New bargaining game based computation offloading scheme for flying ad-hoc networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, no. <issue>2</issue>, pp. <fpage>147038</fpage>&#x2013;<lpage>147047</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Orsini</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Posdorfer</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Lamersdorf</surname></string-name></person-group>, &#x201C;<article-title>Efficient mobile clouds: forecasting the future connectivity of mobile and IoT devices to save energy and bandwidth</article-title>,&#x201D; <source>Procedia Computer Science</source>, vol. <volume>155</volume>, no. <issue>2</issue>, pp. <fpage>121</fpage>&#x2013;<lpage>128</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-46"><label>[46]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Sorkhoh</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Ebrahimi</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Atallah</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Assi</surname></string-name></person-group>, &#x201C;<article-title>Workload scheduling in vehicular networks with edge cloud capabilities</article-title>,&#x201D; <source>IEEE Transactions on Vehicular Technology</source>, vol. <volume>68</volume>, no. <issue>9</issue>, pp. <fpage>8472</fpage>&#x2013;<lpage>8486</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-47"><label>[47]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. S.</given-names> <surname>Krishnan</surname></string-name>, <string-name><given-names>E. G.</given-names> <surname>Julie</surname></string-name> and <string-name><given-names>Y. H.</given-names> <surname>Robinson</surname></string-name></person-group>, &#x201C;<article-title>Modified zone-based intrusion detection system for security enhancement in mobile ad hoc networks</article-title>,&#x201D; <source>Wireless Network</source>, vol. <volume>26</volume>, no. <issue>3</issue>, pp. <fpage>1275</fpage>&#x2013;<lpage>1289</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-48"><label>[48]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Faragardi</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Rajabi</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Sandstr&#x00F6;m</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Nolte</surname></string-name></person-group>, &#x201C;<article-title>EAICA: An energy-aware resource provisioning algorithm for real-time cloud services</article-title>,&#x201D; in <conf-name>IEEE 21st Int. Conf. on Emerging Technologies and Factory Automation</conf-name>, <publisher-loc>Berlin, Germany</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2016</year>. </mixed-citation></ref>
<ref id="ref-49"><label>[49]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Kang</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Maharjan</surname></string-name> <etal>et al.</etal></person-group> &#x201C;<article-title>Software defined networking with pseudonym systems for secure vehicular clouds</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>4</volume>, no. <issue>3</issue>, pp. <fpage>3522</fpage>&#x2013;<lpage>3534</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-50"><label>[50]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>IPv6-based vehicular cloud networking</article-title>,&#x201D; <source>IEEE Communications Letters</source>, vol. <volume>19</volume>, no. <issue>6</issue>, pp. <fpage>933</fpage>&#x2013;<lpage>936</lpage>, <year>2015</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>
