<?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">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</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">12806</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2021.012806</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Secure and Energy Efficient Data Transmission Model for WSN</article-title><alt-title alt-title-type="left-running-head">Secure and Energy Efficient Data Transmission Model for WSN</alt-title><alt-title alt-title-type="right-running-head">Secure and Energy Efficient Data Transmission Model for WSN</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western">
<surname>Singh</surname>
<given-names>Anuj Kumar</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Alshehri</surname>
<given-names>Mohammed</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref>
<email>ma.alshehri@mu.edu.sa</email>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western">
<surname>Bhushan</surname>
<given-names>Shashi</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>Kumar</surname>
<given-names>Manoj</given-names>
</name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western">
<surname>Alfarraj</surname>
<given-names>Osama</given-names>
</name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western">
<surname>Pardarshani</surname>
<given-names>Kamal Raj</given-names>
</name>
<xref ref-type="aff" rid="aff-5">5</xref>
</contrib>
<aff id="aff-1">
<label>1</label><institution>Krishna Engineering College</institution>, <addr-line>Ghaziabad</addr-line>, <country>India</country></aff>
<aff id="aff-2">
<label>2</label><institution>College of Computer and Information Sciences, Majmaah University</institution>, <addr-line>Majmaah, 11952</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3">
<label>3</label><institution>School of Computer Science, University of Petroleum and Energy Studies</institution>, <addr-line>Dehradun</addr-line>, <country>India</country></aff>
<aff id="aff-4">
<label>4</label><institution>Computer Science Department, Community College, King Saud University</institution>, <addr-line>Riyadh</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-5">
<label>5</label><institution>Department of Mathematics, Bioinformatics and Computer Applications</institution>, <addr-line>MANIT, Bhopal</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1">&#x002A;Corresponding Author: Mohammed Alshehri. Email: <email>ma.alshehri@mu.edu.sa</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2020-12-05">
<day>05</day>
<month>12</month>
<year iso-8601-date="2020">2020</year>
</pub-date>
<volume>27</volume>
<issue>3</issue>
<fpage>761</fpage>
<lpage>769</lpage>
<history>
<date date-type="received">
<day>30</day>
<month>8</month>
<year iso-8601-date="2020">2020</year>
</date>
<date date-type="accepted">
<day>01</day>
<month>11</month>
<year iso-8601-date="2020">2020</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Singh et al.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Singh 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_IASC_12806.pdf"></self-uri>
<abstract>
<p>Wireless sensor networks (WSNs) have been used in numerous delicate checking, observation, and surveillance systems that use sensitive data. When a WSN utilizes various data clustering techniques, data is moved to the cluster head (CH) of the corresponding cluster area. Cluster Head further communicates the information to the sink node. In a WSN, a network owner (NO) does not validate a sensor before connecting to the network, so faulty nodes may likely attach to the network to sense the data and attempt to release the information to unauthorized persons. Further, a malicious node may become a mobile node (MN) equipped to send all of a particular cluster area&#x2019;s perceived data to unauthorized persons. The above-stated problems can be solved by introducing an authentication mechanism into wireless sensor networks. In this mechanism, at whatever point of time a sensor connects with a cluster region, the identity of the sensor must be validated and authenticate to, in turn, validate a mobile node. The perceived data are encrypted and then transmitted through the WSN&#x2019;s transmission medium. However, the encrypted data are prone to flaws, and attackers can gain access to it illegitimately. In this study, a more energy effective and proficient secured model is proposed called a data transmission model. The technical components, including the data access control mechanism and various private key cryptography algorithms, are compared to choose the optimal energy-efficient cryptography algorithm. The proposed model is verified by experiments for encryption and decryption processes using JAVA language with advanced encryption standard (AES), data encryption standard (DES), Triple DES, Rivest Cipher (RC4), and Blowfish algorithms. The encryption time is determined using mathematical equations. The experiment results showed that the Blowfish algorithm was comparatively more energy effective than the other private key cryptography algorithms.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Authentication</kwd>
<kwd>cluster head</kwd>
<kwd>network security</kwd>
<kwd>wireless sensor networks</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The information access approach can be considered secure if the user has been authorized first and can only access the source node&#x2019;s desired information (SN). An algorithm that is energy efficient is implemented for both sending and receiving secure information using encryption and decryption processes, respectively [<xref ref-type="bibr" rid="ref-1">1</xref>].</p>
<p>It is initiated with the basic features of wireless sensor networks and issues taking place in practical applications. Motivation towards the present investigation leads to advance features in wireless sensor networks. Initially, the power is generated from the nodes and it is sent to the processing unit. Here the power is passed to the sensing unit, where the sensors collect the information and the output signal is produced.</p>
<sec id="s1_1">
<label>1.1</label>
<title>Methods to Get Crypto-Based Access Information</title>
<p>The crypto-based admittance control and the job-based admittance control are two sorts of made sure about information access moves toward that have been effectively applied in numerous information access control circumstances [<xref ref-type="bibr" rid="ref-2">2</xref>]. Information access control is a basic portion of the information access measure, and information access control and log management were clearly defined in this process [<xref ref-type="bibr" rid="ref-3">3</xref>]. The Role Based access control mechanism was mainly developed so that all the nodes are assigned with the same functions. Here, the Sensor Protocol for Information Negotiation takes place. It will send large collections of data to the neighbor nodes. It avoids redundant data transmission. By saving the node energy, it will increase the network lifetime. By diffusion, the base station sends the query to the remaining nodes. The transmitted data will send back to the base station to find the optimal route path. The main principle is to determine the buffer length and rate control packets by considering each node will maintain the steady transmission rate and packet arrival time. The principal request energy utilization model is based on this postulation [<xref ref-type="bibr" rid="ref-4">4</xref>]. The energy spent for transmitting information consists of two parts: a) Dissipation caused by hardware and b) Energy required for running the transmitter.</p>
<p>Data security, security mechanisms, and activity patterns play a vital role in data security in practice. The sensors first sense data from a hostile environment and then transmit it via the communication medium to the sink node. Unauthorized users manage to tap the transmitted data in order to misuse it. Another topic to investigate regarding authenticity is the concept of log management. Kurp et al. [<xref ref-type="bibr" rid="ref-4">4</xref>], a secure log management approach was proposed for maintaining user activities regarding data access. This secure log management consists of three layers. The discovery of temporal features and relations of activity patterns (DTFRA) has been used to capture time-related information from data. The applications using this secure activity pattern have been detected as anomalies and marked as unauthorized for data access. In the DTFRA, data activity patterns denote the input, and a set of temporal relations denote the output. In the field of sensors, the input collected as data is the data&#x2019;s identity and timestamp [<xref ref-type="bibr" rid="ref-5">5</xref>]. The output captures the duration of work from the temporal relation. This model also uses the apriori algorithm for finding a secure activity pattern in a hostile environment. This algorithm determines the order of activities and can be used to maintain the log.</p>
</sec>
<sec id="s1_2">
<label>1.2</label>
<title>Methods to Manage Logs and Access Control Information</title>
<p>To give a safe access control mechanism and methods to manage logs mechanism, the model shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref> is applied for managing data security [<xref ref-type="bibr" rid="ref-5">5</xref>]. As displayed in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, this model consists of three components: (1) User, which can be either a network owner or a nominal user, (2) The CRBAC; (3) Associated log and data. The methodology for working is as follows. Users, who are either the owner or nominal users, can use the data according to their roles [<xref ref-type="bibr" rid="ref-6">6</xref>]. When a user wants to access the information, he has first to send a request to access control and after getting confirmation, only he can access the information. It is the responsibility of CRBAC to authenticate the user based on the user&#x2019;s credentials and permissions, at which point it grants access to retrieve the data. Next, the user sends a data retrieval request to the data component, allowing the user to be authentic. The data component now starts checking whether the user is directly requested for the data or has already requested for the permission of CRBAC and begins maintaining the logs if permitted. If any unauthorized users get detected in managing Logs and access control information, that particular user will become unauthorized.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Secure access control and log management</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-1.png"/>
</fig>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Mechanism and strategy: Log methodology and access control</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Communication line</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>1. Request to get authenticate</td>
<td>Make a request to get security as an authentication.</td>
</tr>
<tr>
<td>2. Getting response</td>
<td>Receive the response to get authentic and also maintain the log mechanism.</td>
</tr>
<tr>
<td>3. Request for the data</td>
<td>Once get a response from step 2 then request for the data access.</td>
</tr>
<tr>
<td>4. Getting Data as a response</td>
<td>After getting access to data, now detailed information is also maintained.</td>
</tr>
</tbody>
</table></table-wrap>
<p>All the User activities in this security-based access control mechanism are mentioned in <xref ref-type="table" rid="table-1">Tab. 1</xref>. These activities are denoted for communication (e.g., 1 to 4), as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. This architecture&#x2019;s major points are that the CRBAC secures the access control mechanism and the main thing about this protocol is that it will improve the network&#x2019;s stability [<xref ref-type="bibr" rid="ref-7">7</xref>]. As per our observation, this protocol achieves only 52% of throughput and fairness efficiency is low. Here, in this newly proposed protocol, is a hybrid topology where the overhearing problem is also rectified. The sample period is measured for every time and by varying features; the throughput is also measured for different time periods.</p>
</sec>
</sec>
<sec id="s2">
<label>2</label>
<title>Relative Comparison on Key Based Security Algorithms</title>
<p>Various key-based security algorithms have been studied and implemented for security practices; one standard algorithm is RC4 algorithm [<xref ref-type="bibr" rid="ref-8">8</xref>]. The secure key-based algorithms are used in encryption and decryption processes to send data from one node to another securely. So, the benefits of using a secure key-based algorithm are that encryption and decryption times are reduced, and the cracking process is also more time-consuming, making the process more effective and efficient.</p>
<p>This works very effectively in WSN, where each node of WSN has fix and less energy, so energy utilization is a crucial factor while selecting a secure key-based algorithm to encrypt data at the sensor nodes. The energy utilization is dependent on the time taken by the protocols to encrypt and decrypt the code. Some of the private key cryptography algorithms discussed in the below table and their structures, key sizes, and round numbers are presented in <xref ref-type="table" rid="table-2">Tab. 2</xref> [<xref ref-type="bibr" rid="ref-9">9</xref>].</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparative analysis for algorithms</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Algorithm</th>
<th>Type of cipher used</th>
<th>Key size</th>
<th>Rounds (in numbers)</th>
</tr>
</thead>
<tbody>
<tr>
<td>Advanced Encryption Standard</td>
<td>Substitution Cipher</td>
<td>64, 128, 256</td>
<td>8, 16, 24</td>
</tr>
<tr>
<td>Data Encryption Standard</td>
<td>Feistel Cipher</td>
<td>64</td>
<td>16</td>
</tr>
<tr>
<td>T-DES</td>
<td>Feistel Cipher</td>
<td>112, 168</td>
<td>56</td>
</tr>
<tr>
<td>Blowfish</td>
<td>Feistel Cipher</td>
<td>32 to 512</td>
<td>16</td>
</tr>
<tr>
<td>RC4</td>
<td>Unbalanced Feistel Cipher</td>
<td>92</td>
<td>32</td>
</tr>
</tbody>
</table></table-wrap>
</sec>
<sec id="s3">
<label>3</label>
<title>Key Based Secure Block Diagram of WSN</title>
<p>The key-based secure block diagram WSN [<xref ref-type="bibr" rid="ref-10">10</xref>] is presented in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, where it may be observed that this model comprises Network Owner, Mobile Node, cluster sensor, and authenticator. Here in this safe model, the security validation and encryption process are discussed [<xref ref-type="bibr" rid="ref-11">11</xref>&#x2013;<xref ref-type="bibr" rid="ref-15">15</xref>]. The function of the Network Owner is to transferred to the secure query to the Mobile Node to read sensor data stored in the Mobile Node. If the Network Owner doubts or feels that the Mobile Node is transferring a malicious data reply, it will validate the same data with the sensor. The Mobile Nodes&#x2019; primary duty is to accept the Network Owner&#x2019;s query and react to the query using the stored encrypted data and to store the encrypted data transferred by the Cluster Head.</p>
<p>A feedback control loop is designed to determine the total rate of control packets. The light-weight buffer technique will produce only 50% of throughput. To improve this, a globalized probabilistic dropping packets algorithm is designed. In this technique, the controller is designed and an error message is sent to every node. If an error is detected, it starts recovering the packets or data. This leads to improving throughput and network performance. Then the validator generates specific keys with the help of a specially designed algorithm and those keys are passed on sink nodes as well as Mobile nodes when they will join the network</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Secure model architecture for the WSN using private keys</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-2.png"/>
</fig>
<p>The processing component of this model architecture is explained in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. First, the validator produces the encryption keys or decryption keys for each sensor on regular intervals. The sensor stores the manipulated or converted data till the next time interval arises. For instance, if the sensor senses the recently changed data, then the same data will be there for the next time interval. In the next phase, the Mobile Node accepts the data in the encrypted form and saves the sensor information identification number and time when the sensor transmits the data [<xref ref-type="bibr" rid="ref-16">16</xref>]. The validator saves and stores each key for each sensor in the database during the Network Owner decryption process. The Network Owner sends the following query to the</p>
<p>Mobile Node:<inline-formula id="ieqn-1">
<alternatives><inline-graphic xlink:href="ieqn-1.png"/>
<mml:math id="mml-ieqn-1"><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mo>"</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">b</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">s</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">H</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mn>1.</mml:mn><mml:mo>"</mml:mo></mml:math>
</alternatives></inline-formula></p>
<p>Then, the Mobile Node receives the query and sends the request to the authenticator as follows:</p>
<p><disp-formula id="eqn-1">
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-1.png"/>
<mml:math id="mml-eqn-1" display="block"><mml:mo>"</mml:mo><mml:mspace width="negativethinmathspace"></mml:mspace><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">k</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">k</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">g</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">f</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">s</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">f</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">H</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mn>1.</mml:mn><mml:mrow><mml:mo>"</mml:mo></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<sec id="s3_1">
<label>3.1</label>
<title>Blowfish Algorithm</title>
<p>The Blowfish algorithm has shorter encryption and decryption times than similar algorithms. The Blowfish algorithm&#x2019;s primary advantage is that it has significantly less encryption and decryption times than various other similar algorithms, and much longer time is required for unauthorized users to break it down. That is why it is preferably suggested to use the Blowfish algorithm, and it can act as a secure key-based algorithm for safe data transmission in WSNs. One of the parameters that give more preference to the Blowfish algorithm is that it can run at a memory size of less than 5 KB. The Blowfish algorithm is simple to implement and for better security; it uses the additional factor of adding XOR operation and lookup table in each round. The other competitive block ciphers, such as Advanced Encryption Standard, DES, and Triple DES, can be used to require more complex mathematical operations for data transfer. Last, we can say it is easier and safer than other similar algorithms where the size for changing from 32 bits to 448 bits [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-17">17</xref>]. The Blowfish algorithm uses 64 bits of data and the Feistel network for 16 rounds, as shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Round function in the Blowfish algorithm</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-3.png"/>
</fig>
<p>The Blowfish algorithm processes 64 bits of data per block using the key size of 32&#x2013;448 bits in 16 rounds in the Feistel network. The Blowfish algorithm has been used for various data security purposes, including secure data transmission and secure storage, and it has recently been applied to the Internet of Things (IoT) [<xref ref-type="bibr" rid="ref-18">18</xref>&#x2013;<xref ref-type="bibr" rid="ref-20">20</xref>]. There are many examples where the Blowfish algorithm was used for encryption and decryption processes, and some of them are mentioned in the following. The Blowfish block cipher algorithm was used for secure data transmission in the IoT [<xref ref-type="bibr" rid="ref-19">19</xref>]. Suresh et al. [<xref ref-type="bibr" rid="ref-21">21</xref>], the Blowfish algorithm round function was studied, and its encryption time and throughput were compared with those of the other block cipher algorithms, including the DES, AES, RC4, and Triple-DES. The Blowfish algorithm outperformed the other algorithms. With a very large-scale implementation, the effect of the Blowfish algorithm in secure communication was discussed in Suresh et al. [<xref ref-type="bibr" rid="ref-21">21</xref>]. Suresh et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] compared the AES and Blowfish block cipher algorithms. The results showed that performance parameters, including the encryption speed, were higher while the CPU utilization and battery power were lower for the Blowfish algorithm than for the AES block cipher algorithm.</p>
<p>The block cipher algorithms were used for multimedia data security in Saraereh et al. [<xref ref-type="bibr" rid="ref-14">14</xref>]. The encryption times of the RSA, DES, Blowfish, and RC4 algorithms were compared in Kaswan et al. [<xref ref-type="bibr" rid="ref-19">19</xref>]. The results showed that the Blowfish algorithm performed the best in multimedia data encryption and decryption processes. The secure WSN network was implemented using a Blowfish block cipher for patient data transmission in Suresh et al. [<xref ref-type="bibr" rid="ref-21">21</xref>]. The patient&#x2019;s information monitoring wearable sensor was attached to the needy patient in Kaswan et al. [<xref ref-type="bibr" rid="ref-19">19</xref>]. The data were captured from the human body and converted into ciphered data using the Blowfish algorithm and sent via a wireless medium. The secured encrypted patient data were decrypted at the doctor&#x2019;s side, and the patient&#x2019;s health information was monitored. The advantage of this method is that the patient data are accessed securely, and the doctor can monitor the patient from any place and any time. Another interesting application of data security is video data security. The most challenging task for providing security to video data, as encryption and decryption, is choosing an appropriate cryptography algorithm. The encrypted H.264 video transmission using the Blowfish algorithm was proposed for data security in Suresh et al. [<xref ref-type="bibr" rid="ref-21">21</xref>]. There are many real-time applications, which are online as movies and as a camera and sensor-based WSN.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Results</title>
<p>The experiment was conducted using MATLAB to cluster the sensor nodes. The Java programming language was used to implement the Blowfish algorithm with an electronic code block (ECB) cipher-block mode of operation, which was then compared with Triple DES, DES, and AES security algorithms. The system used in this experiment was the 64-bit microprocessor with a 3.06 GHz I<sub>3</sub> processor with 4 GB RAM. The data size for the encryption process for all block cipher algorithms was set to 20 KB, 40 KB, 60 KB, 80 KB, and 100 KB, successively, and the corresponding encryption and decryption times were saved.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Encryption Time Comparison of Block Ciphers</title>
<p>For the data size of 40 KB, the Blowfish algorithm encryption time was 2 s, and for DES, AES, RC4, and Triple DES, the encryption times were 3 s, 5 s, 8 s, and 10 s, respectively. The Blowfish encryption times for the data sizes of 60 KB, 80 KB, and 100 KB were also considerably less than other block ciphers&#x2019; encryption times. The encryption time comparison of the Blowfish, DES, AES, RC4, and Triple DES block cipher algorithms for the data sizes of 20 KB, 40 KB, 60 KB, 80 KB, and 100 KB, is given in <xref ref-type="table" rid="table-3">Tab. 3</xref>.</p>
<p>The mathematical model used for energy-efficient secure data transmission in the experiment is given by <xref ref-type="disp-formula" rid="eqn-1">Eqs. (1)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-3">(3)</xref>, which define the encryption, encryption time, and speed, respectively.</p>
<p><disp-formula id="eqn-2">
<label>(1)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-2.png"/>
<mml:math id="mml-eqn-2" display="block"><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mi>p</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mo>&#x003D;</mml:mo><mml:mspace width="thickmathspace"></mml:mspace><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi mathvariant="normal">_</mml:mi><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace"></mml:mspace><mml:mi>K</mml:mi><mml:mi>e</mml:mi><mml:mi>y</mml:mi><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<p>where <inline-formula id="ieqn-2">
<alternatives><inline-graphic xlink:href="ieqn-2.png"/>
<mml:math id="mml-ieqn-2"><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi mathvariant="normal">_</mml:mi><mml:mi>X</mml:mi></mml:math>
</alternatives></inline-formula> denotes the security algorithm type of, <italic>Data</italic> denotes the data size in bytes, and <italic>Key</italic> denotes the key data in bytes.</p>
<p><disp-formula id="eqn-3">
<label>(2)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-3.png"/>
<mml:math id="mml-eqn-3" display="block"><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi mathvariant="normal">_</mml:mi><mml:mi>T</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mo>&#x003D;</mml:mo><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>D</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">_</mml:mi><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>z</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</alternatives></disp-formula></p>
<p><disp-formula id="eqn-4">
<label>(3)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-4.png"/>
<mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">p</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi mathvariant="normal">B</mml:mi><mml:mi mathvariant="normal">y</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</alternatives></disp-formula></p>
<p>In <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>, <inline-formula id="ieqn-3">
<alternatives><inline-graphic xlink:href="ieqn-3.png"/>
<mml:math id="mml-ieqn-3"><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi mathvariant="normal">_</mml:mi><mml:mi>T</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi></mml:math>
</alternatives></inline-formula> denotes the encryption time measured in s, <inline-formula id="ieqn-4">
<alternatives><inline-graphic xlink:href="ieqn-4.png"/>
<mml:math id="mml-ieqn-4"><mml:mi>D</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi mathvariant="normal">_</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>z</mml:mi><mml:mi>e</mml:mi></mml:math>
</alternatives></inline-formula> denotes the data size, and <italic>Speed</italic> denotes the ratio of the cycles-per-second to the cycles-per-bytes.</p>
<p>The encryption times of different block cipher algorithms for different data sizes are presented in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. The Blowfish algorithm&#x2019;s encryption time was shorter than those of the DES, AES, RC4, and Triple DES algorithms for all the data sizes.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Encryption time comparison</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr><th rowspan="2">Input size</th><th colspan="5">Execution time for encryption</th>
</tr>
<tr>
<th>3DES</th>
<th>RC4</th>
<th>AES</th>
<th>DES</th>
<th>BF</th>
</tr>
</thead>
<tbody>
<tr>
<td>20 KB</td>
<td>5</td>
<td>4</td>
<td>3</td>
<td>1</td>
<td>1</td>
</tr>
<tr>
<td>40 KB</td>
<td>10</td>
<td>8</td>
<td>5</td>
<td>3</td>
<td>2</td>
</tr>
<tr>
<td>60 KB</td>
<td>18</td>
<td>12</td>
<td>8</td>
<td>5</td>
<td>4</td>
</tr>
<tr>
<td>80 KB</td>
<td>20</td>
<td>16</td>
<td>11</td>
<td>8</td>
<td>6</td>
</tr>
<tr>
<td>100 KB</td>
<td>25</td>
<td>20</td>
<td>14</td>
<td>10</td>
<td>8</td>
</tr>
</tbody>
</table></table-wrap>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Encryption time comparisons of block cipher algorithms</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-4.png"/>
</fig>
<p>The decryption times of different are compared in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>, where it can be seen that the Blowfish algorithm had a shorter decryption time than the DES, AES, RC4, and Triple DES algorithms for all data sizes shows in <xref ref-type="table" rid="table-4">Tab. 4</xref>.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Decryption time comparison</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr><th rowspan="2">Input size</th><th colspan="5">Execution time for encryption</th>
</tr>
<tr>
<th>3DES</th>
<th>RC4</th>
<th>AES</th>
<th>DES</th>
<th>BF</th>
</tr>
</thead>
<tbody>
<tr>
<td>20 KB</td>
<td>4</td>
<td>2</td>
<td>3</td>
<td>2</td>
<td>2</td>
</tr>
<tr>
<td>40 KB</td>
<td>9</td>
<td>9</td>
<td>7</td>
<td>4</td>
<td>3</td>
</tr>
<tr>
<td>60 KB</td>
<td>16</td>
<td>14</td>
<td>9</td>
<td>7</td>
<td>3</td>
</tr>
<tr>
<td>80 KB</td>
<td>19</td>
<td>17</td>
<td>9</td>
<td>9</td>
<td>7</td>
</tr>
<tr>
<td>100 KB</td>
<td>29</td>
<td>17</td>
<td>15</td>
<td>11</td>
<td>9</td>
</tr>
</tbody>
</table></table-wrap>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Decryption time comparisons of block cipher algorithms</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-5.png"/>
</fig>
<p>The time required to encrypt data of various using the Blowfish algorithm was comparatively shorter than those of the DES, AES, RC4, and Triple DES algorithms. Therefore, the Blowfish algorithm was identified as a better solution for the proposed secured data transmission model. The experiment confirms that the Blowfish algorithm can perform complex encryption operations, such as key whitening, applying <italic>S</italic>-box, <italic>EXOR</italic> with the <italic>F</italic> function, and output swapping, in less time than the other algorithms. Thus, the Blowfish algorithm represents an energy-efficient algorithm for secure data transmission.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>This paper presents an energy-efficient secure data transmission model and its components. The technical components, including the data access control mechanism and various private key cryptography algorithms, are compared to choose the optimal energy-efficient cryptography algorithm. The experiment was conducted using Java programming language, and it conducted encryption and decryption processes. In the experiments, the performances of the AES, DES, Triple DES, RC4, and Blowfish algorithms were compared in terms of the encryption and decryption times, which were calculated using the mathematical equations. The experiment results showed that the Blowfish algorithm was comparatively more energy efficient than the other private key cryptography algorithms. The Blowfish algorithm&#x2019;s strengths and merits were intense, and its complex mathematical functions took a relatively short time to encrypt and decrypt the data. The Blowfish algorithm performed better than all the other comparison algorithms for all the data sizes used in the experiment. Thus, the Blowfish algorithm is used for secure data transmission in the proposed energy-efficient secured data transmission model. In future, more cryptographic algorithms can be implemented for third party secure communications so that efficiency in multiway can be improved.</p>
</sec>
</body>
<back>
<ack>
<p>The authors would like to express their heartfelt thanks to the editors and anonymous referees for their most valuable comments and constructive suggestions, which led to significant improvements in the earlier version of this manuscript.</p>
</ack><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors extend their appreciation to the Deanship of Scientific research at Majmaah University for funding this work under Project No. (RGP-2019-26).</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>X.</given-names> 
<surname>Li</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Wang</surname></string-name>, <string-name>
<given-names>Z.</given-names> 
<surname>Yang</surname></string-name>, <string-name>
<given-names>L.</given-names> 
<surname>Yan</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Han</surname></string-name>
</person-group>, &#x201C;
<article-title>Energy-efficient and secure transmission scheme based on chaotic compressive sensing in underwater wireless sensor networks</article-title>,&#x201D; 
<source>Digital Signal Processing</source>, vol. 
<volume>81</volume>, pp. 
<fpage>129</fpage>&#x2013;
<lpage>137</lpage>, 
<year iso-8601-date="2018">2018</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>W. Y.</given-names> 
<surname>Alghamdi</surname></string-name>, <string-name>
<given-names>H.</given-names> 
<surname>Wu</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Salil</surname></string-name>
</person-group>, &#x201C;
<article-title>Reliable and secure end-to-end data aggregation using secret sharing in WSNs</article-title>,&#x201D; in <conf-name>2017 IEEE Wireless Communications and Networking Conference (WCNC)</conf-name>, San Francisco, CA, pp. 
<fpage>1</fpage>&#x2013;
<lpage>6</lpage>, 
<year iso-8601-date="2017">2017</year>. </mixed-citation>
</ref>
<ref id="ref-3">
<label>[3]</label><mixed-citation publication-type="book">
<person-group person-group-type="author"><string-name>
<given-names>R.</given-names> 
<surname>Pawar</surname></string-name> and <string-name>
<given-names>D. R.</given-names> 
<surname>Kalbande</surname></string-name>
</person-group>, &#x201C;<chapter-title>Elliptical curve cryptography based access control solution for IoT based WSN</chapter-title>,&#x201D; 
<source>Innovative Data Communication Technologies and Application. Lecture Notes on Data Engineering and Communications Technologies</source>, vol. 
<volume>46</volume>. 
<publisher-loc>Cham.</publisher-loc>: 
<publisher-name>Springer</publisher-name>, pp. 
<fpage>742</fpage>&#x2013;
<lpage>749</lpage>, 
<year iso-8601-date="2019">2019</year>.</mixed-citation>
</ref>
<ref id="ref-4">
<label>[4]</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>T.</given-names> 
<surname>Kurp</surname></string-name>, <string-name>
<given-names>R. X.</given-names> 
<surname>Gao</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Sah</surname></string-name>
</person-group>, &#x201C;
<article-title>An adaptive sampling scheme for improved energy utilization in wireless sensor networks</article-title>,&#x201D; in <conf-name>2010 IEEE Instrumentation &#x0026; Measurement Technology Conf. Proc.</conf-name>, 
<publisher-loc>Austin, TX</publisher-loc>, pp. 
<fpage>93</fpage>&#x2013;
<lpage>98</lpage>, 
<year iso-8601-date="2010">2010</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>Yu</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Ren</surname></string-name> and <string-name>
<given-names>W.</given-names> 
<surname>Lou</surname></string-name>
</person-group>, &#x201C;
<article-title>FDAC: Toward fine-grained distributed data access control in wireless sensor networks</article-title>,&#x201D; 
<source>IEEE Transactions on Parallel and Distributed Systems</source>, vol. 
<volume>22</volume>, no. 
<issue>4</issue>, pp. 
<fpage>673</fpage>&#x2013;
<lpage>686</lpage>, 
<year iso-8601-date="2011">2011</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>J.</given-names> 
<surname>Duan</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Deyun and Hongke</surname></string-name>
</person-group>, &#x201C;
<article-title>TC-BAC: A trust and centrality degree-based access control model in wireless sensor networks</article-title>,&#x201D; 
<source>Ad Hoc Networks</source>, vol. 
<volume>11</volume>, no. 
<issue>8</issue>, pp. 
<fpage>2675</fpage>&#x2013;
<lpage>2692</lpage>, 
<year iso-8601-date="2013">2013</year>.</mixed-citation>
</ref>
<ref id="ref-7">
<label>[7]</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>F.</given-names> 
<surname>Ma</surname></string-name>, <string-name>
<given-names>M.</given-names> 
<surname>Yong</surname></string-name> and <string-name>
<given-names>M.</given-names> 
<surname>Fuchun and Ding</surname></string-name>
</person-group>, &#x201C;
<article-title>The fine-grained security access control of spatial data</article-title>,&#x201D; in <conf-name>2010 18th Int. Conf. on Geoinformatics</conf-name>, 
<publisher-loc>Beijing</publisher-loc>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>4</lpage>, 
<year iso-8601-date="2010">2010</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>Barbosa</surname></string-name>, <string-name>
<given-names>H.</given-names> 
<surname>Arthur</surname></string-name> and <string-name>
<given-names>F. L.</given-names> 
<surname>Mello</surname></string-name>
</person-group>, &#x201C;
<article-title>Machine learning applied to the recognition of cryptographic algorithms used for multimedia encryption</article-title>,&#x201D; 
<source>IEEE Latin America Transactions</source>, vol. 
<volume>15</volume>, no. 
<issue>7</issue>, pp. 
<fpage>1301</fpage>&#x2013;
<lpage>1305</lpage>, 
<year iso-8601-date="2017">2017</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>J.</given-names> 
<surname>Kim</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Nepal</surname></string-name>
</person-group>, &#x201C;
<article-title>A cryptographically enforced access control with a flexible user revocation on untrusted cloud storage</article-title>,&#x201D; 
<source>Data Science and Engineering</source>, vol. 
<volume>1</volume>, no. 
<issue>3</issue>, pp. 
<fpage>149</fpage>&#x2013;
<lpage>160</lpage>, 
<year iso-8601-date="2016">2016</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>M. K.</given-names> 
<surname>Venkateswarlu</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Kandasamy</surname></string-name> and <string-name>
<given-names>K.</given-names> 
<surname>Chandrasekaran</surname></string-name>
</person-group>, &#x201C;
<article-title>An energy-efficient clustering algorithm for edge-based wireless sensor networks</article-title>,&#x201D; 
<source>Procedia Computer Science</source>, vol. 
<volume>89</volume>, pp. 
<fpage>7</fpage>&#x2013;
<lpage>16</lpage>, 
<year iso-8601-date="2016">2016</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>M.</given-names> 
<surname>Upmanyu</surname></string-name>, <string-name>
<given-names>A. M.</given-names> 
<surname>Namboodiri</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Srinath</surname></string-name> and <string-name>
<given-names>C. V.</given-names> 
<surname>Jawahar</surname></string-name>
</person-group>, &#x201C;
<article-title>Blind authentication: A secure crypto-biometric verification protocol</article-title>,&#x201D; 
<source>IEEE Transactions on Information Forensics and Security</source>, vol. 
<volume>5</volume>, no. 
<issue>2</issue>, pp. 
<fpage>255</fpage>&#x2013;
<lpage>268</lpage>, 
<year iso-8601-date="2010">2010</year>.</mixed-citation>
</ref>
<ref id="ref-12">
<label>[12]</label><mixed-citation publication-type="book">
<person-group person-group-type="author"><string-name>
<given-names>Mu</given-names> 
<surname>Arvindhan</surname></string-name> and <string-name>
<surname>Anand</surname></string-name>
</person-group>, &#x201C;<chapter-title>The modern way for virtual machine placement and scalable technique for reduction of carbon in green combined cloud datacenter</chapter-title>,&#x201D; 
<source>Green Computing in Smart Cities: Simulation and Techniques</source>, <publisher-name>Springer International Publishing</publisher-name>, 
<year iso-8601-date="2020">2020</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>S.</given-names> 
<surname>Wei</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Wang</surname></string-name>, <string-name>
<given-names>R.</given-names> 
<surname>Yin</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Yuan</surname></string-name>
</person-group>, &#x201C;
<article-title>Trade-off between security and performance in block ciphered systems with erroneous ciphertexts</article-title>,&#x201D; 
<source>IEEE Transactions on Information Forensics &#x0026; Security</source>, vol. 
<volume>8</volume>, no. 
<issue>4</issue>, pp. 
<fpage>636</fpage>&#x2013;
<lpage>645</lpage>, 
<year iso-8601-date="2013">2013</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>O. A.</given-names> 
<surname>Saraereh</surname></string-name>, <string-name>
<given-names>I.</given-names> 
<surname>Khan</surname></string-name> and <string-name>
<given-names>B. M.</given-names> 
<surname>Lee</surname></string-name>
</person-group>, &#x201C;
<article-title>An efficient neighbor discovery scheme for mobile WSN</article-title>,&#x201D; 
<source>IEEE Access</source>, vol. 
<volume>7</volume>, pp. 
<fpage>4843</fpage>&#x2013;
<lpage>4855</lpage>, 
<year iso-8601-date="2019">2019</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>T.</given-names> 
<surname>Niknam</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Kavousifard</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Aghaei</surname></string-name>
</person-group>, &#x201C;
<article-title>Scenario-based multiobjective distribution feeder reconfiguration considering wind power using adaptive modified particle swarm optimisation</article-title>,&#x201D; 
<source>IET Renewable Power Generation</source>, vol. 
<volume>6</volume>, no. 
<issue>4</issue>, pp. 
<fpage>236</fpage>&#x2013;
<lpage>247</lpage>, 
<year iso-8601-date="2012">2012</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>Q.</given-names> 
<surname>Yang</surname></string-name>, <string-name>
<given-names>X.</given-names> 
<surname>Zhu</surname></string-name>, <string-name>
<given-names>H.</given-names> 
<surname>Fu</surname></string-name> and <string-name>
<given-names>X.</given-names> 
<surname>Che</surname></string-name>
</person-group>, &#x201C;
<article-title>Survey of security technologies on wireless sensor networks</article-title>,&#x201D; 
<source>Journal of Sensors</source>, vol. 
<volume>2015</volume>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>9</lpage>, 
<year iso-8601-date="2015">2015</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>Y. S.</given-names> 
<surname>Khiabani</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Wei</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Yuan</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>Enhancement of secrecy of block ciphered systems by deliberate noise</article-title>,&#x201D; 
<source>IEEE Transactions on Information Forensics &#x0026; Security</source>, vol. 
<volume>7</volume>, no. 
<issue>5</issue>, pp. 
<fpage>1604</fpage>&#x2013;
<lpage>1613</lpage>, 
<year iso-8601-date="2012">2012</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>A.</given-names> 
<surname>Ostad</surname></string-name>, <string-name>
<given-names>H.</given-names> 
<surname>Arshad</surname></string-name>, <string-name>
<given-names>M.</given-names> 
<surname>Nikooghadam</surname></string-name> and <string-name>
<given-names>D.</given-names> 
<surname>Abbasinezhad-Mood</surname></string-name>
</person-group>, &#x201C;
<article-title>Three party secure data transmission in IoT networks through design of a lightweight authenticated key agreement scheme</article-title>,&#x201D; 
<source>Future Generation Computer Systems</source>, vol. 
<volume>100</volume>, pp. 
<fpage>882</fpage>&#x2013;
<lpage>892</lpage>, 
<year iso-8601-date="2019">2019</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>A.</given-names> 
<surname>Kaswan</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Nitesh</surname></string-name> and <string-name>
<given-names>P. K.</given-names> 
<surname>Jana</surname></string-name>
</person-group>, &#x201C;
<article-title>Energy efficient path selection for mobile sink and data gathering in wireless sensor networks</article-title>,&#x201D; 
<source>AEU-International Journal of Electronics and Communications</source>, vol. 
<volume>73</volume>, pp. 
<fpage>110</fpage>&#x2013;
<lpage>118</lpage>, 
<year iso-8601-date="2017">2017</year>.</mixed-citation>
</ref>
<ref id="ref-20">
<label>[20]</label><mixed-citation publication-type="book">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Bhushan</surname></string-name>, <string-name>
<given-names>A. K.</given-names> 
<surname>Singh</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Vij</surname></string-name>
</person-group>, &#x201C;<chapter-title>Comparative study and analysis of wireless mesh networks on AODV and DSR</chapter-title>,&#x201D; in 
<source>4th Int. Conf. on Internet of Things: Smart Innovation and Usages (IoT-SIU)</source>, 
<publisher-loc>Ghaziabad, India</publisher-loc>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>6</lpage>, 
<year iso-8601-date="2019">2019</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>M.</given-names> 
<surname>Suresh</surname></string-name> and <string-name>
<given-names>M.</given-names> 
<surname>Neema</surname></string-name>
</person-group>, &#x201C;
<article-title>Hardware implementation of blowfish algorithm for the secure data transmission in internet of things</article-title>,&#x201D; 
<source>Procedia Technology</source>, vol. 
<volume>25</volume>, pp. 
<fpage>248</fpage>&#x2013;
<lpage>255</lpage>, 
<year iso-8601-date="2016">2016</year>.</mixed-citation>
</ref>
</ref-list>
</back>
</article>