DOI:10.32604/cmc.2022.025773
| Computers, Materials & Continua DOI:10.32604/cmc.2022.025773 | |
| Article |
EACR-LEACH: Energy-Aware Cluster-based Routing Protocol for WSN Based IoT
1Department of Computer Science and Engineering, Sona College of Technology, Salem, 636005, India
2Department of Computer Science, College of Computer and Information Systems, Umm Al-Qura University, Makkah, 21955, Saudi Arabia
3Department of Technical Education, Department of Electronics Engineering, Institute of Engineering and Technology, Dr. A.P.J. Abdul Kalam Technical University, Lucknow, India
4Department of Information Technology, College of Computers and Information Technology, Taif University, Taif, 21944, Saudi Arabia
*Corresponding Author: Digvijay Pandey. Email: digit11011989@gmail.com
Received: 04 December 2021; Accepted: 17 January 2022
Abstract: Internet of Things (IoT) is a recent paradigm to improve human lifestyle. Nowadays, number devices are connected to the Internet drastically. Thus, the people can control and monitor the physical things in real-time without delay. The IoT plays a vital role in all kind of fields in our world such as agriculture, livestock, transport, and healthcare, grid system, connected home, elderly people carrying system, cypher physical system, retail, and intelligent systems. In IoT energy conservation is a challenging task, as the devices are made up of low-cost and low-power sensing devices and local processing. IoT networks have significant challenges in two areas: network lifespan and energy usage. Therefore, the clustering is a right choice to prolong the energy in the network. In LEACH clustering protocol, sometimes the same node acts as CH again and again probabilistically. To overcome these issues, this paper proposes the Energy-Aware Cluster-based Routing (EACR-LEACH) protocol in WSN based IoT. The Cluster Head (CH) selection is a crucial task in clustering protocol in WSN based IoT. In EACR-LEACH, the CH is selected by using the routing metrics, Residual Energy (RER), Number of Neighbors (NoN), Distance between Sensor Node and Sink (Distance) and Number of Time Node Act as CH (NTNACH). An extensive simulation is conducted on MATLAB 2019a. The accomplishment of EACR-LEACH is compared to LEACH and SE-LEACH. The proposed EACR-LEACH protocol extends the network's lifetime by 4%–8% and boosts throughput by 16%–24%.
Keywords: Cluster head; clustering protocol; internet of things; routing metrics; wireless sensor networks
The Internet of Things (IoT) is a collection of objects linked to the Internet that can share data from one to another [1–6]. Kevin Ashton coined the term “Internet of Things” in 1999. By 2025, it is projected that 30 billion devices will be connected to the Internet. The emerging trends in IoT are driven by Artificial Intelligence, Machine Learning, Blockchain, 5G, etc. The IoT applications are smart home, smart healthcare, precision agriculture, industrial automation, etc., [7–10].
Advancement in low-power wireless networking, the emergence of Complementary Metal-Oxide Semiconductor (CMOS) technology and miniaturized sensing devices paves the way for landscaping Wireless Sensor Network (WSN) [11–15]. It is a wirelessly interconnected device capable of sensing the physical phenomenon of the target region and can communicate through wireless links. The exciting features of sensor devices address the gap between physical events and the digital world. Sensors placed in WSN sense the environment collects data, processes them, and delivers the aggregated data towards the sink [16–20]. The reference architecture of a wireless sensor network is shown in Fig. 1.
Figure 1: Reference architecture of wsn
The significant and tiny physical entity of WSN is a Sensor Node (SN). Irrespective of their types, each sensor is comprised of four basic units, namely Sensing Unit (SU), Microcontroller Unit (MU), Communication Unit (CU) and Power supply Unit (PU) [21–28]. SU is responsible for sensing the target area and converts the analog data from the field into digital form using an ADC converter. The processing element of the sensor node includes a microcontroller and memory unit, which carry out data manipulation and storage of processed information. CU consists of communication resources, more often restricted radio range and a small battery in PU furnishes the power to the whole SN unit [29–31].
WSN comprises two types: Distributed Network (DN) and Clustered Network (CN) based on node communication. In DN, SN behaves autonomously and are interconnected with each other for forwarding their data to sink. It does not require a monitoring node, and each node can analyse the data it receives before passing it on to its neighbor. Nodes closer to the sink may drain their energy quickly due to bottleneck problems [32–34]. In CN, the sensor node forms the cluster based on their communication range. In each cluster, any node will act as a Cluster Head (CH) responsible for forwarding the aggregated data from the sensor field to the sink node. In general, sensor nodes in each cluster are connected with CH through a single hop. CH can communicate with each other to share the information from the base station. CN can be divided into Hierarchical CN (HCN) and Distributed CN (DCN) based on how CHs are in touch with the sink node. In HCN, CHs form a hierarchy, and the CH, which is in the top-level hierarchy, will have direct contact with the sink, whereas, in DCN, CH can send the data to its neighbor CH and then processed and forwarded further towards its sink [35–38].
Sinks are essential in WSN because they allow communication between the end-user and the sensor field. It has high energy and processing ability. The sink acts as an access point to gather the sensory data from the target area, process them, and convert them as helpful information to the end-user control system through the Internet and wireless network.
The Internet of Things (IoT) is a platform in which things with sensors, transducers, and processors connect significantly. The WSN innovation is an essential element of IoT since it comprises several sensor devices interacting with the actual world via communication networks. Due to the boundless intervention of sensors in almost all sectors, the applications of WSN are growing every day. Nevertheless, contemporary works deemed WSN applications are entitled IoT applications without differentiating the new aspects characterizing this term.
The diverse variety, Inexpensive and Ad-hoc nature of sensors creates more attention in launching WSN in remote areas where the wired communication is not possible easily. They can be supervised by the users for making a timely decision. In particular, the convergence of WSNs and the IoT enables a ubiquitous interaction of things that have enormous applications both in private and public domains. Especially in a hostile environment like dense forest and chemical industry, significant applications such as forest fire detection, animal tracking system environmental pollution monitoring, industrial control systems and landslide prediction, unmanned battlefield monitoring, video camera surveillance in crowd areas, natural disaster rescue, smart agriculture, smart cities, health monitoring and other business applications were created.
Nodes in a WSN-based IoT are tiny, inexpensive, and energy-efficient, allowing for efficient data transmission. Once dispersed throughout the monitoring region, energy-constrained batteries in sensors become difficult to recharge. In comparison with sensing and computing stages, WSN uses a lot of energy during data transmission. Network life is the biggest problem, and hence adequate routing for early transmission is essential. Since the network's lifetime remains an important need to extend the network functionality, the routing protocol must efficiently use the power because of the implementation of WSN with small energy sensor nodes.
The whole topology of the WSN is divided into sub-regions via the technique known as clustering, enabling efficient transmission of data and the extension of network life. As energy efficiency is an essential part of network life, clustering is more critical. The clusters are the structured WSN units. Furthermore, the extensive structure of the networks is divided into clusters to facilitate the task of communication. In general, each cluster comprises CH, which gathers recently observed data inside the cluster through the member nodes and returns the aggregated data to the BS. Nodes can forward their sensed data to CH, known as intra-cluster routing, whereas CHs can forward the aggregated data towards the sink known as inter-cluster routing. If SN must minimize its power use, its data packets should first be sent to CH's rather than sent to the sink promptly.
In WSNs, single- or multi-hop communication is used to collect and forward data to the base station via a routing mechanism. To ensure longer network life and decrease energy depletion for the WSN, the cluster head role alternates between each member of a group. LEACH is a well-accepted protocol in WSN to facilitate network lifetime enhancement via clustering the network for data collection [39–42]. The two main procedures involved in increasing network life are Clustering and Sleep Scheduling.
The WSN based application follows the single hop or multi-hop data transmission in routing. Some applications like environmental monitoring, temperature monitoring and nuclear power plant monitoring are not necessary to send individual sensors and that may create duplicate data. Therefore, cluster-based routing is one of the active research areas in WSN and IoT. From the literature review, the development of a cluster-based routing protocol decreases the delay, increases the network's lifetime, and increases the throughput. These are strong motivational points to select the LEACH as the standard baseline protocol. However, LEACH is a standard clustering protocol existed with specific problematic issues as follows:
• LEACH makes no attempt to address the sensor node's location or the number of cluster heads in the network.
• Direct communication of CH with BS may drain the energy quickly if the distance between them is too high.
• CH's battery degraded more rapidly than others due to the high energy required for data transmission and fusion.
• The head of the cluster is constantly on and if CH is destroyed the no use of gathered data within the clusters and it will not be communicated to BS in any means.
• Without optimal and energy consciousness choice of cluster head (CH) exhibiting the loss of energy between sensor nodes.
To overcome all of the LEACH protocol's restrictions, this paper proposes EACR - LEACH as a way to extend the network's lifetime. During the CH selection process, it takes into account the factors NoN, RER, distance, and NTNACH.
The authors key contribution in EACR-LEACH as follows:
• An extensive literature review conducted that it discusses various LEACH protocols, advantages, accomplishments and limitations.
• In EACR-LEACH protocol, the authors introduces new metric, namely Number of Time Node Act as CH (NTNACH) to extend the network's lifetime.
• The simulation results indicate that the proposed EACR-LEACH enhances network performance in terms of network lifespan, packet delivery ratio and throughput.
• Design and development of EACR-LEACH for choosing the right CH to increase the network lifetime and packet delivery ratio.
• The simulation is conducted using MATLAB 2019a, and the effectiveness of EACR-LEACH is compared to that of two other clustering protocols, LEACH and SA-LEACH.
The remainder of the paper is structured as follows: Section 2 addresses the related work. Section 3 discusses the system preliminaries. Section 4 presents the EACR-LEACH protocol. Section5 discusses and compares the proposed with respect to the existing protocol. Section 6 concludes the paper and discusses the future work.
This section provides a detailed discussion of various energy-aware LEACH protocols in WSN based IoT. Furthermore, these works address the problem, techniques, accomplishments, and limitations.
Mehra et al. [43] proposed SE-LEACH which considers number of nodes, distance from BS, remaining energy and power dissipation are the parameters to select cluster head efficiently. In two different scenarios the simulation experimentation conducted by placing the BS at the center and in some far distance from the clusters. Though it uses network load balancing, CH election does not include the number of times the node was elected CH and includes the process of calculating its rank.
Salem et al. [44] presented an Enhanced LEACH protocol for extending the lifespan of wireless sensor networks. The CH selection is made on the basis of the distances between each node and the CH and the BS. It is not involved on how close the non CH nodes with CH. Simulation work is carried out on the proposed extended LEACH with original LEACH. It extends the traditional LEACH with the new approach in CH selection but failed to include the residual energy of a node, mobility of a node and power dissemination.
Baniata et al. [45] proposed a novel MIMO-HC protocol for IoT. In MIMO-HC, Sub-optimal rout generated between cluster heads proportional to their range to the central station is in operation. The MIMO-HC attains minimum power utilization and improved system duration contrast to its counterpart approaches. This is accomplished by the energy consumption of CH in MIMO-HC protocol is 40% reduced than UN-LEACH. However, this protocol only considers the RER of a node and ignores the transmission distance between nodes. The more calculation for sub-optimal cluster maintenance even destroys energy of the network.
Ouldzira et al. [46] proposed MG-LEACH, which utilises an intermediary CH to transfer the data packets from CM to Sink. In MG-LEACH, BS divides the nodes into subgroups during the placement of node in the field. To conserve energy, node groups are allowed to work alternatively. However if all the nodes in one subgroup is poor in energy and will not satisfy the energy threshold condition leads to regrouping that is not addressed in MG-LEACH.
Kumar et al. [47] proposed an MM-LEACH protocol that addresses the varying node density in each cluster by fixing the average N nodes in each CH to better load balancing in the network and maintain a good network lifetime. N is computed by dividing the total number of nodes by the total number of CH. While selecting the CH, only the energy threshold is taken into account but not feasible solution for many situations like scalability and load balancing the networks. BS's intervention causes an overhead in cluster formation.
Behera et al. [48] proposed modified LEACH for IoT application. It uses the threshold value during the CH election in the network nodes. Thus, conserve the energy among nodes uniformly in the network. The accomplishment of modified LEACH is compared with standard original LEACH. Therefore, it enhances the lifespan of the network. However, the nodes drain the energy after certain rounds during the data exchange.
Gou et al. [49] proposed an Energy-Efficient Clustering Routing (EECR) in WSN. The EECR is an improved version of the LEACH protocol. It has two stages such as clustering and data transmission stage. The clustering stage considers four parameters, namely residual energy, number of CH, base station distance, round number that nodes are selected as CH. Later, the data transmission stage is used the free space or multipath model to exchange the data from CH to the sink. The simulation is conducted using the MATLAB simulator. The performance of the proposed EECR algorithm is compared with LEACH, LEACH-C and HEED. However, It is not suitable for large scale because the CH is selected randomly.
KMO Nahar et al. [50] proposed a modified probability function for cluster head election in LEACH (MPF-LEACH) protocol. The primary aim is to select the CH using residual energy to prolong the lifespan of the network. This paper is introduced the threshold value, which is based on the probability value. The enhancement is mainly focused on extending the lifespan of the network and increases the throughput. The main objective of this method provides the maximum probability value to elect CH, the node which has more residual energy. The simulation is conducted using the MATLAB simulator. The performance of the proposed MPF-LEACH is compared with LEACH. Thus, the proposed MPF-LEACH is extended the lifespan of the network than LEACH. However, the threshold functions prohibit CH re-election for any sensor considered to be low on energy.
Hnini et al. [51] proposed Improved W-LEACH Decentralized protocol in WSN. This paper is proposed the game theory concept in W-LEACH protocol to choose appropriate CH. The simulation is conducted using MATLAB simulator. The efficacy of W-LEACH with game theory is compared to W-LEACH and LEACH. The proposed W-LEACH with game theory is extended the lifetime the network and throughput. However, it is depleted the energy after certain rounds.
Various LEACH protocols are discussed to prolong the lifespan of the network. From the literature review, we observed the limitations are follows: some of the protocols are not considered the important routing metrics like residual energy, distance, etc, probability based CH selection causes early depletion the network nodes and it supports the small network area due to the coverage the sink. Hence, the network nodes drain the battery earlier in the network. To increase the network performance, this paper proposes an EACR-LEACH in WSN based IoT. Thus, EACR-LEACH extends the overall network performances in terms of network lifetime and packet delivery ratio.
The network nodes are highly resource constrained. We consider that there are ‘N’ nodes and one sink in the network. The nodes are distributed at random, while the sink is located at the network's center [52,53]. Initially, the proposed EACR-LEACH selects the right CH among the network nodes using the network parameters, namely RER, NoN, Distance and NTNACH. Later, the CH gathers the data and aggregated data transfers to the sink. Fig. 2 illustrates the EACR-LEACH network model.
Figure 2: : EACR-LEACH network model
The EACR-LEACH is considered the following assumption.
• Nodes are placed randomly and sink node placed at the center.
• All the nodes have equal energy.
• It supports the single hop data transmission between CH and Sink.
The EACR-LEACH is adopted the simplified channel model for transferring the data from the source to sink [52]. Fig. 3 illustrates the EACR-LEACH energy model.
Figure 3: EACR-LEACH energy model
The amount of energy required to carry x bits from node m to node n is proportional to the distance y, and the formula for calculating this amount of energy is provided in Eq. (1).
The threshold value of the distance Y0 is computed from Eq. (2).
The quantity of energy consumes to receive x bits from the node m and its calculation is given Eq. (3).
4 The Proposed Energy Aware Cluster Routing (EACR-LEACH)
The proposed EACR-LEACH protocol is designed to mimic the behaviour of the LEACH protocol. It is divided into two phases: the setup phase and the steady phase. In general, the LEACH picks the CH on the basis of a random number between 0 and 1, with the higher value being preferred. The sensor node will behave as CH if the random number is less than or equal to the threshold. The threshold Thres(node_id) value is calculated and it is given in Eq. (4).
where
This process is carried out until CH is selected in the network. After CH selection, the CH broadcasts the message to the neighbour node. The CH's forms the cluster based on the CM's response. Finally, the CH sends the aggregated data to the sink.
In EACR-LEACH, the CH selection is based on the Objective Function (OF). The OF is a function that used to provide the maximum profit based on the conditions. In EACR-LEACH, the OF considers the metrics, namely RER, NoN, Distance and NTNACH.
RER indicates the amount of available energy in the network nodes and its calculation is given in Eq. (5).
where i indicates the node id,
4.1.2 Number of Neighbours (NoN)
The NoN indicates the number of neighbour's is located near by the node. The node i is calculated the NoN and it is given in Eq. (6).
The distance is a metric that indicate the distance between CH and the sink in the network. The distance is calculated and it is given in Eq. (7).
4.1.4 Number of Time Node Act as CH (NTNACH)
The NTNACH is a metric that indicates the ration between how many times the particular node acted as CH among total number of nodes in the network. The node i is calculated the NTNACH and it is given Eq. (8).
The Objective Function (OF) helps to find a maximization or minimization solution. The OF is calculated based on the routing metrics, RER, NoN, Distance and NTNACH. In EACR-LEACH, the metrics RER and NoN are Maximization property and Distance, NTNACH are minimization property. Therefore, we are considered that all the metrics are minimization property. The EACR-LEACH protocol selects the minimal OF value contained node is elected as CH. We have conducted the simulation several time and varied the weight values among all the metrics. Finally, the weight values
The mechanism of EACR-LEACH protocol is given in Algorithm 1.
The work flow of EACR-LEACH protocol is shown in Fig. 4.
Figure 4: Work flow of EACR-LEACH
The efficacy of the proposed EACR-LEACH protocol is compared with LEACH and SE-LEACH. The simulation is conducted using MATLAB 2019a. We have taken the total number of nodes are 100 and one sink deployed over the network region of 100 m×100 m. The Sink is placed at the position of (50 m, 50 m). The optimal number of CH percentage is 10%. The node's initial energy is 0.5Joule. The maximum number of round is 2500. The packet size is 4000bits. The simulation parameter and default value is given in Tab. 1.
5.1 Average Number of Dead Nodes
It indicates the number of nodes drained or died up to the current round. Fig. 5 illustrates the number of dead nodes with respect to the number of rounds. It is observed that the node starts to die in EACR-LEACH is slower than LEACH and SE-LEACH. In addition, it is noted that the number of nodes dead in LEACH, SE-LEACH and EACR-LEACH is 100, 98 and 95 respectively, for the network round of 2000. Thus, the number of nodes dies in EACR-LEACH is slowly compared than LEACH and SE-LEACH. The reason is that the metrics of RER, Distances, NoN, and NTNACH, are considered.
Figure 5: Number of dead node vs. number of rounds
Tab. 2 shows number of dead nodes with respect to the number of rounds. It is observed that the node starts to die in EACR-LEACH is slower than LEACH and SE-LEACH. Thus, the number of nodes dies in EACR-LEACH is slowly compared than LEACH and SE-LEACH. The reason is that the metrics of RER, Distances, NoN, and NTNACH, are considered.
The network lifetime completely depends on the operations such sensing, transmitting, receiving and aggregation. If the network nodes consume more energy in each round, the lifetime of networks drain early. Fig. 6 illustrates the average residual energy or average network energy concerning number of rounds. It is observed that average residual in LEACH, SE-LEACH and EACR-LEACH is 2, 5 and 10 J respectively, for the 2000th round. It is noted that the proposed EACR-LEACH consumes 5% lesser than SE-LEACH and 10% lesser than LEACH. It's because the CH selection parameter, particularly NTNACH, is taken into account. As a result, the battery slowly depletes.
Figure 6: Average residual energy vs. number of rounds
Tab. 3 illustrates the average residual energy or average network energy concerning number of rounds. It is noted that the proposed EACR-LEACH consumes 5% lesser than SE-LEACH and 10% lesser than LEACH. It's because the CH selection parameter, particularly NTNACH, is taken into account. As a result, the battery slowly depletes.
It shows how many data packets the sink has successfully received from nodes. Fig. 7 illustrates the number of packets sent to the sink in terms of rounds. It is observed that number of packets sent to the sink in LEACH, SE-LEACH and EACR-LEACH is 10000, 11500 and 13000 respectively for the 2500th round. It is noted that number of packets sent in EACR-LEACH increases by 16% and 24% respectively compared to SE-LEACH and LEACH. It's because the CH selection parameter, particularly NTNACH, is taken into account. Thus, it increases the number of packets between the participant and the sink.
Figure 7: Number of packet sent to the sink vs. number of rounds
Tab. 4 illustrates the number of packets sent to the sink in terms of rounds. It is noted that number of packets sent in EACR-LEACH increases by 16% and 24% respectively compared to SE-LEACH and LEACH.
In Internet of Things (IoT), energy conservation is a challenging task, as the devices are made up of low-cost and low-power sensing devices and local processing. This paper proposed the Energy-Aware Cluster-based Routing (EACR-LEACH) protocol in WSN based IoT. The Cluster Head (CH) selection is a crucial task in clustering protocol. In EACR-LEACH, the CH is selected by using the routing metrics, Residual Energy (RER), Number of Neighbors (NoN), Distance between Sensor Node and Sink (Distance) and Number of Time Node Act as CH(NTNACH). The simulation is conducted on MATLAB 2019a. The accomplishment of EACR-LEACH is compared to LEACH and SE-LEACH. The proposed EACR-LEACH network lifespan is increased by 4–8%, while throughput is increased by 16–24%.
In the future, we would like to deploy the EACR-LEACH protocol in real-time and include the appropriate routing metrics to strengthen data security when transferring data from cluster member to base station. Finally, the performance of EACR-LEACH is compared to LEACH and SE-LEACH.
Acknowledgement: We deeply acknowledge Taif University for supporting this study through Taif University Researchers Supporting Project Number (TURSP-2020/313), Taif University, Taif, Saudi Arabia.
Funding Statement: This research is funded by Taif University, TURSP-2020/313.
Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.
1. S. Sennan, S. Ramasubbareddy, S. Balasubramaniyam, A. Nayyar, M. Abouhawwash et al., “T2FL-PSO: Type-2 fuzzy logic-based particle swarm optimization algorithm used to maximize the lifetime of internet of things,” IEEE Access, vol. 9, no. 1, pp. 63966–63979, 2021. [Google Scholar]
2. S. Venkataramana, B. V. D. S. Sekhar, V. S. Raju, V. V. S. S. S. Chakravarthy and G. Srinivas, “An experimental analysis of secure-energy trade-off using optimized routing protocol in modern-secure-WSN,” EAI Endorsed Transactions on Scalable Information Systems, vol. 7, no. 26, pp. 1–7, 2020. [Google Scholar]
3. M. Mittal and C. Iwendi, “A survey on energy-aware wireless sensor routing protocols,” EAI Endorsed Transactions on Energy Web, vol. 6, no. 24, pp. 1–16, 2019. [Google Scholar]
4. S. Sankar, R. Somula, R. L. Kumar, P. Srinivasan and M. A. Jayanthi, “Trust-aware routing framework for internet of things,” International Journal of Knowledge and Systems Science, vol. 12, no. 1, pp. 48–59, 2021. [Google Scholar]
5. S. Sankar, P. Srinivasan, A. K. Luhach, R. Somula and N. Chilamkurti, “Energy-aware grid-based data aggregation scheme in routing protocol for agricultural internet of things,” Sustainable Computing: Informatics and Systems, vol. 28, no. 1, pp. 100422, 2020. [Google Scholar]
6. A. S. Toor and A. K. Jain, “Energy aware cluster based multi-hop energy efficient routing protocol using multiple mobile nodes (MEACBM) in wireless sensor networks,“ AEU-International Journal of Electronics and Communications, vol. 102, no. 1, pp. 41–53, 2019. [Google Scholar]
7. S. Sennan, R. Somula, A. K. Luhach, G. G. Deverajan, W. Alnumay et al., “Energy efficient optimal parent selection based routing protocol for internet of things using firefly optimization algorithm,” Transactions on Emerging Telecommunications Technologies, vol. e4171, no. 1, pp. 1–15, 2020. [Google Scholar]
8. G. Ravi and K. R. Kashwan, “A new routing protocol for energy efficient mobile applications for ad hoc networks,” Computers & Electrical Engineering, vol. 48, no. 1, pp. 77–85, 2015. [Google Scholar]
9. S. Sennan, S. Ramasubbareddy, A. K. Luhach, A. Nayyar and B. Qureshi, “CT-RPL: Cluster tree based routing protocol to maximize the lifetime of internet of things,” Sensors, vol. 20, no. 20, pp. 5858–5876, 2020. [Google Scholar]
10. X. He, M. Niedermeier and H. De Meer, “Dynamic key management in wireless sensor networks: A survey,” Journal of Network and Computer Applications, vol. 36, no. 2, pp. 611–622, 2013. [Google Scholar]
11. G. Kirubasri, “A contemporary survey on clustering techniques for wireless sensor networks,” Turkish Journal of Computer and Mathematics Education (TURCOMAT), vol. 12, no. 11, pp. 5917–5927, 2021. [Google Scholar]
12. G. Kirubasri, N. U. Maheswari and R. Venkatesh, “Novel energy efficient predictive link quality based reliable routing for wireless multimedia bio-sensor networks in bio-medical invention research and bionic utilities monitoring application,” International Journal of Biomedical Engineering and Technology, vol. 26, no. 3, pp. 219–236, 2018. [Google Scholar]
13. G. Kirubasri, “Energy efficient routing using machine learning based link quality estimation for wmsns,” Turkish Journal of Computer and Mathematics Education (TURCOMAT), vol. 12, no. 11, pp. 3767–3775, 2021. [Google Scholar]
14. M. S. Yousefpoor and H. Barati, “DSKMS: A dynamic smart key management system based on fuzzy logic in wireless sensor networks, “ Wireless Networks, vol. 26, no. 4, pp. 2515–2535, 2020. [Google Scholar]
15. Y. Alotaibi and A. F. Subahi, “New goal-oriented requirements extraction framework for e-health services: A case study of diagnostic testing during the COVID-19 outbreak,” Business Process Management Journal, 2021. [Google Scholar]
16. A. F. Subahi, Y. Alotaibi, O. I. Khalaf and F. Ajesh, “Packet drop battling mechanism for energy aware detection in wireless networks,” Computers, Materials and Continua, vol. 66, no. 2, pp. 2077–2086, 2020. [Google Scholar]
17. A. Alsufyani, Y. Alotaibi, A. O. Almagrabi, S. A. Alghamdi and N. Alsufyani, “Optimized intelligent data management framework for a cyber-physical system for computational applications,” Complex & Intelligent Systems, vol. 398, no. 1, pp. 1–13, 2021. [Google Scholar]
18. N. Veeraiah, O. I. Khalaf, C. V. P. R. Prasad, Y. Alotaibi, A. Alsufyani et al., “Trust aware secure energy efficient hybrid protocol for manet,” IEEE Access, vol. 9, no. 1, pp. 120996–121005, 2021. [Google Scholar]
19. S. Bharany, S. Sharma, S. Badotra, O. I. Khalaf, Y. Alotaibi et al.., “Energy-efficient clustering scheme for flying ad-hoc networks using an optimized leach protocol,” Energies, vol. 14, no. 19, pp. 1–20, 2021. [Google Scholar]
20. Y. Alotaibi, M. N. Malik, H. H. Khan, A. Batool, S. U. Islam et al., “ “Suggestion mining from opinionated text of big social media data,” Computers, Materials and Continua, vol. 68, no. 3, pp. 3323–3338, 2021. [Google Scholar]
21. S. Palanisamy, B. Thangaraju, O. I. Khalaf, Y. Alotaibi, S. Alghamdi et al., “A novel approach of design and analysis of a hexagonal fractal antenna array (HFAA) for next-generation wireless communication,” Energies, vol. 14, no. 19, pp. 6204, 2021. [Google Scholar]
22. R. Rout, P. Parida, Y. Alotaibi, S. Alghamdi and O. I. Khalaf, “Skin lesion extraction using multiscale morphological local variance reconstruction based watershed transform and fast fuzzy c-means clustering,” Symmetry, vol. 13, no. 11, pp. 2085, 2021. [Google Scholar]
23. S. Palanisamy, B. Thangaraju, O. I. Khalaf, Y. Alotaibi and S. Alghamdi, “Design and synthesis of multi-mode bandpass filter for wireless applications,” Electronics, vol. 10, no. 22, pp. 2853–2869, 2021. [Google Scholar]
24. G. Li, F. Liu, A. Sharma, O. I. Khalaf, Y. Alotaibi et al.., “Research on the natural language recognition method based on cluster analysis using neural network,” Mathematical Problems in Engineering, vol. 2021, no. 1, pp. 1–13, 2021. [Google Scholar]
25. G. Suryanarayana, K. Chandran, O. I. Khalaf, Y. Alotaibi, A. Alsufyani et al., “Accurate magnetic resonance image super-resolution using deep networks and Gaussian filtering in the stationary wavelet domain,” IEEE Access, vol. 9, no. 1, pp. 71406–71417, 2021. [Google Scholar]
26. Y. Alotaibi, “A new secured e-government efficiency model for sustainable services provision,” Journal of Information Security and Cybercrimes Research, vol. 3, no. 1, pp. 75–96, 2021. [Google Scholar]
27. Y. Alotaibi, “A new database intrusion detection approach based on hybrid meta-heuristics,” Computers Materials & Continua, vol. 66, no. 2, pp. 1879–1895, 2021. [Google Scholar]
28. N. Jha, D. Prashar, O. I. Khalaf, Y. Alotaibi and A. Alsufyani, “Blockchain based crop insurance: A decentralized insurance system for modernization of Indian farmers,” Sustainability, vol. 13, no. 16, pp. 1–17, 2021. [Google Scholar]
29. D. Kandris, C. Nakas, D. Vomvas and G. Koulouras, “Applications of wireless sensor networks: An up-to-date survey,” Applied System Innovation, vol. 3, no. 1, pp. 14–28. 2020. [Google Scholar]
30. S. Sennan, S. Ramasubbareddy, S. Balasubramaniyam, A. Nayyar, C. A. Kerrache et al., “MADCR: Mobility aware dynamic clustering-based routing protocol in internet of vehicles,” China Communications, vol. 18, no. 7, pp. 69–85, 2021. [Google Scholar]
31. S. Sankar, R. Somula, R. L. Kumar, P. Srinivasan and M. A. Jayanthi, “Trust-aware routing framework for internet of things,” International Journal of Knowledge and Systems Science (IJKSS), vol. 12, no. 1, pp. 48–59, 2021. [Google Scholar]
32. M. Eltoweissy, M. Moharrum and R. Mukkamala, “Dynamic key management in sensor networks,” IEEE Communications Magazine, vol. 44, no. 4, pp. 122–130, 2006. [Google Scholar]
33. S. Rajendran, O. I. Khalaf, Y. Alotaibi and S. Alghamdi, “MapReduce-Based big data classification model using feature subset selection and hyperparameter tuned deep belief network,” Scientific Reports, vol. 11, no. 1, pp. 1–10, 2021. [Google Scholar]
34. H. H. Khan, M. N. Malik, R. Zafar, F. A. Goni, A. G. Chofreh et al., “Challenges for sustainable smart city development: A conceptual framework,” Sustainable Development, vol. 28, no. 5, pp. 1507–1518, 2020. [Google Scholar]
35. M. Alazab, K. Lakshmanna, T. Reddy, Q. V. Pham and P. K. R. Maddikunta, “Multi-objective cluster head selection using fitness averaged rider optimization algorithm for IoT networks in smart cities,” Sustainable Energy Technologies and Assessments, vol. 43, no. 1, pp. 1–9, 2021. [Google Scholar]
36. A. A. Baradaran and K. Navi, “HQCA-WSN: High-quality clustering algorithm and optimal cluster head selection using fuzzy logic in wireless sensor networks,” Fuzzy Sets and Systems, vol. 389, no. 1, pp. 114–144, 2020. [Google Scholar]
37. Q. Ren and G. Yao, “An energy-efficient cluster head selection scheme for energy-harvesting wireless sensor networks,” Sensors, vol. 20, no. 1, pp. 187–195, 2020. [Google Scholar]
38. S. Sankar and P. Srinivasan, “Enhancing the mobility support in internet of things,” International Journal of Fuzzy System Applications (IJFSA), vol. 9, no. 4, pp. 1–20, 2020. [Google Scholar]
39. M. Radhika and P. Sivakumar, “Energy optimized micro genetic algorithm based leach protocol for wsn,” Wireless Networks, vol. 27, no. 1, pp. 27–40, 2021. [Google Scholar]
40. S. El Khediri, R. U. Khan, N. Nasri and A. Kachouri, “MW-LEACH: Low energy adaptive clustering hierarchy approach for WSN,” IET Wireless Sensor Systems, vol. 10, no. 3, pp. 126–129. 2020. [Google Scholar]
41. R. Thiagarajan, “Energy consumption and network connectivity based on novel-LEACH-POS protocol networks,” Computer Communications, vol. 149, no. 1, pp. 90–98, 2020. [Google Scholar]
42. Y. Alotaibi, “Automated business process modelling for analyzing sustainable system requirements engineering,” in IEEE 2020 6th Int. Conf. on Information Management (ICIM), London, UK, pp. 157–161, 2020. [Google Scholar]
43. P. S. Mehra, M. Doja and B. Alam, “Stability enhancement in leach (SE-LEACH) for homogeneous WSN,” EAI Endorsed Transactions on Scalable Information Systems, vol. 6, no. 20, pp. 1–9, 2019. [Google Scholar]
44. A. O. A. Salem and N. Shudifat, “Enhanced LEACH protocol for increasing a lifetime of WSNs,” Personal and Ubiquitous Computing, vol. 23, no. 5, pp. 901–907, 2019. [Google Scholar]
45. M. Baniata, H. T. Reda, N. Chilamkurti and A. Abuadbba, “Energy-efficient hybrid routing protocol for iot communication systems in 5 g and beyond,” Sensors, vol. 21, no. 2, pp. 537, 2021. [Google Scholar]
46. H. Ouldzira, H., Lagraini, A. Mouhsen, M. Chhiba and A. Tabyaoui, “MG-Leach: An enhanced leach protocol for wireless sensor network,” International Journal of Electrical and Computer Engineering, vol. 9, no. 4, pp. 3139, 2019. [Google Scholar]
47. S. A. Kumar, P. Ilango and G. H. Dinesh, “A modified leach protocol for increasing lifetime of the wireless sensor network,” Cybernetics and Information Technologies, vol. 16, no. 3, pp. 154–164, 2016. [Google Scholar]
48. T. M. Behera, U. C. Samal and S. K. Mohapatra, “Energy-efficient modified leach protocol for IoT application,” IET Wireless Sensor Systems, vol. 8, no. 5, pp. 223–228, 2018. [Google Scholar]
49. P. Gou, F. Li, Z. Li and X. Jia, “Improved LEACH protocol based on efficient clustering in wireless sensor networks,“ Journal of Computational Methods in Sciences and Engineering, vol. 19, no. 3, pp. 827–838, 2019. [Google Scholar]
50. K. M. Nahar, R. E. M. Al-Khatib, M. Barhoush and A. A. Halin, “MPF-LEACH: Modified probability function for cluster head election in LEACH protocol,” International Journal of Computer Applications in Technology, vol. 60, no. 3, pp. 267–280. 2019. [Google Scholar]
51. A. Hnini, M. Fihri, A. Hajami, E. M. Kandoussi and M. Nabil, “Improved W-LEACH decentralized protocol with game theory,” Procedia Computer Science, vol. 175, no. 1, pp. 548–553, 2020. [Google Scholar]
52. J. Y. Lee and D. Lee, “Improving transmission method of a cluster head node in a two-level wireless sensor network,” International Journal of Computational Vision and Robotics, vol. 11, no. 5, pp. 554–570, 2021. [Google Scholar]
53. U. Srilakshmi, N. Veeraiah, Y. Alotaibi, S. A. Alghamdi, O. I. Khalaf et al., “An improved hybrid secure multipath routing protocol for MANET,” IEEE Access, vol. 9, pp. 163043–163053, 2021. [Google Scholar]
 | This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |