Search 닫기

Journal of information and communication convergence engineering 2021; 19(2): 67-72

Published online June 30, 2021

https://doi.org/10.6109/jicce.2021.19.2.67

© Korea Institute of Information and Communication Engineering

A Novel Improved Energy-Efficient Cluster Based Routing Protocol (IECRP) for Wireless Sensor Networks

Inam, Muhammad;Li, Zhuo;Zardari, Zulfiqar Ali;

Beijing University of Technology, Beijing University of Technology

Received: February 15, 2021; Accepted: May 16, 2021

Wireless sensor networks (WSNs) require an enormous number of sensor nodes (SNs) to maintain processing, sensing, and communication capabilities for monitoring targeted sensing regions. SNs are generally operated by batteries and have a significantly restricted energy consumption; therefore, it is necessary to discover optimization techniques to enhance network lifetime by saving energy. The principal focus is on reducing the energy consumption of packet sharing (transmission and receiving) and improving the network lifespan. To achieve this objective, this paper presents a novel improved energy-efficient cluster-based routing protocol (IECRP) that aims to accomplish this by decreasing the energy consumption in data forwarding and receiving using a clustering technique. Doing so, we successfully increase node energy and network lifetime. In order to confirm the improvement of our algorithm, a simulation is done using matlab, in which analysis and simulation results show that the performance of the proposed algorithm is better than that of two well-known recent benchmarks.

Keywords Cluster head, Energy efficiency, IECRP, Residual energy, Wireless sensor networks

Wireless sensor networks (WSNs) are used to oversee harsh environments and collect information from both reachable and unreachable locations [1]. The nodes of WSNs sense variables in the target domain and deliver data to a base station (BS) [2]; they fulfill many needs in the environmental, health, military, and industrial fields. The growth potential of WSNs is of particular importance for distributed terrain monitoring, especially for terrains that are inaccessible, hostile, or physically isolated. Recent advances in WSNs have decreased implementation costs and increased functionality [3]. However, the sensor nodes (SNs) are battery-driven and possess limited available energy. It is generally impossible to recharge or replace sensor batteries, owing to the costs and resources required to access the harsh geographic areas. The low-range communication processing capability, scalability, restricted memory, and deployment in unfriendly environments are further challenges.

When a node drains its energy completely, it fails to function and is considered a dead node. Then, target areas that are serviced by those nodes are neglected, even if nearby nodes have sufficient energy to operate. Furthermore, in addition to coverage, maintaining network connectivity is important so that every sensor can send data to the next node, a cluster head (CH), or a BS, depending on the network topology [4]. Hence, while tracking targets, enhancing the network lifespan and sustaining connectivity are crucial tasks.

SNs spend more energy during communication (i.e., sending and receiving data) than during routine computation processes [5]. With indirect communication, SNs dissipate more energy, owing to transmission distances. By contrast, multihop communication saves energy by relaying data via the nearest nodes or CHs to the BS. With multi-hop communication, SNs near the sink/BS have extreme communication overhead, resulting in power issues in the target area [6],[7].

To overcome battery issues and enhance network lifespan, numerous clustering techniques have been proposed for WSNs [8-11] to prolong the life of the network [12-15]. The low-energy adaptive clustering hierarchy (LEACH) protocol improves network lifespan over direct or multi-hop transmissions, but it still has limitations. The CH is chosen randomly, which does not guarantee sufficient node dispersal and optimal performance. Sensors having low or high residual energy enjoy an equal chance of becoming the CH. Hence, those with low residual energy will quickly die as a CH, thereby shortening the life of the network [16].

The load-balancing energy-efficient sleep–awake aware (EESAA) protocol [17] considers multiple parameters, such as stability period, throughput, and network life, by enhancing and examining the clustering algorithm performance of WSNs. The CH collects data from the cluster nodes, fuses them, and sends them to the BS. However, the EESAA does not guarantee an even distribution of CHs across the network.

A stable energy-efficient network (SEEN) was also presented [18] in which the CH selection is based on the node residual energy and distance parameters. With this, a few SNs are facilitated by the best communication and processing competencies. Srivastava et al. [19] presented the optimized zone-based energy-efficient routing protocol (OZEEP) in which node density, residual energy, distance, and node mobility are used as input parameters for a fuzzy inference system to select an appropriate CH. However, it is the BS that stipulates all network controls and operations, which leads to poor scalability.

The problems with WSN routing schemes from the literature can be summarized as follows:

  • • Reselecting the same node as CH quickly drains its energy.

  • • The CHs are not evenly distributed across the network.

  • • Multiple CHs in the same cluster result in additional collisions that lead to increased energy consumption.

To resolve these complications, we propose a novel improved energy-efficient cluster-based routing protocol (IECRP) that is designed for useful clustering, which includes CH selection based on residual energy, neighbor distance, and number of neighbors. The significant contributions of this paper are as follows:

  • • We evaluate and increase clustering algorithm performance in terms of network lifetime, throughput, and stability period for WSNs.

  • • To ensure uninterrupted and collision-free communication, we focus on time-division multiple-access (TDMA)-based node transmissions.

  • • CH selection is based on current residual or maximum average energy.

  • • Active nodes transmit packets to other nodes or the BS, whereas the rest remain in a sleep state.

Many clustering algorithms have been proposed to increase network lifespan, such as LEACH [20], kernel-based fuzzy C-means clustering [21], and dual-cluster heads technique based on Krill herd optimization [22]. WSN cluster routing emerged from these three protocols. The initial cluster routing technique for WSNs was LEACH. This algorithm presented the notion of rounds, which reflects the periodic implementation of cluster-based routing. A node is nominated based on its remaining energy during CH selection and whether it was nominated as a CH earlier.

The SN generates a random number between zero and one. It is selected as the CH if the number is smaller than T(n), after which the node broadcasts the information over the network. Every cluster member receives information from the other CHs. Afterward, the cluster member joins the CH with a strong signal and sends a join request to the CH. Upon receiving the request (approval), the CH assigns time slots using TDMA and codes using code division multiple access.

The probability of a node being selected as a CH based on each node's residual energy was later modified by Thein et al. [23], enhancing network lifespan by 40–50 %. In [24], another CH selection scheme was proposed for data aggregation, also enhancing the network lifetime by eliminating redundant data. The protocol considers a hotness factor to modify the threshold value, which describes a specific node's relative hotness in the network.

The CH selection in [25] focused on particle swarm optimization (PSO). The parameter selection is based on the residual energy, node degree, quantity of optimal CHs, and distance from the intra-cluster. This technique achieves better efficiency in different network metrics when assessed with other routing algorithms. A PSO based on energy-efficient CH selection was implemented in [26], where the CH is chosen based on the PSO by considering the residual energy, distance from the BS, and node-to-node distance. Using an optimization scheme (i.e., clustered gray-wolf search optimization), a security-aware CH is selected to increase the lifespan of the network in [27].

CH selection based on residual energy was then proposed as a LEACH improvement [28]. A modest multi-hop technique to LEACH was also introduced, and it was found that both algorithms enhanced the network lifetime better than LEACH after a given period. A non-probabilistic multi-criteria approach was presented for CH selection in [29], where the entire network is divided into different zones. The decision tool analytical network process is used to select the CH, and the best parameters are selected from a set of collected parameters for CH selection.

To continuously monitor the environment, nodes are organized randomly in a network-targeted region/area. The total number of nodes is represented by N, where N = {n1, n2, n3, ……, nn}. The network model assumption is promulgated into the sensing area by deploying nodes to design the IECRP protocol.

  • • A single BS is placed above the sensing area.

  • • The SNs and the BS are static in the network region.

  • • At the time of deployment, all nodes have the same energy; therefore, uniformity is sustained.

  • • After acknowledgment, the BS interacts with the CH.

  • • Depending on the distance of the receiver, the transmission power is adjusted.

The architecture of IECRP is shown in Fig. 1. In each round, a new CH is selected based on its residual energy. Communication takes place based on the near-optimal path technique.

Fig. 1. Network structure.

The energy required for data transmission depends on the transmission range of the transmission circuit. Similarly, the energy needed to receive the data also relies on the same factors. The energy necessary to transmit a data packet is

ETr(l, d) = Eele(l) + Eamp(l, d),

ETr(l, d) = {lEele+ lεfsd2;d<d0},

ETr(l, d) = {lEele+ lεmpd4;dd0}.

The energy needed to receive a data packet is

ERr(l) = Eele(l)=lEele,

where Eele(l) is the per-bit energy dissipated by transceiver circuitry. The free space (d2) or multipath (d4) propagation is used, depending on the transmission range. Eamp (l,d) is the amplification energy of the data at distance d.

In this section, we propose the IECRP load-balancing technique, which improves the CH selection procedure by considering the node residual energy, node locations, and the number of neighbors.

A. <italic>Coupling in the Network</italic>

At the start of CH selection, the SNs use carrier-sense multiple access (CSMA) with collision avoidance to broadcast the HELLO message with its residual energy to its neighbors. The HELLO message is used to determine the number of neighbors, the distance between them, and the neighbors' energy levels. Initially, the SNs broadcast their location information to the BS; after finding their positions, the BS estimates the related distance between the SNs. Nodes having minimum distance between them join the BS. Subsequently, the BS transmits the location information of each node in the network. The nodes that take part in the communication process change from the sleep state to an active state for the current round. The nodes that do not communicate with other nodes or the CH will remain in a sleep state, minimizing power consumption.

B. Network arrangement

In this section, the distributed algorithm is used for an optimal number of CH selections. Initially, the network is homogeneous in energy with the same level. After the first round, the CH selection is based on each node's residual energy [30]. For the CH selection process, active nodes participate. Initially, nodes having the same initial energy, E0, use a distributed algorithm. The SN of the active state chooses itself as the CH based on the selection probability. The random value of each node is in [0, 1] and is compared with the threshold value, Th, as follows:

Th = P d / 1 P d _ ( first round  m o d   1)   i f   n   Є   A   0 O t h e r w i s e  

Item A is the group of active SNs during the first round, and if the threshold value, Th, is greater than the selected random number of the SN, then the SN elects itself as the CH.

C. <italic>Data Transmission</italic>

The SNs send their sensed data in dedicated time slots during the assigned TDMA method. During the transmission phase, the nodes are not affected by the sleep state. The CH gathers data from each node and sends the aggregated data to the BS. During aggregation, the data are compressed, and redundant data are removed. Using a data aggregation scheme, a significant amount of battery usage can be minimized. Thus, to send packets, a non-CH SN consumes the Eamp in transmission amplification and ETX in the transmitter circuits to achieve a tolerable signal-to-noise ratio. Therefore, the energy spent during the transmission of a non-CH Lc-bit message is calculated as

EnonCH=(N/K1) × ETX × Lc                           × Eamp × Lc × d2CH.

In each cluster, the CH receives data from a cluster member, and the energy is calculated as follows:

Erec=(Erx×Lc) (N/K1),

where Erx represents the receiver-circuit dissipation of the energy for data reception. The data received by the CH to aggregate the data from the cluster members and the energy dissipated by data aggregation is calculated as

EAGR=(EDA×Lc) (N/K).

The battery energy used by the CH to send the gathered data to the BS is

ET=ETX×LA×Eamp×LA×d2BS,

where LA represents aggregated data, and d2-BS represents the distance between the CH and BS. The total CH dissipated energy is calculated as

ECH=Erec+EAGR+ET.

The overall energy consumed by the CH is the energy consumed during data reception, data aggregation, and data transmission to the BS.

To simulate and analyze performance, MATLAB 2017a was used for the proposed IECRP protocol, comparing it with two other benchmarks: SEEN and OZEEP. Table 1 lists the proposed IECRP simulation scheme.

Simulation Setup
ParametersValues
Targeted area100×100 m
Sensor nodes initial energy (E0)1 J
Energy cost during data aggregation (EDA)5 nJ / bit/ signal
Total number of sensor nodes100
Size of packet4,000 bits
Energy cost during transmission (EelectTx)50 nj/bit
Energy cost during receiving (EelecRx)50 nj/bit
Transmit amplifier (Eamp)/bit /m2

A. <italic>Network Lifetime</italic>

Fig. 2 shows that the proposed method ensures that the life cycle of SNs is longer than the other two protocols (i.e., SEEN and OZEEP), because the proposed clustering method ensures that well-distributed CHs throughout the network achieve a balanced load. Moreover, CH selection relies on the nodes’ residual energy to ensure the equal distribution of sensor energy depletion and avoid early battery consumption. From simulation results, an optimal number of SNs remains active until the end of battery life.

Fig. 2. Alive nodes in each round.

Network lifespan is essential to WSNs and is enhanced by the proposed method. Fig. 3 illustrates that SEEN and OZEEP node deaths occurred prior to those of IECRP. The lifetime of a network can be inferred from the death of its nodes.

Fig. 3. Number of dead nodes in each round.
B. <italic>Quantity of Packet Delivery to the BS</italic>

Fig. 4 shows that the packet delivery to the IECRP BS was superior to SEEN and OZEEP. IECRP provides a significant improvement in data-packet transmission, and as it sends packets to the BS, the BS assigns different time slots to the CHs for data collection and transmission back to the BS. When the remaining CH energy is lower than the threshold level, the proposed algorithm selects a new CH.

Fig. 4. Number of packets transmitted to BS.

We introduced a new load-balancing protocol, IECRP, which ensures efficient energy depletion and enhances the network lifetime of WSNs. The proposed method minimizes energy consumption, which leads to an increased network lifespan. Using this protocol, the live node concentration is increased and the dead node concentration is decreased. In terms of CH election, network stability, and network lifetime, the IECRP protocol was found to offer better efficiency than SEEN and OZEEP.

  1. A. S. Zahmati, B. Abolhassani, A. A. B. Shirazi, and A. S. Bakhtiari, “An energy-efficient protocol with static clustering for wireless sensor networks,” International Journal of Electronics, Circuits and Systems, vol. 1, pp. 135-138, 2007. DOI: 10.5281/zenodo.1329188.
    CrossRef
  2. W. R. Heinzelman, A. Chandrakaran, and H. Balakrishnan, “Energy-Efficient communication protocol for wireless microsensor networks,” in Proceeding of the 33rd Annual Hawaii International Conference on System Sciences, Cambridge, MA, pp. 110, 2000. DOI: 10.1109/HICSS.2000.926982.
    CrossRef
  3. R. N. Jadoon, W. Zhou, W. Jadoon, and I. A. Khan, “RARZ: Ring-zone based routing protocol for wireless sensor networks,” Applied Sciences, vol. 8, no. 7, pp. 1023, 2018. DOI: 10.3390/app8071023.
    CrossRef
  4. Q. Zhao and M. Gurusamy, “Lifetime maximization for connected target coverage in wireless sensor networks,” IEEE/ACM Transactions on Networking, vol. 16, no. 6, pp. 1378-1391, 2008. DOI: 10.1109/TNET.2007.911432.
    CrossRef
  5. M. S. Obaidat and S. Misra, Principles of Wireless Sensor Networks, Cambridge University Press, Cambridge, UK, 2014. DOI: 10.1017/CBO9781139030960.
    CrossRef
  6. E. Alnawafa and I. Marghescu, “New energy efficient multi-hop routing techniques for wireless sensor networks: Static and dynamic techniques,” Sensors, vol. 18, pp. 1863, 2018. DOI: 10.3390/s18061863.
    CrossRef
  7. K. Karunanithy and B. Velusamy, “An efficient distributed clustering and gradient based routing protocol for wireless sensor networks,” Journal of Information Science & Engineering, vol. 35, no. 5, pp. 1133-1146, 2019. DOI: 10.6688/JISE.201909_35(5).0012.
    CrossRef
  8. J. Kang, I. Sohn, and S. H. Lee, “Enhanced message-passing based LEACH protocol for wireless sensor networks,” Sensors, vol. 19, no. 1, pp. 75, 2019. DOI: 10.3390/s19010075.
    CrossRef
  9. W. B. Heinzelman, A. P. Chandrakaran, and H. Balakrishnan, “An application specific protocol architecture for wireless micro sensor networks,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660-670, 2002. DOI: 10.1109/TWC.2002.804190.
    CrossRef
  10. M. Inam, A. A. Ikram, and M. Ahmad, “Hierarchical energy efficient routing protocol (HEERP) for wireless sensor networks (WSN),” International Journal of Computer Science and Telecommunions, vol. 4, no. 10, pp. 25-29, 2013.
  11. M. Inam, Z. Li, Z. A. Zardari, and F. M. M. Mokbal, “Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) in wireless sensor networks,” Preprints, 2019. DOI: 10.20944/preprints201912.0142.v1.
    CrossRef
  12. R. Velmani and B. Kaarthick, “An efficient cluster-tree based data collection scheme for large mobile wireless sensor networks,” IEEE Sensors Journal, vol. 15, no. 4, pp. 2377-2390, 2015. DOI: 10.1109/JSEN.2014.2377200.
    CrossRef
  13. S. Deng, J. Li, and L. Shen, “Mobility-based clustering protocol for wireless sensor networks with mobile nodes,” IET Wireless Sensor Systems, vol. 1, no. 1, pp. 39-47, 2011. DOI: 10.1049/iet-wss.2010.0084.
    CrossRef
  14. M. Tarhani, Y. S. Kavian, and S. Siavoshi, “SEECH: Scalable energy efficient clustering hierarchy protocol in wireless sensor networks,” IEEE Sensors Journal, vol. 14, no. 11, pp. 3944-3954, 2014. DOI:10.1109/JSEN.2014.2358567.
    CrossRef
  15. N. Bashir, Z. H. Abbas, and G. Abbas, “On demand cluster head formation with inherent hierarchical clustering and reliable multipath routing in wireless sensor networks,” Adhoc & Sensor Wireless Networks, vol. 45, 2019.
  16. J. Xu, N. Jin, X. Lou, T. Peng, Q. Zhou, and Y. Chen, “Improvement of LEACH protocol for WSN,” in Proceeding of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, pp. 2174-2177, 2012. DOI:10.1109/FSKD.2012.6233907.
    CrossRef
  17. A. Ennaciri, M. Erritali, and J. Bengourram, “Load Balancing Protocol (EESAA) to improve Quality of Service in Wireless sensor network,” Procedia Computer Science, vol. 151, pp. 1140-1145, 2019. DOI: 10.1016/j.procs.2019.04.162.
    CrossRef
  18. R. Priyadarshi, L. Singh, A. Singh, and A. Thakur, “SEEN: Stable energy efficient network for wireless sensor network,” in Proceeding of the 2018 5th International Conference on Signal Processing and Integrated Networks (SPIN), Noida, India, pp. 338-342, 2018. DOI: 10.1109/SPIN.2018.8474228.
    CrossRef
  19. J. R. Srivastava and T. S. B. Sudarshan, “A genetic fuzzy system based optimized zone based energy efficient routing protocol for mobile sensor networks (OZEEP),” Applied Soft Computing, vol. 37, pp. 863-886, 2015. DOI: 10.1016/j.asoc.2015.09.025.
    CrossRef
  20. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient Communication protocols for wireless microsensor networks,” in Proceeding of the 33rd Hawaii International Conference on System Sciences (HICSS), 2000. DOI: 10.1109/HICSS.2000.926982.
    CrossRef
  21. A. A. Salman and T. Z. Alisa, “Improving the Network Lifetime in Wireless Sensor Network for Internet of Thing Applications,” Al-Khwarizmi Engineering Journal, vol. 15, no. 4, pp. 79-90, 2019. DOI: 10.22153/kej.2019.09.007.
    CrossRef
  22. P. Visu, T. S. Praba, N. Sivakumar, R. Srinivasan, and T. Sethukarasi, “Bio-inspired dual cluster heads optimized routing algorithm for wireless sensor networks,” Journal of Ambient Intelligence and Humanized Computing, pp. 1-9, 2020. DOI: 10.1007/s12652-019-01657-9.
    CrossRef
  23. M. C. M. Thein and T. Thein, “An energy efficient cluster-head selection for wireless sensor networks,” in Proceeding of the 2020 International Conference on Intelligent systems, modelling and simulation (ISMS), pp. 287-291, 2010. DOI: 10.1109/ISMS.2010.60.
    CrossRef
  24. K. Maraiya, K. Kant, and N. Gupta, “Efficient cluster head selection scheme for data aggregation in wireless sensor network,” International Journal of Computer Applications, vol. 23, no. 9, pp. 10-18, 2011. DOI: 10.5120/2981-3980.
    CrossRef
  25. B. Singh and D. K. Lobiyal, “A novel energy-aware cluster head selection based on particle swarm optimization for wireless sensor networks,” Human-Centric Computing Information Sciences, vol. 2, no. 1, pp. 13, 2012. DOI: 10.1186/2192-1962-2-13.
    CrossRef
  26. P. C. S. Rao, P. K. Jana, and H. Banka, “A particle swarm optimization based energy efficient cluster head selection algorithm for wireless sensor networks,” Wireless networks, vol. 23, no. 7, pp. 2005-2020, 2017. DOI: 10.1007/s11276-016-1270-7.
    CrossRef
  27. A. Shankar, N. Jaisankar, M. S. Khan, R. Patan, and B. Balamurugan, “Hybrid model for security-aware cluster head selection in wireless sensor networks,” IET Wireless Sensor Systems, vol. 9, no. 2, pp. 68-76, 2019. DOI: 10.1049/iet-wss.2018.5008.
    CrossRef
  28. F. Xiangning and S. Yulin, “Improvement on LEACH protocol of wireless sensor network,” in Proceeding of the 2007 International Conference on Sensor Technologies and Applications (SENSORCOMM), pp. 260-264, 2007. DOI: 10.1109/SENSORCOMM.2007.4394931.
    CrossRef
  29. H. Farman, B. Jan, H. Javed, N. Ahmad, J. Iqbal, M. Arshad, and S. Ali, “Multi-criteria based zone head selection in Internet of Things based wireless sensor networks,” Future Generation Computer Systems, vol. 87, pp. 364-371, 2018. DOI: 10.1016/j.future.2018.04.091.
    CrossRef
  30. T. Shah, N. Javaid and T. N. Qureshi, “Energy Efficient Sleep Awake Aware (EESAA) intelligent Sensor Network routing protocol,” in Proceeding of the 15th International Multitopic Conference (INMIC), pp. 317-322, 2012. DOI: 10.1109/INMIC.2012.6511504.
    CrossRef

Muhammad Inam

received his B.S degree with honors in information technology from University of Malakand, Chakdara, Pakistan, in 2009 and his M.S. degree in telecommunication and networks from Iqra University Islamabad, Pakistan, in 2013. He is currently pursuing his Ph.D. degree at Beijing University of Technology, Beijing, China. His research areas includes wireless communication, video coding and transmission, multimedia QoE management, mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks.


Li Zhuo

received her Ph.D. degree in pattern recognition and intelligent systems from the Beijing University of Technology in 2004. She is currently a professor with the Faculty of Information Technology, Beijing University of Technology. She is also with the Beijing Key Laboratory of Computational Intelligence and Intelligent Systems, Beijing University of Technology, and the Collaborative Innovation Center of Electric Vehicles, Beijing. She has published over 180 refereed journals and conference papers. Her current research interests include image/video processing, image recognition, and medical image processing.


Zulfiqar Ali Zardari

received his B.E. and M.E degrees from Mehran University of Engineering and Technology Jamshoro in Sindh, Pakistan in 2011 and 2015 respectively. Currently, he is working on his Ph.D at the Faculty of Information Technology, Beijing University of Technology, China. He has published eight research papers as a first and co-author in national and international journals. His research interests include mobile ad hoc networks, wireless communications, information security, sensor network security, computer networks, and network security.


Article

Journal of information and communication convergence engineering 2021; 19(2): 67-72

Published online June 30, 2021 https://doi.org/10.6109/jicce.2021.19.2.67

Copyright © Korea Institute of Information and Communication Engineering.

A Novel Improved Energy-Efficient Cluster Based Routing Protocol (IECRP) for Wireless Sensor Networks

Inam, Muhammad;Li, Zhuo;Zardari, Zulfiqar Ali;

Beijing University of Technology, Beijing University of Technology

Received: February 15, 2021; Accepted: May 16, 2021

Abstract

Wireless sensor networks (WSNs) require an enormous number of sensor nodes (SNs) to maintain processing, sensing, and communication capabilities for monitoring targeted sensing regions. SNs are generally operated by batteries and have a significantly restricted energy consumption; therefore, it is necessary to discover optimization techniques to enhance network lifetime by saving energy. The principal focus is on reducing the energy consumption of packet sharing (transmission and receiving) and improving the network lifespan. To achieve this objective, this paper presents a novel improved energy-efficient cluster-based routing protocol (IECRP) that aims to accomplish this by decreasing the energy consumption in data forwarding and receiving using a clustering technique. Doing so, we successfully increase node energy and network lifetime. In order to confirm the improvement of our algorithm, a simulation is done using matlab, in which analysis and simulation results show that the performance of the proposed algorithm is better than that of two well-known recent benchmarks.

Keywords: Cluster head, Energy efficiency, IECRP, Residual energy, Wireless sensor networks

I. INTRODUCTION

Wireless sensor networks (WSNs) are used to oversee harsh environments and collect information from both reachable and unreachable locations [1]. The nodes of WSNs sense variables in the target domain and deliver data to a base station (BS) [2]; they fulfill many needs in the environmental, health, military, and industrial fields. The growth potential of WSNs is of particular importance for distributed terrain monitoring, especially for terrains that are inaccessible, hostile, or physically isolated. Recent advances in WSNs have decreased implementation costs and increased functionality [3]. However, the sensor nodes (SNs) are battery-driven and possess limited available energy. It is generally impossible to recharge or replace sensor batteries, owing to the costs and resources required to access the harsh geographic areas. The low-range communication processing capability, scalability, restricted memory, and deployment in unfriendly environments are further challenges.

When a node drains its energy completely, it fails to function and is considered a dead node. Then, target areas that are serviced by those nodes are neglected, even if nearby nodes have sufficient energy to operate. Furthermore, in addition to coverage, maintaining network connectivity is important so that every sensor can send data to the next node, a cluster head (CH), or a BS, depending on the network topology [4]. Hence, while tracking targets, enhancing the network lifespan and sustaining connectivity are crucial tasks.

SNs spend more energy during communication (i.e., sending and receiving data) than during routine computation processes [5]. With indirect communication, SNs dissipate more energy, owing to transmission distances. By contrast, multihop communication saves energy by relaying data via the nearest nodes or CHs to the BS. With multi-hop communication, SNs near the sink/BS have extreme communication overhead, resulting in power issues in the target area [6],[7].

To overcome battery issues and enhance network lifespan, numerous clustering techniques have been proposed for WSNs [8-11] to prolong the life of the network [12-15]. The low-energy adaptive clustering hierarchy (LEACH) protocol improves network lifespan over direct or multi-hop transmissions, but it still has limitations. The CH is chosen randomly, which does not guarantee sufficient node dispersal and optimal performance. Sensors having low or high residual energy enjoy an equal chance of becoming the CH. Hence, those with low residual energy will quickly die as a CH, thereby shortening the life of the network [16].

The load-balancing energy-efficient sleep–awake aware (EESAA) protocol [17] considers multiple parameters, such as stability period, throughput, and network life, by enhancing and examining the clustering algorithm performance of WSNs. The CH collects data from the cluster nodes, fuses them, and sends them to the BS. However, the EESAA does not guarantee an even distribution of CHs across the network.

A stable energy-efficient network (SEEN) was also presented [18] in which the CH selection is based on the node residual energy and distance parameters. With this, a few SNs are facilitated by the best communication and processing competencies. Srivastava et al. [19] presented the optimized zone-based energy-efficient routing protocol (OZEEP) in which node density, residual energy, distance, and node mobility are used as input parameters for a fuzzy inference system to select an appropriate CH. However, it is the BS that stipulates all network controls and operations, which leads to poor scalability.

The problems with WSN routing schemes from the literature can be summarized as follows:

  • • Reselecting the same node as CH quickly drains its energy.

  • • The CHs are not evenly distributed across the network.

  • • Multiple CHs in the same cluster result in additional collisions that lead to increased energy consumption.

To resolve these complications, we propose a novel improved energy-efficient cluster-based routing protocol (IECRP) that is designed for useful clustering, which includes CH selection based on residual energy, neighbor distance, and number of neighbors. The significant contributions of this paper are as follows:

  • • We evaluate and increase clustering algorithm performance in terms of network lifetime, throughput, and stability period for WSNs.

  • • To ensure uninterrupted and collision-free communication, we focus on time-division multiple-access (TDMA)-based node transmissions.

  • • CH selection is based on current residual or maximum average energy.

  • • Active nodes transmit packets to other nodes or the BS, whereas the rest remain in a sleep state.

II. LITERATURE REVIEW

Many clustering algorithms have been proposed to increase network lifespan, such as LEACH [20], kernel-based fuzzy C-means clustering [21], and dual-cluster heads technique based on Krill herd optimization [22]. WSN cluster routing emerged from these three protocols. The initial cluster routing technique for WSNs was LEACH. This algorithm presented the notion of rounds, which reflects the periodic implementation of cluster-based routing. A node is nominated based on its remaining energy during CH selection and whether it was nominated as a CH earlier.

The SN generates a random number between zero and one. It is selected as the CH if the number is smaller than T(n), after which the node broadcasts the information over the network. Every cluster member receives information from the other CHs. Afterward, the cluster member joins the CH with a strong signal and sends a join request to the CH. Upon receiving the request (approval), the CH assigns time slots using TDMA and codes using code division multiple access.

The probability of a node being selected as a CH based on each node's residual energy was later modified by Thein et al. [23], enhancing network lifespan by 40–50 %. In [24], another CH selection scheme was proposed for data aggregation, also enhancing the network lifetime by eliminating redundant data. The protocol considers a hotness factor to modify the threshold value, which describes a specific node's relative hotness in the network.

The CH selection in [25] focused on particle swarm optimization (PSO). The parameter selection is based on the residual energy, node degree, quantity of optimal CHs, and distance from the intra-cluster. This technique achieves better efficiency in different network metrics when assessed with other routing algorithms. A PSO based on energy-efficient CH selection was implemented in [26], where the CH is chosen based on the PSO by considering the residual energy, distance from the BS, and node-to-node distance. Using an optimization scheme (i.e., clustered gray-wolf search optimization), a security-aware CH is selected to increase the lifespan of the network in [27].

CH selection based on residual energy was then proposed as a LEACH improvement [28]. A modest multi-hop technique to LEACH was also introduced, and it was found that both algorithms enhanced the network lifetime better than LEACH after a given period. A non-probabilistic multi-criteria approach was presented for CH selection in [29], where the entire network is divided into different zones. The decision tool analytical network process is used to select the CH, and the best parameters are selected from a set of collected parameters for CH selection.

III. NETWORK MODEL

To continuously monitor the environment, nodes are organized randomly in a network-targeted region/area. The total number of nodes is represented by N, where N = {n1, n2, n3, ……, nn}. The network model assumption is promulgated into the sensing area by deploying nodes to design the IECRP protocol.

  • • A single BS is placed above the sensing area.

  • • The SNs and the BS are static in the network region.

  • • At the time of deployment, all nodes have the same energy; therefore, uniformity is sustained.

  • • After acknowledgment, the BS interacts with the CH.

  • • Depending on the distance of the receiver, the transmission power is adjusted.

The architecture of IECRP is shown in Fig. 1. In each round, a new CH is selected based on its residual energy. Communication takes place based on the near-optimal path technique.

Figure 1. Network structure.

IV. ENERGY CONSUMPTION MODEL

The energy required for data transmission depends on the transmission range of the transmission circuit. Similarly, the energy needed to receive the data also relies on the same factors. The energy necessary to transmit a data packet is

ETr(l, d) = Eele(l) + Eamp(l, d),

ETr(l, d) = {lEele+ lεfsd2;d<d0},

ETr(l, d) = {lEele+ lεmpd4;dd0}.

The energy needed to receive a data packet is

ERr(l) = Eele(l)=lEele,

where Eele(l) is the per-bit energy dissipated by transceiver circuitry. The free space (d2) or multipath (d4) propagation is used, depending on the transmission range. Eamp (l,d) is the amplification energy of the data at distance d.

V. IECRP PROTOCOL

In this section, we propose the IECRP load-balancing technique, which improves the CH selection procedure by considering the node residual energy, node locations, and the number of neighbors.

A. <italic>Coupling in the Network</italic>

At the start of CH selection, the SNs use carrier-sense multiple access (CSMA) with collision avoidance to broadcast the HELLO message with its residual energy to its neighbors. The HELLO message is used to determine the number of neighbors, the distance between them, and the neighbors' energy levels. Initially, the SNs broadcast their location information to the BS; after finding their positions, the BS estimates the related distance between the SNs. Nodes having minimum distance between them join the BS. Subsequently, the BS transmits the location information of each node in the network. The nodes that take part in the communication process change from the sleep state to an active state for the current round. The nodes that do not communicate with other nodes or the CH will remain in a sleep state, minimizing power consumption.

B. Network arrangement

In this section, the distributed algorithm is used for an optimal number of CH selections. Initially, the network is homogeneous in energy with the same level. After the first round, the CH selection is based on each node's residual energy [30]. For the CH selection process, active nodes participate. Initially, nodes having the same initial energy, E0, use a distributed algorithm. The SN of the active state chooses itself as the CH based on the selection probability. The random value of each node is in [0, 1] and is compared with the threshold value, Th, as follows:

Th = P d / 1 P d _ ( first round  m o d   1)   i f   n   Є   A   0 O t h e r w i s e  

Item A is the group of active SNs during the first round, and if the threshold value, Th, is greater than the selected random number of the SN, then the SN elects itself as the CH.

C. <italic>Data Transmission</italic>

The SNs send their sensed data in dedicated time slots during the assigned TDMA method. During the transmission phase, the nodes are not affected by the sleep state. The CH gathers data from each node and sends the aggregated data to the BS. During aggregation, the data are compressed, and redundant data are removed. Using a data aggregation scheme, a significant amount of battery usage can be minimized. Thus, to send packets, a non-CH SN consumes the Eamp in transmission amplification and ETX in the transmitter circuits to achieve a tolerable signal-to-noise ratio. Therefore, the energy spent during the transmission of a non-CH Lc-bit message is calculated as

EnonCH=(N/K1) × ETX × Lc                           × Eamp × Lc × d2CH.

In each cluster, the CH receives data from a cluster member, and the energy is calculated as follows:

Erec=(Erx×Lc) (N/K1),

where Erx represents the receiver-circuit dissipation of the energy for data reception. The data received by the CH to aggregate the data from the cluster members and the energy dissipated by data aggregation is calculated as

EAGR=(EDA×Lc) (N/K).

The battery energy used by the CH to send the gathered data to the BS is

ET=ETX×LA×Eamp×LA×d2BS,

where LA represents aggregated data, and d2-BS represents the distance between the CH and BS. The total CH dissipated energy is calculated as

ECH=Erec+EAGR+ET.

The overall energy consumed by the CH is the energy consumed during data reception, data aggregation, and data transmission to the BS.

VI. RESULTS WITH DISCUSSION

To simulate and analyze performance, MATLAB 2017a was used for the proposed IECRP protocol, comparing it with two other benchmarks: SEEN and OZEEP. Table 1 lists the proposed IECRP simulation scheme.

Simulation Setup
ParametersValues
Targeted area100×100 m
Sensor nodes initial energy (E0)1 J
Energy cost during data aggregation (EDA)5 nJ / bit/ signal
Total number of sensor nodes100
Size of packet4,000 bits
Energy cost during transmission (EelectTx)50 nj/bit
Energy cost during receiving (EelecRx)50 nj/bit
Transmit amplifier (Eamp)/bit /m2

A. <italic>Network Lifetime</italic>

Fig. 2 shows that the proposed method ensures that the life cycle of SNs is longer than the other two protocols (i.e., SEEN and OZEEP), because the proposed clustering method ensures that well-distributed CHs throughout the network achieve a balanced load. Moreover, CH selection relies on the nodes’ residual energy to ensure the equal distribution of sensor energy depletion and avoid early battery consumption. From simulation results, an optimal number of SNs remains active until the end of battery life.

Figure 2. Alive nodes in each round.

Network lifespan is essential to WSNs and is enhanced by the proposed method. Fig. 3 illustrates that SEEN and OZEEP node deaths occurred prior to those of IECRP. The lifetime of a network can be inferred from the death of its nodes.

Figure 3. Number of dead nodes in each round.
B. <italic>Quantity of Packet Delivery to the BS</italic>

Fig. 4 shows that the packet delivery to the IECRP BS was superior to SEEN and OZEEP. IECRP provides a significant improvement in data-packet transmission, and as it sends packets to the BS, the BS assigns different time slots to the CHs for data collection and transmission back to the BS. When the remaining CH energy is lower than the threshold level, the proposed algorithm selects a new CH.

Figure 4. Number of packets transmitted to BS.

VII. CONCLUSION

We introduced a new load-balancing protocol, IECRP, which ensures efficient energy depletion and enhances the network lifetime of WSNs. The proposed method minimizes energy consumption, which leads to an increased network lifespan. Using this protocol, the live node concentration is increased and the dead node concentration is decreased. In terms of CH election, network stability, and network lifetime, the IECRP protocol was found to offer better efficiency than SEEN and OZEEP.

Fig 1.

Figure 1.Network structure.
Journal of Information and Communication Convergence Engineering 2021; 19: 67-72https://doi.org/10.6109/jicce.2021.19.2.67

Fig 2.

Figure 2.Alive nodes in each round.
Journal of Information and Communication Convergence Engineering 2021; 19: 67-72https://doi.org/10.6109/jicce.2021.19.2.67

Fig 3.

Figure 3.Number of dead nodes in each round.
Journal of Information and Communication Convergence Engineering 2021; 19: 67-72https://doi.org/10.6109/jicce.2021.19.2.67

Fig 4.

Figure 4.Number of packets transmitted to BS.
Journal of Information and Communication Convergence Engineering 2021; 19: 67-72https://doi.org/10.6109/jicce.2021.19.2.67
Simulation Setup
ParametersValues
Targeted area100×100 m
Sensor nodes initial energy (E0)1 J
Energy cost during data aggregation (EDA)5 nJ / bit/ signal
Total number of sensor nodes100
Size of packet4,000 bits
Energy cost during transmission (EelectTx)50 nj/bit
Energy cost during receiving (EelecRx)50 nj/bit
Transmit amplifier (Eamp)/bit /m2

References

  1. A. S. Zahmati, B. Abolhassani, A. A. B. Shirazi, and A. S. Bakhtiari, “An energy-efficient protocol with static clustering for wireless sensor networks,” International Journal of Electronics, Circuits and Systems, vol. 1, pp. 135-138, 2007. DOI: 10.5281/zenodo.1329188.
    CrossRef
  2. W. R. Heinzelman, A. Chandrakaran, and H. Balakrishnan, “Energy-Efficient communication protocol for wireless microsensor networks,” in Proceeding of the 33rd Annual Hawaii International Conference on System Sciences, Cambridge, MA, pp. 110, 2000. DOI: 10.1109/HICSS.2000.926982.
    CrossRef
  3. R. N. Jadoon, W. Zhou, W. Jadoon, and I. A. Khan, “RARZ: Ring-zone based routing protocol for wireless sensor networks,” Applied Sciences, vol. 8, no. 7, pp. 1023, 2018. DOI: 10.3390/app8071023.
    CrossRef
  4. Q. Zhao and M. Gurusamy, “Lifetime maximization for connected target coverage in wireless sensor networks,” IEEE/ACM Transactions on Networking, vol. 16, no. 6, pp. 1378-1391, 2008. DOI: 10.1109/TNET.2007.911432.
    CrossRef
  5. M. S. Obaidat and S. Misra, Principles of Wireless Sensor Networks, Cambridge University Press, Cambridge, UK, 2014. DOI: 10.1017/CBO9781139030960.
    CrossRef
  6. E. Alnawafa and I. Marghescu, “New energy efficient multi-hop routing techniques for wireless sensor networks: Static and dynamic techniques,” Sensors, vol. 18, pp. 1863, 2018. DOI: 10.3390/s18061863.
    CrossRef
  7. K. Karunanithy and B. Velusamy, “An efficient distributed clustering and gradient based routing protocol for wireless sensor networks,” Journal of Information Science & Engineering, vol. 35, no. 5, pp. 1133-1146, 2019. DOI: 10.6688/JISE.201909_35(5).0012.
    CrossRef
  8. J. Kang, I. Sohn, and S. H. Lee, “Enhanced message-passing based LEACH protocol for wireless sensor networks,” Sensors, vol. 19, no. 1, pp. 75, 2019. DOI: 10.3390/s19010075.
    CrossRef
  9. W. B. Heinzelman, A. P. Chandrakaran, and H. Balakrishnan, “An application specific protocol architecture for wireless micro sensor networks,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660-670, 2002. DOI: 10.1109/TWC.2002.804190.
    CrossRef
  10. M. Inam, A. A. Ikram, and M. Ahmad, “Hierarchical energy efficient routing protocol (HEERP) for wireless sensor networks (WSN),” International Journal of Computer Science and Telecommunions, vol. 4, no. 10, pp. 25-29, 2013.
  11. M. Inam, Z. Li, Z. A. Zardari, and F. M. M. Mokbal, “Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) in wireless sensor networks,” Preprints, 2019. DOI: 10.20944/preprints201912.0142.v1.
    CrossRef
  12. R. Velmani and B. Kaarthick, “An efficient cluster-tree based data collection scheme for large mobile wireless sensor networks,” IEEE Sensors Journal, vol. 15, no. 4, pp. 2377-2390, 2015. DOI: 10.1109/JSEN.2014.2377200.
    CrossRef
  13. S. Deng, J. Li, and L. Shen, “Mobility-based clustering protocol for wireless sensor networks with mobile nodes,” IET Wireless Sensor Systems, vol. 1, no. 1, pp. 39-47, 2011. DOI: 10.1049/iet-wss.2010.0084.
    CrossRef
  14. M. Tarhani, Y. S. Kavian, and S. Siavoshi, “SEECH: Scalable energy efficient clustering hierarchy protocol in wireless sensor networks,” IEEE Sensors Journal, vol. 14, no. 11, pp. 3944-3954, 2014. DOI:10.1109/JSEN.2014.2358567.
    CrossRef
  15. N. Bashir, Z. H. Abbas, and G. Abbas, “On demand cluster head formation with inherent hierarchical clustering and reliable multipath routing in wireless sensor networks,” Adhoc & Sensor Wireless Networks, vol. 45, 2019.
  16. J. Xu, N. Jin, X. Lou, T. Peng, Q. Zhou, and Y. Chen, “Improvement of LEACH protocol for WSN,” in Proceeding of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, pp. 2174-2177, 2012. DOI:10.1109/FSKD.2012.6233907.
    CrossRef
  17. A. Ennaciri, M. Erritali, and J. Bengourram, “Load Balancing Protocol (EESAA) to improve Quality of Service in Wireless sensor network,” Procedia Computer Science, vol. 151, pp. 1140-1145, 2019. DOI: 10.1016/j.procs.2019.04.162.
    CrossRef
  18. R. Priyadarshi, L. Singh, A. Singh, and A. Thakur, “SEEN: Stable energy efficient network for wireless sensor network,” in Proceeding of the 2018 5th International Conference on Signal Processing and Integrated Networks (SPIN), Noida, India, pp. 338-342, 2018. DOI: 10.1109/SPIN.2018.8474228.
    CrossRef
  19. J. R. Srivastava and T. S. B. Sudarshan, “A genetic fuzzy system based optimized zone based energy efficient routing protocol for mobile sensor networks (OZEEP),” Applied Soft Computing, vol. 37, pp. 863-886, 2015. DOI: 10.1016/j.asoc.2015.09.025.
    CrossRef
  20. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient Communication protocols for wireless microsensor networks,” in Proceeding of the 33rd Hawaii International Conference on System Sciences (HICSS), 2000. DOI: 10.1109/HICSS.2000.926982.
    CrossRef
  21. A. A. Salman and T. Z. Alisa, “Improving the Network Lifetime in Wireless Sensor Network for Internet of Thing Applications,” Al-Khwarizmi Engineering Journal, vol. 15, no. 4, pp. 79-90, 2019. DOI: 10.22153/kej.2019.09.007.
    CrossRef
  22. P. Visu, T. S. Praba, N. Sivakumar, R. Srinivasan, and T. Sethukarasi, “Bio-inspired dual cluster heads optimized routing algorithm for wireless sensor networks,” Journal of Ambient Intelligence and Humanized Computing, pp. 1-9, 2020. DOI: 10.1007/s12652-019-01657-9.
    CrossRef
  23. M. C. M. Thein and T. Thein, “An energy efficient cluster-head selection for wireless sensor networks,” in Proceeding of the 2020 International Conference on Intelligent systems, modelling and simulation (ISMS), pp. 287-291, 2010. DOI: 10.1109/ISMS.2010.60.
    CrossRef
  24. K. Maraiya, K. Kant, and N. Gupta, “Efficient cluster head selection scheme for data aggregation in wireless sensor network,” International Journal of Computer Applications, vol. 23, no. 9, pp. 10-18, 2011. DOI: 10.5120/2981-3980.
    CrossRef
  25. B. Singh and D. K. Lobiyal, “A novel energy-aware cluster head selection based on particle swarm optimization for wireless sensor networks,” Human-Centric Computing Information Sciences, vol. 2, no. 1, pp. 13, 2012. DOI: 10.1186/2192-1962-2-13.
    CrossRef
  26. P. C. S. Rao, P. K. Jana, and H. Banka, “A particle swarm optimization based energy efficient cluster head selection algorithm for wireless sensor networks,” Wireless networks, vol. 23, no. 7, pp. 2005-2020, 2017. DOI: 10.1007/s11276-016-1270-7.
    CrossRef
  27. A. Shankar, N. Jaisankar, M. S. Khan, R. Patan, and B. Balamurugan, “Hybrid model for security-aware cluster head selection in wireless sensor networks,” IET Wireless Sensor Systems, vol. 9, no. 2, pp. 68-76, 2019. DOI: 10.1049/iet-wss.2018.5008.
    CrossRef
  28. F. Xiangning and S. Yulin, “Improvement on LEACH protocol of wireless sensor network,” in Proceeding of the 2007 International Conference on Sensor Technologies and Applications (SENSORCOMM), pp. 260-264, 2007. DOI: 10.1109/SENSORCOMM.2007.4394931.
    CrossRef
  29. H. Farman, B. Jan, H. Javed, N. Ahmad, J. Iqbal, M. Arshad, and S. Ali, “Multi-criteria based zone head selection in Internet of Things based wireless sensor networks,” Future Generation Computer Systems, vol. 87, pp. 364-371, 2018. DOI: 10.1016/j.future.2018.04.091.
    CrossRef
  30. T. Shah, N. Javaid and T. N. Qureshi, “Energy Efficient Sleep Awake Aware (EESAA) intelligent Sensor Network routing protocol,” in Proceeding of the 15th International Multitopic Conference (INMIC), pp. 317-322, 2012. DOI: 10.1109/INMIC.2012.6511504.
    CrossRef
JICCE
Dec 31, 2024 Vol.22 No.4, pp. 267~343

Stats or Metrics

Share this article on

  • line

Related articles in JICCE

Journal of Information and Communication Convergence Engineering Jouranl of information and
communication convergence engineering
(J. Inf. Commun. Converg. Eng.)

eISSN 2234-8883
pISSN 2234-8255