Table of Contents Author Guidelines Submit a Manuscript

A corrigendum for this article has been published. To view the corrigendum, please click here.

Journal of Computer Networks and Communications
Volume 2014, Article ID 969501, 11 pages
Review Article

Hole Detection for Quantifying Connectivity in Wireless Sensor Networks: A Survey

Computer Science and Engineering, DCRUST, Murthal, Sonipat 131039, India

Received 31 May 2014; Revised 9 September 2014; Accepted 14 September 2014; Published 7 October 2014

Academic Editor: Tin-Yu Wu

Copyright © 2014 Pearl Antil and Amita Malik. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Owing to random deployment, environmental factors, dynamic topology, and external attacks, emergence of holes in wireless sensor networks is inescapable. Hole is an area in sensor network around which sensors cease to sense or communicate due to drainage of battery or any fault, either temporary or permanent. Holes impair sensing and communication functions of network; thus their identification is a major concern. This paper discusses different types of holes and significance of hole detection in wireless sensor networks. Coverage hole detection schemes have been classified into three categories based on the type of information used by algorithms, computation model, and network dynamics for better understanding. Then, relative strengths and shortcomings of some of the existing coverage hole detection algorithms are discussed. The paper is concluded by highlighting various future research directions.