APTEEN routing protocol optimization in wireless sensor networks based on combination of genetic algorithms and fruit fly optimization algorithm

doi:10.1016/j.adhoc.2020.102138

Ad Hoc Networks

Volume 102, 1 May 2020, 102138

https://doi.org/10.1016/j.adhoc.2020.102138 Get rights and content

Abstract

APTEEN routing protocol exists the problems of uneven network energy consumption, premature death of some nodes, consume too much unnecessary energy and low effective coverage of the whole network. To solve these problems, this paper optimizes the APTEEN routing protocol by combining genetic algorithm with fruit fly optimization algorithm. By adding residual energy, distance from node to base station, distance from node to geometric center of the whole network, node degree and other selection factors to cluster heads selection, the genetic algorithm and fruit fly optimization algorithm is used to select cluster heads for the first time, and the second time of cluster heads selection based on density adaptive algorithm. Some nodes are selected to sleep according to the position and degree of nodes. The residual energy of cluster head, the distance between node and cluster head, and the number of cluster members are taken into account when nodes join clusters. When energy is transmitted from cluster heads to base station, the Dijkstra algorithm is used to find the optimal path. Add the rule of rotating cluster heads when the energy consumption of data transmission is too high, and the GA-APTEEN routing protocol is obtained through the above optimization. The simulation results show that the GA-APTEEN improves the 50% lifetime, 10% coverage and robustness of the network, reduces the energy consumption of the overall network system and avoids the phenomenon of the hot zone of energy.

Introduction

Wireless sensor networks (WSNs) have been widely used in many fields due to its excellent monitoring performance. Currently, there are many well-known routing protocols, such as SPEED protocol, GEAR protocol, LEACH and other protocols [1], [2], [3]. However, sensor nodes can not replenish energy. Therefore, an efficient and energy-saving routing protocol becomes a major goal of WSNs to improve network lifetime and robustness of network system. At present, the popular clustering routing protocol is the Adaptive Threshold-sensitive Energy Efficient Sensor Network Protocol (APTEEN).

The APTEEN routing protocol chooses cluster head nodes randomly in a circular way. The algorithm uses the concept of "round". Each node generates a random number between 0 and 1 in each round. If the random number generated is less than the preset number T(n) of the protocol, the node is selected as the cluster head for data transmission. On this basis, APTEEN defines hard and soft threshold to reduce unnecessary data transmission, and it can not only regularly collect data, but also respond quickly in sudden environments [4], [5], [6]. Since the distribution of sensor nodes is basically irregular, APTEEN has the following disadvantages: the protocol can't choose the best cluster heads, some high-energy nodes are not fully utilized, energy consumption between clusters is uneven, when large amounts of data need to be transmitted in emergencies, it is easy to generate the phenomenon of the hot zone of energy, which leads to nodes premature death, there is no good sleep mechanism for densely distributed nodes, and the coverage of cluster heads is too low[7], [8].

In view of the above shortcomings, the APTEEN has been improved a lot at home and abroad [9], [10], [11], [12], [13], [14]. Many protocols optimize the cluster heads selection method for APTEEN, mainly to limit cluster heads selection in terms of energy and location [[11], [12], [13], [15], [16], [17], [14]], so as to select the optimal cluster heads to improve the performance of the whole network and reduce the energy consumption of the whole network [15], [16], [17]. However, the less factors considered in the selection lead to the possibility of not choosing excellent nodes as cluster heads, and unable to balance the energy consumption between clusters, leading to premature death nodes and low coverage. In order to solve the above problems, this paper introduces the method of combining the genetic algorithm and fruit fly optimization algorithm to select cluster heads based on multiple factors of nodes to improve the lifetime and reduce the energy consumption of network, introduces the mechanism of node dormancy and multiple factors clustering, and add the mode of optimal path selection and rotation of cluster head to prolong the lifetime and reduce the phenomenon of the hot zone of energy.

Section snippets

Energy consumption model

APTEEN routing protocol still uses the way of LEACH protocol to select cluster heads in turn, which is shown in formula (1). On this basis, APTEEN specifies two thresholds: hard threshold and soft threshold, which respectively represent the range of measurement values and the change of measurement values before and after. In addition, active and reactive modes are added, which can not only periodically collect data to inform the base station of its own survival, but also respond quickly in

GA-APTEEN optimization protocol

Aiming at the deficiencies of the research status, such as short life cycle, uneven energy consumption leading to the phenomenon of energy hot zone, low coverage, waste of unnecessary energy consumption and so on, the system mainly optimizes the selection of cluster heads, combination of optimal algorithms, the overall coverage of the system, the dormancy of nodes and the clustering of common nodes. The Application of Genetic Algorithms to Adaptive Threshold-sensitive Energy Efficient Sensor

Simulation analysis

The GA-APTEEN protocol is tested on the MATLAB platform to verify its performance. The experimental scenario is that 100 nodes are randomly distributed in the region of 100 m × 100 m, the initial energy of the node is 0.125 J, and 10% high-energy nodes are introduced to create a non-uniform energy environment. The energy of the high-energy node is the energy of the common node 2 times, the base station coordinates are at (50,100), the data fusion degree is 60%, the coverage of each cluster and

Conclusion

Through the above optimization methods, the GA-APTEEN protocol can prolong the network lifetime while ensuring the quality of work, enhance the coverage of the system, balance the energy consumption within the cluster and between clusters, avoid the phenomenon of the hot zone of energy, and reduce the distance of data transmission and receiving, energy consumption and the volume of redundant data. The improved GA-APTEEN routing protocol reduces the frequency of replacing sensor nodes, greatly

Declaration of Competing Interests

The authors declare that they have no conflict of interest.

Acknowledgment

Shubin Wang is the correspondent author and this work was supported by the National Natural Science Foundation of China (61761034).

Minghao Wang was born in Hohhot, Inner Mongolia, China, in 1993. He received the B.S. degree in electronic information science and technology from Nanjing Agricultural University in 2015. He is currently pursuing the M.S. degree in electronic engineering with Inner Mongolia University, Hohhot, China. His research interests include wireless sensor networks, cognitive radio, and published three papers.

References (23)

R Elkamel et al.
Extending the lifetime of wireless sensor networks through mitigating the hot spot problem
J. Parallel Distrib. Comput.
(2019)
T Meng et al.
An improved fruit fly optimization algorithm for solving the multidimensional knapsack proble
Appl. Soft Comput.
(2017)
Y Deng et al.
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
Appl. Soft Comput.
(2012)
J. Choi et al.
J Kaur et al.
Survey on WSN routing protocols
Int. J. Comput. Appl.
(2015)
K Arora V et al.
A survey on LEACH and other's routing protocols in wireless sensor network
Optik
(2016)
Jinyu Ma et al.
Hybrid energy-efficient APTEEN protocol based on ant colony algorithm in wireless sensor network
EURASIP J. Wireless Commun. Netw.
(2018)
N Mittal et al.
Tree-Based Threshold-sensitive energy-efficient routing approach for wireless sensor networks
Wireless Person. Commun.
(2019)
M. Omari et al.
Simulation, comparison and analysis of Wireless Sensor Networks protocols: LEACH, LEACH-C, LEACH-1R, and HEED
N. Mittal
Moth flame optimization based energy efficient stable clustered routing approach for wireless sensor networks
Wireless Person. Commun.
(2019)

A Aalavandhar et al.

Comparative study of different cluster mechanism for wireless sensor networks

Cited by (30)

An enhanced routing algorithm based on a re-position particle swarm optimization (RA-RPSO) for wireless sensor network
2022, Journal of King Saud University - Computer and Information Sciences
Citation Excerpt :
If the distance between a CH and the sink is more than the threshold value, the data is sent to the sink through adjacent CHs. In Wang et al. (2020), an optimum routing protocol (GA-FFO) was presented by merging routing algorithm that depend on GA and Fruit Fly Optimization (FFO). The proposed GA-FFO considered four criteria: node degree, residual energy, distance to the BS, and distance to the center of the network.
Energy saving is a major requirement in the design of routing algorithms to maximize the throughput and lifetime of wireless sensor networks. To address this requirement, this work proposes a routing algorithm based on a novel Reposition Particle Swarm Optimization (RPSO) algorithm and a new fitness function. The role of the RPSO algorithm is to salvage particles that may have fallen into local minima, if any. The algorithm is evaluated using three types of benchmark functions, namely unimodal, multimodal, and rotated multimodal. The evaluation results demonstrate that RPSO outperforms native Particle Swarm Optimization and Particle Swarm Optimization with Levy Flight in terms of convergence speed and global optimum identification. The proposed RPSO is then employed to develop an efficient routing algorithm. The routing algorithm is tested in terms network lifetime, number of dead sensor nodes, energy consumption, and number of packets delivered to base station, against four competitive Meta-Heuristic algorithms. The test results clearly indicate that the routing algorithm outperforms all the competitive algorithms for all the performance metrics. In particular, it achieves $14 %$ to $29 %$ higher network lifetime, $52 %$ to $58 %$ less dead sensor nodes, $61 %$ to $70 %$ less energy consumption, and $13 %$ to $36 %$ more throughput.
CMML: Combined metaheuristic-machine learning for adaptable routing in clustered wireless sensor networks
2022, Applied Soft Computing
Citation Excerpt :
In this method, the proper CHs are selected based on a multi-objective function to minimize the total energy consumption and reduce the number of dead sensor nodes. GA-FFO [41] is a combined routing algorithm based on GA and fruit fly optimization (FFO), which optimizes the routing protocol, considering the residual energy, node degree, distance to the sink, and distance to the center of the network. After primary CH selection using GA-FFO, the final CHs are chosen using a density adaptive algorithm, and then, Dijkstra algorithm is utilized to find the optimal path from each CH to the sink.
Cluster-based routing is the most common routing approach to achieve energy efficiency in wireless sensor networks. However, optimal determination of cluster heads is NP-hard, which calls for heuristics or metaheuristics for obtaining a near-optimal solution. Although metaheuristics achieve better performance, they suffer from high computational time, and thus, cannot rapidly respond to routing requests. Also, a large majority of the existing routing protocols cannot easily adapt to changing network or application configurations. In this paper, a Combined model based on Metaheuristics and Machine Learning, named CMML, is proposed to support efficient and adaptable routing in clustered wireless sensor networks. In our CMML model, a multi-criteria heuristic clustering algorithm is used for clustering in which a metaheuristic (e.g., genetic algorithm) is utilized for the automatic tuning of the heuristic algorithm for each configuration separately. We repeat this process for several configurations (i.e., for different network sizes, numbers of nodes, aggregation factors, lifetime definitions, etc.). The tuned heuristic algorithm in each configuration is subsequently used for network simulation to obtain the corresponding solution. As a result, a comprehensive dataset for different configurations is derived, which is used to train a machine learning model (e.g., support vector machine). The input feature vector of a sample comprises local features (current state of a node at a round), global features (current state of the network), and application-specific features, while the output is the priority factor of each node to be selected as a cluster head. After training the CMML model, it can be applied as a quickly adaptable clustering protocol. In fact, our motivation is to utilize the generalizability of machine learning to learn the behavioral pattern of the metaheuristic algorithm in finding best routes for previous configurations. Simulation results demonstrate that the CMML model can effectively adapt with different applications, while prolonging the network lifetime based on the application requirements.
An enhanced energy proficient clustering (EEPC) algorithm for relay selection in heterogeneous WSNs
2021, Ad Hoc Networks
Citation Excerpt :
Insufficient energy of sensor nodes makes the target tracking system to be despondent. In the recent past, industry-wide research is going on in the domain of wireless sensor networks to achieve energy-efficient communication to enhance the network lifetime and achieve better resource allocation [3–5]. It is revealed from the literature that the utilization of SNs in WSNs, in an energy-efficient manner is still an open area that needs to be researched [3–7].
The recent advancements in Wireless Sensor Networks (WSNs) have brought attention to the field of sensor tracking events. Habitat monitoring is considered as one of the most important applications of WSNs, which ensures wildlife conservation. Researchers have proposed various solutions to select the optimal path in the field of sensor tracking. However, energy dissipation of sensor nodes and fault tolerance during data transformation is still one of the major challenges of the WSN environment in dynamic scenarios. In this paper, an Enhanced Energy Proficient Clustering (EEPC) is proposed to reduce the energy consumption of the entire sensor nodes in the field of tracking events. The network is created with both fixed and mobile nodes. Initially, fixed nodes broadcast information, and mobile nodes select the cluster head from fixed nodes. The mobile nodes select their cluster head (CH) based on their associated placement and energy level. Mobile sensor nodes (SNs) transmit data to the CH. It introduces the concept of finding relay nodes, which are fixed nodes. The EEPC algorithm selects the relay nodes based on their velocity and location by calculating particle fitness value. The selected intermediate relay nodes transmit the collected information to the Base Station (BS) using the sensor data fusion technique. The link fault of nodes could be predicted based on the deviation value. The simulation results show that the proposed approach points out progress with reference to various performance metrics. The proposed work minimizes the energy depletion and enhances the network lifetime compared to other existing protocols.
Energy-efficient Clustering Protocol Using an Improved Binary Dragonfly Algorithm and Mamdani Fuzzy Inference System in Wireless Sensor Networks
2024, Research Square
Energy aware clustering protocol using chaotic gorilla troops optimization algorithm for Wireless Sensor Networks
2024, Multimedia Tools and Applications
Enhanced Energy Proficient Clustering (EEPC) algorithm for minimizes the energy depletion in wireless sensor network
2024, Journal of Intelligent and Fuzzy Systems

View all citing articles on Scopus

Shubin Wang was born in Chifeng, Inner Mongolia, China, in 1971. He received the B.S. and M.S. degrees in physics and electronic engineering from Inner Mongolia University, China, in 1996 and 2003, respectively, and the Ph.D. degree from the Beijing University of Posts and Telecommunications in 2010.From 2009 to 2010, he was a Research Fellow supervised by Prof. K. S. Kwak with Inha University, Inchon, South Korea. Since 2013, he has been a Professor with the College of Electronic Information Engineering, Inner Mongolia University. He is the author of over 40 articles, over 7 inventions, and holds four Chinese patents. His research interests include wireless sensor networks, cognitive radio networks, machine vision, binocular stereo vision. and signal processing.

Dr. Wang was a recipient of the eighth China Inner Mongolia Autonomous Region Youth Science and Technology Award in 2011, the Inner Mongolia Autonomous Region Science and Technology Progress Award in 2009, and the CSPS Best Symposium Paper Award in 2014.

Bowen Zhang was born in Hohhot, Inner Mongolia, China, in 1994. He received the B.S. degree in electronic engineering from Nanchang University, China in 2017. He is currently pursuing the M.S. degree in electronic engineering with Inner Mongolia University, China. His research interests include wireless sensor network, cognitive radio, and he has published two papers.

View full text

APTEEN routing protocol optimization in wireless sensor networks based on combination of genetic algorithms and fruit fly optimization algorithm

Abstract

Introduction

Section snippets

Energy consumption model

GA-APTEEN optimization protocol

Simulation analysis

Conclusion

Declaration of Competing Interests

Acknowledgment

J. Parallel Distrib. Comput.

Appl. Soft Comput.

Appl. Soft Comput.

Survey on WSN routing protocols

Int. J. Comput. Appl.

A survey on LEACH and other's routing protocols in wireless sensor network

Optik

Hybrid energy-efficient APTEEN protocol based on ant colony algorithm in wireless sensor network

EURASIP J. Wireless Commun. Netw.

Tree-Based Threshold-sensitive energy-efficient routing approach for wireless sensor networks

Wireless Person. Commun.

Simulation, comparison and analysis of Wireless Sensor Networks protocols: LEACH, LEACH-C, LEACH-1R, and HEED

Moth flame optimization based energy efficient stable clustered routing approach for wireless sensor networks

Wireless Person. Commun.

Comparative study of different cluster mechanism for wireless sensor networks