Communication and Computing Systems ~ Prasad et al. (eds) © 2019 Taylor & Francis Group, London, ISBN 978-0-367-00147-6 Effective-coverage and connectivity in WSN Anand Prakash DRDO-Institute for Systems Studies and Analyses, Dethi, India Mohd Yousuf Ansari DRDO-Defence Scientific Information and Documentation Centre, Delhi, India ABSTRACT: This study addresses the problem of obtaining an effective coverage of sensors in WSN for a given target area while ensuring connectivity among sensors. The problem under consideration assumes that sensors are moving in the area. We propose TLBO (Teach- ing Learning Based Optimization) for coverage problem with OD (Orthogonal Design) to improve the convergence rate of TLBO. Furthermore, we propose to use RNG (Relative Neighborhood Graph) to ensure the connectivity. Finally, we propose to use VF (Virtual Force) concept to achieve even more compact (ie. effective) coverage of sensors. 1 INTRODUCTION WSN (Wireless Sensor Network) has become an important source of information nowadays. WSN can be defined as a collection of sensors which are working autonomously and commu- nicating wirelessly. A typical WSN is shown in Figure 1, which clearly describes how a target sensor node captures a phenomenon in a monitoring area and then transfers the gathered information via a series of connected sensor nodes to reach a sink node eventually. It is the sink node that performs the computation and transforms the result in user defined format over the internet. Sensors can be deployed in a given monitoring area in different ways known as static and dynamic. In static deployment the best location to deploy a sensor is pre-decided by some optimization technique and then becomes invariant throughout its lifetime. Dynamic deploy- ‘ment requires locations and movement capability of sensors in advance. WSN has certain key issues like coverage area and connectivity of sensor nodes in a given target area. It is desirable to obtain minimum number of sensors to be deployed due to its cost. It is also desirable that these sensor nodes are connected in the target area so that infor- mation gathered can eventually reach the sink node for further processing. Thus connectivity is also very essential requirement. This study focuses on how sensor nodes can be deployed effectively in a given target area while ensuring the connectivity among them. We propose to use TLBO (Teaching Learning Based Optimization) which is a nature inspired optimization technique to optimize number of sensor nodes to be deployed in the monitoring area. We propose to use OD (Orthogonal Design) technique to make the convergence rate of TLBO better; combining OD with TLBO we get OTLBO optimization technique for the coverage prob- Jem. We propose to use RNG (Relative Neighbourhood Graph) technique to ensure the connectivity among sensor nodes. The concept of neighbourhood is defined by maintaining the communication graph of the network. Nodes within communication range are con- sidered as neighbouring nodes. We further propose to use virtual force technique to get even better coverage by applying this concept on OTLBO. In section 2, we present the related work in this area. In section 3, we describe OTLBO algo- rithm for sensor nodes coverage problem. In section 4, we explain connectivity preservation 144algorithm for sensor nodes. In section 5, we explain how virtual force can make coverage of sensor nodes effective. In section 6, we explain a system model that can be used for the experi- mentation, In section 7, we explain performance evaluation of the proposed hybrid scheme, Finally, in section 8, we present some conclusions. Figure 1. Wireless Sensor Network system, 2 RELATED WORK In present scenario there has been tremendous improvements in the fields of computer net- work, remote sensing and GIS (Geographic Information System). Many problems like cluster- ing, classification, surveillance of HVT (high valued targets) in border areas require sensors to be deployed to gather relevant information. Figure 2, describes how sensors can be left iso- lated and thus become useless for obtaining useful information in WSN sometimes. The deployment of sensors can be static or dynamic which is based on the fact when we calculate the locations of sensors with respect to time. He X., Gui, X. L. and An, J propose how genetic algorithm can be used in multi-overlapping domains of any target points. This coverage problem is well explained by Guo, X. M., Zhao, C. J., Yang, X. T. et al., whereby authors talk about the coverage problem on grid scan. Zhang,Y. Z., Wu, C.D. Cheng, L. et al. discuss the effect of obstacle, if any, in the monitoring area to achieve the optimal coverage; authors here propose how robots can be utilized to deploy sensors in given area dynamically to improve the overall performance of WSN. In this approach sensors, initially, can be dispersed uniformly over the monitoring field then we can employ any optimization technique to get optimal deployment. The concept of virtual forces is well explained by Luo, Q. and PAN, Z. M. to get optimal coverage of sensors in WSN. This concept has been extended by Wang, X., Wang, S. and MA, J. J. for develop- ing virtual force based particles algorithm. Techniques like simulated annealing, explained by Lin, Y. 8. and Chiu, P. L., PSO (particle swarm optimization algorithm) explained by Liu, Y. 2011 and simulated annealing genetic algorithm, explained by Liao, W. H., Kao, Y. C. and Li, Y. S., can also be considered excellent approaches to address key areas in WSN, Haitao Zhang and Cuiping Liu. also explaine simulated annealing genetic algo- rithm. In mobile sensor networks it has been shown that mobility can make the design of higher layer algorithms complicated, but it can also improve the network performance. Loseri, Valeria, Natalizio, Enrico and Guerriero, Francesca discuss, particle swarm opti- mization schemes Based on consensus for WSN has been well explained. Satapathy, Chan- dra, Naik, Anima and Parvathi, K. explain TLBO and OTLBO techniques. The connectivity preservation and coverage schemes are well explained by Razafindralambo, Tahiry, and Simplot-Ryl, David, it is further explained by Wing-Leung Y and Yuping W and van der Waals force for node deployment is discussed by Xiangyu Yu, Ninghao Liu, Weipeng Huang, Xin Qian and Tao Zhang. A method for optimal target coverage based on Reduced Minimum Spanning Tree (R-MST) is discussed by Abhilash, C. N., Manjula, S. H. and Venugopal, K. R., also termed as r-coverage. Olasupo, T. O. and Otero, C. E. 145discuss an optimization and visualization framework is proposed which is based on hier- archical-logic mapping and deployment algorithms, The approach uses image processing techniques for classification of deployment terrains to improve coverage and connectivity. Sensing models, issues related to coverage and deployment is nicely explained by Tripathi, A., Gupta, H. P., Dutta,T., Mishra, R. Shukla, K. K. and Jit, S., the authors have covered various methods for handling coverage problem in detail. The WSN, sometimes, becomes vulnerable for exchanging classified information especially in defense domain: incomplete secure connectivity can affect various performance parameters, it is explained by Yildiz, H. U., Cifiler, B. S., Tavli, B., Bicakci, K. and Incebacak, D. To improve the coverage and Sharma, D. and Gupta, V. propose connectivity Harmony Search algorithm Their simulation shows that if sensing range is half of the communication range, then average coverage ratio and connectivity ratio become maximum. Al-Karaki, J. N. and Gawanmeh, A. explain how a dynamic programming is utilized to derive optimal neces- sary and sufficient conditions for coverage and connectivity problem in WSN. Sink Node ~~t ee 2 CSS ae P98 2 rencrincsemteamarans Figure 2. Sensor nodes 1 and 2 are not connected. 3. OTLBO FOR COVERAGE PROBLEM 3.1 TLBO (Teaching Learning Based Optimization) The scheme TLBO is considered into two phases: the first phase is known as “Teacher Phase” and the second phase is known as “Learner Phase”. 3.1.1 Teacher phase If we take analogy of a classtoom, a teacher is the most knowledgeable person in a classroom. The teacher imparts knowledge to her students (ie. learners) in the classroom; as a result the knowledge level of the entire class increases. In other words we can say that the original mean of knowledge level M; of the class is increased by the teacher T; to a new mean level M,. The ‘mean of knowledge level is also dependent on quality of the teacher as well as quality of stu- dents in the class. 3.1.2 Learner phase This phase is iterative learning steps of a learner in the classroom. A learner can increase her knowledge only when other learners have more knowledge than her. 3.2 OD (Orthogonal Design) To understand Orthogonal Design let us consider a problem that has multiple factors F having multiple levels L. Thus total number of combinations will be L*. It is noteworthy here that if we have large F and L then it is impractical to calculate all combinations. In order to study multi-factor and multi-level problems the orthogonal design can be used as a tool 1464 CONNECTIVITY PRESERVATION ALGORITHM The second issue is the connectivity of sensor nodes while they are considered moving. The scenario of moving sensor nodes can be modelled by RNG (Relative Neighborhood Graph), where all the moving sensors can be considered as nodes and communication links are represented as edges. The local information of deployed sensors is sufficient for construction of RNG which makes it suitable for modelling the connectivity preservation of aforementioned scenario. The RNG is effective when Euclidean distance is employed which in turn reduces the mean degree of graph. The RNG also has capability to preserve the connectivity when few edges are deleted from the initial graph with a condition that the initial graph is connected. 5 EFFECTIVE COVERAGE AREA USING VIRTUAL FORCE In section 3, we have covered optimal deployment of sensor nodes using OTLBO. Then we have considered RNG for ensuring the connectivity. Now, we propose further to use concept of virtual forces to get better coverage. The net force experienced by sensor node / at any time ran be expressed by the sum of two components, exchange force, Ff and frictional force F?, the relationship is expressed in equation (1). The motion of sensors is modelled by Newton's second law of motion described in equation (3); here m denotes the virtual mass of the sensor node X,(1) denotes its position in the coordinate and F(t) denotes the net virtual force exerted toa sensor node. Fl) = Fe) + FL) () 2 6 SYSTEM MODEL Under this study we assume that WSN is a homogeneous network ic. all sensor nodes are alike in terms of sensing and communication range in the network. We further assume that a sensor is modelled by a range-based disk model to sense and communicate the phe- nomenon within sensing range R, and within communication range Re. It is assumed that sensor nodes do not fail while in operation in WSN and initially sensors are deployed using uniform distribution under random deployment scheme. For the purpose of connect- ivity it is assumed that the communicational links are bidirectional. Let k is the node density, N sensor nodes are deployed in a given target area of size, then the deployment model can be expressed by equation (3), N = kA, where A goes toinfinity 3) 7 EXPERIMENTATION Based on the assumptions and system model described in previous sections a simulation can be performed taking simulation parameters described in Table 1. Final deployment of sensors is shown in Figure 3 147Table 1. Simulation parameters. 1 Sensor field size (L x L) 100m x 100m 2 Number of sensors (N) 50 3 Sensing range (R,) 125m 4 Communication range (R.) 2Rm 5 Number of runs 100 6 Vines 10 mis 7 Time interval (6) 5s 8 Movement step (¢) o 9 Simulation time 5000s 10 Confidence Interval 95% 120 100 o 20 -40, Sa 0 a 2 40 60 #0 700 i20 7140 Figure 3. Final deployment of sensors, 8 CONCLUSION The coverage and connectivity are two fundamental issues in WSN and often considered per- formance metric, in this paper a simulation is performed to ensure the feasibility of OTLBO. optimization scheme on node deployment problem for coverage and connectivity. OTLBO outperforms TLBO in terms of convergence rate, using RNG we can ensure the connectivity during the lifetime of WSN and finally virtual force concept can ensure the effective coverage in the monitoring area by minimizing the overlapped region between two sensor nodes. REFERENCES Abhilash, C. N., Manjula, S. H. and Venugopal, K. R. 2017. Optimal connectivity for target coverage using prediction filter in wireless sensor networks, 2017 Intemational Conference on Wireless Commu- nications, Signal Processing and Networking (WiSPNET), Chennai, pp. 409-413. Al-Karaki, J. N. and Gawanmeh, A.2017.The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited, in IEEE Access, vol. 5, pp. 18051-18065, Guo, X. M., Zhao, C. J., Yang, X. T. et al, 2012.A Deterministic Sensor Node Deployment Method with Target Coverage Based on Grid Scan, Chinese Journal of Sensors and Actuators, Vol.25, No.l, pp.10-109. Haitao Zhang and Cuiping Liu, 2012, A Review on Node Deployment of Wireless Sensor Network, LICSL International Journal of Computer Science Issues, Vol. 9, Issue 6, No 3, ISSN (Online): 1694-0814 He X., Gui, X. L. and An, J. 2010, A Deterministic Deployment Approach of Nodes in Wireless Seasor Networks for Target Coverage, Journal of XiAn Jiaotong University Vol. 44, No.6, pp.6-10. 148Liao, W. H., Kao, Y. C. and Li, Y. . 2011. A Sensor Deployment Approach Using Glowworm Swarm Optimization Algorithm in Wireless Sensor Networks, Expert Systems with Applications, Vol. 38, No., pp. 12180-12188, Lin, Y. S. and Chiu, P. L. 2005. A Near-optimal Sensor Placement Algorithm to Achieve Complete Coverage Discrimination in Sensor Network, IEEE Communications Letters, Vol. 9, No. 1. pp 43-45. Liu, Y. 2011. Wireless Sensor Network Deployment Based on Genetic Algorithm and Simulated Annealing Algorithm, Computer Simulation, Vol. 28, No.5, pp.171-174 Loseri, Valeria, Natalizio, Enrico and Guerriero, Francesca Particle Swarm Optimization Schemes Based on Consensus for Wireless Sensor Networks”. Luo, Q. and PAN, Z.M. 2011.An Algorithm of Deployment in Small-Scale Underwater Wireless Sensor Networks, Chinese Journal of Sensors and Actuators, Vol. 24, No. 7, pp. 1043-1047. Olasupo, T. O. and Otero, C. E, 2018. Framework for Optimizing Deployment of Wireless Sensor Net- works, in IEEE Transactions on Network and Service Management Razafindralambo, Tabiry, and Simplot-Ryl, David.2011.Connectivity Preservation and Coverage Schemes for Wireless Sensor Networks, IEEE Transactions On Automatic Control, Vol. 56, No. 10. Satapathy, Chandra, Naik, Anima and Parvathi, K. 2013. A teaching learning based optimization based on orthogonal design, SpringerPlus, 2:130 Sharma, D. and Gupta, V. 2017, Improving coverage and connectivity using harmony search algorithm in wireless sensor network, International Conference on Emerging Trends in Computing and Commu- nication Technologies (ICETCCT), Dehradun, pp. 1-7. Tripathi,A., Gupta, H. P., Dutta,T., Mishra, R. Shukla, K, K. and Jit, S. 2018. Coverage and Connectiv- ity in WSNs: A Survey, Research Issues and Challenges, in IEEE Access, vol. 6, pp. 26971-26992. Wang, X., Wang, S. and MA, J. J. 2007. Dynamic Sensor Deployment Strategy Based on Virtuai Force- Directed Particle Swarm Optimization in Wireless Sensor Networks, Acta Electronica Sinica, Vol. 35, No. 11, pp. 2038-2042, Wing-Leung Y, Yuping W. 2001.An orthogonal genetic algorithm with quantization for global numerical Optimization, IEEE Trans Evol Comput; 5(1):40-53. Xiangyu Yu, Ninghao Liu, Weipeng H uang, Xin Qian and Tao Zhang. 2013. A Node Deployment Algorithm Based on Van Der Waals Force i n Wireless Sensor Networks, International Journal of tributed Sensor Networks, Volume 2013, Article ID 508710, 8 pages. Yildiz, H. U., Cifiler, B. S., Tavli, B., Bicakei, K. and Incebacak, D. March 2018. The Impact of Incomplete Secure Connectivity on the Lifetime of Wireless Sensor Networks, in IEEE Systems Journal, vol. 12, no. 1, pp. 1042-1046. Zhang,Y. Z., Wu,C. D., Cheng, L. et al.2010.Research of node deployment strategy for wireless sensor in deterministic space, Control and Decision, Vol. 25, No. 11, pp. 1625-1629. 149,