Authors: Xiaofei Xing; Guojun Wang; Jie Li
Addresses: School of Information Science and Engineering, Central South University, Changsha, Hunan Province 410083, China ' School of Information Science and Engineering, Central South University, Changsha, Hunan Province 410083, China ' Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba Science City, Ibaraki 305-8573, Japan
Abstract: Sensing coverage and network connectivity are two fundamental issues in wireless sensor networks (WSNs). In this paper, we first propose a square-based coverage and connectivity probability model (SCCP), which reflects the relations among the coverage (connectivity) rate, the number of deployed sensor nodes, the sensing (communication) range of sensor nodes, and the network size. This model can be used to calculate the number of sensor nodes that need to be deployed for maintaining a certain coverage (connectivity) rate. Then, an efficient approximation algorithm for largest cover set (EAA-LCS) is developed to find a largest cover set (LCS). The simulation results have shown that the error rate of node deployment is less than 5%. The proposed model and algorithm are very useful in estimating the coverage and connectivity capacity in a randomly and uniformly deployed sensor network.
Keywords: WSNs; wireless sensor networks; sensing coverage; network connectivity; probability modelling; LCS; largest cover set; node deployment; simulation.
International Journal of Sensor Networks, 2015 Vol.19 No.3/4, pp.161 - 170
Available online: 05 Nov 2015 *Full-text access for editors Access for subscribers Purchase this article Comment on this article