LEA: An Algorithm to Estimate the Level of Location Exposure in Infrastructure-Based Wireless Networks

Figure 4

LEA operation for cases when . (a) LEA selects the most probable polygon where the mobile node is located at time for row [ 0 1] (see polygon filled in gray color). (b) In a similar way, for row [ 0 0], LEA chooses the most probable polygon where the mobile node is located at time ; (c) shows the associated Voronoi diagram for row [ 1 0] at time . Finally, LEA uses a convex hull (CH) algorithm to compute a unique resulting polygon where the mobile node is likely located.

(a) Voronoi diagram for row [ 0 1]

(b) Voronoi diagram for row [ 0 0]

(c) Voronoi diagram for row [ 1 0]

(d) Resulting polygon by using CH