Wireless Sensor Network Coverage Hole Detection Using Relative Positioning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless sensor networks face challenges in reliably detecting events due to coverage holes caused by sensor node failures, which reduce network reliability and require improved coverage verification schemes that do not rely on precise sensor location information.
Innovation Solution
A method for detecting coverage holes in wireless sensor networks using a coordinate-free approach, where nodes estimate distances to neighbors, determine relative locations, and identify cyclic segment sequences to verify k-coverage without requiring location information, ensuring the sensing border is fully covered.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional coverage verification methods using precise sensor location information are employed, then measurement precision is improved, but device complexity and cost increase
Solution Approach 1:
The patent extracts and removes the requirement for precise sensor location information from the coverage verification process. Instead of using GPS coordinates or other location data, the invention uses only distance measurements between neighboring nodes to determine coverage status, thereby eliminating the need for complex location tracking infrastructure while maintaining verification accuracy
Solution Approach 2:
The patent introduces distance measurements as an intermediary parameter that bridges the gap between sensor nodes and coverage verification. By using distance to neighboring nodes as the basis for determining sensing border coverage, the system avoids direct reliance on precise location information while still achieving accurate coverage hole detection
2Reliability
If sensor node density is increased to eliminate coverage holes, then network reliability is improved, but loss of substance and deployment cost increase
Solution Approach 1:
The patent performs preliminary coverage verification by having each sensor node independently check whether its sensing border is covered by neighboring nodes before deploying or activating the network. This allows the system to identify potential coverage holes in advance and adjust node placement or activation strategies, ensuring reliable event detection without requiring excessive sensor nodes
Solution Approach 2:
Each sensor node autonomously performs coverage verification by measuring distances to its neighbors and determining if its sensing border is adequately covered. This self-service approach eliminates the need for centralized verification and allows the network to self-diagnose and self-adjust, improving reliability without requiring additional monitoring infrastructure or excessive node density
3Measurement precision
If precise sensor location information is required for coverage verification, then measurement precision is improved, but ease of operation deteriorates
Solution Approach 1:
The patent removes the operational burden of collecting and processing precise location information from the coverage verification process. By using only distance measurements between neighboring nodes—data that is naturally available through wireless communication—the system simplifies operations while maintaining verification accuracy
Solution Approach 2:
Each sensor node automatically performs coverage verification using distance measurements to its neighbors, without requiring external location data or centralized coordination. This self-service mechanism makes the system easy to operate, as nodes simply need to communicate with their neighbors to determine coverage status
Data Source
AI summary
Methods and apparatus are provided for improved coverage verification schemes in a wireless sensor network that do not require information about the location of sensor nodes in the wireless sensor network. Coverage holes are detected by a first node in a wireless sensor network by obtaining an estimate of a distance to each of a plurality of additional nodes in a transmission radius of the first node; determining a relative location of each of the plurality of additional nodes in the coordinate system of the first node; identifying border segments of a sensing border of the first node, where each of the border segments comprises a section of a sensing border of the first node that is covered by a sensing radius of at least one of the additional nodes; and determining if a coverage hole exists for the first node by determining if a plurality of the border segments comprise a cyclic segment sequence. The coordinate system comprises r-map coordinates of the first node and the additional nodes, where r is based on a transmission radius of the first node.


