Optimized Sensor Nodes Deployment in Wireless Sensor Network Using Bat Algorithm
- PDF / 2,729,436 Bytes
- 19 Pages / 439.37 x 666.142 pts Page_size
- 59 Downloads / 195 Views
Optimized Sensor Nodes Deployment in Wireless Sensor Network Using Bat Algorithm Satinder Singh Mohar1 · Sonia Goyal1 · Ranjit Kaur1
© Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract For the optimal performance of wireless sensor networks in different areas of applications needs to maximize the coverage area of sensor nodes. The coverage of sensor nodes in monitoring region can be improved by using efficient node deployment algorithms. In this paper node deployment based on bat algorithm (BA) is proposed to enhance the coverage rate of nodes. Each bat describes solution for deployment of sensor nodes individually. In bat algorithm based node deployment grid points covered by one sensor node are excluded for remaining sensor nodes. The benefit of eliminating the grid points is that the load on remaining nodes is decreased and there is no chance of overlapping i.e. grid point is covered by only one sensor node. The simulations of node deployment based on BA and fruit fly optimization algorithm (FOA) are also demonstrated. In this paper to further increase the coverage rate of sensor nodes the performance of various parameters of bat algorithm such as loudness, pulse emission rate, maximum frequency, grid points and sensing radius has been optimized. The simulation results of node deployment based on optimized bat algorithm are also compared with BA and FOA based node deployment in terms of mean coverage rate, computation time and standard deviation. The coverage rate curve for various numbers of iterations and sensor nodes are also presented for optimized bat algorithm, BA and FOA. The results demonstrate the effectiveness of optimized bat algorithm as it achieved more coverage rate than BA and FOA. Keywords Node deployment · Coverage rate · Grid points · Sensor nodes · Optimized bat algorithm
* Satinder Singh Mohar [email protected] Sonia Goyal [email protected] Ranjit Kaur [email protected] 1
Department of Electronics and Communication Engineering, Punjabi University, Patiala, India
13
Vol.:(0123456789)
S. S. Mohar et al.
1 Introduction Recent inventions in wireless technology have empowered the evolution of wireless sensor networks (WSN). WSN contains huge amount of sensor nodes, these nodes have capabilities to perform tasks such as sensing the data, processing the sense data and also they can share the information with other nodes to achieve the desired task [1, 2]. Furthermore, the nodes can be installed at arbitrary place or can be at pre-planned places. A large region can be covered with more accuracy if enormous nodes are placed at optimized positions [3]. WSNs can be categorized into two parts structured and unstructured WSN. In case of unstructured WSN handling network connections and detection of failure nodes is difficult since large numbers of nodes are placed at arbitrary sites in the region. Few sensor nodes are positioned at pre-defined locations in structured WSN. Network maintenance and detection of failures is easy in structured netw
Data Loading...
