Method of coverage evaluation and optimization using triangulation model

• US 20100302953A1
• Filed: 05/27/2009
• Published: 12/02/2010
• Est. Priority Date: 05/27/2009
• Status: Abandoned Application

• Current Assignee: Xiaoyun Li
• Original Assignee: Xiaoyun Li
• Inventors: Li, Xiaoyun
• Application Number:
  US12/453,899
• Publication Number:
  US 20100302953A1
• Time in Patent Office: Days
• US Class Current: 370/252
• CPC Class Codes: G01S 5/14 Determining absolute distances from a plurality of spaced points of known location
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04W 16/20 for indoor coverage or short range network deployment
• CPC Class Codes: H04W 24/02 Arrangements for optimising operational condition
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update

Abstract

An un-triangulated hole counting method is described in the invention to evaluate the performance of sensing coverage or wireless communication coverage in a randomly and uniformly deployed sensor network or wireless network without knowing the network topology. This method calculates the expected number of un-triangulated holes, which is the un-triangulated area size in the target area divided by mean un-triangulated hole size, given node density and target area size of the network. The present invention thus provides an aid for controlling the degree of coverage in node deployment for randomly deployed sensor networks. It can also aid to choose a suitable common transmission range for all nodes in a wireless network to provide acceptable wireless radio coverage. A position inside a target area is said to be un-triangulated if it is not enclosed by any triangle formed by connectivity links between three mutually connected nodes. An un-triangulated hole is an area enclosed by a polygon formed by links between nodes where each position of the area is un-triangulated.

Claims

1. A method for estimating the expected number of un-triangulated holes in a randomly and uniformly deployed sensor network or wireless network, said method comprising the steps of:

Calculating the expected un-triangulated area size in the target area given node density and target area size, wherein said node density is the mean number of nodes fallen inside a unit sensing coverage area or unit radio coverage area, wherein said un-triangulated area is an area that each position in the area is not enclosed by any triangle formed by links between three mutually connected nodes;

Calculating the mean un-triangulated hole size given node density of the network, wherein said un-triangulated hole is a area enclosed by a polygon formed by links between nodes where each position in the area is un-triangulated.

Calculating the expected number of un-triangulated hole in the target area, which is the expected un-triangulated area size divided by mean un-triangulated hole size.