Holes Detection in Wireless Sensor Networks: A Survey
---
paper_title: Wireless sensor networks: a survey

paper_content:

This paper describes the concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of factors influencing the design of sensor networks is provided. Then, the communication architecture for sensor networks is outlined, and the algorithms and protocols developed for each layer in the literature are explored. Open research issues for the realization of sensor networks are also discussed.
---
paper_title: JAM: a jammed-area mapping service for sensor networks

paper_content:

Preventing denial-of-service attacks in wireless sensor networks is difficult primarily because of the limited resources available to network nodes and the ease with which attacks are perpetrated. Rather than jeopardize design requirements which call for simple, inexpensive, mass-producible devices, we propose a coping strategy that detects and maps jammed regions. We describe a mapping protocol for nodes that surround a jammer which allows network applications to reason about the region as an entity, rather than as a collection of broken links and congested nodes. This solution is enabled by a set of design principles: loose group semantics, eager eavesdropping, supremacy of local information, robustness to packet loss and failure, and early use of results. Performance results show that regions can be mapped in 1-5 seconds, fast enough for real-time response. With a moderately connected network, the protocol is robust to failure rates as high as 25 percent.
---
paper_title: Denial of Service in Sensor Networks

paper_content:

Sensor networks hold the promise of facilitating large-scale, real-time data processing in complex environments, helping to protect and monitor military, environmental, safety-critical, or domestic infrastructures and resources, Denial-of-service attacks against such networks, however, may permit real world damage to public health and safety. Without proper security mechanisms, networks will be confined to limited, controlled environments, negating much of the promise they hold. The limited ability of individual sensor nodes to thwart failure or attack makes ensuring network availability more difficult. To identify denial-of-service vulnerabilities, the authors analyzed two effective sensor network protocols that did not initially consider security. These examples demonstrate that consideration of security at design time is the best way to ensure successful network deployment.
---
paper_title: Optimal Energy Aware Clustering in Sensor Networks

paper_content:

Sensor networks is among the fastest growing technologies that have the potential of changing our lives drastically. These collaborative, dynamic and distributed computing and communicating systems will be self organizing. They will have capabilities of distributing a task among themselves for efficient computation. There are many challenges in implementation of such systems: energy dissipation and clustering being one of them. In order to maintain a certain degree of service quality and a reasonable system lifetime, energy needs to be optimized at every stage of system operation. Sensor node clustering is another very important optimization problem. Nodes that are clustered together will easily be able to communicate with each other. Considering energy as an optimization parameter while clustering is imperative. In this paper we study the theoretical aspects of the clustering problem in sensor networks with application to energy optimization. We illustrate an optimal algorithm for clustering the sensor nodes such that each cluster (which has a master) is balanced and the total distance between sensor nodes and master nodes is minimized. Balancing the clusters is needed for evenly distributing the load on all master nodes. Minimizing the total distance helps in reducing the communication overhead and hence the energy dissipation. This problem (which we call balanced k-clustering) is modeled as a mincost flow problem which can be solved optimally using existing techniques.
---
paper_title: Estimating coverage holes and enhancing coverage in mixed sensor networks

paper_content:

Area coverage is one of the most fundamental problems in ad hoc wireless sensor networks because it directly relates to optimization of resources in a sensing field. Maximizing the coverage area while maintaining a lower cost of deployment has always been a challenge, especially when the monitoring region is unknown and possibly hazardous. In this paper, we present a method to deterministically estimate the exact amount of coverage holes under random deployment using Voronoi diagrams and use the static nodes to collaborate and estimate the number of additional mobile nodes needed to be deployed and relocated to optimal positions to maximize coverage. We follow a two-step deployment process in a mixed sensor network and we argue by simulation and analysis that our collaborative coverage enhancing algorithm (COVEN) can achieve a tradeoff between the cost of deployment and percentage of area covered.
---
paper_title: Hole Detection for Increasing Coverage in Wireless Sensor Network Using Triangular Structure

paper_content:

The emerging technology of wireless sensor network (WSN) is expected to provide a broad range of applications, such as battlefield surveillance, environmental monitoring, smart spaces and so on. The coverage problem is a fundamental issue in WSN, which mainly concerns with a fundamental question: How well a sensor field is observed by the deployed sensors? Mobility is exploited to improve area coverage in a kind of hybrid sensor networks. The main objective for using mobile sensor nodes is to heal coverage holes after the initial network deployment, when designing a hole healing algorithm, the following issues need to be addressed. First, how to decide the existence of a coverage hole and how to estimate the size of a hole. Second, what are the best target locations to relocate mobile nodes to repair coverage holes? We use the triangular oriented diagram (HSTT) for aim to goal where its simple ,have low calculation among construction and it is great to calculate the size of hole exactly .
---
paper_title: Bidding Protocols for Deploying Mobile Sensors

paper_content:

Constructing a sensor network with a mix of mobile and static sensors can achieve a balance between sensor coverage and sensor cost. In this paper, we design two bidding protocols to guide the movement of mobile sensors in such sensor networks to increase the coverage to a desirable level. In the protocols, static sensors detect coverage holes locally by using Voronoi diagrams and bid mobile sensors to move. Mobile sensors accept the highest bids and heal the largest holes. Simulation results show that our protocols achieve suitable trade-off between coverage and sensor cost
---
paper_title: Level Set Based Coverage Holes Detection and Holes Healing Scheme in Hybrid Sensor Network

paper_content:

A fundamental issue in sensor network is the coverage problem. Since the distribution of sensor nodes is not usually uniform due to random deployment and node failures, the coverage holes are hardly avoided in sensor network. And the coverage holes are important health indicators of the sensor network. This paper firstly proposes a level set based coverage holes detection algorithm for hybrid sensor network. This algorithm could estimate the number of holes and the size of the holes. Then we propose genetic algorithms based coverage holes healing algorithm. This algorithm could leverage mobility to optimize the average coverage rate and the average movement distance of the mobile nodes. Simulation results show that the proposed method could detect the holes efficiently. The holes healing algorithm outperforms the Random and Delaunay methods.
---
paper_title: A Real-Time Directed Routing Protocol Based on Projection of Convex Holes on Underwater Acoustic Networks

paper_content:

The directed routing protocol ends in failure when it faces a situation of the destination node with a very low velocity in a sparse ad hoc network so that none of nodes exist in its forwarding zone. Illuminated by BFDREAM and ZONER, the paper firstly proposes a novelty routing protocol that is fairly immune to forwarding failure through projecting the present source node on the boundaries of convex baffle holes of underwater acoustic networks in deep sea. Compared with DREAM and BFDREAM, the experimental results show our protocol achieves a great improvement in decreasing the propagation delay and reducing quantities of the non-effect information. So the new protocol may have a bright application prospect in deep sea acoustic networks.
---
paper_title: Toward the automatic detection of access holes in disaster rubble

paper_content:

The collapse of buildings and other structures in heavily populated areas often result in multiple human victims becoming trapped within the resulting rubble. This rubble is often unstable, difficult to traverse and dangerous for first responders who are tasked with finding and extricating victims through access holes in the rubble. Recent work in scene mapping and reconstruction using RGB-D data collected by unmanned aerial vehicles (UAVs) suggest the possibility of automatically identifying potential access holes into the interior of rubble. This capability would allow critical limited search capacity to be concentrated in areas where potential access holes can be verified as useful entry points. In this paper, we present a system to automatically identify access holes in rubble. Our investigation begins with defining a hole in terms of its functionality as a potential means for accessing the interior of rubble. From this definition, we propose a set of discriminative geometric and photometric features to detect “access holes”. We conducted experiments using RGB-D data collected over several disaster training facilities using a UAV. Our empirical evaluation indicates the potential of the proposed approach for successfully identifying access holes in disaster rubble scenes.
---
paper_title: Hole Detection for Increasing Coverage in Wireless Sensor Network Using Triangular Structure

paper_content:

The emerging technology of wireless sensor network (WSN) is expected to provide a broad range of applications, such as battlefield surveillance, environmental monitoring, smart spaces and so on. The coverage problem is a fundamental issue in WSN, which mainly concerns with a fundamental question: How well a sensor field is observed by the deployed sensors? Mobility is exploited to improve area coverage in a kind of hybrid sensor networks. The main objective for using mobile sensor nodes is to heal coverage holes after the initial network deployment, when designing a hole healing algorithm, the following issues need to be addressed. First, how to decide the existence of a coverage hole and how to estimate the size of a hole. Second, what are the best target locations to relocate mobile nodes to repair coverage holes? We use the triangular oriented diagram (HSTT) for aim to goal where its simple ,have low calculation among construction and it is great to calculate the size of hole exactly .
---
paper_title: Research of Location Technology Based on Wireless Sensor Network

paper_content:

The node localization algorithms based on distance measurement are mainly studied in this paper.A stepwise weighted positioning algorithm based on distance measurement is designed on the basis of analyzing several typical positioning algorithms,static nodes positioning under natural environment is achieved. On this basis,with STMS32 selected as a core chip in the paper,the basic system circuit and peripheral interface circuit of node device is designed,and then using the development software BeeKit and CodeWarrior for node software design,localization algorithm is testedthrough experiment.After analyzing the results,the algorithm is mostly influenced by the RSSI ranging error,the coarse positioning of node can be achieved.
---
paper_title: Data Collection Method with A Mobile Sink Node in Wireless Sensor Network

paper_content:

this paper resent a data collection method of using mobile sink and static sink together against “thermal region” in wireless sensor network. The mobile sink visits the remote-cluster and communicates with the head node directly, thus reducing both the energy cost of multi-hop transmission in long distance and the frequency of data forwarding in clusters near the static sink. Simulation results showed that the added mobile sink extended the network lifetime and expanded the capacity of network.
---
paper_title: A Study of Black Hole Attack on MANET Performance

paper_content:

Mobile Ad hoc Network (MANET) is a self-organized wireless network, consisting of nodes (mobile devices) responsible for its creation, operation and maintenance. The communication in the MANET is of multihop in nature due to absence of any fixed infrastructure. An attacker may intrude easily into MANET by posing as legitimate intermediate node and present various types of security attacks on data exchanges taking place between source and destination. In this paper we study the impact of presence of black hole node on MANET performance on the basis of reachability, hop count, neighbor node density and path optimality. We observe that as the percentage of black hole nodes increases, the MANET performance degrades significantly.
---

Title: Holes Detection in Wireless Sensor Networks: A Survey

Section 1: INTRODUCTION
Description 1: Provide an overview of wireless sensor networks (WSNs), their applications, and their importance. Discuss the problem of holes in WSNs and introduce different types of holes.

Section 2: Subsystems in WSNs
Description 2: Describe the three main subsystems of WSNs: sensor subsystem, processing subsystem, and communication subsystem.

Section 3: Characteristics of WSNs
Description 3: Explain the key characteristics of WSNs and their implications for hole detection. Briefly outline the organization of the paper.

Section 4: Types of Holes in WSNs
Description 4: Identify and describe various types of holes in WSNs, including coverage holes, routing holes, sink/black holes, and worm holes.

Section 5: Coverage Hole
Description 5: Discuss coverage holes in detail, including factors affecting coverage, types based on static and moving sensors, and specific scenarios like area coverage, point coverage, and barrier coverage.

Section 6: Routing Hole
Description 6: Elaborate on routing holes, their causes, difficulties in handling them, and comparisons to other types of holes like jamming holes.

Section 7: Sink/Black Hole
Description 7: Detail the concept of sink/black holes, their impact on data transmission, and methods to detect them.

Section 8: Worm Hole
Description 8: Describe worm holes, their formation through Denial of Service (DoS) attacks, and the consequences on network routing.

Section 9: EXISTING SOLUTIONS TO HOLE DETECTION
Description 9: Present existing methodologies for hole detection in WSNs, including the Voronoi diagram and triangular oriented diagram approaches.

Section 10: Voronoi Diagram Approach
Description 10: Explain how the Voronoi diagram approach works for detecting and measuring coverage holes.

Section 11: Triangular Oriented Diagram Approach
Description 11: Discuss the triangular oriented diagram approach for hole detection, highlighting its advantages and limitations.

Section 12: PROPOSED ALGORITHM FOR HOLE DETECTION
Description 12: Introduce a new algorithm proposed by the authors for hole detection, including its operational phases and expected improvements over existing methods.

Section 13: CONCLUSION AND FUTURE RESEARCH DIRECTIONS
Description 13: Summarize the survey's findings, the proposed algorithm, and outline potential future research directions in hole detection and WSN coverage improvement.