A Novel Lightness Localization Algorithm Based on Anchor Nodes Equilateral Triangle Layout in WSNs

Abstract

Localization, which determines the geographical locations of sensors, is a crucial issue in wireless sensor networks. In this paper, we propose a novel lightweight equilateral triangle localization algorithm (LETLA) that accurately localizes sensors and minimizes the power consumption. In the LETLA, the approximate coordinates substituted for the real coordinates of the unknown node, and the corresponding optimization problem is formulated to minimize the estimation error. With the sequences that represent the ranking of distances from the anchors to the unknown node, a simple and robust technique is developed to quickly and efficiently estimate a region containing the approximate coordinates, and a condition under which the approximate error can be minimized is given. This condition employs a new geometric construct of anchor layout called equilateral triangle diagrams. Extensive simulations show that the LETLA performs better than other state-of-the-art approaches in terms of energy consumption with the same localization precision.

1. Introduction

WSNs (Wireless Sensor Networks) have recently received great attention because they hold the potential to change many aspects of our economy and life [1–8]. Typical networks consist of a large number of densely deployed sensor nodes which could gather local data and communicate with other nodes. The data from these sensor nodes are relevant only if we know their locations. In addition, the accurate location estimation could aid in sensor network services such as routing, information processing, tasking, and querying. Therefore the knowledge of positions becomes imperative [9–17]. Moreover, the minimum resources must be used: typical sensor nodes are battery powered and have a limited processing ability [18, 19]. These constraints impose the new challenges in localization algorithm development and imply that power efficient, computation complexity and location precision should be employed simultaneously. Many methods have been proposed, such as APS (DV-Hop, DV-coordinates) [20], APIT [21–26], triangulation [27–29], Centroid [30–33], Sequence Based [34–38], Voronoi diagrams [39–43], and mathematical programming [44–46].

With regard to the precision of location, most of the localization algorithms can be classified into two broad categories: accuratelocation algorithm and approximate location algorithm. The accuratelocation algorithm produces the exact coordinates of the unknown node through complex calculations and precise measurement of distance. Typical accuratelocation algorithms include triangulation, linear programming, and semidefinite programming. The approximate location algorithms estimate an approximate position of the unknown node, with rough measurement and simple calculation. APS, APIT, Centroid, Sequence Based, and Voronoi diagrams are all approximate location algorithms.

The accurate location algorithms have two major requirements that render them disadvantages; that is, (a) the complexity is high, because triangulation, linear programming, and semidefinite programming usually involve solving higher order nonlinear equations which consume a large amount of energy, and (b) the ranging accuracy should be high enough, otherwise location algorithm will be halted. Under an adverse ranging condition, exact localization is not available; hence the statistical estimation will be introduced [47–49]. When the limited energy, the reduced processor, and the unstable accuracy of ranging results have been given [5, 17, 19], the precise coordinates of the unknown node are usually difficult to be obtained. Furthermore, in the scene of mobile sensor nodes, the precise coordinates need so much time that the location result is not valid anymore.

The approximate location algorithms consume less energy in computing, since the location procedures of APS, APIT, Centroid, Sequence Based, and Voronoi diagrams are made up of simple logical operations and algebraic operations. The aim of approximate location algorithms is to find a rough precise position of the unknown node with the least energy consumption and to achieve a compromise between the accuracy and the complexity. The approximate location algorithms are particularly useful for large-scale wireless sensor networks, because they could extend sensor nodes' life with less computation complexity and energy consumption and tolerate ranging error to a certain degree.

In this paper, we present a novel equilateral triangle localization algorithm (LETLA) that is a lightweight approximate localization algorithm and could provide better precision with less power consumption. In the LETLA, the sensing area is covered by many identical disjoint equilateral triangle diagrams, and the anchors are placed in the vertexes of the equilateral triangle diagrams. The LETLA is an approximate localization based on the concept of substituting the approximate coordinates for the real coordinates, which could loose less accuracy and save more energy. The new geometric construct of the layout, called the equilateral triangle diagrams, has a major contribution to minimize the approximate error and simplify the location procedure. In order to avoid the ranging ambiguities arising from the interference of noise, the LETLA adopts the order of ranging results to represent the location relationship of unknown node and anchors. That is an effective technology and has been employed in many works of literature [34, 36–38].

The rest of the paper is organized as follows. The next section gives a brief overview of the related work. In Section 3, we describe the procedures of the LETLA. To prove the rationality of the LETLA, we calculate the utilization coefficient of the equilateral triangle diagrams, illustrate the geometrical characteristics of the equilateral triangle diagrams, explain the reason for dividing the equilateral triangle into seven distinct regions, and introduce a principle to determine the point of tangency. In Section 4, we demonstrate the localization procedures of the LETLA in a practical scenario. In Section 5, we present a performance study of the LETLA and make a comparison with other four localization techniques. We conclude this paper and mention our future work in Section 6.

2. State of the Art

In this section, we first give a brief summary of centroid, sequence-based, and Voronoi diagrams and then show the inspirations from them.

2.1. Survey of Centroid, Sequence-Based, and Voronoi Diagrams Localization Technology

Recently, many researchers have focused on localization in WSNs. Bulusu et al. [30] demonstrated a location technique called “Centroid” in 2000. Firstly, with the help of basic connectivity or distance information, a rough estimate of relative node distance is made. Then layout of anchors is used to create a relative map of anchor position. Finally the coordinates of the centroid are obtained by calculating the coordinates of anchors which surround the unknown node in a radiation range of communication. The coordinates of the centroid are regarded as the approximate coordinates of the unknown node. In 2007, weighted centroid localization (WCL) was provided by Blumenthal et al. [31]. It is derived from a centroid determination which calculates the position of unknown node by averaging the coordinates of anchors. To improve the precision in real implementations, the weights were used to refine the estimated position [32]. Because the radio device can provide the Link Quality Indication (LQI), received signal strength indication (RSSI), the performance of packet transmission, and even the difference of energy received in packets, it achieves better precision than original centroid localization. In 2011, Jun et al. [33] presented the first theoretical framework for WCL in terms of the localization error distribution parameterized by the node density, the node placement, the shadowing variance, the correlation distance, and the inaccuracy of sensor node positioning. With this analysis, the robustness of WCL has been quantified, and some design guidelines, such as node placement and spacing, for the practical deployment of WCL, have been provided.

Yedavalli et al. [34] described the sequence-based location approach, called Ecolocation, which was quite effective in dense and uniform topologies in 2005. Ecolocation determines the location of unknown nodes by examining the ordered sequence of received signal strength measurements taken at multiple reference nodes. The key features of the Ecolocation algorithm are as follows: (1) it constructs a constraint table based on the RSSI values; (2) it searches the table to find the location. However, the Ecolocation algorithm is imperfect and has a rough localization performance. In 2009, Zhong and He [50] presented a range-free approach to capture a relative distance between 1-hop neighboring nodes from their neighborhood orderings. With little overhead, the proposed method can be conveniently applied as a transparent supporting layer for many state-of-the-art connectivity-based localization solutions.

To improve the localization accuracy, a new algorithm based on the weighted rank order correlation coefficient and the dynamic centroid was proposed by Yu et al. [35] in 2011. The simulations indicate that the localization accuracy and the robustness of the new algorithm are distinctly raised compared with the Ecolocation.

In 2008, Yedavalli et al. [36] introduced a novel sequence-based localization technique (SBL). In the SBL, the localization space can be divided into many distinct regions that can be uniquely identified by the sequences. The sequences represent the ranking of distances from the anchors to that region. The SBL and the Ecolocation are both proposed by Kiran. The Ecolocation picks the location that maximizes the number of satisfied anchor's topology constraints. In contrast, the SBL applies two statistic metrics that capture the difference in the rank orders. For the problem of location error, a new localization technique, based on the SBL, was proposed by Liu et al. [37] in 2009. Because it uses the triangular area which is enclosed by the centroids of the three “nearest” location regions, it improves the accuracy to some extent. In 2011, Hsiao et al. [38] analyzed the deployment strategy of sensor nodes for the SBL algorithm in order to effectively reduce location error such as (1) the standard deviation of the polygon area cut by the perpendicular bisectors should be kept as small as possible; (2) certain amount of space should be maintained between the sensor nodes, and (3) optimization with the angle between the perpendicular bisectors should be utilized.

Voronoi diagrams provide a powerful technique for analysing computational geometric problems. The Voronoi diagrams divide the plane into multiple polygons (known as cells). Specifically, the cells are constructed in the way that any point in a cell is closer to the local site (i.e., the site within the cell) than to any other site on the plane. Recently, the concept of Voronoi diagrams has been applied in robot navigation and map establishing [39].

In 2007, Boukerche et al. [40] proposed a novel approach that adopted Voronoi diagrams. Two types of localization can result from the proposed algorithm: the physical location of the node (e.g., latitude, longitude) or a region limited by the node's Voronoi cell. In 2009, Boukerche et al. improved DV-Hop localization algorithm with Voronoi diagrams to limit the scope of flooding communication and error [41]. In 2010, to achieve “k-coverage” of the sensing area, which means every point in the surveillance area is monitored by at least k sensors, Li and kao [42] presented a novel distributed self-location estimation scheme based on Voronoi diagrams with mobile nodes. Li illustrated that distributed Voronoi diagrams provided a convenient means of analysing the coverage problem in large-scale sensor networks. In the same year, Ampeliotis and Berberidis [43] generalized a notion of the closest point of the approach estimator. While in the closest point of approach estimator, the unknown node may lie close to the closest point of approach node. Hence the unknown node is restricted to lie in a convex set called the sorted order-K Voronoi cell.

2.2. Inspiration of Centroid, Sequence-Based, and Voronoi Diagrams Localization Technology

By the literature in former section, we find some inspirations from centroid, sequence-based, and Voronoi diagrams. They are adopted, developed, and fused in the LETLA.

According to the facts in WSNs, most location applications only require a proximate region instead of the accurate coordinates of the unknown nodes. Especially in the localization of the mobile nodes, the real-time and approximate coordinates of the mobile nodes are more effective than the accurate coordinates with a long computing delay. Moreover, WSNs need to prolong the sensor node's life, as the sensor nodes are powered by batteries and replaced difficultly. Therefore, substituting the approximate coordinates for the real coordinates of the unknown node is an efficient method to balance the location precision and the computation complexity. The purpose of centroid is to substitute the approximate coordinates for the real coordinates, which significantly reduces the location complexity. Enlightened by the centroid, we proposed a method to obtain the approximate coordinates instead of the real coordinates. This method simplifies the arc equations to the tangent equations as described in Section 3.

In WSNs, the unknown nodes can build Voronoi diagrams based on the position information of anchors and the rank of ranging result. Each node also can find the Voronoi diagrams it belongs to. There is a geometric constraint that links the location to the sorting of the distances between the unknown node and the anchors. If we know the correct sorting of the distances, we would restrict the space in which the unknown node may lie. This space is the Voronoi diagrams that corresponds to the correct sorting. Aiming to reduce the computation complexity in building Voronoi diagrams, we propose the equilateral triangle diagrams which have better geometric attribute than Voronoi diagrams in simplifying location process.

The order sequences of ranging result are more robust than the numerical measurement of distance, which has been proved in some papers [34, 36–38]. The measurement noise corrupts the numerical measurement of distance directly and distinctly over the whole location area, but it alters the rank of ranging result slightly in the most of the areas. In the Voronoi diagrams and the equilateral triangle diagrams, each region can be identified by only a sorted sequence of ranging result. Hence, the special limited region covering the unknown node can be determined by the order sequences of ranging result. In some mobile instances, the special limited region can be regarded as a rough location, if a little location delay is demanded. Consequently we apply the sequence-based method in the LETLA to determine the special limited region efficiently.

3. Lightness Equilateral Triangle Localization Method

In the LETLA, the anchors are able to acquire their positions via external device like GPS, but the unknown nodes cannot obtain this information. The unknown nodes can get the positions of the anchors and construct the corresponding location sequence tables. Then, every wireless sensor node is equipped with an omnidirectional antenna which can transfer wireless signal in all directions [21, 50–56].

The localization area is divided into many same equilateral triangles, as shown in Figure 1(a). Each equilateral triangle formed by three anchors is picked out to estimate the position of the unknown node. All anchors are deployed in the vertexes of equilateral triangles and fixed after the initial deployment. Each anchor has six adjacent anchors with the same distance, denoted by a. As shown in Figure 1(a), anchor J has six adjacent anchors K, L, M, N, R, and S, which are the nearest six anchors to J with the distance of a. Each node has the same data transmission radius, denoted by l. In the LETLA $l > 2 a$ is valid. ▵ denotes an equilateral triangle. The basic procedures of the LETLA can be described as follows.

Figure 1

(a) The anchor layout and a demonstration of Steps 1 and 2; (b) the example of dividing $▵ D E C$ in Step 3; (c) an instance of selecting two arcs in Step 4; (d) the intersection of two tangents substituted for the intersection of two arcs in Step 5.

Step 1.

The unknown node measures the distances between itself and the anchors in its transmission range and sorts the ranging result in the ascending order. The node P is an unknown node and resides in an equilateral triangle with the side of a. This equilateral triangle can be found by utilizing the three shortest distances between the anchors and node P. If nodes $A, B$ , and C are the three nearest anchors according to the ranging sequence, the node P will reside in the $▵ A B C$ , as shown in Figure 1(a). In Step 1, node P is assigned to $▵ A B C$ , only by means of the rank of distance measurement, not related to any numerical computation.

Step 2.

When $▵ A B C$ is determined, $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ are selected. As shown in Figure 1(a) the overlap region of $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ is $▵ A B C$ and their side lengths are $2 a$ . Because node P knows the positions of the anchors, it is feasible to find these three equilateral triangles.

Step 3.

$▵ D E C$ , $▵ I B H$ , and $▵ A F G$ are divided into seven distinct regions, respectively. Figure 1(b) shows the example of dividing $▵ D E C$ into seven distinct regions, by means of three arcs with the centers on the vertexes of the $▵ D E C$ and the radii equal to r. Node P localizes itself at the fifth region of the $▵ D E C$ according to the relation of $D P$ , $E P$ , $C P$ , and r in Table 1. Node P also finds other two regions in $▵ I B H$ and $▵ A F G$ , respectively, in the same way.

Table 1

The method of determining the sequence number of the region in $▵ D E C$ .

Sequence number	Sufficient and necessary condition
1	$D P < r$ , $E P > r$ , $C P > r$
2	$D P < r$ , $E P < r$ , $C P > r$
3	$D P > r$ , $E P < r$ , $C P > r$
4	$D P > r$ , $E P < r$ , $C P < r$
5	$D P >$ r, $E P > r$ , $C P < r$
6	$D P <$ r, $E P > r$ , $C P < r$
7	$D P <$ r, $E P < r$ , $C P < r$

Step 4.

According to the regions including node P in $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ , two arcs are selected. They have an intersection in the position of node P. For the example presented in Step 3, two arcs are shown in Figure 1(c). Because node P is in the fifth region of $▵ D E C$ , the third region of $▵ I B H$ , and the sixth region of $▵ A F G$ in Step 3, the arc with center F and radius $F P$ and the arc with center C and radius $C P$ are selected by Table 2. The length of the arc is limited by the range of region divided in Step 3. As shown in Figure 1(c), because node P is in the sixth region of $▵ A F G$ , the length of one arc is limited by the range of the sixth region in $▵ A F G$ . In the same manner, length of the other arc is limited by the range of the fifth region in $▵ D E C$ .

Table 2

The method of selecting two arcs to indicate unknown node P with their intersection.

Sequence number in $▵ D E C$	Sequence number in $▵ I B H$	Sequence number in $▵ A F G$	Center	Radius
6	2	1	Node A and node H	AP and HP
4	3	2	Node B and node D	BP and DP
5	4	6	Node C and node F	CP and FP
6	3	1	Node A and node E	AP and EP
5	2	1	Node A and node H	AP and HP
4	3	1	Node B and node D	BP and CP
5	3	2	Node B and node G	BP and GP
5	3	6	Node C and node F	CP and FP
5	4	1	Node C and node I	CP and IP
5	3	1	Node A and node B	AP and BP

Step 5.

The intersection of the two tangents is substituted for the intersection of two arcs selected in Step 4. In Figure 1(d), the intersection of the two tangents, denoted by Q, is considered to be the approximation of the intersection of two arcs which is also the position of the unknown node P. The principle of finding the point of the tangency is illustrated in Section 3.3.

3.1. Geometrical Characteristics of Equilateral Triangle Diagram

In Step 1, we propose a proposition: the unknown node P resides in $▵ A B C$ , when nodes A, B, and C are the three nearest anchors in Figure 1(a). In this section, we validate the proposition through mathematical proofs. We consider the sides of an equilateral triangle as a part of the inside of the equilateral triangle. Thus, a node is either inside or outside an equilateral triangle.

Proposition 1.

As shown in Figure 1(a), if nodes $A, B$ , and C are the three nearest anchors to node P according to the ranging sequences, node P is inside $▵ A B C$ .

Proof.

First, in Figure 1(a), the localization space is cut into many equilateral triangles with the same side length a, and therefore each node in the localization space will be inside an equilateral triangle with the side length a. Second, if a node is inside an equilateral triangle, the distances between the node and the three vertexes of the equilateral triangle are all less than the side length $(a)$ of the equilateral triangle. If a node is outside an equilateral triangle, the longest distance between the node and the three vertexes of the equilateral triangle is more than a.

Let us prove this by contradiction. Nodes $A, B$ , and C are the three nearest anchors to node P according to the ranging sequences. Let us suppose the false proposition that node P is outside $▵ A B C$ . Since each node in the localization space will be inside an equilateral triangle with the side length a, node P is inside $▵ J K L$ , which is an arbitrary equilateral triangle and differs from the $▵ A B C$ . Because node P is inside $▵ J K L$ , it can be concluded that $P J < a$ , $P K < a$ and $P L < a$ . Node P is outside $▵ A B C$ simultaneously, if $P A > P B > P C$ , hence it is obtained $P A > a$ . Consequently, we can draw a conclusion that $P A > P J$ , $P A > P K$ , and $P A > P L$ , which is a contradiction as nodes $A, B$ , and C, are the three nearest anchors to node P. Now it is fallacious that node P is outside $▵ A B C$ . So the proposition that node P is inside $▵ A B C$ is true.

3.2. Reason of Dividing Equilateral Triangle

In this section, we will present the reason why $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ are divided into seven distinct regions, respectively. We first introduce a conclusion which will be proved in Section 3.3. In substituting the intersection of the two tangents for the intersection of the two arcs, as described in Step 5, the approximation error varies directly with the angle and the radius of the two arcs. For a given point of tangency, less radius and angle of the arc will lessen the approximation error.

Take $▵ D E C$ for example, only node D, node E, and node C can be considered as the center of the arc in Table 2. Before dividing, the angle of the arc in $▵ D E C$ is 60 degrees and the radius of the arc in $▵ D E C$ is in the range $[0, a]$ . When $▵ D E C$ has been divided into seven distinct regions, the length of the arc is limited by the range of the region which reduces the ranges of angle and radius of the arc in $▵ D E C$ . The arcs in the first, third, and fifth regions have less radii which is about a third of the original length, and the arcs in the second, fourth, sixth, and seventh regions have less angles about 30 degrees. We can draw a conclusion that dividing $▵ D E C$ into seven regions effectively reduces the range of the angle and the radius of the arc in $▵ D E C$ . It will be helpful to lessen the approximate error in Step 5.

As shown in Figure 1(a), $▵ A B C$ is the overlap region of $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ ; thereby $▵ A B C$ is made up of ten divisions which are superposed by different regions of $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ , respectively. The ten divisions in $▵ A B C$ are denoted by α, β, σ, χ, δ, ε, γ, φ, θ, and μ, as demonstrated in Figure 2(b). The definitions of the ten divisions are according the superposition of the region in $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ , as presented in Table 3. By the comparison between Tables 2 and 3, the selection of center and radius of the arc in Step 4 is based upon the division including the unknown node P.

Table 3

The definition of the ten divisions in $▵ A B C$ .

Sequence number in $▵ D E C$	Sequence number in $▵ I B H$	Sequence number in $▵ A F G$	Symbol in $▵ A B C$
6	2	1	α
4	3	2	δ
5	4	6	γ
6	3	1	β
5	2	1	σ
4	3	1	χ
5	3	2	ε
5	3	6	φ
5	4	1	θ
5	3	1	μ

Figure 2

(a) The angle and the radius of the arc in different regions of $▵ D E C$ after dividing; (b) the ten divisions in $▵ A B C$ ; (c) applying the cosine theorem of sides to obtain r.

The length of radius in Step 3, denoted by r, is a function of a. Given $a, r$ is presented according to the cosine theorem of sides in Figure 2(c):

\begin{matrix} r^{2} = {(2 a)}^{2} + {(\frac{\sqrt{3}}{2} a)}^{2} - 2 \times 2 a \times \frac{\sqrt{3}}{2} a \times \cos (\frac{π}{6}), \end{matrix}

(1)

\begin{matrix} r = \frac{\sqrt{7}}{2} a . \end{matrix}

(2)

3.3. Principle of Determining Point of Tangency

An arc is determined by the coordinates of center, the length of radius, and the value of angle. In a given arc, a tangent is determined by the position of the point of tangency. Hence, the selection of the tangent is equivalent to choosing an optimization position of the point of tangency. The tangent which touches the arc in the optimal point can minimize the approximation error in Step 4. The gap between the arc and the tangent is a major effect factor of approximation error in Step 5. To facilitate the calculation, a segment of the tangent is used to substitute the whole tangent. As shown in Figure 3, $F E$ is a segment of the tangent and intercepts by two lines parallel with the bisector of the arc. $A B$ is a given arc with a given radius and a given value of degree, denoted by r and a, respectively. The origin of the coordinate plane is denoted by O, which is located at the center of $A B$ , and the y-axis is the bisector of $A B$ and intersects $A B$ at C. D is the point of tangency and b denotes the degree between the side of $A B$ and the radius perpendicular to $F E$ . D can be any point on $A B$ , so the gap between the arc and the tangent is affected by the position of D.

Figure 3

The definition of $Erro r_{gap}$ .

The effects of substituting $E F$ for $A B$ can be evaluated $Erro r_{gap}$ . $(x_{\tan}, y_{\tan})$ denotes the coordinates of a point on $E F$ and $(x_{arc}, y_{arc})$ denotes the coordinates of a point on $A B$ . The definition of $Erro r_{gap}$ is the difference between $y_{\tan}$ and $y_{arc}$ when $x_{\tan}$ is equal to $x_{arc}$ . In Figure 3, a double-headed arrow in the gap between $E F$ and $A B$ is an $Erro r_{gap}$ :

\begin{matrix} Erro r_{gap} = y_{\tan} - y_{arc}, \\ (x_{\tan} = x_{arc} = r \times \cos (\frac{π - a}{2} + c)) . \end{matrix}

(3)

The range of both $x_{\tan}$ and $y_{\tan}$ is (4). Because each value of the x-axis in (4) corresponds to an $Erro r_{gap}$ , the number of $Erro r_{gap}$ approaches infinity:

\begin{matrix} r \times \cos (\frac{π - a}{2}) \leq x_{\tan} \leq r \times \cos (\frac{π + a}{2}), \\ r \times \cos (\frac{π - a}{2}) \leq x_{arc} \leq r \times \cos (\frac{π + a}{2}) . \end{matrix}

(4)

As $(x_{\tan}, y_{\tan})$ denotes the coordinates of a point on $E F$ and $(x_{arc}, y_{arc})$ denotes the coordinates of a point on $A B$ , the expressions of $y_{\tan}$ and $y_{arc}$ can be obtained with the angle a, b, and c.

\begin{array}{l} y_{\tan} = r \times \tan (π - \frac{a}{2} + b) \times [\sin (\frac{a}{2} - c) - \sin (\frac{a}{2} - b)] \\ + r \times \cos (\frac{a}{2} - b), \\ y_{arc} = r \times \sin (\frac{π}{2} - \frac{a}{2} + c) = r \times \cos (\frac{a}{2} - c) . \end{array}

(5)

By combining (3) and (5), the following new expression of $Erro r_{gap}$ can be obtained in (6). Specifically, $Erro r_{gap}$ is the function of r, a, b, and c and is actually in proportion to r and a according to (6). When $A B$ is fixed, r and a are given. The parameter b is determined by the position of D. The parameter c in (6) has the range of $[0, a]$ . Finding the optimal position of D is equivalent to finding the optimal value of angle b to minimize the $Erro r_{gap}$ over the whole feasible range of angle c, in the given radius r and angle a. Three indicators can quantify the effect of $Erro r_{gap}$ over the whole gap between the $E F$ and $A B$ and are the functions of angle b:

\begin{array}{l} Erro r_{gap} = r \times (\frac{1 - \sin ((a / 2) - b) \times \sin ((a / 2) - c)}{\cos ((a / 2) - b)} \\ - \frac{\cos ((a / 2) - b) \times \cos ((a / 2) - c)}{\cos ((a / 2) - b)}) \\ = r \times (\frac{1 - \cos (b - c)}{\cos ((a / 2) - b)}) . \end{array}

(6)

The first indicator is $E ({Error}_{gap})$ which is defined as the average of ${Error}_{gap}$ over the whole gap between $E F$ and $A B$ . $x_{A}$ and $x_{B}$ denote the coordinates of A and B in the x-axis and $[x_{A}, x_{B}]$ represents the whole feasible range on the x-axis over the whole gap between $E F$ and $A B$ . Then the expression of $E ({Error}_{gap})$ is obtained:

\begin{matrix} E (Erro r_{gap}) = \frac{1}{x_{B} - x_{A}} \int_{x_{A}}^{x_{B}} Erro r_{gap} d x . \end{matrix}

(7)

$[x_{A}, x_{B}]$ in the x-axis can be represented by $[0, a]$ in angle c. By differential calculus of (3), we obtain

\begin{matrix} d x = - r \times \sin (\frac{π}{2} - \frac{a}{2} + c) \times d c . \end{matrix}

(8)

By combining (7) and (8),

\begin{array}{l} E (Erro r_{gap}) = \frac{1}{x_{B} - x_{A}} \int_{x_{A}}^{x_{B}} Erro r_{gap} \times d x \\ = \frac{1}{2 \sin (a / 2)} \int_{0}^{a} Erro r_{gap} \times \cos (\frac{a}{2} - c) \times d c . \end{array}

(9)

By combining (6) and (9), the new expression of $E ({Error}_{gap})$ is given by

\begin{array}{l} E (Erro r_{gap}) = \frac{r}{2 \sin (a / 2)} \\ \times [\frac{8 \sin (a / 2) - \sin ((3 / 2) a - b)}{4 \cos ((a / 2) - b)} \\ - \frac{\sin ((a / 2) + b)}{4 \cos ((a / 2) - b)} - \frac{a}{2}] . \end{array}

(10)

Because $A B$ is given, radius r and angle a are fixed. The value of $E (Erro r_{gap})$ only accounts for the value of angle b. The extremum problem can be solved by finding the value of angle b which makes the first derivative of $E (Erro r_{gap})$ equal to zero: (i)

syms $a b$ ,

(ii)

solve $(diff (^{'} (8 * \sin (0.5 * a) - \sin (1.5 * a - b) - \sin (0.5 * a + b)) / (4 * \cos (0.5 * a - b))^{'},^{'} b^{'}),^{'} b^{'})$ .

The numerical result given by MATLAB demonstrates that $E (Erro r_{gap})$ can be least only if b is equal to 0.5a. It shows that $b = 0.5 a$ is the condition for minimizing $E (Erro r_{gap})$ and means that the point of tangency is the midpoint of the arc. When D is the midpoint of $A B$ in Figure 3, the average of $Erro r_{gap}$ over the whole gap between $E F$ and $A B$ is minimal.

The second indicator is $D (Erro r_{gap})$ which is defined as the variance of $Erro r_{gap}$ over the whole gap between $E F$ and $A B$ . $[x_{A}, x_{B}]$ represents the whole feasible range on the x-axis over the whole gap between $E F$ and $A B$ . Then the expression of $D (Erro r_{gap})$ is obtained:

\begin{matrix} D (Erro r_{gap}) = \frac{1}{x_{B} - x_{A}} \int_{x_{A}}^{x_{B}} {(Erro r_{gap} - E (Erro r_{gap}))}^{2} d x . \end{matrix}

(11)

By applying (8) to (11), (12) is obtained:

\begin{array}{l} D (Erro r_{gap}) = \frac{1}{x_{B} - x_{A}} \int_{x_{A}}^{x_{B}} {(Erro r_{gap} - E (Erro r_{gap}))}^{2} \\ \times d x \\ = \frac{1}{2 \sin (a / 2)} \int_{0}^{a} {(Erro r_{gap} - E (Erro r_{gap}))}^{2} \\ \times \cos ((a / 2) - c) \times d c . \end{array}

(12)

Combined with (6), (12) can be changed to (13). It is the new expression of $D (Erro r_{gap})$ :

\begin{array}{l} D (Erro r_{gap}) = {(\frac{r}{\cos ((a / 2) - b)} - E (Erro r_{gap}))}^{2} \\ + r \times (\frac{\cos ((a / 2) - b) \times E (Erro r_{gap}) - r}{co s^{2} ((a / 2) - b)}) \\ \times (\frac{2 \cos ((a / 2) - b) + \sin ((3 / 2) a - b)}{4 \sin (a / 2)} \\ + \frac{\sin ((a / 2) + b)}{4 \sin (a / 2)}) \\ + r^{2} (\frac{3 \sin ((3 / 2) a - 2 b)}{24 \sin (a / 2) \cos^{2} (a / 2 - b)} \\ + \frac{\sin ((5 / 2) a - 2 b)}{24 \sin (a / 2) \cos^{2} (a / 2 - b)} \\ - \frac{3 \sin (a / 2 - 2 b)}{24 \sin (a / 2) \cos^{2} (a / 2 - b)} \\ + \frac{\sin (a / 2 + b) + 12 \sin (a / 2)}{24 \sin (a / 2) \cos^{2} ((a / 2) - b)}) . \end{array}

(13)

Because $A B$ is given, radius r and angle a are fixed. $D (Erro r_{gap})$ only accounts for the value of angle b. The numerical result given by MATLAB demonstrates that $D (Erro r_{gap})$ can be least only if b is equal to $0.5 a$ . It shows that $b = 0.5 a$ is the condition for minimizing $D (Erro r_{gap})$ and means that the point of tangency is the midpoint of the arc. When D is the midpoint of $A B$ in Figure 3, the variance of ${Error}_{gap}$ over the whole gap between $E F$ and $A B$ is minimal. (i)

syms $a b s 1 s 2 s 3 s 4 s 5$ ;

(ii)

$s 1 = (1 / (2 * \sin (0.5 * a))) * (((8 * \sin (0.5 * a) + \sin (b - 1.5 * a) - \sin (b + 0.5 * a)) /$ $(4 * \cos (b - 0.5 * a))) - (0.5 * a))$ ;

(iii)

$s 2 = 2 * \sin (0.5 * a) * (1 / (\cos (b - 0.5 * a)^2) + (s 1)^2 - (2 * (s 1)) / (\cos (b - 0.5 * a)))$ ;

(iv)

$s 3 = ((2 * (s 1)) / (\cos (b - 0.5 * a)) - (2) / ((\cos (b - 0.5 * a))^2)) * ((0.5 * \cos (b - 0.5 * a)) -$ $(0.25 * \sin (b - 1.5 * a)) + (0.25 * \sin (b + 0.5 * a)))$ ;

(v)

$s 4 = (1 / (2 * (\cos (b - 0.5 * a)^2))) * ((0.5 * \sin (1.5 * a - 2 * b)) - ((1 / 6) * (\sin (2 * b - 2.5 * a)))$ $- (0.5 * \sin (0.5 * a - 2 * b)) + ((1 / 6) * (\sin (2 * b + 0.5 * a))) + (2 * \sin (0.5 * a)))$ ;

(vi)

$s 5 = s 2 + s 3 + s 4$ ;

(vii)

solve $(diff (s 5,^{'} b^{'}),^{'} b^{'})$ .

The third indicator is $MAX (Erro r_{gap})$ which is defined as the maximal value of $Erro r_{gap}$ over the whole gap between $E F$ and $A B$ , given a fixed position ofD, when the position ofD is fixed, which means that the degree of angle b is constant. Considering the definition of ${Error}_{gap}$ , the maximal value of ${Error}_{gap}$ can be found in $c = 0$ or $c = a$ and depends on the degree of angle b. Thus, the expression of $MAX (Erro r_{gap})$ is obtained:

\begin{matrix} Max (Erro r_{gap}) = {\begin{cases} r \times (\frac{1 - \cos (a - b)}{\cos ((a / 2) - b)}), \\ 0 \leq b < \frac{a}{2}, c = a \\ r \times (\frac{1 - \cos (a / 2)}{\begin{smallmatrix} 1 \end{smallmatrix}}), \\ b = \frac{a}{2}, c = 0 or c = a \\ r \times (\frac{1 - \cos (b)}{\cos ((a / 2) - b)}), \\ \frac{a}{2} \leq b < a, c = 0 . \end{cases} \end{matrix}

(14)

Proposition 2.

As shown in Figure 3 and indicated in (14). If the degree of angle a is constant and the degree of angle b is in the interval $[0,0.5 a)$ , $Max ({Error}_{gap})$ will be reached in $c = a$ when $b = 0.5 a$ .

Proposition 3.

As shown in Figure 3 and indicated in (14), if the degree of angle a is constant and the degree of angle b is in the interval $(0.5 a, a]$ , $Max ({Error}_{gap})$ will be reached in $c = 0$ when $b = 0.5 a$ .

Proof.

Consider

∵ $0 \leq b < a / 2 \begin{smallmatrix} \end{smallmatrix} and \begin{smallmatrix} \end{smallmatrix} 0 < a < π$

∴ $- a / 2 < - b \leq 0$

∴ $a / 2 < a - b \leq a$

∵ $0 < a / 2 < π / 2$

∴ $1 - \cos (a / 2) < 1 - \cos (a - b)$

∵ $1 > \cos (a / 2 - b)$

∴ $r \times ((1 - \cos (a / 2)) / 1) < r \times ((1 - \cos (a - b)) / \cos ((a / 2) - b))$ .

Proof.

Consider

∵ $a / 2 < b \leq a \begin{smallmatrix} \end{smallmatrix} and \begin{smallmatrix} \end{smallmatrix} 0 < a < π$

∴ $0 < a / 2 < π / 2$

∴ $1 - \cos (a / 2) < 1 - \cos (b)$

∵ $1 > \cos (a / 2 - b)$

∴ $r \times ((1 - \cos (a / 2)) / 1) < r \times ((1 - \cos (b)) / \cos ((a / 2) - b))$ .

Therefore, if a is given, we can obtain the minimal $Max ({Error}_{gap})$ in $b = 0.5 a$ . It means that $b = 0.5 a$ is the necessary and sufficient condition for minimizing $Max ({Error}_{gap})$ . Taking $Max ({Error}_{gap})$ into consideration, consequently, the point of the tangent must be the midpoint of the arc. When D is the midpoint of $A B$ in Figure 3, the maximal value of $Erro r_{gap}$ over the whole gap between $E F$ and $A B$ is less than other positions of D.

Given an arc, the tangent is dominated by the position of the point of tangency. If the point of tangency is the midpoint of the arc, then $E (Erro r_{gap})$ , $D ({Error}_{gap})$ , and $Max ({Error}_{gap})$ have the least value in each range. It has been used in the LETLA to choose the point of tangency.

3.4. Utilization Coefficient of Equilateral Triangle Diagrams

In Step 4, two anchors are selected from the nine anchors which have the special geometrical relations as shown in Figure 1(a). However, it is hard to satisfy the geometrical requirement in the boundaries of the location space. In Figure 4, the location area, unlocation area, and cover area are defined and illustrated in three examples with the sides $(3 a, a)$ , $(4 a, 2 a)$ , and $(5 a, 3 a)$ of the cover area. In this section, the utilization coefficient of equilateral triangle diagrams is obtained, which means the percentage of the location area in the cover area. As the sides of the cover area increase linearly, the number of anchors and the location area, the unlocation area, and the cover area are listed in Table 4.

Table 4

The relation of the five indexes.

The side length of cover area	(3a, 1a)	(4a, 2a)	(5a, 3a)	(6a, 4a)	(7a, 5a)	(8a, 6a)
The number of anchors	18	36	60	90	126	168
Unlocation area	$18 \times \frac{a^{2} \sqrt{3}}{4}$	$30 \times \frac{a^{2} \sqrt{3}}{4}$	$42 \times \frac{a^{2} \sqrt{3}}{4}$	$54 \times \frac{a^{2} \sqrt{3}}{4}$	$66 \times \frac{a^{2} \sqrt{3}}{4}$	$78 \times \frac{a^{2} \sqrt{3}}{4}$
Location area	$4 \times \frac{a^{2} \sqrt{3}}{4}$	$22 \times \frac{a^{2} \sqrt{3}}{4}$	$52 \times \frac{a^{2} \sqrt{3}}{4}$	$94 \times \frac{a^{2} \sqrt{3}}{4}$	$148 \times \frac{a^{2} \sqrt{3}}{4}$	$214 \times \frac{a^{2} \sqrt{3}}{4}$
Cover area	$22 \times \frac{a^{2} \sqrt{3}}{4}$	$52 \times \frac{a^{2} \sqrt{3}}{4}$	$94 \times \frac{a^{2} \sqrt{3}}{4}$	$148 \times \frac{a^{2} \sqrt{3}}{4}$	$214 \times \frac{a^{2} \sqrt{3}}{4}$	$292 \times \frac{a^{2} \sqrt{3}}{4}$

Figure 4

The topological structure of the equilateral triangle diagrams.

$(m \times a, n \times a)$ denotes the length of the sides of the cover area in Figure 4 the formulas of $Nu m_{anchor}, S_{unlocat}, S_{locat}$ , and $S_{cover}$ are obtained as follows. $Nu m_{anchor}$ is the number of anchors and S_unlocat is the unlocation area. Because $m - n = 2 a$ is the relation between m and n in terms of Table 4, (15), (16), (17), and (18) can be simplified to single variable functions of n:

\begin{matrix} Nu m_{anchor} = \sum_{k = 0}^{k = n} (k + 1) \times 6, \end{matrix}

(15)

\begin{matrix} S_{unlocat} = [18 + 12 \times (n - 1)] \times \frac{a^{2} \sqrt{3}}{4}, \end{matrix}

(16)

\begin{matrix} S_{locat} = {\begin{cases} 4 \times \frac{a^{2} \sqrt{3}}{4}, & n = 1 \\ 22 \times \frac{a^{2} \sqrt{3}}{4}, & n = 2 \\ [4 + 18 \times (n - 1) + \sum_{k = 1}^{k = n - 2} 12 \times k] \\ \times \frac{a^{2} \sqrt{3}}{4}, & \begin{matrix} n > 2 \end{matrix}, \end{cases} \end{matrix}

(17)

\begin{matrix} S_{cover} = {\begin{cases} 22 \times \frac{a^{2} \sqrt{3}}{4}, & n = 1 \\ 22 \times \frac{a^{2} \sqrt{3}}{4}, & n = 2 \\ [22 + 18 \times (n - 1) + \sum_{k = 1}^{k = n - 1} 12 \times k] \\ \times \frac{a^{2} \sqrt{3}}{4}, & \begin{matrix} n > 1 \end{matrix} . \end{cases} \end{matrix}

(18)

The utilization coefficient of equilateral triangle diagrams is the complement of ratio of $S_{unlocat}$ to $S_{cover}$ :

\begin{array}{l} 1 - \frac{S_{unlocat}}{S_{cover}} \\ = {\begin{cases} 1 - \frac{18}{22}, & n = 1 \\ 1 - \frac{18 + 12 \times (n - 1)}{22 + 18 \times (n - 1) + \sum_{k = 1}^{k = n - 1} 12 \times k}, & n > 1 . \end{cases} \end{array}

(19)

As (16) and (18) imply, $S_{unlocat}$ grows linearly with n, and $S_{cover}$ grows linearly with the power of n. Consequently, the increment of n will lead to the ratio of $S_{unlocat}$ to $S_{cover}$ close to zero. It means that the utilization coefficient of equilateral triangle diagrams will get close to one hundred percent as the scale of network increases. In Figure 5 the growth rate of $S_{unlocat}$ is far less than the growth rate of $S_{cover}$ as n increases. When the scale of cover area increases, the influence of unlocation area in the LETLA will rapidly vanish.

Figure 5

The utilization coefficient of equilateral triangle diagrams grows along with n's growth.

4. Lightness Equilateral Triangle Localization Algorithm

In this section, the LETLA will be explained by a practical example. This example is shown in Figure 1, and the given conditions are the same as Section 3. When the unknown node P knows the distance between itself and the anchor, the LETLA can be implemented as follows. (a)

Sort the ranging results and select the three nearest anchors $A, B$ , and C, then find node P in $▵ A B C$ .

(b)

$▵ D E C$ , $▵ I B H$ , and $▵ A F G$ can be determined, for $▵ A B C$ is their overlapped region and their side lengths are equal to $2 a$ . The geometric relation of equilateral triangles is determined by the deployment of anchors which is known by node P.

(c)

Node P finds the regions in $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ , respectively, through the relationship between the ranging results and r, as exemplified in Table 1.

(d)

As node P is in the fifth region of $▵ D E C$ , the third region of $▵ I B H$ , and the sixth region of $▵ A F G$ in Figure 1(c), the arc with the center F and the radius $F P$ and the other arc with the center C and the radius $C P$ are selected on the basis of Table 2.

(e)

Derive two tangential equations of the arcs obtained in the previous step and solve the two tangential equations.

The main parameters of a tangential equation include the coordinates of the point of tangency and the slope of tangency. When the tangent is perpendicular to the line which goes through C and the point of tangency K, the slope of tangency can be derived by

\begin{matrix} slope of tangent = - \frac{x_{c} - x_{k}}{y_{c} - y_{k}} . \end{matrix}

(20)

$(x_{c}, y_{c})$ and $(x_{k}, y_{k})$ are the coordinates of C and K, respectively. P knows $(x_{c}, y_{c})$ , but does not know $(x_{k}, y_{k})$ . In order to determine $(x_{k}, y_{k})$ , a coordinate system is established in Figure 6.

Figure 6

The calculation of the point of the tangent.

The new coordinate system can be built as follows. First, move the original coordinate system to the positive direction of the x-axis with the distance $x_{c}$ . Second, move the original coordinate system to the positive direction of the y-axis with the distance $y_{c}$ . Finally, rotate the original coordinate system 180 degree clockwise. In the new coordinate system, the origin is C denoted by $(x_{c}^{'}, y_{c}^{'})$ , and the coordinates of K are $(x_{k}^{'}, y_{k}^{'})$ . The values of $(x_{c}^{'}, y_{c}^{'})$ and $(x_{k}^{'}, y_{k}^{'})$ are shown in (21), where $C P$ is a known ranging result:

\begin{matrix} x_{c}^{'} = 0, \\ y_{c}^{'} = 0, \\ x_{k}^{'} = - C P, \\ y_{k}^{'} = 0 . \end{matrix}

(21)

The relation of $(x_{k}, y_{k})$ and $(x_{k}^{'}, y_{k}^{'})$ is

\begin{matrix} x_{k}^{'} = - (x_{k} - x_{c}), \\ y_{k}^{'} = - (y_{k} - y_{c}) . \end{matrix}

(22)

Because $(x_{c}, y_{c})$ and $C P$ are known, combined with (21), $(x_{k}, y_{k})$ can be obtained by

\begin{matrix} x_{k} = x_{c} - x_{k}^{'}, \\ y_{k} = y_{c} - y_{k}^{'} . \end{matrix}

(23)

The coordinates of the point of tangency are the function of the coordinates of the center of the arc, the length of radius of the arc, and the angle between the bisector and the x-axis. When the coordinates of the point of tangency are known, the slop of tangency can be drawn from (20). Now the tangential equation can be set up. Solving the intersection of two tangents is equivalent to solving the bivariate system of linear equations.

To sum up, the (a), (b), (c), and (d) in the LETLA are achieved by relational operation and only (e) is implemented by arithmetic operation. The procedure (e) only contains the four arithmetic operations and does not involve solving multivariable nonlinear equations, differentiation, integration, statistical estimation, and mathematical programming. It suggests that the LETLA is a lightness location method.

5. Performance Evaluation

5.1. Localization Error Evaluation

In Section 5.1, a numerical analysis of the performance of localization error will be given. Figure 7 shows the anchor distribution and the coordinate system. It is set up by putting Figure 1(a) in a coordinate system with an origin O on the lower left quarter. In Figure 7, the distance between a pair of adjacent anchors is denoted by a, which is the same in Figure 1(a) and assigned a value of 50. The length of radius to divide $▵ D E C$ , $▵ I B H$ , and $▵ A F G$ is denoted by r, which is also like Figure 1(a) and assigned a value according to (2). To obtain the localization error $Erro r_{locat}$ , node P has been placed in the different positions of $▵ A B C$ for many times.

Figure 7

A numerical example of Figure 1(a).

Figure 8 shows the distribution of $Erro r_{locat}$ in $▵ A B C$ . The z-axis in Figure 8 indicates the value of $Erro r_{locat}$ in the corresponding testing position. Given $a = 50$ , the area of $Erro r_{locat} < 1$ makes up 72.971% of $▵ A B C$ . The area of $Erro r_{locat} < 3$ covers 90.519% of $▵ A B C$ . The maximum and minimum values of $Erro r_{locat}$ are 6.13 and 0, respectively. The data transmission radius of node P is l and $l > 2 a$ . A common evaluation method is computing the ratio of $Erro r_{locat}$ and l, and the ratio within 10% is a good indicator of localization performance [57]. Figure 8 illustrates LETLA can achieve the ratio within 10% in 92.655% of $▵ A B C$ . It means that the LETLA can obtain a good localization precision and a stable distribution.

Figure 8

The distribution of $Erro r_{locat}$ in $▵ A B C$ according to the geometrical relation in Figure 7: (a) the side view; (b) the top view. In both (a) and (b), the color indicates the value of $Erro r_{locat}$ .

In Figure 8, $Erro r_{locat}$ is associated with the division in $▵ A B C$ , denoted by α, β, σ, χ, δ, ε, γ, φ, θ, and μ as demonstrated in Figure 2(b) and defined in Table 3. The connecting points of β and χ, ε and φ, and σ and θ have the maximum value of $Erro r_{locat}$ . $Erro r_{locat}$ in α, δ, and γ is all less than 1 and $Erro r_{locat}$ in μ is less than 1 in least 60% area. Moreover, $Erro r_{locat}$ is distributed uniformly in α, δ, γ, and μ. The reason of producing the maximum value of $Erro r_{locat}$ in the connecting point can be explained as follows. Combine Tables 2 and 3, when node P lies in the connecting point of the divisions in $▵ A B C$ , the intersection of two the arcs as determined from Table 2 is far away from the intersection of the two tangents. The reason is that the intersection of the two arcs is on the endpoint of the both arcs which both have a maximum of distance with the tangent. That result has been analyzed in Section 3.3 with the conception of $Max ({Error}_{gap})$ and the maximal value of ${Error}_{gap}$ is in the endpoint of the arc. Since the connecting point is the intersection of the two arcs' endpoint, ${Error}_{gap}$ of the two arcs reaches the maximum value simultaneously. Consequently, ${Error}_{gap}$ in the connecting point is greater than other positions of $▵ A B C$ obviously.

Figure 9 shows the distribution of $Erro r_{locat}$ in $▵ A B C$ . Figures 8 and 9 are distinguished by the ranging noise. In Figure 8 $Erro r_{locat}$ is produced by the LETLA with accurate ranging results, but in Figure 9 $Erro r_{locat}$ is produced by the LETLA with the ranging results which are corrupted by noise following a Gaussian distribution. The ranging noise is represented by ζ, with expectation $E (ζ) = 0$ and variance $D (ζ) = 0.5$ .

Figure 9

The distribution of $Erro r_{locat}$ in $▵ A B C$ with ranging noise according to the geometrical relation in Figure 7: (a) the side view; (b) the top view.

Given $a = 50$ , $E (ζ) = 0$ , and $D (ζ) = 0.5$ , the area of $Erro r_{locat} < 1$ makes up 65.251% of $▵ A B C$ . The area of $Erro r_{locat} < 3$ covers 82.238% of $▵ A B C$ . The maximum and minimum values of $Erro r_{locat}$ are 7.26 and 0, respectively. Although the ranging noise lowers the localization precision of the LETLA, the LETLA also achieves the ratio within 10% in 90.14% of $▵ A B C$ .

Figure 9 shows that $Erro r_{locat}$ is associated with the division in $▵ A B C$ , which is the same as Figure 8. $Erro r_{locat}$ is distributed uniformly in α, δ, γ, and μ. In β, σ, χ, ε, φ, and θ, $Erro r_{locat}$ is affected by the noise, because the areas of these divisions are less than the areas of α, δ, γ, and μ. It leads to the misjudgment of the division including node P more easily:

\begin{matrix} P {| ξ - E (ξ) | < 3 D (ξ)} \geq 0.8889 . \end{matrix}

(24)

By comparing Figures 9 with 8, the range of $Erro r_{locat}$ in Figure 8 and in Figure 9 is [0, 6.13] and [0, 7.26]. Based on the Chebyshev inequality of (24), $E (ζ) = 0$ , and $D (ζ) = 0.5$ , we obtain ζ in the range of $[- 1.5,1 . 5]$ with the probability of 88.89%. It means that the noise cannot change the range of $Erro r_{locat}$ obviously in Figure 8; hence the difference between the maximum of Figure 9 and that of Figure 8 is only 1.13. Consequently, the area of $Erro r_{locat} < 1$ and $Erro r_{locat} < 3$ only decreases 7.72% and 8.281%, respectively.

5.2. Localization Coverage and Beacon Density

To study the performances of the localization coverage and beacon density, we generate a variety of the test scenarios of the different numbers of anchors. The graphs in Figure 10 illustrate three test scenarios. The whole test area, designed as a circular domain and denoted by $S_{test}$ , is the whole area of the test scenario. The whole test area is calculated using the following equation:

\begin{matrix} S_{test} = π \cdot {(4 a)}^{2} . \end{matrix}

(25)

Figure 10

The topological structure of the test scenarios.

The location area $S_{locat}$ and the cover area $S_{cover}$ represent the region in which the node can be located and region covered by anchors. For instance, Table 5 shows the number of anchors, the location area, and the cover area calculated for varying the side length of the cover area. The variable n is a factor used to indicate the side length of the cover area, as shown in Table 5. Because the number of anchors is determined by n, as shown in Table 5, we can replace the anchor number with the variable n to facilitate the calculation of the location area and cover area.

Table 5

The relationship among the four indexes.

The side length of the cover area	The number of anchors	Location area	Cover area
$1 a$	7	0	$3 \sqrt{3} \cdot a^{2} / 2$
$2 a$	19	$3 \sqrt{3} \cdot a^{2} / 2$	$6 \sqrt{3} \cdot a^{2}$
$3 a$	37	$6 \sqrt{3} \cdot a^{2}$	$27 \sqrt{3} \cdot a^{2} / 2$
$4 a$	61	$27 \sqrt{3} \cdot a^{2} / 2$	$24 \sqrt{3} \cdot a^{2}$
$5 a$	91	$24 \sqrt{3} \cdot a^{2}$	$125 \sqrt{3} \cdot a^{2} / 2$
$n \cdot a$	$1 + 3 n \cdot (n + 1)$	$3 \sqrt{3} \cdot (n - 1)^{2} \cdot a^{2} / 2$	$3 \sqrt{3} \cdot n^{2} \cdot a^{2} / 2$

We use the following definitions in the evaluation: localization coverage, $P_{r}$ , denotes the ratio of the location area to the whole test area:

\begin{matrix} P_{r} = \frac{S_{locat}}{S_{test}} = \frac{3 \sqrt{3} \cdot {(n - 1)}^{2} \cdot a^{2}}{2 π \cdot {(4 a)}^{2}} = \frac{3 \sqrt{3} \cdot {(n - 1)}^{2}}{32 π}, \\ P_{d} = \frac{NU M_{anchor}}{S_{cover}} = \frac{2 (1 + 3 n \cdot (n + 1))}{3 \sqrt{3} \cdot n^{2} \cdot a^{2}} = \frac{2 + 6 n^{2} + 6 n}{3 \sqrt{3} \cdot n^{2} \cdot a^{2}} . \end{matrix}

(26)

Because the whole test area is a fixed circular domain, as expressed in (25) and illustrated in Figure 10, the localization coverage increases with growing anchor number, as shown in Figure 11(a). When the number of anchor increases to 91, the location area constitutes 82.699 percent of the test area. Figure 11(b) graphs the beacon density for varying the quantity of anchors under the condition of $a = 50$ which is the same as assigned in Section 5.1. We see that the beacon density falls sharply with increasing anchor number, until it reaches a density. We refer to this density as the saturation beacon density. The saturation beacon density can be obtained when the value of n approaches to infinity. If $a = 50$ , the saturation beacon density will be $4.6188 e - 004$ . We can reach the same conclusion in Figure 11(b):

\begin{matrix} \lim_{n \to \infty} P_{d} = \lim_{n \to \infty} \frac{2 + 6 n^{2} + 6 n}{3 \sqrt{3} \cdot n^{2} \cdot a^{2}} = \frac{2}{\sqrt{3} \cdot a^{2}} . \end{matrix}

(27)

Figure 11

(a) The number of anchors versus localization coverage; (b) the number of anchors versus beacon density.

5.3. Comparisons

We compare the LETLA with the weighted centroid [33], the sequence based [36], the Voronoi diagrams [43], and the multilateration [58]. In order to study the performances of localization precision and energy consumption in different scenarios, NS2 is adopted in Table 6.

Table 6

The simulation parameters of NS2.

Parameter	Value
Channel bandwidth (kbps)	250
Frequency (GHz)	2.4
Wireless model	Shadowing
MAC protocol	IEEE 802.15.4
Power for transmission (Watt)	0.28183815
Power for idle (Watt)	0.003587
Power for reception (Watt)	0.2182837
RX thresh (Watt)	$1.35685 e - 11$
RF radius (m)	50
Initial energy (J)	10

The anchors were deployed uniformly in a square field of $1000 m \times 1000 m$ , and 1000 testing positions were selected to place the unknown node. The testing positions were evenly distributed across the $1000 m \times 1000 m$ . The localization error was obtained by averaging the ten testing values of repeated measurements in each testing position. The anchors placements of the five location algorithms followed the geometric structure as Figure 4. To cover the square field of $1000 m \times 1000 m$ , a portion of anchors were moved to the corners. In the experiments, we consider RSS as the range-measurement:

\begin{matrix} P_{R} (d) = P_{T} - P L (d_{0}) - 10 η lo g_{10} \frac{d}{d_{0} - X_{σ}} . \end{matrix}

(28)

The most widely used simulation model is the log-normal shadowing model [59], where $P_{R}$ is the received signal power, $P_{T}$ is the transmit power, and $P_{L} (d_{0})$ is the path loss for a reference distance of $d_{0}$ . η is the path loss exponent, and the random variation $X_{σ}$ in RSS is generated according to Gaussian distribution with mean 0 and variance $σ^{2}$ . In this model, we do not provision separately for any obstructions like walls. In order to compare the performance in energy consumption, we consider that a second in localization computing will consume $8.052518 e - 5 J$ . This value is obtained by dividing power for transmission into 3500. We modify the MAC layer of WPAN protocol in NS2 2.27 to realize the calculation of the energy consumption.

In Figure 12(a) the relationship between the localization error and the variance of noise is investigated when the number of anchors is 36. The result shows that the localization error increases with the variance of noise. We can observe that the performance of the multilateration is the best when the variance is less than six. As the variance increases, the LETLA is more robust than the other four algorithms under the same condition. Some of the reasons for this result can be briefly stated. The multilateration will obtain more precise coordinates if the variance becomes smaller. But its performance rapidly degrades when the effect of noise increases. As a result, the circles do not intersect at a common point and the precise coordinates degenerate into the approximate coordinates. The sequence based rises faster than the weighted centroid, the Voronoi diagrams, and the LETLA, since it needs a lot of iterative computations which are sensitive to the initial value. The weighted centroid and the Voronoi diagrams rise gently, but they are less accurate than the LETLA, because they have not fully utilized the information of the anchor placement.

Figure 12

(a) The relationship between the localization error and the variance of noise; (b) the relationship between the localization error and the number of anchors.

In Figure 12(b), the localization error decreases with the increment of anchors, when the variance of noise is ten. As the number of anchors increases, the density of anchors also grows in the fixed cover area. For this reason the received signal power is enhanced with the decrement of the distances between the anchors and the unknown node. As shown in Figure 12(b), the sequence based, the LETLA, and the Voronoi diagrams descend in steps. The reason is that a few increments of the number of anchors are not sufficient to change the density obviously. Only some degrees of promotion can alter the density adequately and improve precision effectually. It is also interesting to note that the Multilateration is the best when the number of anchors less than 32. However, as anchors began to accumulate, the LETLA, the Voronoi diagrams, and the multilateration are of about the same accuracy.

Figure 13 presents the energy consumptions of five algorithms when the variance of noise is ten. Under the same condition, the multilateration consumes more energy than the other four methods. The multilateration with noisy data as described above is based on solving nonlinear equations with complicated closed-form solutions. However, standard algorithms that provide least-square solutions for large numbers of nonlinear equations have a very high computational cost.

Figure 13

The energy consumption in the localization calculation versus the number of anchors.

In Figure 13 the tendency of the weighted centroid, the sequence based, and the Voronoi diagrams rise with the number of anchors and the energy consumptions of these three methods are less than the multilateration but more than the LETLA. By studying the References [33, 36, 43], we can find some reasons. The Voronoi diagrams spend most of the computing energy in constructing Voronoi diagrams and carrying out iterative computations [43]. The sequence based consumes too many energy in the generalization of location sequence tables and the calculation of the Spearman's Rank Order Correlation Coefficient and the Kendall's Tau [36]. The weighted centroid does not contain iterative computation, so it is simpler than sequence based and Voronoi diagrams. However, the Weighted Centroid has more energy consumption for solving the constrained extremum problems [33].

On the other hand, the energy consumption of the LETLA is the least of all. As mentioned in Section 4, the LETLA only solves binary linear equations, except matching and sorting in a limited range, and does not contain any iterative computations, statistical equilibrium, and multivariate nonlinear equations. It is worthwhile to note that, the energy consumption of the LETLA is stable. There are two reasons. First, only two of the nine ranging results and the coordinates of anchors are used to construct and solve the binary linear equations. It means that the scale of the calculation of the LETLA is fixed and limited. Second, the matching and sorting operations can be implemented with the special data structure, like index point, which trades time for space. In contrast with the weighted Centroid, the sequence based, the Voronoi diagrams, and the multilateration, the results suggest that the LETLA is more energy efficient with the same localization accuracy.

6. Conclusion

In this paper, we presented a novel lightness equilateral triangle localization algorithm (LETLA). In the LETLA, the approximate coordinates were substituted for the real coordinates of the unknown node and an optimization problem was set up to minimize the approximate error. To solve this optimization problem, we proposed a new geometric structure called “equilateral triangle diagrams.” In detail, we probed into the scalability of equilateral triangle diagrams and presented the geometrical characteristic of equilateral triangle diagrams. In the process of substituting the tangent for the arc, we derived that the midpoint of the arc was the most appropriate position of the point of the tangent.

Finally, the performance of the LETLA is much better than those of the other localization techniques, and experimental results indicate that the energy consumption of the LETLA is less than other location algorithm, at the same degree of location precision. As part of future work, we would focus on the implementation of the LETLA in the practical hardware of sensor nodes, such as MicaZ, Mica2, and Telos.

Footnotes

Acknowledgments

The authors would like to thank the anonymous reviewers for their helpful comments which have significantly improved the quality of the paper. This work was supported in part by NSFC under Grant no. 60973022.

References

Akyildiz

I. F.

Vuran

M. C.

Wireless Sensor Networks 2010

John Wiley & Sons

Mainwaring

Polastre

Szewczyk

Culler

Anderson

Wireless sensor networks for habitat monitoring

Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications

September 2002

Atlanta, Ga, USA

88 97

2-s2.0-0036986465

Yang

Wang

Z. J.

Study on localization algorithms for large scale wireless sensor network

Transducer and Microsystem Technologies 2007 26 2 33 36

Wang

D. W.

Ding

Wang

Agent collaborative target localization and classification in wireless sensor networks

Sensors 2007 7 8 1359 1386

2-s2.0-34548505478

Mao

Fidan

Anderson

B. D. O.

Wireless sensor network localization techniques

Computer Networks 2007 51 10 2529 2553

2-s2.0-34247885928

10.1016/j.comnet.2006.11.018

Wang

Srinivasan

Wang

Chua

K. C.

Coverage for target localization in wireless sensor networks

IEEE Transactions on Wireless Communications 2008 7 2 667 676

2-s2.0-39749117413

10.1109/TWC.2008.060611

Qian

Tipper

A design for secure and survivable wireless sensor networks

IEEE Wireless Communications 2007 14 5 30 37

2-s2.0-36849083584

10.1109/MWC.2007.4396940

You

Han

Lieckfeldt

Salzmann

Timmermann

Virtual position based geographic routing for wireless sensor networks

Computer Communications 2010 33 11 1255 1265

2-s2.0-77955273252

10.1016/j.comcom.2009.12.007

Younis

M. F.

Ghumman

Eltoweissy

Location-aware combinatorial key management scheme for clustered sensor networks

IEEE Transactions on Parallel and Distributed Systems 2006 17 8 865 882

2-s2.0-33646921841

10.1109/TPDS.2006.106

10.

Baggio

Langendoen

Monte Carlo localization for mobile wireless sensor networks

Ad Hoc Networks 2008 6 5 718 733

2-s2.0-41549088690

10.1016/j.adhoc.2007.06.004

11.

Chehri

Fortier

Martin Tardif

UWB-based sensor networks for localization in mining environments

Ad Hoc Networks 2009 7 5 987 1000

2-s2.0-60249097273

10.1016/j.adhoc.2008.08.007

12.

Haibo

Yingna

Bao

A localization method of wireless sensor network based on two-hop focus

Procedia Engineering 2011 15 2021 2025

10.1016/j.proeng.2011.08.377

13.

Zhang

Research and improvement of localization algorithm for wireless sensor networks

Energy Procedia 2011 13 8969 8975

10.1016/j.egypro.2011.12.682

14.

Huang

Chen

Wang

Minimum cost localization problem in wireless sensor networks

Ad Hoc Networks 2011 9 3 387 399

2-s2.0-78651361188

10.1016/j.adhoc.2010.08.013

15.

Aksu

Aksoy

Korpeoglu

A study of localization metrics: evaluation of position errors in wireless sensor networks

Computer Networks 2011 55 15 3562 3577

10.1016/j.comnet.2011.06.023

16.

Shunmuga Perumal

Rhymend Uthariaraj

Novel localization of sensor nodes in wireless sensor networks using co-ordinate signal strength database

Procedia Engineering 2012 30 662 668

10.1016/j.proeng.2012.01.912

17.

Huang

Anderson

B. D.

Analyzing localization errors in one-dimensional sensor networks

Signal Processing 2012 92 2 427 438

10.1016/j.sigpro.2011.08.007

18.

Hwa Liao

Ping Shih

Chee Lee

A localization protocol with adaptive power control in wireless sensor networks

Computer Communications 2008 31 10 2496 2504

2-s2.0-44549086238

10.1016/j.comcom.2008.03.020

19.

Ampeliotis

Berberidis

Low complexity multiple acoustic source localization in sensor networks based on energy measurements

Signal Processing 2010 90 4 1300 1312

2-s2.0-72949110576

10.1016/j.sigpro.2009.10.015

20.

Niculescu

Nath

DV based positioning in ad hoc networks

Journal of Telecommunication Systems 2003 22 1–4 267 280

2-s2.0-0038703640

10.1023/A:1023403323460

21.

Huang

Blum

B. M.

Stankovic

J. A.

Abdelzaher

Range-free localization schemes for large scale sensor networks

Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom '03)

September 2003

New York, NY, USA

ACM

81 95

2-s2.0-1542329081

22.

Zhou

Xia

S. X.

IEEE

An improved APIT node self-localization algorithm in WSN

Proceedings of the 7th World Congress on Intelligent Control and Automation (WCICA '08)

June 2008

New York, NY, USA

IEEE

7582 7586

2-s2.0-52149085038

10.1109/WCICA.2008.4594106

23.

Wang

J. Z.

Jin

H. G.

Improvement on APIT localization algorithms for wireless sensor networks

Proceedings of the International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC '09)

April 2009

Los Alamitos, CA, USA

IEEE Computer Society

719 723

2-s2.0-67650476142

10.1109/NSWCTC.2009.370

24.

X. Q.

Gao

L. L.

IEEE

An improved APIT algorithm based on direction searching

Proceedings of the 5th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM '09)

September 2009

New York, NY, USA

IEEE

3268 3271

2-s2.0-73149098961

10.1109/WICOM.2009.5303135

25.

Feng

X. F.

H. B.

IEEE Computer Society

Improvement and simulation for a localization based on APIT

Proceedings of the International Conference on Computer Technology and Development (ICCTD '09)

November 2009

Los Alamitos, CA, USA

IEEE Computer Society

68 72

2-s2.0-77951120739

10.1109/ICCTD.2009.127

26.

Jia

J. Q.

Fei

M. R.

Jia

Research on APIT and Monte Carlo method of localization algorithm for wireless sensor networks

Life System Modeling and Intelligent Computing 2010

Berlin, Germany

Springer

128 137

27.

X. Y.

Stojmenovic

Wang

Partial delaunay triangulation and degree limited localized bluetooth scatternet formation

IEEE Transactions on Parallel and Distributed Systems 2004 15 4 350 361

2-s2.0-1942436280

10.1109/TPDS.2004.1271184

28.

Font-Llagunes

J. M.

Batlle

J. A.

Consistent triangulation for mobile robot localization using discontinuous angular measurements

Robotics and Autonomous Systems 2009 57 9 931 942

2-s2.0-68749094959

10.1016/j.robot.2009.06.001

29.

Tekdas

Isler

Sensor placement for triangulation-based localization

IEEE Transactions on Automation Science and Engineering 2010 7 3 681 685

2-s2.0-77954386995

10.1109/TASE.2009.2037135

30.

Bulusu

Heidemann

Estrin

GPS-less low-cost outdoor localization for very small devices

IEEE Personal Communications 2000 7 5 28 34

2-s2.0-0034291601

10.1109/98.878533

31.

Blumenthal

Grossmann

Golatowski

Timmermann

Urena

J. U.

Dominguez

J. J. G.

Weighted centroid localization in Zigbee-based sensor networks

Proceedings of IEEE International Symposium on Intelligent Signal Processing (WISP '07)

October 2007

New York, NY, USA

IEEE

1 6

2-s2.0-51149088302

10.1109/WISP.2007.4447528

32.

Kong

Yang

Dai

IEEE

Research of an improved weighted centroid localization algorithm and anchor distribution

Proceedings of the 2nd International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC '10)

October 2010

New York, NY, USA

IEEE

400 405

2-s2.0-78649880839

10.1109/CyberC.2010.79

33.

Jun

Urriza

Yuxing

Cabric

Weighted centroid localization algorithm: theoretical analysis and distributed implementation

IEEE Transactions on Wireless Communications 2011 10 10 3403 3413

10.1109/TWC.2011.081611.102209

34.

Yedavalli

Krishnamachari

Ravulat

Srinivasan

IEEE

Ecolocation: a sequence based technique for RF localization in wireless sensor networks

Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN '05)

April 2005

New York, NY, USA

IEEE

285 292

2-s2.0-33744918523

10.1109/IPSN.2005.1440937

35.

Jiang

C. X.

Zhao

X. J.

Sequence Based localization algorithm with improved correlation metric and dynamic centroid

Science China Information Sciences 2011 54 11 2349 2358

10.1007/s11432-011-4434-1

36.

Yedavalli

Krishnamachari

Sequence-based localization in wireless sensor networks

IEEE Transactions on Mobile Computing 2008 7 1 81 94

2-s2.0-36549073131

10.1109/TMC.2008.4387797

37.

Liu

Chen

A new sequence-based iterative localization in wireless sensor networks

Proceedings of the International Conference on Information Engineering and Computer Science (ICIECS '09)

December 2009

1 4

2-s2.0-77949648637

10.1109/ICIECS.2009.5364333

38.

Hsiao

C.-C

Tsai

Y.-J.

Node deployment strategy for WSN-based node-sequence localization

Proceedings of the 7th International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP '11)

December 2011

259 264

39.

Blanco

Boada

B. L.

Moreno

Localization by Voronoi diagrams correlation

Proceedings of IEEE International Conference on Robotics and Automation (ICRA '01)

May 2001

4232 4237

2-s2.0-0034868427

40.

Boukerche

Oliveira

H. A. B. F.

Nakamura

E. F.

Loureiro

A. A. F.

A Voronoi approach for scalable and robust DV-hop localization system for sensor networks

Proceedings of the 16th International Conference on Computer Communications and Networks (ICCCN '07)

August 2007

497 502

2-s2.0-40949119563

10.1109/ICCCN.2007.4317868

41.

Boukerche

Oliveira

H. A. B. F.

Nakamura

E. F.

Loureiro

DV-Loc: a scalable localization protocol using Voronoi diagrams for wireless sensor networks

IEEE Wireless Communications 2009 16 2 50 55

2-s2.0-67349117962

10.1109/MWC.2009.4907560

42.

J. S.

Kao

H. C.

Distributed K-coverage self-location estimation scheme based on Voronoi diagram

IET Communications 2010 4 2 167 177

2-s2.0-75649096049

10.1049/iet-com.2009.0288

43.

Ampeliotis

Berberidis

Sorted order-K Voronoi diagrams for model-independent source localization in wireless sensor networks

IEEE Transactions on Signal Processing 2010 58 1 426 437

2-s2.0-72949097070

10.1109/TSP.2009.2029724

44.

Biswas

Lian

T. C.

Wang

T. C.

Semidefinite programming based algorithms for sensor network localization

ACM Transactions on Sensor Networks 2006 2 2 188 220

2-s2.0-33746874045

10.1145/1149283.1149286

45.

Lui

K. W. K.

W. K.

H. C.

Chan

F. K. W.

Semi-definite programming algorithms for sensor network node localization with uncertainties in anchor positions and/or propagation speed

IEEE Transactions on Signal Processing 2009 57 2 752 763

2-s2.0-60549110264

10.1109/TSP.2008.2007916

46.

Lee

Chung

Kim

A new range-free localization method using quadratic programming

Computer Communications 2011 34 8 998 1010

2-s2.0-79954420131

10.1016/j.comcom.2010.10.013

47.

Kim

Lee

J. G.

Jee

G. I.

The interior-point method for an optimal treatment of bias in trilateration location

IEEE Transactions on Vehicular Technology 2006 55 4 1291 1301

2-s2.0-33746355587

10.1109/TVT.2006.877760

48.

Mohamed

A. L.

Ridha

Hybrid TOA/AOA approximate maximum likelihood mobile localization

Journal of Electrical and Computer Engineering 2010 10 1 1 5

49.

Cheng

Wang

Caelli

Optimal nonlinear estimation for localization of wireless sensor networks

IEEE Transactions on Signal Processing 2011 59 12 5674 5685

10.1109/TSP.2011.2166547

50.

Zhong

Achieving range-free localization beyond connectivity

Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems (SenSys '09)

November 2009

New York, NY, USA

IEEE

281 294

2-s2.0-74549122106

10.1145/1644038.1644066

51.

Zhong

Wireless sensor node localization by multisequence processing

ACM Transactions on Embedded Computing Systems 2012 11 1 1 33

52.

Jeong

Guo

D. H. C.

Autonomous passive localization algorithm for road sensor networks

IEEE Transactions on Computers 2011 60 11 1622 1637

10.1109/TC.2010.260

53.

Liu

Rendered path: range-free localization in anisotropic sensor networks with holes

IEEE/ACM Transactions on Networking 2010 18 1 320 332

2-s2.0-77249115764

10.1109/TNET.2009.2024940

54.

Tang

Hong

Bradford

P. G.

Privacy-preserving secure relative localization in vehicular networks

Security and Communication Networks 2008 1 3 195 204

10.1002/sec.31

55.

Boukerche

Oliveira

H. A. B. F.

Nakamura

E. F.

Loureiro

A. A. F.

Secure localization algorithms for wireless sensor networks

IEEE Communications Magazine 2008 46 4 96 101

2-s2.0-42649116160

10.1109/MCOM.2008.4481347

56.

Mao

Fidan

Anderson

B. D. O.

Wireless sensor network localization techniques

Computer Networks 2007 51 10 2529 2553

2-s2.0-34247885928

10.1016/j.comnet.2006.11.018

57.

Chen

Trappe

Greenstein

L. J.

Liu

Non-interactive localization of cognitive radios based on dynamic signal strength mapping

Proceedings of the 6th International Conference on Wireless On-Demand Network Systems and Services (WONS '09)

February 2009

85 92

2-s2.0-64849108029

10.1109/WONS.2009.4801847

58.

Leonardi

Mathias

Galati

Closed form localization algorithms for mode S wide area multilateration

Proceedings of the 6th European Radar Conference (EuRAD '09)

October 2009

73 76

2-s2.0-72449185225

59.

Rappaport

T. S.

Wireless Communications: Principles and Practice 1999

Prentice Hall