# A Proficient Bee Colony-Clustering Protocol to Prolong Lifetime of Wireless Sensor Networks

Authors: Aruna Pathak
Journal: Journal of Computer Networks and Communications
 (2020)

---

## Abstract

In wireless sensor network, replacement of node’s battery is very tough task in hostile environments. Therefore, to maximize network lifetime is the ultimate solution. Dividing the sensing region of wireless sensor network into clusters is an excellent approach to gain high energy efficiency and to enhance lifetime of the network. On the other hand, heads of the cluster need additional energy because of additional work such as obtaining data from its member nodes, aggregation of their data, and finally sending it to the base station. To enhance the lifetime of these networks, proper selection of heads plays a vital role. In this paper, we propose proficient bee colony-clustering protocol (PBC-CP) which is based on artificial bee colony algorithm. In PBC-CP approach, we have taken important factors for selection of heads such as node’s energy, degree of node, and distance from base station to node. For transmitting the data from cluster head to base station, it chooses the energy-efficient path which further minimizes the energy consumption of sensor network. Simulation experiments show the effectiveness of our proposed approach.


---

## Body

## 1. Introduction

Wireless sensor network (WSN) contains a huge number of tiny sensor nodes. These tiny nodes have sensing, computation, and wireless communications capabilities [1]. The WSN model is shown in Figure 1. The sensing area is the area where sensor nodes are deployed either t randomly or installed manually. They gather the information from the sensing area, process it, and send wirelessly either to other nodes or to an external base station (BS). BS is a centralized point of control within the network. It may be a stationary or a movable node. BS is joined to an accessible communications infrastructure or to the Internet.Figure 1
Wireless sensor network model.WSNs have found applications in business, home, medical, transport, industrial production, real-time control, defence, emergency, disaster relief management, etc. They are also used in supervising of remote or inaccessible environment applications [2, 3]. It is a very tedious job to replace or even refill the attached battery of the node in many applications, especially supervising the hostile environment. The limited energy source is the main restriction of these networks [4, 5]. The challenge of prolonging lifetime of the network has led to an increased research interest from the scientific community. As a result, researchers have proposed many techniques like duty cycling, data reduction, and topology management for enhancing the network’s lifetime. Node’s energy can be saved with duty cycling strategy that permits sensor nodes to go to sleep when they are not in use [6–10]. The data reduction method also reduces the energy consumption with the help of minimizing the quantity of information generated, processed, and transmitted [11–13]. The topology management saves the energy consumption of nodes by constructing and preserving a reduced set of nodes [14–16]. Cluster-based routing techniques seem to be most suitable for prolonging the lifetime of WSNs [17–19]. In clustering, the entire region is segregated into various groups termed as clusters and all groups are led by a particular head called as cluster head (CH). These leaders are accountable for gathering the information from its member nodes inside the clusters, then aggregate the recieved data and send it to BS by single-hop trasmission model or multi-hop trasmission model. In the single-hop trasmission model, CH sends data diresctly to BS. In the multi-hop trasmission model, CH uses some intermediate nodes, i.e., other CHs, to forward the data towards BS. Selection of the heads is an extremely vital task for enhancing the lifetime of network. Appropriate selection has a number of impacts on the energy conservation of member nodes as well as effect on the routing method.Low energy adaptive clustering hierarchy (LEACH) is a recognized clustering algorithm in WSNs [20]. CHs are selected on probability basis and rotated in each round for achieving energy balance. This protocol could gain partial success because it is entirely distributed protocol. In distributed protocol, more energy is required to transmit the packet. Clustering protocols have been also implemented with fuzzy logic [21–25]. Swarm intelligence offers proficient metaheuristic tools that can be efficiently applied in WSNs. Clustering is a well-known optimization problem. The swarm intelligence is efficiently solving this issue as surveyed in [26–30]. Ant colony optimization metaheuristic has also been applied in clustering [31]. Particle swarm optimization (PSO) algorithm is also used in clustering optimization. The protocol presented in [32] utilizes PSO for cluster head selection taking residual energy, intracluster distance, and node degree as fitness function. A hybrid centralized protocol combining harmony search algorithm (HSA) and PSO is also used for clustering in sensor networks [33]. Bee colony metaheuristic achieved success in resolving the clustering problem in WSNs [34–38].In this paper, a proficient bee colony-clustering protocol (PBC-CP) is presented. Selection of heads of cluster is an optimization problem that is NP-hard in nature. Artificial bee colony (ABC) algorithm is a proficient nature inspired algorithm that can be a good option for such NP-hard problem because of its easiness of implementation and high quality of solution. The proposed protocol gains the best result with the appropriate selection of head of cluster on the basis of node’s energy, degree of node, and distance from BS to node. The energy-efficient transmission of data from node to the base station further enhances its performance. The multihop transmission of data between adjacent CHs is followed on the basis of residual energy of nodes rather than direct transmission from CH to BS. The major contributions of the paper are as follows:(i)
Firstly, the bee colony model is presented considering its applicability in clustering WSNs.(ii)
Secondly, proficient bee colony-clustering protocol is proposed focusing on phasewise description, functional pseudocode steps, and network model.(iii)
Thirdly, the proposed clustering protocol is comparatively evaluated considering various network performance metrics.The rest of the paper is organized as follows. Related work is described in Section2. In Section 3, the details of the bee colony model and PBC-CP are presented. Section 4 discusses the experimental setup and performance evaluation of the proposed PBC-CP. Conclusion and future scope are presented in Section 5.


## 2. Related Work

Energy conservation is essential to prolong the whole network’s lifetime. Network lifetime can be defined as the time elapsed until the first node in the network depletes its energy [39, 40]. Cluster-based routing techniques seem to be most suitable for prolonging the lifetime of WSNs [17–19]. These methods also bring down energy consumption within a cluster by performing data aggregation and fusion. Low energy adaptive clustering hierarchy (LEACH) protocol [20] is a recognized clustering algorithm. However, there are certain drawbacks of this protocol. Some of them are as follows:(1)
It selects CHs based on probability which leads to two adverse consequences. First, there is a load imbalance among the CHs due to nonassurance of uniform distribution of CHs in the network. Second, low energy node may be chosen as CHs which is not capable enough to do additional work of heads such as fusing the data obtained from its members and transfer this fused data to the BS.(2)
The CHs send their data to the BS in one hop transmission. They bear the energy expenditure of long range transmission. The CH that is distant from the BS diminishes its energy faster than the other CHs in the network, which are not so distant.(3)
In each round, the protocol has to do the process for selecting the new CHs and forming new clusters. This further increases the operating cost of the set up phase.The authors in [41] tried to solve the problem of nonuniform load distribution of cluster heads. However, the scheme presented in [41] needs a node positioning system such as GPS that causes the system to be costly. In addition, GPS necessitates supplementary energy consumption; hence, it requires larger size hardware. The authors in [42] presented a new idea based on thresholds for sending node’s data. However, it is difficult to calculate the precise value of these thresholds because this protocol is not appropriate for monitoring applications where data are continuously reported to the BS. In the paper presented in [43], efficient clustering scheme is presented where the CH nominees struggle to be promoted as heads. If a node could not find another node with more residual energy than itself, it takes up the responsibility of the head. This algorithm forms clusters of varying sizes using distance from the BS as metric. Hybrid energy-efficient distributed clustering [44] decides CH based on two important parameters: residual energy of every node and intracluster communication cost. Energy-efficient hierarchical clustering protocol [45] partitions the network into hierarchy of layers. Lowest level CHs collect information from members and aggregate it. The aggregated information from the lowest layer is then sent to the heads of the subsequent layer. This method repeats itself recursively until all the data have reached the BS. Stable election protocol [46] highlights the impact of heterogeneity of nodes regarding the energy of the nodes. In clustering algorithm via waiting timer [47], protocol node degree is taken into consideration for the selection of cluster heads. Autonomous clustering via directional antenna [48] algorithm uses directional antennas to decrease the redundancy in sensing the data in sensor networks. Two-level LEACH [49] protocol has two types of CHs, namely, primary heads and secondary heads. Network is divided into outer and inner layers. Primary heads are accountable for aggregating the data in outer layer, and the secondary heads are responsible for inner layer. LEACH with distance-based thresholds [50] algorithm selects CHs with modified probability. This approach optimally balances consumption of energy among the nodes. In [51], the parameter for the selection of head is dependent on the neighbours like distance between the nodes and the number of its neighbouring nodes within communication reach. The main focus of Ying et al.’s algorithm [52] is to balance the load with uniform and nonuniform node distribution in the network. The link aware clustering method (LCM) [53] initiates a new function, called predicted transmission count (PTC), to calculate the nominee conditions. The position of the nodes, transmitted power, residual energy, and link quality are used as the parameters to derive the PTC. The PTC demonstrates the potential of an applicant for persistent transmissions to any specific neighbouring node. In energy-efficient LEACH (EE-LEACH) [54] protocol, the criteria of selection of the head is based on the function of spatial density. The protocol considers the Gaussian distribution model for deployment of sensors. Hence, it is not suited to the applications where sensor nodes cannot be deployed manually.Fuzzy logic-dependent clustering protocol is presented in [21]. LEACH-fuzzy logic [22] computes the chance for selecting the CHs. The authors in [23] used fuzzy logic to select heads based on the prediction of residual energy. The authors in [55] have taken node degree and node centrality as fuzzy variables. Initially, each node calculates its cost. In [56], the authors presented a cluster head selection algorithm using ant colony optimization to build load balanced clusters in the network. In [57], the authors presented clustering algorithm using PSO. They considered two types of nodes: normal nodes and high energy nodes. The high energy nodes act as cluster heads in the network, whereas normal sensor nodes act as members of the clusters. Another ant-based clustering (ANTCLUST) method is described in [58]. ANTCLUST protocol categorizes energy-efficient clusters by local interactions among sensor nodes. A hybrid protocol combining Harmony search algorithm (HSA) and PSO is also used for clustering optimization [33]. Honey bee optimization is also used to form clusters in WSNs [34–38]. Wireless sensor network clustering using artificial bee colony algorithm (WSNCABC) [34] uses artificial bee colony to compute the fitness of CH using the parameters such as residual energy of node and distance from BS to the nodes. However, this algorithm suffers from the high cost for the direct transmission of data from head to the BS. Bee-Sensor-C [59] forms clusters and chooses their heads when an event happens. Honey bee mating optimization which motivated the clustering algorthm is presented inBee-C [60]. In [61], route discovery problem is solved after discovering the CHs using fractional artificial bee colony (FABC) algorithm. The paper presented in [62] is based on the ABC and the genetic algorithm (GA). CHs are formulated by GA, and their members are decided by ABC. Another bee algorithm-based clustering (BeeWSN) is presented in [63], which creates clusters on the basis of energy of node, degree, speed, and direction.


## 3. Bee Colony Model

The bee colony algorithm is motivated by intelligent foraging behaviour of honey bees. Bee colony has three groups of bees, namely, worker bees, onlooker bees, and scout bees. Probable solution to the optimization problem is represented by the location of a food source, whereas the quality (fitness) of the associated solution corresponds to the nectar amount. Here, the size of the colony is the same as the number of worker bees and also equal to the onlooker bees. The initial locations of food sources are randomly generated, and every worker bee is appointed to a food source. After that, each worker bee finds a new food source in all iteration and computes its quality. Worker bee travels to the new food source if the nectar quantity of the new food source is higher than the earlier one or else it persists with the older one. This process is described by(1)Vij=xij+τxij−xkj,where τ is a random number that lies between [−1, 1], Vi is new food source, xi is current food source, xk is neighbourhood source, and j Є {1, 2, …, D} is randomly chosen index with D as dimension of the food source vector. After finishing the search procedure by worker bees, they share the information about their food source with onlooker bees. The onlooker bee then assesses the nectar information and picks a food source with a probability related to its nectar amount by(2)Pi=Fi∑l=1mFl,where Fi is the fitness value of the solution i that is proportional to the nectar amount of the food source in the location i and m is the number of food sources.All onlooker bees find a new neighbouring food source as respective selected food source and analyze its nectar amount. This process continues for a predetermined number of cycles. The food source is allocated as abandoned if any site cannot be improved further. Then, the function transforms; worker bee of that source turns into scout bee. In that location, the scout bee generates a novel solution and is given as(3)xij=xij+rand0,1xjmax−xjmin,where abandoned source is represented by xi.


### 3.1. Proficient Bee Colony-Clustering Protocol (PBC-CP)

As the sensor nodes have restricted energy source, enhancing the network lifetime still remains an important issue. This paper focuses on the need of energy-efficient strategies in wireless sensor network. We propose a proficient bee colony-clustering protocol (PBC-CP) for enhancing the wireless sensor network’s lifetime (Algorithm1). This protocol supports the supervising of a hostile environment wherever replacement of node’s battery or even recharging of their battery is not feasible. Generally, the individual nodes’ data are often correlated in case of monitoring applications. To send all nodes’ data to the BS is not an energy-efficient approach. Therefore, it is beneficial to send aggregated data that illustrate the events taking place in the region. We select clustering infrastructure as the foundation for PBC-CP due to the strongest correlation between statistics from nodes located near to each other. Not all individual nodes send their individual data directly to BS. They send their data to respective CH; then, CH aggregates the data coming from its member nodes and sends it to the BS. Therefore, only aggregated data are transmitted to BS and not individual node's data. In this way, transmission energy is saved.Honey bees are highly organized organisms capable of individual cognitive abilities and self-organization. They exhibit a combination of individual traits and social cooperation. We adopt a centralized mechanism for clustering which is managed and controlled at the base station, whereas the routing is performed in a distributed manner. Therefore, the proposed protocol systematically behaves in a semidistributed manner.Selection of heads of clusters with important parameters is extremely needed to balance the load of the network. A high energy node needs to be selected as CH, as it has to bear extra responsibility of the head. Therefore, we take residual energy into consideration. For minimizing the transfer energy, distance is also taken as important parameter. The number of connecting nodes to the CH (so-called node degree) should be taken into consideration for uniform load distribution among the heads.This algorithm works in given distinct phases. We will discuss each of them separately as follows:(a)
Network initialization: initially, the sensor nodes are deployed randomly in the sensing region. The BS transmits beacon signals to all nodes. These beacon signals contain the position information of the base station. Then, all the nodes compute their respective Euclidian distance from the base station. Furthermore, the distance between neighbouring nodes is computed on the basis of arriving strength of signals and their relative coordinates.(b)
Cluster head selection phase: selection of cluster heads depends on fitness function which is computed by bee colony algorithm.(c)
Recruiting cluster members’ phase: all the selected heads transmit an information message to the rest of the sensor nodes. This message conveys the information regarding their selection as heads. When the noncluster head nodes get this message, they have to take a decision to be a member under a particular head. This depends on the signal strength of the arrived message. Based on this decision, the non-CH nodes then report to the appropriate heads to be a member of their cluster. Furthermore, the CH creates a schedule based on time division multiple access (TDMA) and allocates it to the members of its cluster.(d)
Data gathering: in a cluster, each cluster member transmits its information to their respective heads by the TDMA-based method. We assume it is perfect transmission and no retransmission is required.(e)
Data aggregation: upon receiving the data from all the members, the CHs aggregate all incoming data together with their own data. In this way, redundancy is reduced if any.(f)
Data transmission: then, cluster heads transmit their aggregated data to the next CH or BS in an energy-efficient manner. First, CH checks for the distance between its adjacent CHs and BS. CH chooses the one which has less distance. If it is BS, then the cluster head transmits its data. But if it is another head, then the sender cluster head checks the residual energy of the adjacent heads and sends its data to the higher one.(g)
Rotation of cluster head: energy of CH drains out faster because they are involved in carrying out additional tasks such as data gathering from member nodes, aggregation of data, and data relaying, compared to other sensor nodes. Therefore, there is a need to rotate their role. Process of reelection is triggered after each round of data transmission for balancing the energy consumption of all sensor nodes. However, the reelection will be done based on fitness function.The fitness function, represented asfi is specified as follows:(4)fi=optimizekRei+ND+1−k1Eui,b,where k is the scaling factor; residual energy of node (Re) is the ratio of remaining energy to the initial energy in the node; node degree (ND) is the number of connecting nodes to a particular node within its transmission range; and Euclidean distance from node i to base station is represented by Euib.Algorithm 1: Pseudocode of clustering.
Begin
//Initialization//
(1)
Base station broadcasts beacon
(2)
All nodes calculate Euclidian distance
//Cluster head selection phase//
(3)
Generate the initial population
(4)
Set cycle to 1
(5)
Repeat
(6)
For each sensor
(7)
Launch artificial bee colony algorithm
(8)
Select CHs
(9)
Cycle = cycle + 1
(10)
Until Maximum Cycle Number
(11)
End For
//cluster-member recruitment//
(12)
Set CH cycle to 1
(13)
Repeat
(14)
For each CH
(15)
Set Hop Cycle to 1
(16)
Repeat
(17)
For each CH broadcast REQUEST message;
(18)
If (non-CH node neighbours receive REQUEST message)
(19)
Then, non-CH node neighbours send ACCEPTED message to CH;
(20)
End if
(21)
Hop Cycle = Hop Cycle + 1
(22)
Until Maximum Hop Cycle Number
(23)
End For
(24)
CH cycle = CH cycle + 1
(25)
Until Maximum CH cycle Number
(26)
End For
End


### 3.2. Network Model

In this paper, we use the radio propagation model specified in [41] as shown in Figure 2. In a radio model, the signal received at the receiver transmitted from the transmitter with a distance d is given by(5)Pr=PtGtGrλ24π2dβLoss,where Gr is the receiver antenna gain, Gt is the transmitter antenna gain, λ is the carrier wavelength, β is the propagation loss factor, and any extra loss in transmitting the packet is represented by Loss.Figure 2
Radio hardware model.(6)
E
T
=
l
E
e
+
l
E
f
s
d
2
,
if
d
<
d
o
,
l
E
e
+
l
E
t
g
d
4
,
if
d
≥
d
o
,Radio propagation models are free space model and two-ray ground propagation model. In the free space propagation model, the propagation loss of transmitting power is inversely proportional to square of the distance between transmitter and receiver. In case of the two-ray ground propagation model, the propagation loss of transmitting power is inversely proportional to fourth power of the distance between transmitter (Tx) and receiver (Rx). The energy consumption to transmitl-bit packet from Tx to Rx at the distance d is given bywhere Ee is considered as the energy/bit absorbed in the transceiver circuitry and second factor lEfsd2 or lEfsd4 is considered as the energy/bit absorbed in the power amplifier. The crossover distance do can be obtained from(7)do=EfsEtg.If the value ofdo is greater than the value of distance between Tx and Rx, then the free space model is utilized; otherwise, the two-ray ground model is taken into unt. Energy consumption for receiving a l-bits message [41] is(8)ER=lEe.


## 3.1. Proficient Bee Colony-Clustering Protocol (PBC-CP)

As the sensor nodes have restricted energy source, enhancing the network lifetime still remains an important issue. This paper focuses on the need of energy-efficient strategies in wireless sensor network. We propose a proficient bee colony-clustering protocol (PBC-CP) for enhancing the wireless sensor network’s lifetime (Algorithm1). This protocol supports the supervising of a hostile environment wherever replacement of node’s battery or even recharging of their battery is not feasible. Generally, the individual nodes’ data are often correlated in case of monitoring applications. To send all nodes’ data to the BS is not an energy-efficient approach. Therefore, it is beneficial to send aggregated data that illustrate the events taking place in the region. We select clustering infrastructure as the foundation for PBC-CP due to the strongest correlation between statistics from nodes located near to each other. Not all individual nodes send their individual data directly to BS. They send their data to respective CH; then, CH aggregates the data coming from its member nodes and sends it to the BS. Therefore, only aggregated data are transmitted to BS and not individual node's data. In this way, transmission energy is saved.Honey bees are highly organized organisms capable of individual cognitive abilities and self-organization. They exhibit a combination of individual traits and social cooperation. We adopt a centralized mechanism for clustering which is managed and controlled at the base station, whereas the routing is performed in a distributed manner. Therefore, the proposed protocol systematically behaves in a semidistributed manner.Selection of heads of clusters with important parameters is extremely needed to balance the load of the network. A high energy node needs to be selected as CH, as it has to bear extra responsibility of the head. Therefore, we take residual energy into consideration. For minimizing the transfer energy, distance is also taken as important parameter. The number of connecting nodes to the CH (so-called node degree) should be taken into consideration for uniform load distribution among the heads.This algorithm works in given distinct phases. We will discuss each of them separately as follows:(a)
Network initialization: initially, the sensor nodes are deployed randomly in the sensing region. The BS transmits beacon signals to all nodes. These beacon signals contain the position information of the base station. Then, all the nodes compute their respective Euclidian distance from the base station. Furthermore, the distance between neighbouring nodes is computed on the basis of arriving strength of signals and their relative coordinates.(b)
Cluster head selection phase: selection of cluster heads depends on fitness function which is computed by bee colony algorithm.(c)
Recruiting cluster members’ phase: all the selected heads transmit an information message to the rest of the sensor nodes. This message conveys the information regarding their selection as heads. When the noncluster head nodes get this message, they have to take a decision to be a member under a particular head. This depends on the signal strength of the arrived message. Based on this decision, the non-CH nodes then report to the appropriate heads to be a member of their cluster. Furthermore, the CH creates a schedule based on time division multiple access (TDMA) and allocates it to the members of its cluster.(d)
Data gathering: in a cluster, each cluster member transmits its information to their respective heads by the TDMA-based method. We assume it is perfect transmission and no retransmission is required.(e)
Data aggregation: upon receiving the data from all the members, the CHs aggregate all incoming data together with their own data. In this way, redundancy is reduced if any.(f)
Data transmission: then, cluster heads transmit their aggregated data to the next CH or BS in an energy-efficient manner. First, CH checks for the distance between its adjacent CHs and BS. CH chooses the one which has less distance. If it is BS, then the cluster head transmits its data. But if it is another head, then the sender cluster head checks the residual energy of the adjacent heads and sends its data to the higher one.(g)
Rotation of cluster head: energy of CH drains out faster because they are involved in carrying out additional tasks such as data gathering from member nodes, aggregation of data, and data relaying, compared to other sensor nodes. Therefore, there is a need to rotate their role. Process of reelection is triggered after each round of data transmission for balancing the energy consumption of all sensor nodes. However, the reelection will be done based on fitness function.The fitness function, represented asfi is specified as follows:(4)fi=optimizekRei+ND+1−k1Eui,b,where k is the scaling factor; residual energy of node (Re) is the ratio of remaining energy to the initial energy in the node; node degree (ND) is the number of connecting nodes to a particular node within its transmission range; and Euclidean distance from node i to base station is represented by Euib.Algorithm 1: Pseudocode of clustering.
Begin
//Initialization//
(1)
Base station broadcasts beacon
(2)
All nodes calculate Euclidian distance
//Cluster head selection phase//
(3)
Generate the initial population
(4)
Set cycle to 1
(5)
Repeat
(6)
For each sensor
(7)
Launch artificial bee colony algorithm
(8)
Select CHs
(9)
Cycle = cycle + 1
(10)
Until Maximum Cycle Number
(11)
End For
//cluster-member recruitment//
(12)
Set CH cycle to 1
(13)
Repeat
(14)
For each CH
(15)
Set Hop Cycle to 1
(16)
Repeat
(17)
For each CH broadcast REQUEST message;
(18)
If (non-CH node neighbours receive REQUEST message)
(19)
Then, non-CH node neighbours send ACCEPTED message to CH;
(20)
End if
(21)
Hop Cycle = Hop Cycle + 1
(22)
Until Maximum Hop Cycle Number
(23)
End For
(24)
CH cycle = CH cycle + 1
(25)
Until Maximum CH cycle Number
(26)
End For
End


## 3.2. Network Model

In this paper, we use the radio propagation model specified in [41] as shown in Figure 2. In a radio model, the signal received at the receiver transmitted from the transmitter with a distance d is given by(5)Pr=PtGtGrλ24π2dβLoss,where Gr is the receiver antenna gain, Gt is the transmitter antenna gain, λ is the carrier wavelength, β is the propagation loss factor, and any extra loss in transmitting the packet is represented by Loss.Figure 2
Radio hardware model.(6)
E
T
=
l
E
e
+
l
E
f
s
d
2
,
if
d
<
d
o
,
l
E
e
+
l
E
t
g
d
4
,
if
d
≥
d
o
,Radio propagation models are free space model and two-ray ground propagation model. In the free space propagation model, the propagation loss of transmitting power is inversely proportional to square of the distance between transmitter and receiver. In case of the two-ray ground propagation model, the propagation loss of transmitting power is inversely proportional to fourth power of the distance between transmitter (Tx) and receiver (Rx). The energy consumption to transmitl-bit packet from Tx to Rx at the distance d is given bywhere Ee is considered as the energy/bit absorbed in the transceiver circuitry and second factor lEfsd2 or lEfsd4 is considered as the energy/bit absorbed in the power amplifier. The crossover distance do can be obtained from(7)do=EfsEtg.If the value ofdo is greater than the value of distance between Tx and Rx, then the free space model is utilized; otherwise, the two-ray ground model is taken into unt. Energy consumption for receiving a l-bits message [41] is(8)ER=lEe.


## 4. Experimental Setup

All experiments were implemented in MATLAB 2009a and run on Windows 7 with Intel (R) Core (TM) 2 Duo T6570 CPU@2.10 GHz. We assume that all sensor nodes have same initial energy and the capabilities of all nodes such as processing and communicating are similar. They are not equipped with global positioning system, i.e., they do not have capable antennas with moving capabilities. We also assume that base station is fixed and not limited in terms of energy, memory, and computational power. The LEACH protocol is considered as based for comparative analysis of experimental results focusing on clustering centric benefits in the integration with the protocols. The required simulation parameters for various algorithms are shown in Table1 [20, 33–35].Table 1
Parameters of PBC-CP
Parameter
Value
Sensor field area (X ∗ Y) (m)
(100 ∗ 200)
Base station position (x, y)
(50, 150)
Number of nodes (s)
100
Initial energy of a node (Eint) (J)
0.5
Data packet length (L) (bits)
4096
Energy/bit absorbed in the transceiver circuitryEe (nJ/bit)
70
Energy/bit absorbed in the power amplifier (Efs and Etg) (pJ/bit/m2)
120 & 0.0013
Energy data aggregation (Eg) (nJ)
5
Number of rounds (Rmax)
3000
Colony size (CS)
50
Maximum cycle number (MCN)
200
Dimension of the food source vector (D)
20


### 4.1. Performance Evaluation

The performance of our model is estimated on residual energy (RE) of the network, throughput (Thr) of the network, the number of dead nodes (NND), and the number of alive nodes (NAN) for different rounds of data transfer.We compare the results of PBC-CP with three standard protocols, namely, LEACH [20], PSO [32], and HSA-PSO [33] for alive nodes, dead nodes, residual energy, and throughput in different rounds as shown in Figure 3. It is evident from Figure 3(a) that the performance of PBC-CP in terms of number of alive nodes is better than other protocols. The alive nodes start dropping in LEACH, PSO, and HSA-PSO after 255 rounds, 1300 rounds, and 1700 rounds, respectively, while alive nodes in PBC-CP start dropping after 1800 rounds. Next, we compare the results of dead nodes in the network for different rounds as shown in Figure 3(b). In LEACH, the first node death occurs near 206 rounds, the reason being probabilistic selection of CHs. HSA-PSO and PSO give improved performance than LEACH. The first dead node in PSO occurs close to 1238 rounds, whereas in HSA-PSO, first node is dead around 1632 rounds. It is now seen from the results that PBC-CP outperforms as the first node is dead here around 1730 rounds.Figure 3
(a) Number of alive nodes vs number of rounds in different protocols. (b) Number of dead nodes vs number of rounds in different protocols. (c) Comparative analysis of PBC-CP in terms of residual energy with different rounds. (d) Comparative analysis of PBC-CP in terms of throughput with different rounds.
(a)
(b)
(c)
(d)From Figure3(c), it is apparent that the PBC-CP demonstrates preeminent results for energy optimization in clustered WSN. The value of RE in LEACH algorithm falls to zero at an early stage (around 650 rounds). It is due to the reason that the heads are selected randomly in the algorithm. PSO algorithm lasts only for around 1400 rounds due to its dynamic capability while HSA-PSO algorithm lasts for almost 1753 rounds due to high exploring efficiency of HSA with the dynamic nature of PSO. In PBC-CP, the value of RE drops to zero after approximately 2500 rounds because of the use of fitness function for the selection of CHs.The throughput (Thr) of the wireless sensor network for LEACH, PSO, HSA-PSO, and PBC-CP is shown in Figure 3(d). Thr of the network improves as the number of alive node in network enhances. All algorithms have maximum value of Thr equivalent to 0.41 Mbps. Nevertheless, when the number of rounds increases, the value of Thr reduces. At 380 rounds, the value of Thr in LEACH is decreased by 52.27% as compared with the other approaches when value of Thr is equivalent to 0.2 Mbps. The value of Thr in PSO is maintained to its maximum value by 1100 rounds, and in HSA-PSO, it is maintained to its maximum value till 1700 rounds. In contrast, the PBC-CP algorithm maintains the value of Thr of 0.41 Mbps for more than 2500 rounds.


## 4.1. Performance Evaluation

The performance of our model is estimated on residual energy (RE) of the network, throughput (Thr) of the network, the number of dead nodes (NND), and the number of alive nodes (NAN) for different rounds of data transfer.We compare the results of PBC-CP with three standard protocols, namely, LEACH [20], PSO [32], and HSA-PSO [33] for alive nodes, dead nodes, residual energy, and throughput in different rounds as shown in Figure 3. It is evident from Figure 3(a) that the performance of PBC-CP in terms of number of alive nodes is better than other protocols. The alive nodes start dropping in LEACH, PSO, and HSA-PSO after 255 rounds, 1300 rounds, and 1700 rounds, respectively, while alive nodes in PBC-CP start dropping after 1800 rounds. Next, we compare the results of dead nodes in the network for different rounds as shown in Figure 3(b). In LEACH, the first node death occurs near 206 rounds, the reason being probabilistic selection of CHs. HSA-PSO and PSO give improved performance than LEACH. The first dead node in PSO occurs close to 1238 rounds, whereas in HSA-PSO, first node is dead around 1632 rounds. It is now seen from the results that PBC-CP outperforms as the first node is dead here around 1730 rounds.Figure 3
(a) Number of alive nodes vs number of rounds in different protocols. (b) Number of dead nodes vs number of rounds in different protocols. (c) Comparative analysis of PBC-CP in terms of residual energy with different rounds. (d) Comparative analysis of PBC-CP in terms of throughput with different rounds.
(a)
(b)
(c)
(d)From Figure3(c), it is apparent that the PBC-CP demonstrates preeminent results for energy optimization in clustered WSN. The value of RE in LEACH algorithm falls to zero at an early stage (around 650 rounds). It is due to the reason that the heads are selected randomly in the algorithm. PSO algorithm lasts only for around 1400 rounds due to its dynamic capability while HSA-PSO algorithm lasts for almost 1753 rounds due to high exploring efficiency of HSA with the dynamic nature of PSO. In PBC-CP, the value of RE drops to zero after approximately 2500 rounds because of the use of fitness function for the selection of CHs.The throughput (Thr) of the wireless sensor network for LEACH, PSO, HSA-PSO, and PBC-CP is shown in Figure 3(d). Thr of the network improves as the number of alive node in network enhances. All algorithms have maximum value of Thr equivalent to 0.41 Mbps. Nevertheless, when the number of rounds increases, the value of Thr reduces. At 380 rounds, the value of Thr in LEACH is decreased by 52.27% as compared with the other approaches when value of Thr is equivalent to 0.2 Mbps. The value of Thr in PSO is maintained to its maximum value by 1100 rounds, and in HSA-PSO, it is maintained to its maximum value till 1700 rounds. In contrast, the PBC-CP algorithm maintains the value of Thr of 0.41 Mbps for more than 2500 rounds.


## 5. Conclusion and Future Work

In this paper, we have presented a proficient bee colony-clustering protocol (PBC-CP) inspired from the foraging principles of honey bees for wireless sensor networks, where the objective is to extend network’s lifetime. We select heads of the clusters by exploiting the fast searching features of the bee colony optimization algorithm and transfer data from cluster heads to the base station by energy-efficient path. The simulation results indicate that the PBC-CP algorithm outperforms LEACH, PSO, and HSA-PSO. While PBC-CP is an efficient protocol, there may be some more areas for the improvement in this protocol to make it more extensively applicable. In the present implementation of PBC-CP, nodes regularly send their data to their respective heads in their assigned slot. Nodes may only send their data after they notice an event. We have tested PBC-CP in static wireless networks. We may also investigate clustering in mobile sensor networks.



---

*Source: 1236187-2020-02-25.xml*