Training and Learning Swarm Intelligence Algorithm (TLSIA) for Selecting the Optimal Cluster Head in Wireless Sensor Networks
الموضوعات :
Ali Sedighimanesh
1
(Science and Research branch, Islamic Azad University)
Hessam Zandhessami
2
(Science and Research branch, Islamic Azad University)
Mahmood Alborzi
3
(Science and Research branch, Islamic Azad University)
mohammadsadegh Khayyatian
4
(shahid Beheshti university)
الکلمات المفتاحية: Hierarchical routing, TLBO algorithm, TS algorithm, wireless sensor network,
ملخص المقالة :
Background: Wireless sensor networks include a set of non-rechargeable sensor nodes that interact for particular purposes. Since the sensors are non-rechargeable, one of the most important challenges of the wireless sensor network is the optimal use of the energy of sensors. The selection of the appropriate cluster heads for clustering and hierarchical routing is effective in enhancing the performance and reducing the energy consumption of sensors. Aim: Clustering sensors in different groups is one way to reduce the energy consumption of sensor nodes. In the clustering process, selecting the appropriate sensor nodes for clustering plays an important role in clustering. The use of multistep routes to transmit the data collected by the cluster heads also has a key role in the cluster head energy consumption. Multistep routing uses less energy to send information. Methods: In this paper, after distributing the sensor nodes in the environment, we use a Teaching-Learning-Based Optimization (TLBO) algorithm to select the appropriate cluster heads from the existing sensor nodes. The teaching-learning philosophy has been inspired by a classroom and imitates the effect of a teacher on learner output. After collecting the data of each cluster to send the information to the sink, the cluster heads use the Tabu Search (TS) algorithm and determine the subsequent step for the transmission of information. Findings: The simulation results indicate that the protocol proposed in this research (TLSIA) has a higher last node dead than the LEACH algorithm by 75%, ASLPR algorithm by 25%, and COARP algorithm by 10%. Conclusion: Given the limited energy of the sensors and the non-rechargeability of the batteries, the use of swarm intelligence algorithms in WSNs can decrease the energy consumption of sensor nodes and, eventually, increase the WSN lifetime.
[1] A. Belfkih, C. Duvallet, and B. Sadeg, “A survey on wireless sensor network databases,” Wirel. Networks, vol. 25, no. 8, pp. 4921–4946, 2019.
[2] M. Sedighimanesh* and H. Z. and A. Sedighimanesh, “Presenting the Hybrid Algorithm of Honeybee - Harmony in Clustering and Routing of Wireless Sensor Networks,” International Journal of Sensors, Wireless Communications and Control, vol. 9, no. 3. pp. 357–371, 2019.
[3] A. Kochhar, P. Kaur, P. Singh, and S. Sharma, “Protocols for wireless sensor networks: A survey,” Journal of Telecommunications and Information Technology. 2018.
[4] Z. Ullah, “A Survey on Hybrid, Energy Efficient and Distributed (HEED) Based Energy Efficient Clustering Protocols for Wireless Sensor Networks,” Wirel. Pers. Commun., vol. 112, no. 4, pp. 2685–2713, 2020.
[5] A. Shahraki, A. Taherkordi, Ø. Haugen, and F. Eliassen, “Clustering objectives in wireless sensor networks: A survey and research direction analysis,” Comput. Networks, vol. 180, p. 107376, 2020.
[6] S. A. Susan T and B. Nithya, “Cluster Based Key Management Schemes in Wireless Sensor Networks: A Survey,” Procedia Comput. Sci., vol. 171, pp. 2684–2693, 2020.
[7] P. Sarzaeim, O. Bozorg-Haddad, and X. Chu, “Teaching-Learning-Based Optimization (TLBO) Algorithm BT - Advanced Optimization by Nature-Inspired Algorithms,” O. Bozorg-Haddad, Ed. Singapore: Springer Singapore, 2018, pp. 51–58.
[8] M. Gendreau, “An Introduction to Tabu Search,” in Handbook of Metaheuristics, 2006.
[9] U. E. Zachariah and L. Kuppusamy, “A hybrid approach to energy efficient clustering and routing in wireless sensor networks,” Evol. Intell., 2021.
[10] F. Fanian and M. K. Rafsanjani, “Cluster-based routing protocols in wireless sensor networks: A survey based on methodology,” J. Netw. Comput. Appl., vol. 142, pp. 111–142, 2019.
[11] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on. p. 10 pp. vol.2, 2000.
[12] M. Shokouhifar and A. Jalali, “A new evolutionary based application specific routing protocol for clustered wireless sensor networks,” AEU - Int. J. Electron. Commun., vol. 69, no. 1, pp. 432–441, Jan. 2015.
[13] M. Khabiri and A. Ghaffari, “Energy-Aware Clustering-Based Routing in Wireless Sensor Networks Using Cuckoo Optimization Algorithm,” Wirel. Pers. Commun., vol. 98, no. 3, pp. 2473–2495, 2018.
[14] P. K. Roy, C. Paul, and S. Sultana, “Oppositional teaching learning based optimization approach for combined heat and power dispatch,” Int. J. Electr. Power Energy Syst., 2014.
[15] W. Shao, D. Pi, and Z. Shao, “An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem,” Appl. Soft Comput. J., 2017.
[16] X. Wang, L. Wang, and Y. Wu, “An Optimal Algorithm for Prufer Codes,” JSEA, vol. 2, pp. 111–115, Jan. 2009.
http://jist.acecr.org ISSN 2322-1437 / EISSN:2345-2773 |
Journal of Information Systems and Telecommunication
|
Training and Learning Swarm Intelligence Algorithm (TLSIA) for Selecting the Optimal Cluster Head in Wireless Sensor Networks |
Ali Sedighimanesh1, Hessam Zandhessami1*, Mahmood Alborzi1, Mohammadsadegh Khayyatian2
|
1.Department of Management and Economics, Science and Research branch, Islamic Azad University, Tehran, Iran 2.Institute for science and technology studies, shahid Beheshti university, Tehran, Iran |
Received: 28 Nov 2020 / Revised: 29 Apr 2021/ Accepted: 29 May 2021 |
Abstract
Background: Wireless sensor networks include a set of non-rechargeable sensor nodes that interact for particular purposes. Since the sensors are non-rechargeable, one of the most important challenges of the wireless sensor network is the optimal use of the energy of sensors. The selection of the appropriate cluster heads for clustering and hierarchical routing is effective in enhancing the performance and reducing the energy consumption of sensors. Aim: Clustering sensors in different groups is one way to reduce the energy consumption of sensor nodes. In the clustering process, selecting the appropriate sensor nodes for clustering plays an important role in clustering. The use of multistep routes to transmit the data collected by the cluster heads also has a key role in the cluster head energy consumption. Multistep routing uses less energy to send information.
Methods: In this paper, after distributing the sensor nodes in the environment, we use a Teaching-Learning-Based Optimization (TLBO) algorithm to select the appropriate cluster heads from the existing sensor nodes. The teaching-learning philosophy has been inspired by a classroom and imitates the effect of a teacher on learner output. After collecting the data of each cluster to send the information to the sink, the cluster heads use the Tabu Search (TS) algorithm and determine the subsequent step for the transmission of information. Findings: The simulation results indicate that the protocol proposed in this research (TLSIA) has a higher last node dead than the LEACH algorithm by 75%, ASLPR algorithm by 25%, and COARP algorithm by 10%.
Conclusion: Given the limited energy of the sensors and the non-rechargeability of the batteries, the use of swarm intelligence algorithms in WSNs can decrease the energy consumption of sensor nodes and, eventually, increase the WSN lifetime.
Keywords: Hierarchical Routing; TLBO Algorithm; TS Algorithm; Wireless Sensor Network.
1- Introduction
The wireless sensor network consists of several non-rechargeable sensor nodes applied for particular purposes [1]. One of the most important issues and challenges related to wireless sensor networks is the use of methods to reduce the energy consumption of sensor nodes. One of the methods is the clustering of the sensor nodes; instead of the sensor nodes consuming a great deal of energy and transmitting the data directly to the sink, they fall into a group called the cluster and send the data to the cluster head, and the cluster heads are required to transmit the data, thus consuming less energy of the sensor nodes and extending the network’s lifetime [2]. Cluster heads can either send the received data directly to the sink or work together to send the data to the sink in a hierarchical routing process. In general, transmitting data hierarchically reduces the energy consumption of cluster heads farther from the sink [3],[4].
The process of selecting cluster heads from available sensors and the routing between clusters to transmit data to the sink are of the optimization issues; therefore, the use of optimization algorithms has an effective role in the proper performance of these two processes, and ultimately, the efficiency of the wireless sensor network [5],[6]. Teaching-Learning-Based Optimization (TLBO) algorithm is one of the modern intelligent optimization algorithms implemented in two stages (phases) and can lead to optimization through being inspired by the learning and teaching process. In the teaching phase, the best member of the community is selected as the teacher and directs the average population towards himself/herself; this is similar to what a teacher does in the real world. In the learning phase, the people in the population work together to increase their knowledge, and it is similar to what happens in the company of friends and classmates [7].
The Tabu Search (TS) [8] algorithm is also one of the most powerful algorithms for solving optimization problems, especially graph-based and combinatorial optimization problems. The TS algorithm applies a list named the taboo list, which has been designed to prevent the algorithm from falling at the local optimal point. In summary, TS starts from a point or solution and searches for neighbors around that point, chooses the best neighbor and moves to that point, and continues this search until a stopping criterion to be satisfied. The optimal point is reported at the end of the search.
In the present article, the TLBO swarm intelligence algorithm is applied to select the appropriate cluster heads from the available sensor nodes. Once the cluster heads are identified, the members of each cluster become the member of the nearest cluster head and send the data to their cluster heads. The cluster heads receive data from their members and process and aggregate them subsequently. Then, the TS algorithm is used to transmit data to the sink by cluster heads until the best routes are formed for sending data, which reduces the energy consumption of cluster heads to transfer data. The rest of the article is structured as follows. Section 2 presents the previous work. Section 3 addresses the Proposed algorithm. Section 4 discusses the findings of the article. In Section 5, the authors present open problems for wireless sensor networks, and also the results are presented.
In this research, we will address several routing protocols that have attracted interest in recent years, namely the following: LEACH, ASLPR, and COARP[9][10].
2-1- Low- Energy Adaptive Clustering Hierarchy (LEACH)
In the LEACH protocol [11], there is a probability P for each sensor to be a cluster head (CH) in every round. In other words, LEACH creates groups using a distributed algorithm, in which the sensors automatically decide to become a cluster head and there is no centralized control. Each sensor can be a cluster head only once in 1/P consecutive rounds. First, each sensor makes a decision with a probability of P to become a cluster head. The cluster head roles changes in rounds between the group nodes, and this is to create an equilibrium in the energy consumption distribution. One can divide the performance of LEACH in each round into two phases. These phases are the setup and steady-state phases. A random number between 0 and 1 is chosen by every sensor in the setup phase. If that number is smaller than T(n), the sensor n becomes a CH for that round. The value of T(n) is computed based on (1), where P is the tendency of the sensor to be a node, and r represents the round number. Moreover, G denotes the set of all sensors that have not been chosen as a cluster head during the last 1/P rounds.
| (1) |
After the cluster heads are selected, they are announced to all the sensors in the network as cluster heads. When non-cluster head sensor receives an announcement from the cluster heads, it selects the cluster head closest in terms of communication.
2-2- Application- Specific Low Power Routing (ASLPR) protocol
The ASLPR protocol [12] collects specific pieces of information, such as remaining energy, distance from the base station, and distance between the CHs and sensor node, to select the cluster head nodes. Then, each node selects a random number between zero and 1. If the random number selected by a node is less than 
in (2), this node is converted to a cluster head.
| (2) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (3) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (4) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (5) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (6) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (7) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
TLSIA Algorithm |
Select nodes in sensing area for clustering 1 CHs= TLBO 2 For i=1: number of nodes 3 If node(i) is in sensing area && node(i) is normal node 4 node(i) joins to nearest CH 5 end if 6 end for Routing to send cluster head information 7 Route= TS 8 For i= Cluster heads 9 CH(i) joins to route; 10 end for |
3-1- Node Distribution and Sink Location
During the simulation, the sensor nodes are randomly distributed in an environment. Then, the location of the sink is determined, which is usually outside the environment.
Fig. 1. Random distribution of the nodes in the environment
The process of choosing the optimal cluster heads from between the sensors in the network is performed using the Teaching-Learning-Based Optimization (TLBO) algorithm. The teaching-learning philosophy has been inspired by a classroom and imitates a teacher’s effect on the learner output. Similar to other swarm intelligence algorithms, the TLBO algorithm is a population-based evolutionary optimization algorithm and consists of a teaching phase and a learner phase.
In the teaching phase, the teacher has the main role and attempts to transfer their knowledge to all the learners in the classroom to increase the average score. The average result of the learners and the improvement in results completely depends on the teacher. In each step, the best learner in the population is selected as the teacher, and, accordingly, the cost function and the average position for improving the position of the learners are computed.
In the learning phase, the learners increase their knowledge either via the teacher or via interacting with each other. The main difference between the teaching and learning phases is that in the teaching phase, the teacher transfers the knowledge to the learners, but in the learning phase, the learners gain knowledge from the teacher and by communicating with each other. In population-based optimization methods, a population has a set of members, each of which has a number of variables. Every member of the population is a solution to the optimization problem. In this paper, we first form an initial population consisting of a number of members, named learners, to determine the cluster head. Each learner includes 2 variables: Position, which consists of a string of variables, and cost. The figure below shows an overview of a population.
Learner 01 | Position | Node 01 | Node 02 | Node 03 | …. | Node (n-1) | Node (n) |
Cost | |||||||
Learner 02 | Position | Node 01 | Node 02 | Node 03 | …. | Node (n-1) | Node (n) |
Cost | |||||||
. | |||||||
. | |||||||
. | |||||||
Learner 0N | Position | Node 01 | Node 02 | Node 03 | …. | Node (n-1) | Node (n) |
| Cost | ||||||
Fig. 2. Overview of a population
First, the variables inside the position are given a random value between 0 and 1 (0 ≤ Position (i) ≤ 1). The most important issue in optimization algorithms is how to determine the cost for the learners in the population. In this paper, the cost is equal to (8):
(8)
In the above formula, x is the variable inside the population member, RE is the remaining energy of each variable, density is the ratio of the number of neighbors to the total number of nodes, centrality is the sum of distances of the nodes from the neighbors, Beta= -0.3, Alpha= -0.5, and Gamma=0.2.
In the TLBO method, every member of the population is considered a learner. In every iteration of the TLBO algorithm, we select the member with the lowest cost between the population members as the best member of the population. Then, we sort the variables inside the selected member in descending order and select 10% of these variables as the optimal cluster head. For example, if after the end of the maximum iteration of the algorithm, the output is as follows:
|
| 01 | 02 | 03 |
| n-1 | n |
Learner 01 | Position | 0.36 | 0.47 | 0.25 | …. | 0.12 | 0.22 |
Cost= -1.25 | |||||||
Learner 02 | Position | 0.26 | 0.17 | 0.45 | …. | 0.32 | 0.52 |
Cost=-1.35 | |||||||
. . . | |||||||
Learner N | Position | 0.14 | 0.32 | 0.54 | …. | 0.33 | 0.63 |
Cost=-1.05 | |||||||
Learner 02 is selected as the best member of the population; hence, the variables inside this member are sorted in descending order, and 10% of them are considered as the cluster head.
In implementing the TLBO algorithm, 3 values have a vital role in the optimal performance of the algorithm: (1) initialization of the learners, (2) updating of the teaching phase, and (3) updating of the learning phase.
Learner initialization: In this method, we first create a random population and calculate the second population from the first using (9). Subsequently, we combine the 2 populations and compute and sort the costs of the learners. Then, we select from the learners with less cost a number equal to the learner members of the population[14], [15].
Fig. 3. Opposition-based learning and quasi-oppositional learning[15].
| (9) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (10) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (11) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (12) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (13) |
where newXi is the ith learner’s position, 
represents the learners chosen randomly from the class, and 
and 
respectively denote the fitness values of the learners 
and . In addition, rand denotes a random vector in the [0, 1] range.
TLSIA Clustering Algorithm |
1 Initialize learners; 2 Evaluate learners; 3 For all learners 4 For i=each dimension 5 6 7 End_For 8 End_For 9 Combine first population and Quasi-opposite population; 10 Select best learners as new population; 11 Xteacher=best learner; 12 Xmean=average of learners; 13 While (stopping condition is not met) 14 For i=all learners 15 TF = round (1 + rand (0,1)); 16 Xnewi=Xi+rand*(Xteacher-TF*Xmean); 17 End_For 18 Evaluate new learners; 19 If new learner is better than old one 20 Xi=Xnewi; 21 End_If 22 For i=all learners 23 Randomly select another learner which is different from i (Xk); 24 If Xi is better than Xk 25 Xnewi=Xi+rand*(Xi-Xk); 26 Else 27 Xnewi=Xi+rand*(Xk-Xi); 28 End_If 29 End_For 30 If new learner is better than existing 31 Xi=Xnewi; 32 End_If 33 Xteacher=best learner; 34 Xmean=average of learners; 35 End_While |
Solution | Position | Node 01 | Node 02 | Node 03 | …. | Node (n-1) | Node (n) |
Cost |
In the TS algorithm, a number of actions are performed on the solution variables so as to optimize the solution cost. These actions are reversion, swap, and insertion.
To optimize routing using the TS algorithm, we use the Prüfer algorithm [16] to create a tree between the cluster head nodes. This algorithm maps a sequence of numbers to the corresponding tree.
First, we create a solution that assigns a random number between 0 and 1 to each position variable. Then, the solution cost is computed. To calculate the cost of each solution, we first convert it to the corresponding tree using the Prüfer algorithm. Then, the routing is performed according to the obtained tree, and the cost is calculated from (14). E1 is the network energy before applying the routing, and E2 is the computed energy after applying the routing.
| (14) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (15) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
| 01 | 02 | 03 | 04 | 05 | 06 | 07 | 08 | 09 |
Solution | Position | 0.37 | 0.26 | 0.88 | 0.76 | 0.44 | 0.55 | 0.45 | 0.35 | 0.25 |
Cost= 2 | ||||||||||
For the cost, we first convert this position into integers and obtain the corresponding array 5 4 10 9 5 7 6 5 4. This array is given to the Prüfer algorithm, and an equivalent tree is created. The cost is equal to the energy consumption of the cluster heads during the transmission of information to the sink according to this tree and route, and we seek to reduce the cost of the problem solution. After the initial solution is known, the desired actions are applied according to the obtained solution and the position and cost of the optimal solution are obtained. if a lower cost results, it replaces the best solution, and the action is not performed for a specific amount of time. This is continued until the cost is optimized. Finally, the obtained solution is converted to a tree via the Prüfer algorithm, which represents our optimal route.
TLSIA Routing Algorithm |
1 Create initiate solution; 2 Sbest=best solution; 3 While (stopping condition is not met) 4 Generate candidate solutions in the neighborhood of Sbest 5 For i=candidate solutions 6 If candidate_i is not in TabuList 7 If candidate_i is better than bestnewsol 8 Bestnewsol=candidate_i 9 End_If 10 End_If 11 End_For 12 If bestnewsol is better than Sbest 13 Sbest= bestnewsol 14 End_If 15 Push the bestnewsol to TabuList 16 If TabuListSize>maxTabuListSize 17 Remove the first element from TabuList; 18 End_If 19 End_While |
3-4- Network Operations and Energy Consumption Computation
The network operations in the proposed algorithm are divided into start-up and register phases. The energy consumption of every node in each round is computed by examining what has occurred in both phases.
3-4-1- Start-up Phase
The sink uses the 
control packet to communicate with the sensor nodes. These control packets contain short messages that request the ID, position, and the level of energy from each of the sensor nodes. The energy 
is consumed in the process of receiving the control packets from the sink according to (16). Moreover, all the nodes utilize the energy 
to transfer to the sink the control packets that contain data relating to the IDs, positions, and levels of energy.
| (16) | ||||||||||
| (17) | ||||||||||
| (18) | ||||||||||
| (19) | ||||||||||
| (20) | ||||||||||
Parameter | Value |
Population or Learner | 50 |
Number of iterations | 100 |
Number of Variables | length (Alive Nodes) |
Variables Lower Bound | VarMin= 0 |
Variables Upper Bound | VarMax=1 |
Table 2: Adjusting the parameters of the TS algorithm
Parameter | Value |
Population or Solution | 1 |
Number of iterations | 100 |
Number of Variables | Nch-1 (Nch= Number of Cluster Head) |
Variables Lower Bound | VarMin= 0 |
Variables Upper Bound | VarMax=1 |
NAction | NSwap+NReversion+NInsertion |
NSwap = NReversion | N × (N-1)/2 |
NInsertion | N × N (N=Number of position variables) |
Table 3: Simulation parameters
Parameter | Value |
Initial energy of the nodes | 1j |
| 10 (pj/bit/m2) |
| 0.0013 (pj/bit/m4) |
Eelec | 50 (nJ/bit) |
Eda | 5 (nJ/bit) |
Data packet size | 4100 (bit) |
In this section, the authors take into account eight scenarios according to Table (4) to evaluate the proposed algorithm. The number of sensors, the size of the environment, and the sink location are the parameters investigated in these scenarios to evaluate the algorithms in which the parameters change in each scenario.
Table 4: Used scenarios
Number | Number of sensors | Network size | Sink location |
1 | 100 | 200m × 200m | (100m, 250m) |
2 | 100 | (250m, 550m) | |
3 | 200 | 200m × 200m | (100m, 250m) |
4 | 200 | 500m × 500m | (250m, 550m) |
5 | 500 | 200m × 200m | (100m, 250m) |
6 | 500 | 500m × 500m | (250m, 550m) |
7 | 2000 | 200m × 200m | (100m, 250m) |
8 | 2000 | 500m × 500m | (250m, 550m) |
According to Table (4), the scenarios are simulated in two environments of sizes 200m×200m, and 500m×500m and the number of sensor nodes 100, 200, 500, and 2000, and their results are analyzed. Three factors are investigated in these scenarios: 1) the number of live nodes, 2) energy consumption of the network, 3) packets sent to the sink in each round.
Fig. 4. Number of live nodes in each round in the first scenario.
According to the results obtained in Figure (4) in the first scenario, FND1, HND2 and LND3 in the proposed algorithm are better compared to other approaches and indicates that in the Proposed algorithm, the energy consumption of sensors in each round is less than other methods. In Figure (5), the network’s lifetime has been compared; in the Proposed algorithm, the networks’ lifetime has increased compared to other methods, which shows the proper performance of the proposed algorithm in clustering and data transmission.
Fig. 5. Network’s energy consumption in each round in the first scenario.
Fig. 6. Packets sent to the sink in each round in the first scenario.
In the simulations, the higher the number of intact packets sent to the sink, the better the performance of the sensor nodes and cluster heads, which leads to an increase in the performance of the wireless sensor network. As shown in Figure (6), in the Proposed algorithm, the number of packets sent to the sink in each round is more than other methods, which indicates the proper performance of the sensor nodes and cluster heads within the wireless sensor network in the TLSIA method.
Fig. 7. Number of live nodes in each round in the third scenario.
Fig. 8. Network’s energy consumption in each round in the third scenario.
Fig. 9. Packets sent to the sink in each round in the third scenario.
The difference between the first and third scenarios is the number of nodes distributed in the simulation environment. The increase in the number of sensor nodes and the constant size of the simulation environment has led to an increase in the two factors of live nodes and packets sent to the sink in each round, which is true for all comparable algorithms. The results obtained from Figures 7, 8, and 9 indicate that the TLSIA algorithm outperforms the investigated algorithms. This performance includes the number of live nodes, the network’s lifetime, and the number of packets sent to the sink in each round.
In Table 5, the authors compare and evaluate FND, HND, and LND factors of the proposed algorithm (TLSIA) compared to other methods in the first four scenarios.
[1] First Node Dead
[2] Half Node Dead
[3] Last Node Dead
Table 5: Comparison of FND, HND, and LND of TLSIA method with other methods in the first four scenarios.
Network Size= 500 m × 500 m Sink location= (250 m, 500 m) | Network Size= 200 m × 200 m Sink location= (100 m, 250 m) |
|
|
| |||||||
LND | HND | FND | LND | HND | FND |
|
|
| |||
43 | 27 | 2 | 1204 | 1155 | 780 | LEACH | 100 | Number of sensor nodes | |||
69 | 43 | 4 | 1914 | 1848 | 1248 | ASLPR | |||||
73 | 47 | 5 | 2004 | 1940 | 1294 | COARP | |||||
85 | 54 | 8 | 2119 | 2032 | 1388 | TLSIA | |||||
61 | 42 | 4 | 1268 | 1431 | 1507 | LEACH | 200 | ||||
98 | 68 | 7 | 2028 | 2289 | 2347 | ASLPR | |||||
105 | 72 | 8 | 2117 | 2361 | 2456 | COARP | |||||
120 | 84 | 11 | 2345 | 2547 | 2637 | TLSIA | |||||
The difference between the first, second, third, and fourth scenarios is in the number of sensor nodes and the size of the simulation environment. Increasing the number of network’s sensor nodes in these scenarios leads to an increase in the network’s lifetime and the number of packets sent to the sink in each round, but increasing the size of the environment leads to a decrease in the network’s lifetime and the number of packets sent to the sink in each round. As indicated in Table (5), with increasing the number of sensors as well as the network’s size, the TLSIA method is better in terms of FND, HND, and LND in comparison with other techniques. These results mean that the TLSIA algorithm performs better in selecting cluster heads and routing the collected data compared to other methods, which reduces the energy consumption of sensor nodes and cluster heads.
Fig. 10. Number of live nodes in each round in the fifth scenario.
Fig. 11. Network’s energy consumption in each round in the fifth scenario.
Fig. 12. Packets sent to the sink in each round in the fifth scenario.
In Scenario 5, the number of sensor nodes was considered to be 500, the size of the simulation environment to be 200m×200m, and the nodes being randomly distributed in the environment. According to the results obtained in Figures 10, 11, and 12, it can be concluded that an excessive increase in the number of sensors in the simulation environment has an adverse effect on network’s performance since a large number of sensor nodes are distributed in a small environment which leads to an increase in the useless interactions between the sensors as well as an increase in the cluster heads’ load, causing energy consumption and rapid discharge of cluster heads. Thus, there must be a tradeoff between selecting the number of sensor nodes and the size of the simulation environment to reach an optimal performance of this network.
In Scenario 7, by increasing the number of sensor nodes to 2000, the results indicate that the TLSIA method is more efficient than other approaches. According to Figures (13), (14), and (15), the TLSIA method outperforms other techniques in terms of the number of live nodes, network’s lifetime, and the number of packets sent to the sink.
Fig. 13. Number of live nodes in each round in the seventh scenario.
Fig. 14. Network’s energy consumption in each round in the seventh scenario.
Fig. 15. Packets sent to the sink in each round in the seventh scenario.
In Table (6), the results of the proposed algorithm (TLSIA) are evaluated and compared to other methods in FND, HND, and LND modes. These results are related to the last four scenarios presented in Table (4).
Table 6: Comparison of FND, HND, and LND of TLSIA method with other methods in the second four scenarios.
Network Size= 500 m × 500 m Sink location= (250 m, 500 m) | Network Size= 200 m × 200 m Sink location= (100 m, 250 m) |
|
|
| |||||||
LND | HND | FND | LND | HND | FND |
|
|
| |||
127 | 102 | 60 | 988 | 910 | 636 | LEACH | 500 | Number of sensor nodes | |||
205 | 164 | 95 | 1562 | 1456 | 1005 | ASLPR | |||||
212 | 174 | 100 | 1645 | 1530 | 1072 | COARP | |||||
234 | 185 | 112 | 1790 | 1657 | 1145 | TLSIA | |||||
46 | 30 | 20 | 552 | 405 | 320 | LEACH | 2000 | ||||
74 | 49 | 32 | 872 | 645 | 505 | ASLPR | |||||
78 | 52 | 35 | 921 | 680 | 535 | COARP | |||||
92 | 64 | 48 | 984 | 720 | 575 | TLSIA | |||||
The results of these four scenarios also indicate that by increasing the number of sensor nodes and also increasing the size of the environment, the TLSIA method has performed better compared to the other methods in terms of the three studied factors: FND, HND, and LND.
By evaluating the proposed scenarios, it can be concluded that some variables such as the size of the simulation environment and the number of sensor nodes distributed in the environment have a significant impact on the energy consumption of the sensors, cluster heads, and the performance of the wireless sensor network. Therefore, one of the significant challenges in such networks is establishing a proper fit between the network size and the number of sensors.
5- Discussion and Conclusion
The wireless sensor networks include a set of sensor nodes designed and applied for particular purposes; hence, energy-saving is considerably important due to the non-rechargeability of sensor nodes. Selecting the appropriate cluster head from the sensor nodes and the hierarchical routing has a significant effect on reducing the energy consumption of the sensor nodes. Different routing protocols, including the LEACH, ASLPR, and COARP protocols, have been proposed to achieve energy efficiency in wireless sensor networks. The purpose of all protocols is to extend the lifetime of wireless sensor networks. In order to achieve this objective, the authors applied the teaching-learning-based optimization algorithm, which consists of two phases: Teaching Phase, Learner Phase. The authors selected the appropriate nodes from the sensor nodes in the network using the TLBO swarm intelligence algorithm, which led to the formation of suitable clusters to reduce the energy consumption of the sensor nodes. After selecting the cluster head and also the clustering operations, the collected data was sent to the sink through a multistage (hierarchical) method by the TS algorithm. This method reduced the energy consumption of the cluster heads when sending data to the sink.
According to the simulation results of the proposed algorithm in this article, the TLSIA algorithm outperformed other compared algorithms in different conditions with increasing the number of sensor nodes and also the size of the simulation environment and also the network’s lifetime has been increased. as well as, the proposed TLSIA algorithm can decrease the energy consumption of the nodes and increase the network life. In terms of HND, FND, and LND, the proposed algorithm has had an increase of about 75%, 15%, and 10% compared to the LEACH, ASLPR, and COARP algorithms, respectively. Moreover, the number of packets transmitted to the sink in the proposed algorithm has increased compared to that in other methods. The following suggestions can be made for future works to improve and develop the Proposed algorithm:
1) Mobilization of the sensor nodes inside the network to suitable clustering.
2) Movement of the sink around the network environment to collect the information sensed by the sensor nodes.
3) Use of ensemble learning algorithms in the selection of the cluster head.
6- References
[1] A. Belfkih, C. Duvallet, and B. Sadeg, “A survey on wireless sensor network databases,” Wirel. Networks, vol. 25, no. 8, pp. 4921–4946, 2019.
[2] M. Sedighimanesh* and H. Z. and A. Sedighimanesh, “Presenting the Hybrid Algorithm of Honeybee - Harmony in Clustering and Routing of Wireless Sensor Networks,” International Journal of Sensors, Wireless Communications and Control, vol. 9, no. 3. pp. 357–371, 2019.
[3] A. Kochhar, P. Kaur, P. Singh, and S. Sharma, “Protocols for wireless sensor networks: A survey,” Journal of Telecommunications and Information Technology. 2018.
[4] Z. Ullah, “A Survey on Hybrid, Energy Efficient and Distributed (HEED) Based Energy Efficient Clustering Protocols for Wireless Sensor Networks,” Wirel. Pers. Commun., vol. 112, no. 4, pp. 2685–2713, 2020.
[5] A. Shahraki, A. Taherkordi, Ø. Haugen, and F. Eliassen, “Clustering objectives in wireless sensor networks: A survey and research direction analysis,” Comput. Networks, vol. 180, p. 107376, 2020.
[6] S. A. Susan T and B. Nithya, “Cluster Based Key Management Schemes in Wireless Sensor Networks: A Survey,” Procedia Comput. Sci., vol. 171, pp. 2684–2693, 2020.
[7] P. Sarzaeim, O. Bozorg-Haddad, and X. Chu, “Teaching-Learning-Based Optimization (TLBO) Algorithm BT - Advanced Optimization by Nature-Inspired Algorithms,” O. Bozorg-Haddad, Ed. Singapore: Springer Singapore, 2018, pp. 51–58.
[8] M. Gendreau, “An Introduction to Tabu Search,” in Handbook of Metaheuristics, 2006.
[9] U. E. Zachariah and L. Kuppusamy, “A hybrid approach to energy efficient clustering and routing in wireless sensor networks,” Evol. Intell., 2021.
[10] F. Fanian and M. K. Rafsanjani, “Cluster-based routing protocols in wireless sensor networks: A survey based on methodology,” J. Netw. Comput. Appl., vol. 142, pp. 111–142, 2019.
[11] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient communication protocol for wireless microsensor networks,” System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on. p. 10 pp. vol.2, 2000.
[12] M. Shokouhifar and A. Jalali, “A new evolutionary based application specific routing protocol for clustered wireless sensor networks,” AEU - Int. J. Electron. Commun., vol. 69, no. 1, pp. 432–441, Jan. 2015.
[13] M. Khabiri and A. Ghaffari, “Energy-Aware Clustering-Based Routing in Wireless Sensor Networks Using Cuckoo Optimization Algorithm,” Wirel. Pers. Commun., vol. 98, no. 3, pp. 2473–2495, 2018.
[14] P. K. Roy, C. Paul, and S. Sultana, “Oppositional teaching learning based optimization approach for combined heat and power dispatch,” Int. J. Electr. Power Energy Syst., 2014.
[15] W. Shao, D. Pi, and Z. Shao, “An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem,” Appl. Soft Comput. J., 2017.
[16] X. Wang, L. Wang, and Y. Wu, “An Optimal Algorithm for Prufer Codes,” JSEA, vol. 2, pp. 111–115, Jan. 2009.
* Corresponding Author
Zandhessami@srbiau.ac.ir
رایمگ
الروابط
المراكز ذات الصلة
دعامة
الصفحات الرسمية
حقوق هذا الموقع الإلكتروني مملوكة لنظام Rimag Press Management. © 1438-1446