Probability-Based Coverage Algorithm for 3D Wireless Sensor Networks
We propose a probability-based K-coverage control approach (PKCCA) for the contradiction between the inherent uncertainty and strong fault-tolerance ability and robustness of wireless sensor networks in the monitoring of three-dimensional space. The entire monitoring region is to be covered by at least K sensors with probability T. A grid distribution and greedy heuristic are introduced to determine the best placement of sensors. Our approach will be terminated when a preset upper limit on the number of sensors is reached, or the coverage task is completed. We implement our approach and compare it against traditional random and uniform deployment. The results show that PKCCA uses less sensors to complete the same coverage task or same sensors to reach higher coverage degree. We also analyze the cases of preferential coverage for sub-regions. PKCCA is a better solution with high reliability and robustness to detect special environment with weak propagation of signal.
KeywordsWireless sensor networks three dimensional coverage coverage control K-coverage
Unable to display preview. Download preview PDF.
- 2.Ye, C., Sun, L.M., Liao, Y.: Energy Management of Sensor Networks. J. Comput. Engineer. Appl. 8, 196–198 (2004)Google Scholar
- 3.Cui, J.H., Kong, J.J., Marion, G., Zhou, S.L.: Challenges: Building Scalable and Distributed Underwater Wireless Sensor (UWSNs) for Aquatic Applications. UCONN CSE Technical Report (2005)Google Scholar
- 4.Jinag, P.: Survey on Key Technology of WSN-Based Wetland Water Quality Remote Real-time Monitoring System. J. Chinese Sensor. Actuat. 20, 183–186 (2007)Google Scholar
- 5.Liu, L.P., Wang, Z., Sun, Y.X.: Survey on Coverage in Wireless Sensor Networks Deployment. Journal of Electronics and Information Technology 28, 1752–1757 (2006)Google Scholar
- 7.Bai, H.X., Chen, X., Guan, X.H.: Preserving Coverage for Wireless Sensor Networks of Nodes with Various Sensing Ranges. In: ICNSC 2006. Proceedings of the 2006 IEEE International Conference, pp. 54–59. IEEE Press, Los Alamitos (2006)Google Scholar
- 8.Yang, B.W., Yu, H.Y., Li, H., Hou, H.F.: A Coverage-preserving Density Control Algorithm based-on Cooperation in Wireless Sensor Networks. In: WiCOM 2006, pp. 1–4 (2006)Google Scholar
- 9.Lin, F.Y.S., Chiu, P.L.: A Near-optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks. J. IEEE Communications Letters 9, 43–45 (2005)Google Scholar
- 10.Shakkottai, S., Srikant, R., Shroff, N.: Unreliable Sensor Grids: Coverage, Connectivity and Diameter. In: Bauer, F. (ed.) Proc. of the IEEE Infocom, pp. 1073–1083. IEEE Press, San Francisco (2003)Google Scholar
- 11.Dhillon, S.S., Chakrabarty, K., Iyengar, S.S.: Sensor Placement for Grid Coverage under Imprecise Detections. In: Proc. of International Conference on Information Fusion, USA, pp. 1581–1587 (2002)Google Scholar
- 12.Santosh, K., Ten, H.L., Jozef, B.: On K-coverage in a Mostly Sleeping Sensor Network. In: MobiCom 2004 (2004)Google Scholar