# Hybrid Swarm Intelligence Energy Efficient Clustered Routing Algorithm for Wireless Sensor Networks

Authors: Rajeev Kumar; Dilip Kumar
Journal: Journal of Sensors
 (2016)

---

## Abstract

Currently, wireless sensor networks (WSNs) are used in many applications, namely, environment monitoring, disaster management, industrial automation, and medical electronics. Sensor nodes carry many limitations like low battery life, small memory space, and limited computing capability. To create a wireless sensor network more energy efficient, swarm intelligence technique has been applied to resolve many optimization issues in WSNs. In many existing clustering techniques an artificial bee colony (ABC) algorithm is utilized to collect information from the field periodically. Nevertheless, in the event based applications, an ant colony optimization (ACO) is a good solution to enhance the network lifespan. In this paper, we combine both algorithms (i.e., ABC and ACO) and propose a new hybrid ABCACO algorithm to solve a Nondeterministic Polynomial (NP) hard and finite problem of WSNs. ABCACO algorithm is divided into three main parts: (i) selection of optimal number of subregions and further subregion parts, (ii) cluster head selection using ABC algorithm, and (iii) efficient data transmission using ACO algorithm. We use a hierarchical clustering technique for data transmission; the data is transmitted from member nodes to the subcluster heads and then from subcluster heads to the elected cluster heads based on some threshold value. Cluster heads use an ACO algorithm to discover the best route for data transmission to the base station (BS). The proposed approach is very useful in designing the framework for forest fire detection and monitoring. The simulation results show that the ABCACO algorithm enhances the stability period by 60% and also improves the goodput by 31% against LEACH and WSNCABC, respectively.


---

## Body

## 1. Introduction

Wireless sensor networks (WSNs) consist of various sensor nodes, which have the capability to sense, process, compute, and communicate [1]. A large number of sensor nodes and their different applications induce various hindrances during implementation in sensor networks. Other than implementation, certain areas, namely, accessing of information, data collection, and storage, are still a dilemma. Various specifications of sensor nodes like their size, computational ability, cost, hardware constraint, energy efficiency, and other design parameters make the implementation of the sensor network a difficult task. In present scenario optimization issues become more tedious. An energy specification of sensor networks becomes intolerable in a huge environment which in turn demands a concern related to various optimization parameters. That is why we formulated to assess the potency of various evolutionary algorithms to enhance the network lifespan with energy as a constraint duly concentrating on the various transmission strategies [2]. During a couple of years, a number of evolutionary algorithms have been introduced for evaluation of problems to get the best possible result out of the various solutions. Many of the proposed algorithms concentrate on the principle of the population based heuristic search methods, for solving general optimization problems. A swarm intelligent algorithm works on the principle behavior of flying birds in order to get to the resources being implemented in LEACH [3] protocol. In these protocols, the swarm intelligent algorithm is implemented to form various clusters which in turn help in defining their respective CHs while designing a WSN with the same conditions as in real time network. The swarm based algorithm produces desirable results. Network lifespan can be further enhanced by implementing various best possible route detection techniques. Artificial bee colony (ABC) algorithm is a new upcoming approach whose working totally resembles that of swarm based optimization techniques while monitoring the clusters in WSN.The most unavoidable hindrances faced in the sensor networks are about getting the best possible routes for data transmission up to the BS. In general WSN node operates in a multinode pattern; immense algorithms have been introduced for routing data to reach the destination. In [4] some notable routing techniques in WSN desire to use ant as a moving agent while discovering the route in order to discover the best possible path for data transmission in WSN. In this research, we prioritize the multiple nodes grounded in their respective power, competency, and there approaching nature to route the data through the best path. In recent years, a new picture by applying routing based protocols on the movement of the swarms in order to depict the best possible path for delivering the acquired data through the selected path was introduced. Algorithm working with nodes should be more energy saver as well as fast enough to acquire and transmit the data. Ant colony optimization (ACO), designed in such a way so that ants behaviors for finding food sources can be depicted easily, acts as a valuable solution for different route detection, although this technique is not favourable in governing applications which needs timely data transfer [5].For upgrading the execution of the network, clustering mechanisms have been connected to networks with hierarchical structures while minimizing the fundamental energy utilization [6, 7]. Clustering is a technique to group number of nodes in areas in a densely employed wide-scale network [8]. One of the nodes will be elected as a cluster head (CH) among other nodes called cluster members of their respective cluster. In clustering, randomly deployed nodes join in carrying out the job. Here, the signal to the nodes is advertised with nodes. Signals are received by all sensor nodes from distinct CHs and nodes give response with their node-id to CH with strength and this formation of clusters takes place. Without CH, for intracluster routing, a proactive strategy is utilized and for intercluster routing, a reactive strategy is utilized. Clustering has various challenges in deployment such as ensuring connectivity between nodes, determining optimal cluster sizes [9, 10], and optimizing clustering structures dynamically on the basis of the status of cluster members. For a hierarchical routing or network administration, convention can be better executed with CHs. In [11, 12], the authors have studied the influence of cluster based hierarchical routing that is a quite famous approach with some benefits related to well organized communication and scalability. For attaining power efficient routing, the concept of hierarchical routing is used. Using two-tier clusters for sending information to BS has the profit of shorter transmit separations for nodes. Only some nodes are essential to send data to BS at far distances and it is valid in those networks where there is a high density of nods. Through hierarchical level cluster can communicate with other clusters or with external network at the same time [13]. In this paper, we have introduced three-level hierarchy. The first level is known as CH, the second level is known as subcluster head (SCH), and the third level is denoted by member node. Partial local computation is introduced in each and every SCH at the second stage and the local computation at CH where information is sent to BS directly. This approach is used as regions and subregions and significant progress is obtained. The objectives of the subregions and subregion parts are formulated as in(1)Maximum⁡TSSC=Minimum⁡∑i,j∈TeeETee,where TSSC is the work time of the square shaped cluster. ETee is the total energy expenditure in a cluster.The rest of the work is done in seven sections. In Section2, we discuss the related work. In Section 3, we define the radio model for wireless sensor network. Section 4 describes the squared optimization problem for CH and SCH. Section 5 exhibits the details of ABC, ACO, and the proposed approach ABCACO. In Section 6, the performances of ABCACO approach are evaluated via a number of experiments and we compare its simulation results with both WSNCABC and LEACH. Finally, Section 7 concludes the paper and suggests the further work to be carried out.


## 2. Related Works

In literature, various protocols have been considered with the idea of enhancing the lifespan of sensor network by the appropriation of cluster based sensor network structural engineering. A well-known protocol known as LEACH (Low Energy Adaptive Clustering Hierarchy) [3] is based on distributed clustering approach. It prolongs the network lifespan by reducing the power dissipation. No wastage of power for electing a node as a CH is the advantage of LEACH protocol. The CH selection process is primarily based upon the inducted energy level of each sensor node that is the disadvantage of LEACH. So a sensor node that has low power has more chances of becoming a CH than the one that has more power which leads to the dead state of the entire cluster. The second disadvantage is the presence of more overheads in the development of the dynamic cluster. In [9], the results have demonstrated that LEACH-C outperforms LEACH because of the improvement in cluster formation by the BS. Furthermore, the fraction of CHs in each iteration of LEACH-C is equivalent to the craved optimum number. An additional clustering algorithm that enhances the lifespan of network has been presented in [14] known as HEED (Hybrid Energy Efficient Distributed Clustering). The CH election process in HEED is intentionally based upon the parameters, that is, residual energy of the sensor nodes, and in addition to this cost of communication within the clusters is also considered by the authors for increasing power efficiency and further enhancing lifespan of network. This protocol maintains the CH for a fixed number of cycles. Related to LEACH, significant overhead is imposed by the sensor network by clustering in each round. Noticeable power dissipation is imposed by this overhead that leads to decrease in lifespan of the network. As HEED requires various iterations for the formation of clusters, it suffers from a subsequent overhead as at each iteration the broadcasting of a lot of packets takes place. Power Efficient Gathering in Sensor Information Systems (PEGASIS) has been developed in [15] for prolonging the network lifespan. PEGASIS outperforms LEACH in terms of power dissipation for extending the network lifespan. It is not a clustering approach. It is a chain based protocol due to which all nodes interact with one another and can transmit data to a CH. Sensor nodes die in arbitrary locations in PEGASIS as a selection of CHs has been done without concerning the overall lifespan of each sensor node. Delay in transmitting time bounds data over a chain of sensor nodes is the main disadvantage of PEGASIS. Optimal routing may not be present as it is a greedy algorithm that selects the shortest path rather than the optimal one and there is just simply CH that may turn out to be a bottleneck when a lot of data is gathered at this sensor node. In [4] it is suggested in the literature that various power conserving methods are presented that tend to prolong the lifespan of the network. The author explained a converged, power efficient cluster based protocol that is considered to prolong the lifespan of the network using a swarm intelligence mechanism, called artificial bee colony (ABC). In [16] the authors introduce the EEABR protocol, which is in view of the ACO heuristic centred on the standard WSN requirements. They propose two redesigns in the AntNet routing algorithm for reducing the memory utilized as a piece of sensor nodes as well as dealing with the energy constraints of the routes discovered by the mobile agents. In this paper the author has presented the enacted energy level of sensor nodes and their routing distance with the ACO probability equation by adjusting the routing conventions in WSN. Likewise the algorithm considered data aggregation yet did not consider the adjusted utilization of energy in the entire networks. The protocol exhibited in [17] introduced improved information driven routing protocol of WSN based upon the ant including the search ant, so as to provide past data to the neighbourhood ants. It described a “retry” principle so that the protocol does not come to a halt. In this the communication cost known as the Euclidean distance between the two vertexes is considered such that they can correspond with one another specifically. Taking into account this expense, it builds a weighted graph by consuming three types of ants, namely, chasing ants, foragers, and trailing ants. Chasing ants are specifically used to make the forward ants searching the sink (the destination node) in a scalable manner. In the proposed protocol, the source nodes were only 2.5% of the total nodes. No framework lifespan utilizing this algorithm was as a part of the paper. In [4] the authors have met the prerequisite of WSN by adjusting ant colony and presenting information on a chip based routing component for streamlining proficiency; however it has been connected to the planar routing. In [18] the authors are concerned with the problem of multiagent path planning in discrete-time pursuit-evasion games (PEGs). They proposed the improved strategy, that is, I-ACO algorithms, which include the designed direction factor, blocking rule, and smoothening rule. Other papers, for example, [19, 20], have used ACO techniques to handle various routing issues in WSN but none of them have outperformed while considering cluster based ad hoc sensor networks. In this paper, we have applied the ABC and ACO to propose a cluster based routing plan for WSNs.The fundamental thought in the proposed algorithm (Algorithm1) is the choice of a CH and SCH that can reduce the distance between themselves and their neighbours within a cluster. Each node is installed in such way that it has equal distance from each of its neighbouring nodes and this distance is the same for every node of the network. The square shaped sensing field is divided into subregions and then subregions parts based on optimal clustering mechanism. Finally, among the divided regions, the CH is selected using the ABC algorithm and then CHs use ACO algorithm, which is an organically propelled standard for improved methodology, to discover a best route to the BS.Algorithm 1:Pseudocode of the proposed algorithm.
Assumptions:
(i)N nodes are uniformly dispersed within a square field.
(ii) Each node has unique ID. Nodes located in the event area are grouped into one cluster.
(iii) Nodes are location-aware and quasi-stationary.
(iv) A sensor can compute the approximate distance based on the received signal strength (RSS),
and the radio power can be controlled
(v) A fixed base station can be located inside or outside the network sensor fields.
(vi) All nodes are capable of operating in cluster head mode and sensing mode.
(vii) Data fusion is used to reduce the total data message sent.
Variables:
(i)D is the dimension of the squared region.
(ii)Nodes are the number of nodes in the (D×D) region.
(iii)E0 is the Initial energy of the nodes.
(iv)Alive_Nodes is the number of nodes left after the successful execution of previous round.
(v)d is the distance between the nodes.
(vi)d0 is the threshold distance value between the free space and multipath fading model.
(vii)єmp is the amplification energy.
(viii)єfs is the free space energy consumption.
(ix)N is the set of sensor nodes.
(x)Nodes_C is the nodes in sub-region which is under consideration for CH selection.
(xi)Energy is the residual energy of the nodes.
(xii)vij is list of possible nodes positions to become a sub-region CH computed using ABC algorithm.
(xiii)CH_s is the list of CHs in the round.
//Set up phase
Step  1. Take a region of D×D (m2) with N number of nodes.
Step  2.  Initialize the Nodes (N) with initial Energy E0
Step  3.For each round Until Alive_Nodes > 0, then
Repeat Step 4 to Step 16
function Alive_Nodes (Nodes)
Total_Alive  := 0
for each node i := 1 to length (Nodes) do
ifEnergy [Nodes[i]] > 0 then
NODE_STATUS[i]  := 1
Total_Alive  := Total_Alive + 1
Else
NODE_STATUS[i]  := 0
end if
end for
return Total_Alive Returns Alive node count
endfunction
Step  4. Compute the distance of each node from other nodes and the BS by using Euclidian distance formula.
dist⁡=x1-x22+y1-y22
wherex1 and x2 are x-coordinates of nodes and y1 and y2 are y-coordinates of the nodes.
Step  5. Compute Kopt for optimal number of sub_regions that can be formed in given region D×D (m2)
and divide the given regionD×D (m2) into k sub_regions based on Kopt value.
function Region Optimum Value {NODES}
Kopt  := Null
ifBS.location is “Outside” then
if  d≤d0  then
Kopt=4N5+12K/D+12K2/D2
else
Kopt=60Nϵfs7D2+120L2+180L4/D2ϵmp
endif
endif
return  Kopt
endfunction
Step  6. For each sub_region repeat Steps 7 and 8.
Step  7. Select CH, for each sub_region using ABC algorithm using function ABC_Cluster_HeadEnergy, Nodes_C,
Which accepts two arguments, (1) Nodes residual Energy and (2) Nodes in that particular sub_region.
function ABC_Cluster_HeadEnergy, Nodes_C
Fitness_to_be_CH  := Null
for each node i := 1 to length(Nodes_C) do
Fitness_to_be_CH  := Fitness(Nodes_C[i] × ID, BS)
end for
Threshold_Energy  := NULL
Residual_Energy  := NULL
for each node i := 1 to length(Nodes_C) do
Residual_Energy := Residual_Energy +
Energy(Nodes_C[i])
end for
Threshhold_Energy=Residual_Energylength(Nodes_C)
for each node i := 1 to length(Nodes_C) do
Probability_Nodes_to_CH[i]=Fitness_to_be_CH[i]∑j=1length(Nodes_C)Fitness to be CH[j]
end for
Threshold_Probability := 1/length(Nodes_C)
// New Position Calculating
for each node i := 1 to length(Nodes_C) do
if  Probability_Nodes_to_CH[i] >
Threshold_Probabilitythen
rand_ABC:= Upper_Bound_ABC +
(Lower_Bound_ABC-Upper_Bound_ABC) × rand
vij := Fitness_Node_CH(Prev_CH_Node) − rand_ABC × (Fitness_Node_CH(Prev_CH_Node) −
Fitness_Node_CH (Nodes_C[i]))
end if
end for
Node CH Id:= Nodes C_max(vij)
endfunction
Step  8. For each sub_region, repeat Steps 9 and 10.
Step  9. Divide the sub_region into sub_region_parts based on  Kopt value for this sub region.
function Sub_Region_Optimum_ValueNODES
Kopt := Null
if CH.location is at “Centre” then
if  d≤d0  then
Kopt=2N
else
Kopt=60Nϵfs7D2ϵmp
endif
else if CH.location is at “Corner” then
if  d≤d0  then
Kopt=N2
else
Kopt=15Nϵfs28D2ϵmp
endif
else if CH.location is at “mid-point of the bottom side” then
if  d≤d0  then
Kopt=4N5
else
Kopt=240Nϵfs193D2ϵmp
endif
end if
Endfunction
Step  10. Select the sub_cluster_head (SCH) for each sub_region_parts based on given fitness formula
(i.e residual energy and distance to sub region CH).
[Each SCH is responsible to communicate with CH of that sub region]
Step  11. Select optimal path for CH of all sub regions for data transmit to BS using ACO algorithm.
function ACO_Optimal_PathCH_s, BS
for each node i:=1 to length(CH_s) do
Fitness:= Fitness(CH_s[i], BS)
end for
for each node i:=1 to length(CH_s) do
for each node j:=1 to length(CH_s) do
if  i≠j  then
Probk(p,q)=τp,qα.ηp,qβ∑q∈Rqτp,qα.ηp,qβ,ifq∉Mk
end if
end for
end for
endfunction
// Steady state phase
Step  12. Nodes wake up and sensed data.
Step  13. Node forwards sensed data to SCH using TDMA with (2).
Step  14. SCH receives sensed data from nodes by using (3) and transmits aggregated data to CH using CDMA with (2).
Step  15. CH aggregates the data receivsed from all SCHs and send to BS using CDMA through a next hop receiver
(i.e CH of other sub region) with (2).
Step  16. For each region,
if Node_Energy<Eth then go to Step  3.


## 3. Radio Energy Model

Our energy model for the WSN is taking into consideration the first-order radio model as reported in [9]. In this first-order radio model, a radio energy disseminated model is proposed in which transmitter chunks the energy while operating the radio electronics and power amplifier; on the other hand recipient disseminates the energy while initiating the radio electronics. The first-order model uses both free space and multipath fading models considering the distance between the sender and the receiver. If the considered distance between the transmitter and receiver is less than d0, then the free space model is implemented; else multipath fading will be applicable.With a specific end goal to send l-bit message over the network both the transmitting and receiving energies will be calculated by the following equations, respectively:(2)ETransl,d=ETrans-elecl+ETrans-ampl,d=lEelec+lEfsd2,d≤d0lEelec+lEmpd4,d>d0,(3)ERecel,d=ERece-elecl=lEelec.The CHs of the cluster expend their energy at three levels, that is, receiving energy to get the signals from their member nodes, aggregation energy to aggregate the signals, and transmitting energy to transmit the signals to other CHs. Additionally, we accept that distance between transmitter and recipient is more prominent than threshold. So energy utilization of CH for a cycle is given by(4)ECH/cycle=lERece-elecNk-1+NklEDataAgr+lETrans-elec+lϵampdtoBSn.And member nodes of cluster transmit their acquired signals to their respective CHs. So the energy utilization by the member node is given by(5)Emem-node=lEelec+lϵfsdtoCHn,where dtoCH is the average length of the member node to their CH.


## 4. Squared Optimization Problem

In [3] the authors show that if the cluster formation is not done in a scalable manner, then the total energy cost of the entire network is maximized at an exponential rate; either the number of clusters is more as compared to the optimal number (Kopt) of clusters or the number of clusters is less than Kopt. If there are a smaller number of clusters, then the considerable number of CHs has to send their information far, which leads to a higher global energy cost in the system. Furthermore, if there are a bigger number of clusters, then less data aggregation is done locally and for monitoring the entire sensor field, a large number of transmissions are needed. When the uniform distribution of sensor nodes over the sensing field is done, the optimal probability of a sensor node being selected as a CH as a function of spatial density has been discussed either by simulation [8, 9] or analytically [21, 22]. This is a feasible clustering in the sense that well distribution of energy utilization is done by overall nodes and the total energy utilization is less. This optimal clustering highly relies on the energy model. Similar energy model and analysis are used for the purpose of the study as presented in [14] and determination of the optimal value of being Kopt done analytically. Cluster arrangement algorithm guarantees that the acknowledged number of clusters per cycle is equivalent to Kopt. Here, sensor area is supposed to be a square shaped with an area of A. It is required by the optimization problem to calculate the predicted squared distance between member nodes and their CH [9, 23]. For extracting a closed-form expression for Kopt accordingly, various special cases are well thought out for obtaining an explicit parametric formula [24].Suppose the sensing region is a squared shape area A over whichN number of nodes are uniformly deployed. If Kopt clusters are present, then on an average N/Kopt node per cluster, having single CH and rest cluster member nodes will exist. While receiving signals from the sensors, aggregating signals, and sending aggregated data to the BS there is some dissipation of energy by each and every CH [9]. Thus the energy dissipated in the CH during a cycle with the supposition that each and every cycle has one frame is (4) and the energy utilized in a cluster member node is equivalent to (5). The area of each cluster is aroundD2/Kopt. Like in [25] the expected distances are computed from a cluster member node to its CH and from a CH to the BS. Because of the uniform distribution of CHs in a D×D (m2) sensor area, the expected squared region enclosed by each cluster with the CH positioned at (xCH,yCH) can be computed as given below:(6)D2Kopt×D2Kopt,where Kopt is the optimum number of CHs. The member nodes are also deployed regularly and independently in each cluster, where we have (7)Exmem-nodes=ExCH=Eymem-nodes=EyCH=12D2Kopt,Exmem-nodes2=ExCH2=Eymem-nodes2=EyCH2=D23Kopt.In this manner the predicted squared length from member nodes to their CH within a cluster can be computed as(8)EdtoCH2=Exmem-nodes-xCH2+Eymem-nodes-yCH2=Exmem-nodes2-Exmem-nodesExCH+ExCH2+Eymem-nodes2-Eymem-nodesEyCH+EyCH2=D23Kopt.By substituting the value of dtoCH2 from (8) in (5), the energy used by each member node per cycle is given by(9)Emem-nodes=lETrans-elec+lϵfsD23Kopt.The energy utilization in the whole cluster during a single cycle can be communicated by using(10)Ecluster=ECH/cycle+NKopt-1Emem-nodes.Hence Ecycle⁡ can be computed as(11)Ecycle⁡=KoptEcluster=KoptlERece-elecNKopt-1+lEDataAgrNKopt+ETrans-elec+lϵampdtoBSn+NKopt-1lETrans-elec+lϵfsD23Kopt=NlERece-elec-KoptlERece-elec+NlEdataAgr+KoptlETrans-elec+KoptlϵampdtoBSn+NlETrans-elec-KoptlETrans-elec+NlϵfsD23Kopt-lϵfsD23=NlERece-elec-KoptlERece-elec+NlEDataAgr+KoptlϵampdtoBSn+NlETrans-elec+NlϵfsD23Kopt-3lϵfsD2.By selecting the feasible solution to the first derivative of (11), that is, Kopt, the total consumed energy per cycle, that is, Ecycle⁡, can be minimized. The first and second derivative of Ecycle⁡ with respect to Kopt are(12)∂Ecycle⁡∂Kopt=lϵampdtoBSn-lERece-elec-NlϵfsD23Kopt2,∂2Ecycle⁡∂2Kopt=2NlϵfsD23Kopt3>0.By setting the first derivative with respect to optimal number Kopt to zero, the optimum number of CHs, that is, Kopt, can be calculated as(13)0=lϵampdtoBSn-lERece-elec-NlϵfsD23Kopt2,lϵampdtoBSn=lERece-elec+NlϵfsD23Kopt2,3Kopt2lϵampdtoBSn=3Kopt2lERece-elec+NlϵfsD2,3Kopt2lϵampdtoBSn-lERece-elec=NlϵfsD2,Kopt2=NlϵfsD23lϵampdtoBSn-ERece-elec,Kopt=NlϵfsD23ϵampdtoBSn-ERece-elec.We have shown that a feasible number of clusters depend upon the following parameters: total number of nodes, say N, sensing field dimensions (D), average length between sensor nodes and BS (dtoBSn), receiving total energy consumed by sensor nodes (ERece-elce), and transmitter amplifier energy consumption (ϵamp). Some of the protocols [26–28] neglect the receiving energy dissipation of sensor nodes in exploring the routes and only consider the energy of the transmitter. So we also suppose that receiving circuitry to be very small. If receiving circuitry is large, it will be in the form of a constant overhead that can predominantly make the clustering schemes questionable [24]. The upper and lower range can be attained by putting the least and biggest values of dtoBSn in (13) and can compute the optimal value of Kopt. Also the solution of the second derivation of (11) is positive which represents that the value of Kopt defined in (13) results in the least possible total energy consumption in WSNs with the regular node distribution. Once the optimal number of CHs is obtained, their locations are found by the ABC algorithm among uniformly distributed sensors. In [24] the authors have derived the expected value of different powers of communication path between the nodes and the BS throughout the sensing field (i.e., dtoBS2,dtoBS4) as shown in Table 1. If d≤d0 (i.e., for free space model), the expected value of dtoBS2 is computed. Also for d>d0 (i.e., for two-ray model), the expected value of dtoBS4 is computed. Figures 1–3 show the sample plot of the network for different cases of experiments. We have considered one case with BS position (i.e., outside the sensor field) to divide the region into subregions and three cases with CH position (i.e., centre, corner, and mid-point of bottom side) to divide the subregions into subregion parts. We have used different values of dtoBS2,dtoBS4 from Table 1 and submit these values in (13) to calculate the values of Kopt for all these cases. The different values of Kopt from (14), (15) are used to divide the region into subregions and the values of Kopt from (16)–(21) are used to divide the subregions into subregion parts. The simulation of the network environment is executed and the nature of sensor nodes for every round of experiments is visualized in Figures 1–3. These figures show the location of sensor nodes and BS. The green colour indicates the normal sensor nodes, blue colour indicates the SCH, and red colour indicates the CH. The square box symbol outside the y-axis indicates the BS node.Table 1
Closed-form expressions for squared shaped sensing fieldD×D [24].
Position of  BS
Radio model used
Threshold valued0=ϵfs/ϵmp
Predicted value ofdtoBS2,dtoBS4
Centre
Free space
d
≤
d
0
D
2
6
Corner
2
D
2
3
Side’s mid-point
5
D
2
12
Outside
5
D
2
12
+
D
K
+
K
2
Centre
Multipath
d
>
d
0
7
D
4
180
Corner
28
D
4
45
Side’s mid-point
193
D
4
720
Outside
7
D
2
180
+
2
D
2
L
2
3
+
L
4Figure 1
Square shaped network field where CH is located at the centre.Figure 2
Square shaped network field where CH is located at the corner.Figure 3
Square shaped network field where CH is located at the mid-point of bottom side.Case 1.
BS is placed at outside of the squared network field.(a)
Ifd≤d0, then Kopt from (13) can be calculated as(14)Kopt=NϵfsD23ϵampdtoBS2-ERece-elec,Kopt=NϵfsD23ϵfs5D2/12+DK+K2,Kopt=4N5+12K/D+12K2/D2.(b)
Ifd>d0, then Kopt from (13) can be calculated as(15)Kopt=NϵfsD23ϵampdtoBS4-ERece-elec,Kopt=NϵfsD23ϵmp7D4/180+2D2L2/3+L4,Kopt=60Nϵfs7D2+120L2+180L4/D2ϵmp.Case 2.
CH is located at the centre of the squared network field as shown in Figure1.(a)
Ifd≤d0, then Kopt from (13) can be calculated as(16)Kopt=NϵfsD23ϵampdtoBS2-ERece-elec,Kopt=NϵfsD23ϵfsD2/6,Kopt=2N.(b)
Ifd>d0, then Kopt from (13) can be calculated as(17)Kopt=NϵfsD23ϵampdtoBS4-ERece-elec,Kopt=NϵfsD23ϵmp7D4/180,Kopt=60Nϵfs7D2ϵmp.Case 3.
CH is located at the corner of the squared network field as shown in Figure2.(a)
Ifd≤d0, Kopt from (13) can be calculated as(18)Kopt=NϵfsD23ϵampdtoBS2-ERece-elec,Kopt=NϵfsD23ϵfs2D2/3,Kopt=N2.(b)
Ifd>d0, Kopt from (13) can be calculated as(19)Kopt=NϵfsD23ϵampdtoBS4-ERece-elec,Kopt=NϵfsD23ϵmp28D4/45,Kopt=15Nϵfs28D2ϵmp.Case 4.
CH is positioned at the mid-point of the bottom side of the squared network field with the origin remaining in the bottom left corner as shown in Figure3.(a)
Ifd≤d0, then Kopt from (13) can be calculated as(20)Kopt=NϵfsD23ϵampdtoBS2-ERece-elec,Kopt=NϵfsD23ϵfs5D2/12,Kopt=4N5.(b)
Ifd>d0, then Kopt from (13) can be calculated as(21)Kopt=NϵfsD23ϵampdtoBS4-ERece-elec,Kopt=NϵfsD23ϵmp193D4/720,Kopt=240Nϵfs193D2ϵmp.


## 5. Protocol Description

### 5.1. Artificial Bee Colony Approach

A recent swarm intelligent approach motivated by the gifted metaheuristic behavior of honey bees [6] is known as artificial bee colony algorithm, that is, ABC, which was invented by Karaboga et al. ABC is a swarm intelligence approach which is being attracted by the foregoing nature of real time bees. Bee colony optimization consumes three kinds of bees, namely, employed bees, onlookers, and scout bees. The basic behavior of these bees is as follows.Scout Bees. These bees randomly move throughout the searching space and try to explore new food resources and calculate their fitness function.Employed Bees. Employed bees are currently employing and exploring a specific food resource and calculate the new fitness value. They communicate information about this specific food resource with onlooker bees waiting in the beehive by performing waggle dance. This information can be amount of nectar, direction of food resource, and its distance from the beehive.Onlooker Bees. If the new fitness value is better than the value calculated by the scout bees then select the employed bee and recruit onlookers to pursue the visited routes by employed bees and calculate fitness function. Choose the onlooker bee with best fitness function.In artificial bee colony, where the exploitation process is performed by an onlooker and employed bees in the searching environment, scout bees manage exploration of food resources.At the initial stage bee colony algorithm generates a population of these three types of bees along with their food resource locations through a number of iterations starting fromI=0 up to Imax. The food resources are flower petals and the food source positions are called solutions that have different amount of nectar which is known as the fitness function. Each solution si is a d-dimensional solution vector, where i=1,2,3,…,z, d is number of optimization variables, and z denotes number of onlooker or employed bees which is equal to the food source locations. Depending upon the visual information of the food resource (i.e., its shape, colour, and fragrance) the employed bees update the solutions in their memory and evaluate the nectar amount of the newly generated food resource. If the newly discovered food resource is better than the previous one in terms of fitness value, then bees keep the newly generated solutions in their memory and neglect the previous solution or vice versa. At the second stage of iteration, once all the employed bees had discovered food resources, bees communicate statistics regarding the food resources with onlooker bees sitting in beehive by performing a special dance called waggle dance. The food resource statistics can be quantity of nectar, its direction, and distance from the beehive. When onlooker bees get the information about food resources by the employed bees, they choose the favourable food resource. Depending upon the fitness value, the probability Pi [29] for an onlooker bee to choose the food resource is evaluated by the given equation:(22)Pi=fitnessi∑n=1zfitnessi,where fitnessi is the fitness function of the solution i which is proportional to the nectar quantity of food resource at the position i and z is the number of food sources.To generate optimal food source location [29], bee colony uses the given equation(23)xij′=xij+rijxij-xkj,where j∈{1,2,…,D} are indexes that are arbitrarily selected and k∈{1,2,…,m}, where k is determined arbitrarily that must be different from i, where rij is a random number that lies within [-1,1]. It controls the generation of food sources in the neighbourhood of xij and also shows the comparison of two food locations using bees. Hence, from (23), it is noticed that if the difference in the xij and xjk parameters reduces, variation towards the xij solution also gets reduced. Therefore the moment searching process reaches the optimal solution; number of steps will be decreased accordingly. If the parameter value generated by the searching process is greater than the maximum limit, it will be sustainable and if food source location cannot be improved through a preordained number of iterations, then that food resource will be replaced with another food resource discovered by the scout bees. The predefined number of iterations is an important control parameter of the artificial bee colony, so called a limit for rejection. The food resource whose nectar is neglected by the bees is replaced with a new food resource found by the scouts [29] using(24)xij=LBij+r0,1UBij-LBij∀j∈1,2,…,D,∀i∈1,2,…,N.Basically bee colony technique carries out various selection procedures. (i)
Global Selection Procedure. This process is followed by onlookers in order to discover favourable regions with some probability to choose the food resource by using (22).(ii)
Local Selection Procedure. This process is executed by employed bees and onlookers using the visual status of food resources.(iii)
Greedy Selection Procedure. Onlooker and employed bees execute this procedure in which as long as the nectar quantity of the optimal food resource is larger than the current food resource, the bee skips the current solution and retains the optimal solution generated by using (23).(iv)
Random Selection Procedure. This process is performed by scouts as mentioned in (24).


### 5.2. Ant Colony Optimization Based Routing in WSN

Ant colony optimization is a swarm intelligence approach that is used to solve complex combinatorial problems [30]. The best example for ACO application is AntNet algorithm which was discovered by Di Caro and Dorigo [31]. ACO considers simulated ants as mobile agents that work collectively and communicate with each other via artificial pheromone trails. In ACO based methodology, each and every ant randomly tries to search a way in the search space using forward and backward movements. Ants are originated from a source node at a regular time interval and while travelling through its neighbouring nodes, ant reaches its last destination so called sink node, say, d. At whatever node the ant is, the information about a node has to be interchanged with the destination (i.e., BS); as ants are self-propelling in nature, therefore ants are set in motion. At each node p, the probability with which an ant chooses the next node q is given by(25)Probkp,q=τp,qα·ηp,qβ∑q∈Rqτp,qα·ηp,qβ,ifq∉Mk0otherwise,where τp,q are the pheromone generated by the backward ants and ηp,q is the estimated heuristic function for energy and distance and Rq is the recipient nodes. For node p, Mk is the list of nodes previously visited by the ants. α and β are two control parameters which restrict the amount of pheromones. Pheromone values are deposited along circular arcs such that each arc (p,q) has a trail value τ(r,s)∈0,1. Since the destination hop is a stable base station, therefore the last node of the path for every ant journey is the same. The higher the probability Probk(p,q) the higher the chances of the node q being selected. The heuristic value of the node p is expressed by the following equation:(26)ηp,q=∑i=1nEciEIi×DBSz,qi,where Eci is the current energy of the ith node. EIi is the initial energy of the ith node. DBSz,qi is minimum distance of CH qi from BSz. Henceforth an ant can choose the next node on the basis of the amount of energy and distance level of the neighbouring nodes. This inferred that if a node has a lower energy level, it means it has a lower probability of being selected and vice versa. The moment forward ant reaches its destination node, a backward ant is originated and the memory of the foraging ant is exchanged to the trailing ant and then the forward ant is released. The trailing ant moves in the same way as the forward ant except in backward direction. While moving hop to hop back to the source node, the trailing ant retains an amount of pheromone, Δτk, on every node which is given by the following equation:(27)Δτk=w·1Lk,where Lk is the route length of the kth ant in terms of number of visited hops and w is the weighting coefficient. These pheromone qualities are retained in the memory for the future reference. The quality of a node is determined by the measurement of pheromones on the way to its neighbouring hops. Therefore, it is observed that the values of the variables Mk and Lk have been confined in a memory stored for every ant in every node. However, this space is less than equal to a few bytes. This information is placed onto the edge relating to the foraging ant. To control the quantity of pheromones, pheromone evaporation operation is performed in order to avoid the immense amount of pheromone trails and to favour the searching of new paths. The evaporation mechanism is performed by using the following equation:(28)τpq=1-ρτpq,where 0<ρ≤1 is the abandonment of pheromone trail and ρ is the coefficient of stigmergy persistence.


### 5.3. Proposed Hybrid (ABCACO) Algorithm

The proposed algorithm operates iteratively, where each iteration initiates with a setup phase followed by a steady-state phase. After uniform or homogeneous deployment process of the network, each node initially calculates distance to other nodes and from BS using the Euclidian formula. At the starting of each setup phase, all nodes transfer the information regarding their energy and locations (calculated distances) to the base station. Thus, using this information, the base station computes the average energy level of all hops and decides which node will be chosen as CH such that node must have sufficient energy and least distance to the BS. After that the value of optimal clustering (Kopt) is calculated. This value is based on the position of BS, meaning that BS is positioned outside or centred of the square shaped sensing field. On the basis of Kopt and distance, all nodes of the region are divided into square shaped clusters known as subregions. Next, BS selects CHs at each round by using the ABC algorithm. In this algorithm, the CHs selection process is achieved using the fitness function given by (29) which is obtained analytically in which the communication energy and distance are the significant factors that are considered:(29)fitnessi=∑i=1nEciEIi×DBSz,ki,where DBSz,k is the minimum distance of the node ki from BSz. Again Kopt value is calculated and this value is based on the position of CH; that is, CH is positioned at the centre, corner, and mid-point of the bottom side of the square shaped sensing field. On the basis of this Kopt value and distance, all the nodes of subregions are further divided into subregions parts. Based on a given fitness formula, SCH of each CH is selected for each subregion part. In steady-state phase all nodes are responsible for communicating with their SCH of that subregion part and each SCH is responsible for communicating with CH of that subregion. Each SCH receives data from its member nodes and aggregates the data. After aggregation, SCH transfers data to the CH of that subregion. Again the CH aggregates the data and sends it to the BS in a multihop fashion (i.e., CH to CH) using the optimal path given by ACO algorithm. In our case we have considered that ants should always move towards the BS. So for this purpose, the number of hops is always less than or equal to Kopt. Depending upon the distance, the optimized hop count is calculated for each CH. Next, ants are starting from CHs to BS through the next possible hops and return with finding the optimized next hop. From that optimized hop the same process is repeated for the next optimized hop towards BS and so on. In ACO to accomplish a proficient and strong routing process some key characteristics of distinctive sensor networks are considered. Failure in communication nodes is more feasible in WSNs than traditional networks, as nodes are regularly positioned in unattended places and they use a restricted power supply. So the network should not be affected by a node’s breakdown and should be in an adaptive structure to sustain the routing process. A better solution for data transmission is achieved by packet switching. In the packet switched network message is broken up into packets of fixed or variable size. Each packet includes a header that contains the source address, destination address, and other control information. The size of a packet depends upon the type of network and protocol used. No resources are allocated for a packet in advance. Resources are allocated on demand on a first-come, first-served basis. The packets are routed over the network hop to hop. At each hop packet is stored briefly before being transmitted according to the information stored in its header. These types of networks are called store and forward networks. Individual packets may follow different routes to reach the destination. In most protocols the transport layer is responsible for rearranging these packets before routing them on to the destination port numbers. So when failure takes place in a trail, the related data packet cannot reach the destination, that is, BS. Acknowledgment signals are used to achieve guaranteed and reliable delivery, So when an acknowledgment for a data packet is absent, the source node, that is, CH, retransmits that packet to an altered path. Therefore, routing becomes more robust by using acknowledgment related data transmission and maintains different routes. Also in this kind of network some routes would be shorter and set aside for minimum energy costs. Communication on these routes should be made at regular intervals to decrease the total energy consumption cost using these paths. That is, to attain lower energy consumption more data packets should be transmitted along shorter transmission routes.The setup and steady-state phase of the proposed algorithm are given below.Setup Phase. In this phase, the operation is divided into cycles. In every cycle, all nodes generate and transmit a message to their SCH, CH, or base station. The BS uses the proposed algorithm to perform the following steps: to (1) divide region into subregions and further subregion parts, (2) select CH using ABC algorithm, and (3) compute the shortest multihop path using ACO algorithm. The process of the setup phase is shown in Figure 4.Figure 4
Setup phase process.Steady-State Phase. In this phase, all nodes know their own duty according to the notification message received in the setup phase. Member nodes sense the data and send to their SCH. Each SCH aggregates data received from its member nodes and sends to the CH of that subregion. Further, each CH aggregates data received from SCHs and sends to the next hop CH node on the shortest path determined in setup phase. When the energy of any node is less than the threshold energy, then that node will not participate in the CH or SCH selection. Otherwise the entire system continues with the setup and steady-state phase. The system continues these cycles until every node’s energy has been depleted. The process of the steady-state phase is shown in Figure 5.Figure 5
Steady-state phase process.


## 5.1. Artificial Bee Colony Approach

A recent swarm intelligent approach motivated by the gifted metaheuristic behavior of honey bees [6] is known as artificial bee colony algorithm, that is, ABC, which was invented by Karaboga et al. ABC is a swarm intelligence approach which is being attracted by the foregoing nature of real time bees. Bee colony optimization consumes three kinds of bees, namely, employed bees, onlookers, and scout bees. The basic behavior of these bees is as follows.Scout Bees. These bees randomly move throughout the searching space and try to explore new food resources and calculate their fitness function.Employed Bees. Employed bees are currently employing and exploring a specific food resource and calculate the new fitness value. They communicate information about this specific food resource with onlooker bees waiting in the beehive by performing waggle dance. This information can be amount of nectar, direction of food resource, and its distance from the beehive.Onlooker Bees. If the new fitness value is better than the value calculated by the scout bees then select the employed bee and recruit onlookers to pursue the visited routes by employed bees and calculate fitness function. Choose the onlooker bee with best fitness function.In artificial bee colony, where the exploitation process is performed by an onlooker and employed bees in the searching environment, scout bees manage exploration of food resources.At the initial stage bee colony algorithm generates a population of these three types of bees along with their food resource locations through a number of iterations starting fromI=0 up to Imax. The food resources are flower petals and the food source positions are called solutions that have different amount of nectar which is known as the fitness function. Each solution si is a d-dimensional solution vector, where i=1,2,3,…,z, d is number of optimization variables, and z denotes number of onlooker or employed bees which is equal to the food source locations. Depending upon the visual information of the food resource (i.e., its shape, colour, and fragrance) the employed bees update the solutions in their memory and evaluate the nectar amount of the newly generated food resource. If the newly discovered food resource is better than the previous one in terms of fitness value, then bees keep the newly generated solutions in their memory and neglect the previous solution or vice versa. At the second stage of iteration, once all the employed bees had discovered food resources, bees communicate statistics regarding the food resources with onlooker bees sitting in beehive by performing a special dance called waggle dance. The food resource statistics can be quantity of nectar, its direction, and distance from the beehive. When onlooker bees get the information about food resources by the employed bees, they choose the favourable food resource. Depending upon the fitness value, the probability Pi [29] for an onlooker bee to choose the food resource is evaluated by the given equation:(22)Pi=fitnessi∑n=1zfitnessi,where fitnessi is the fitness function of the solution i which is proportional to the nectar quantity of food resource at the position i and z is the number of food sources.To generate optimal food source location [29], bee colony uses the given equation(23)xij′=xij+rijxij-xkj,where j∈{1,2,…,D} are indexes that are arbitrarily selected and k∈{1,2,…,m}, where k is determined arbitrarily that must be different from i, where rij is a random number that lies within [-1,1]. It controls the generation of food sources in the neighbourhood of xij and also shows the comparison of two food locations using bees. Hence, from (23), it is noticed that if the difference in the xij and xjk parameters reduces, variation towards the xij solution also gets reduced. Therefore the moment searching process reaches the optimal solution; number of steps will be decreased accordingly. If the parameter value generated by the searching process is greater than the maximum limit, it will be sustainable and if food source location cannot be improved through a preordained number of iterations, then that food resource will be replaced with another food resource discovered by the scout bees. The predefined number of iterations is an important control parameter of the artificial bee colony, so called a limit for rejection. The food resource whose nectar is neglected by the bees is replaced with a new food resource found by the scouts [29] using(24)xij=LBij+r0,1UBij-LBij∀j∈1,2,…,D,∀i∈1,2,…,N.Basically bee colony technique carries out various selection procedures. (i)
Global Selection Procedure. This process is followed by onlookers in order to discover favourable regions with some probability to choose the food resource by using (22).(ii)
Local Selection Procedure. This process is executed by employed bees and onlookers using the visual status of food resources.(iii)
Greedy Selection Procedure. Onlooker and employed bees execute this procedure in which as long as the nectar quantity of the optimal food resource is larger than the current food resource, the bee skips the current solution and retains the optimal solution generated by using (23).(iv)
Random Selection Procedure. This process is performed by scouts as mentioned in (24).


## 5.2. Ant Colony Optimization Based Routing in WSN

Ant colony optimization is a swarm intelligence approach that is used to solve complex combinatorial problems [30]. The best example for ACO application is AntNet algorithm which was discovered by Di Caro and Dorigo [31]. ACO considers simulated ants as mobile agents that work collectively and communicate with each other via artificial pheromone trails. In ACO based methodology, each and every ant randomly tries to search a way in the search space using forward and backward movements. Ants are originated from a source node at a regular time interval and while travelling through its neighbouring nodes, ant reaches its last destination so called sink node, say, d. At whatever node the ant is, the information about a node has to be interchanged with the destination (i.e., BS); as ants are self-propelling in nature, therefore ants are set in motion. At each node p, the probability with which an ant chooses the next node q is given by(25)Probkp,q=τp,qα·ηp,qβ∑q∈Rqτp,qα·ηp,qβ,ifq∉Mk0otherwise,where τp,q are the pheromone generated by the backward ants and ηp,q is the estimated heuristic function for energy and distance and Rq is the recipient nodes. For node p, Mk is the list of nodes previously visited by the ants. α and β are two control parameters which restrict the amount of pheromones. Pheromone values are deposited along circular arcs such that each arc (p,q) has a trail value τ(r,s)∈0,1. Since the destination hop is a stable base station, therefore the last node of the path for every ant journey is the same. The higher the probability Probk(p,q) the higher the chances of the node q being selected. The heuristic value of the node p is expressed by the following equation:(26)ηp,q=∑i=1nEciEIi×DBSz,qi,where Eci is the current energy of the ith node. EIi is the initial energy of the ith node. DBSz,qi is minimum distance of CH qi from BSz. Henceforth an ant can choose the next node on the basis of the amount of energy and distance level of the neighbouring nodes. This inferred that if a node has a lower energy level, it means it has a lower probability of being selected and vice versa. The moment forward ant reaches its destination node, a backward ant is originated and the memory of the foraging ant is exchanged to the trailing ant and then the forward ant is released. The trailing ant moves in the same way as the forward ant except in backward direction. While moving hop to hop back to the source node, the trailing ant retains an amount of pheromone, Δτk, on every node which is given by the following equation:(27)Δτk=w·1Lk,where Lk is the route length of the kth ant in terms of number of visited hops and w is the weighting coefficient. These pheromone qualities are retained in the memory for the future reference. The quality of a node is determined by the measurement of pheromones on the way to its neighbouring hops. Therefore, it is observed that the values of the variables Mk and Lk have been confined in a memory stored for every ant in every node. However, this space is less than equal to a few bytes. This information is placed onto the edge relating to the foraging ant. To control the quantity of pheromones, pheromone evaporation operation is performed in order to avoid the immense amount of pheromone trails and to favour the searching of new paths. The evaporation mechanism is performed by using the following equation:(28)τpq=1-ρτpq,where 0<ρ≤1 is the abandonment of pheromone trail and ρ is the coefficient of stigmergy persistence.


## 5.3. Proposed Hybrid (ABCACO) Algorithm

The proposed algorithm operates iteratively, where each iteration initiates with a setup phase followed by a steady-state phase. After uniform or homogeneous deployment process of the network, each node initially calculates distance to other nodes and from BS using the Euclidian formula. At the starting of each setup phase, all nodes transfer the information regarding their energy and locations (calculated distances) to the base station. Thus, using this information, the base station computes the average energy level of all hops and decides which node will be chosen as CH such that node must have sufficient energy and least distance to the BS. After that the value of optimal clustering (Kopt) is calculated. This value is based on the position of BS, meaning that BS is positioned outside or centred of the square shaped sensing field. On the basis of Kopt and distance, all nodes of the region are divided into square shaped clusters known as subregions. Next, BS selects CHs at each round by using the ABC algorithm. In this algorithm, the CHs selection process is achieved using the fitness function given by (29) which is obtained analytically in which the communication energy and distance are the significant factors that are considered:(29)fitnessi=∑i=1nEciEIi×DBSz,ki,where DBSz,k is the minimum distance of the node ki from BSz. Again Kopt value is calculated and this value is based on the position of CH; that is, CH is positioned at the centre, corner, and mid-point of the bottom side of the square shaped sensing field. On the basis of this Kopt value and distance, all the nodes of subregions are further divided into subregions parts. Based on a given fitness formula, SCH of each CH is selected for each subregion part. In steady-state phase all nodes are responsible for communicating with their SCH of that subregion part and each SCH is responsible for communicating with CH of that subregion. Each SCH receives data from its member nodes and aggregates the data. After aggregation, SCH transfers data to the CH of that subregion. Again the CH aggregates the data and sends it to the BS in a multihop fashion (i.e., CH to CH) using the optimal path given by ACO algorithm. In our case we have considered that ants should always move towards the BS. So for this purpose, the number of hops is always less than or equal to Kopt. Depending upon the distance, the optimized hop count is calculated for each CH. Next, ants are starting from CHs to BS through the next possible hops and return with finding the optimized next hop. From that optimized hop the same process is repeated for the next optimized hop towards BS and so on. In ACO to accomplish a proficient and strong routing process some key characteristics of distinctive sensor networks are considered. Failure in communication nodes is more feasible in WSNs than traditional networks, as nodes are regularly positioned in unattended places and they use a restricted power supply. So the network should not be affected by a node’s breakdown and should be in an adaptive structure to sustain the routing process. A better solution for data transmission is achieved by packet switching. In the packet switched network message is broken up into packets of fixed or variable size. Each packet includes a header that contains the source address, destination address, and other control information. The size of a packet depends upon the type of network and protocol used. No resources are allocated for a packet in advance. Resources are allocated on demand on a first-come, first-served basis. The packets are routed over the network hop to hop. At each hop packet is stored briefly before being transmitted according to the information stored in its header. These types of networks are called store and forward networks. Individual packets may follow different routes to reach the destination. In most protocols the transport layer is responsible for rearranging these packets before routing them on to the destination port numbers. So when failure takes place in a trail, the related data packet cannot reach the destination, that is, BS. Acknowledgment signals are used to achieve guaranteed and reliable delivery, So when an acknowledgment for a data packet is absent, the source node, that is, CH, retransmits that packet to an altered path. Therefore, routing becomes more robust by using acknowledgment related data transmission and maintains different routes. Also in this kind of network some routes would be shorter and set aside for minimum energy costs. Communication on these routes should be made at regular intervals to decrease the total energy consumption cost using these paths. That is, to attain lower energy consumption more data packets should be transmitted along shorter transmission routes.The setup and steady-state phase of the proposed algorithm are given below.Setup Phase. In this phase, the operation is divided into cycles. In every cycle, all nodes generate and transmit a message to their SCH, CH, or base station. The BS uses the proposed algorithm to perform the following steps: to (1) divide region into subregions and further subregion parts, (2) select CH using ABC algorithm, and (3) compute the shortest multihop path using ACO algorithm. The process of the setup phase is shown in Figure 4.Figure 4
Setup phase process.Steady-State Phase. In this phase, all nodes know their own duty according to the notification message received in the setup phase. Member nodes sense the data and send to their SCH. Each SCH aggregates data received from its member nodes and sends to the CH of that subregion. Further, each CH aggregates data received from SCHs and sends to the next hop CH node on the shortest path determined in setup phase. When the energy of any node is less than the threshold energy, then that node will not participate in the CH or SCH selection. Otherwise the entire system continues with the setup and steady-state phase. The system continues these cycles until every node’s energy has been depleted. The process of the steady-state phase is shown in Figure 5.Figure 5
Steady-state phase process.


## 6. Simulation Results

In this section, the simulation results of cluster based WSN clustering using artificial bee colony (WSNCABC) [32] have been compared with a well-known clustering based wireless sensor protocol called “Low Energy Adaptive Clustering Hierarchy” (LEACH) [3]. We used MATLAB 2012b and Oracle JDeveloper 11 g for evaluation of this approach. The simulations for 100 sensor nodes in a 100 m × 100 m sensing region and for 225 sensor nodes in a 200 m × 200 m and 300 m × 300 m region with equivalent initial energy of 0.5 J and 1.0 J have been run. Assume every node has a potential of interacting between base station and the sensor nodes. In the simulations, LEACH and WSNCABC algorithm settings and assumptions are for consistent comparisons. In experiments, a parallel model for MATLAB is used in providing periodical data transfers. Free space and multipath radio propagation models are used in simulations. For comparison, LEACH and WSNCABC were used to verify the success of this approach. A packet level simulation has been performed and utilizes the parameter values of the same physical layer as described in [9]. To get the average results, random topologies had been considered through the simulations. BS is located outside of monitored region. We consider various important aspects as the number of alive nodes per round, remaining energy, goodput (i.e., total number of packets received at the BS), and the stability period of the entire network. Simulation is carried out up to 10 percent of the total number of alive nodes. The simulation parameters are mentioned in Table 2.Table 2
Simulation parameters.
Network parameter
Value
Field span
Square: 100 × 100, 200 × 200, 300 × 300
Numbers of sensor nodes
100, 225
Location of BS
(−10, 50)
E
elec
50 nJ/bit
E
fs
10 nJ/bit/m2
E
mp
0.0013 pJ/bit/m4
E
DA
50 nJ/bit/signal
Initial energy
0.5 J, 1.0 J
Channel type
Channel/wireless channel
Radio propagation model
Free space, multipath
Energy model
Battery
Radio bit rate
1 mbpsAfter each round the number of live sensors goes down. The network remains alive till the last node. Figures6–11 depict that the proposed approach has a large number of alive nodes compared against LEACH and WSNCABC. A uniform installation of clusters results in prolonged life of network. While in another two approaches like WSNCABC and LEACH the clusters are installed randomly which may cause nodes to cover a longer distance and may cause poor performance.Figure 6
Number of alive nodes versus rounds with grid size 100 × 100 and energy = 0.5 J.Figure 7
Number of alive nodes versus rounds with grid size 100 × 100 and energy = 1 J.Figure 8
Number of alive nodes versus rounds with grid size 200 × 200 and energy = 0.5 J.Figure 9
Number of alive nodes versus rounds with grid size 200 × 200 and energy = 1 J.Figure 10
Number of alive nodes versus rounds with grid size 300 × 300 and energy = 0.5 J.Figure 11
Number of alive nodes versus rounds with grid size 300 × 300 and energy = 1 J.Goodput. Goodput is the number of packets delivered successfully per unit time [33].Figure12 shows the messages are transmitted more frequently as compared to WSNCABC and LEACH when BS is located at (−10, 50) position. The proposed approach depicts better results because the CHs are chosen very carefully after considering the distance of each node from the BS. The CHs are selected based on a high level of energy at least up to a predefined threshold value and the shortest distance from the BS. The graphs indicate that data delivery rate of our approach is far better against WSNCABC and LEACH by a factor of 35%. The other two approaches do not consider these important parameters during CHs selection which is the reason why they show poor performance.Figure 12
Number of successfully received packets at BS located at (−10, 50).Stability Period. Stability period is defined when the first node is dead. The stability is a very important parameter in WSNs because after the death of the first node other nodes die gradually which decreases the network lifetime. ABCACO increases the stability period of the network by 48% against WSNCABC and by 60% against LEACH, respectively, as shown in Figure 13.Figure 13
Comparison of protocols on the basis of the first node dead.Residual Energy. The residual energy is calculated as follows: residual energy = initial energy − current energy.Figures14–19 demonstrate the residual energy of the network versus number of rounds. It clearly indicates that ABCACO algorithm enhances the lifespan of the network over the other two algorithms by consuming less energy.Figure 14
Residual energy with grid size 100 × 100 and energy = 0.5 J over rounds.Figure 15
Residual energy with grid size 100 × 100 and energy = 1 J over rounds.Figure 16
Residual energy with grid size 200 × 200 and energy = 0.5 J over rounds.Figure 17
Residual energy with grid size 200 × 200 and energy = 1 J over rounds.Figure 18
Residual energy with grid size 300 × 300 and energy = 0.5 J over rounds.Figure 19
Residual energy with grid size 300 × 300 and energy = 1 J over rounds.


## 7. Application

This paper explains how the wireless sensor network technology helps with fire detection in real time. One of the most appealing features of WSN is environment auditing. Wireless sensor nodes are installed in various parts of the forest which measure temperature, humidity, and biometric data and deliver this collected data to the BS. However, the success of forest fire detection system that is based upon the wireless sensor nodes is restricted due to constrained energy resources of the sensor nodes and the rough environmental settings. Immediate response to fire plays a crucial role in this whole scenario to have the least amount of permanent destruction in the forest. This requires constant surveillance of the area. We decided to study WSN after considering the deficiencies of satellite and camera system. Our proposed architecture not only aims to detect the forest fire effectively and quickly, but also was designed considering the very limitations of sensor nodes.In our system, sensor nodes work under regular day conditions exempting the period of forest fire such that the wireless sensor nodes will be quite potential under the normal weather conditions and no fire. A distributed (cluster based) approach is used in each sensor node to detect fire threat cautiously in case of abnormally high temperatures to inform the BS about the possibility or occurrence of fire rapidly.From the literature [34–39], we study that single aspect of environmental monitoring is handled. However, the proposed system takes into account the densely deployed wireless sensor nodes; shortened transmission paths between the sensor nodes enable local computations (i.e., at SCH and CH) and used hybrid swarm intelligent approach with energy and distance parameters for early detection of fire.Wireless sensor nodes and networks have unique features with many pros and cons of their application in forest fire detection and monitoring. An effective forest fire detection via use of wireless sensor nodes should consider design goals, for example, (a) energy efficiency, (b) earliest forest fire detection, (c) weather resistant structure, and (d) predicting spread and direction of forest fire.From the abovementioned four design goals of fire detection, we have proposed different strategies: (i) a uniform sensor deployment scheme, (ii) a hierarchical clustered network architecture where CH is elected by ABC algorithm with parameters energy and distance from BS and SCH is elected by parameters energy and distance from their CH, (iii) an intracluster communication with aggregation of data on SCH, and (iv) intercluster communication (with aggregation of data at CH) by using ACO algorithm.A sample illustration of a forest fire detection and the communication between the nodes is shown in Figure20.Figure 20
Detection of fire event and message forwarding among the nodes.


## 8. Conclusion and Future Scope

In this paper, we use ABC because of its simple usage and quick convergence. Additionally, we implement an ACO technique to solve the routing problem that exists in WSNs. We implement both periodical (ABC) and event based (ACO) approaches to develop a new hybrid swarm intelligent energy efficient routing algorithm called ABCACO. In ABCACO, the entire sensing field is divided into an optimal number of subregions and subregion parts based onKopt. The proposed methodology provides a better clustering approach by selecting the CHs uniformly throughout the network area. Since we use hierarchical structure, at the first level, we implement ABC approach for the selection of CHs and on the second level a better routing path is evaluated for data transmission by using ACO approach. ABCACO decreases the communication distance by placing the CH node in the perfect position that provides maximum lifetime of the network. The simulation results show that ABCACO outperforms network performance in terms of lifetime, stability, and goodput as compared to existing algorithms. This paper leads to one step ahead tointerdisciplinary research within the biological systems to come up with better bioinspired solutions for real world WSN such as neural swarm system, swarm fuzzy system, and neural fuzzy system. The bioinspired hybridalgorithms open new perspective in the optimization solutions of WSNs.



---

*Source: 5836913-2015-12-21.xml*