Research Article  Open Access
Geometric Buildup Algorithms for Sensor Network Localization
Abstract
We present a geometric buildup algorithm for solving the sensor network localization problem with either accurate or noisy distance data. The algorithm determines the locations of the sensors, one at a time, by using the distances between the determined sensors and the undetermined ones. Each time, only a small system of distance equations needs to be solved and therefore, in an ideal case when the required distances are available for every sensor to be determined, the computation can be completed in steps if sensors are to be determined. An algorithm with two buildup phases is also implemented to handle not only noisy but also sparse distance data with for example only a few distant anchors. We show our test results and compare them with other approaches.
1. Introduction
Ad hoc wireless sensor networks consist of a large number of spatially distributed sensor nodes that communicate with their nearby sensors within a radio range [1, 2]. The sensor data are relevant only if the sensors’ locations are known. The expensive GPS (Global Positioning System) may locate only some of the sensors (called anchors). Most sensors can be located by means of some distance information obtained from the radio signals that the sensors receive [1]. The problem of finding the locations of the sensors given a few anchors and some local distance information among the sensors is called the sensor network localization problem.
Sensor network localization has been applied to many application fields, including environmental studies such as monitoring environmental conditions [3, 4], health cares such as patient tracking [5], and military applications such, as battlefield surveillance [6]. For example, [2, 7] mention that Southern California Edisons Nuclear Generating Station in San Onofre, Calif, USA has deployed wireless meshnetworked sensors from Dust Networks Inc. to obtain realtime trend data. These data are used to predict which motors are about to fail, so they could be preemptively rebuilt or replaced during scheduled maintenance periods. Implementation of a sensor localization algorithm could provide a service that eliminates the need to record every sensor’s location and its associated ID number in the network [2].
Mathematically, the sensor network localization problem can be described as follows. Assume that there are anchors whose locations denoted by , are known and sensors whose locations denoted by need to be decided. For a pair of sensors and , let their Euclidean distance be denoted by . Similarly, let denote the Euclidean distance between an anchor and a sensor . Let and be two sets of node pairs, where represents the Euclidean norm and is a fixed parameter called radio range. The sensor network localization problem can be formulated as a 2D distance geometry problem, to find the vectors for all such that In practice, the distance information is available only if the distance of two nodes is within a certain radio range. Therefore, the available distances are usually sparse, that is, only a small subset of all distances among the nodes is available. The distance data contains errors as well due to the accuracy of the measurements, the power of the sensors, and some other environmental factors. A distance geometry problem with sparse and inexact distances has been proved to be difficult to solve in general [8–10].
More specifically, if exact distances for all pairs of nodes are available, a distance geometry problem can be solved in polynomial time by using for example a singular value decomposition algorithm in [9] or a geometric buildup algorithm in [11], where is the number of nodes to be determined and is the conventional expression for time complexity. If only a sparse set of distances is given, the problem is NPhard in general [8], even if small distance errors are allowed [10].
Much work has been done on the sensor network localization problem. Biswas et al. [1, 12] proposed an SDP (semidefinite programming) approach to the problem. Wang et al. [13] made further SDP relaxations and developed NSDP (nodebased SDP) and ESDP (edgebased SDP) algorithms for largescale applications. Nie [14] presented an SOS (sum of squares) approach by formulating the problem as a minimization problem for a sum of squares. Tseng [15] developed an SOCP (secondorder cone programming) relaxation method. Recent works also include Carter et al. [2], the SFSDP (sparse variant of FSDP [1]) approach by Kim et al. [16], Zhu et al. [17], the LPCGD (logbarrier penalty coordinate gradient descent) approach by Pong and Tseng [18], and the SNLSDPclique approach by Krislock and Wolkowicz [19, 20].
We investigate the solution of the sensor network localization problem within a geometric buildup framework. A basic geometric buildup algorithm [11] was proposed for the solution of a 3D distance geometry problem with exact distances. The work was later extended to problems with sparse distances [21–23], inexact distances [24], and distance bounds [25]. All these works were applied to protein structure determination problems, which are to determine a set of points given a set of distances between the points. The idea of geometric buildup is to determine the points, one at a time, using the distances between the determined points and the undetermined ones. The algorithm can be applied to distance geometry problems in any finite dimensional Euclidean space including the sensor network localization in 2D.
In every buildup step, for determining a point, a small system of distance equations needs to be solved. However, the point may be overdetermined for there may be more equations than the coordinates for the point. On the other hand, the distances may have errors and the equations are most likely to be inconsistent. To overcome this difficulty, a leastsquares approximation method has been developed for solving the distance equations [24]. The method employs a lowrank matrix approximation scheme [26], which requires the singular value decomposition for a small distance matrix. Here, our algorithm is different from [24] in the approximation scheme. We implement a lowrank positive semidefinite approximation scheme [27], which requires a spectral decomposition and guarantees a bestpossible approximation to the solution of the distance equations in a leastsquares sense.
The availability of an initial set of determined points can be important for a geometric buildup algorithm to start and succeed. Fortunately, for sensor network localization, there is usually a set of anchor nodes that can be used as an initial set of nodes. However, if there are only a few anchors scattered widely in space, the chance is that there may not be many sensors with (at least three) distances to these anchors and the algorithm may be able to determine only a small set of sensors. For this reason, we have also implemented a twophase buildup algorithm. In the first phase, we determine as many sensors as possible starting with the initial anchors. In the second phase, from the undermined sensors, if there are any, we find a clique of sensors, that is, a subset of sensors with all distances among them available. We position the sensors in the clique in space (which is possible using their distances) and start from them to determine the remaining sensors. In this way, we can have more sensors determined than a single phase algorithm.
This paper is organized as follows. In Section 2, we present several possible versions of geometric buildup algorithms for sensor network localization. In Section 3, we present the numerical results for a set of simulated sensor network localization problems with exact and inexact sparse distances. We conclude the paper and make some remarks in Section 4.
2. The Geometric Buildup Algorithms
In this section, we present three versions of geometric buildup algorithms for sensor network localization. Three cases of problems are concerned (1) when exact distances are available, (2) when distances have errors, and (3) when there are only a few distant anchors. A geometric buildup algorithm, named as basic, extended, and twophase geometric buildup algorithms, respectively, is described for each of the three cases.
2.1. The Basic Geometric Buildup Algorithm
When a set of exact distances is given, that is, the distances in (1.1) is accurate, a basic geometric buildup algorithm can be applied. The algorithm works as follows. It first takes the anchors as the initial set of determined sensors. Then, for any undetermined sensor , it tries to find three determined sensors that are not collinear but have distances to sensor . We call these three determined sensors a basis set of sensors for sensor . Let be the coordinate vectors of the three determined sensors. Given the distances , the coordinate vector of sensor can be determined by using the following system of equations: Subtracting equation from equation results in a linear system of equations where
The points are not collinear, so the coefficient matrix is nonsingular and the linear system (2.2) has a unique solution. An outline of the basic geometric buildup algorithm is given in Algorithm 1. Note that if there are at least three anchors in the network and the distances are exact, and if in every step, an undetermined sensor and a basis set of determined sensors associated with it can be found, then the basic geometric buildup algorithm can solve the problem in computation time, where is the total number of sensors to be determined.

2.2. The Extended Geometric Buildup Algorithm
Note that for every undetermined sensor, there may be more than three determined sensors that have distances to it. Therefore, there may be more than three distance equations in (2.1) for the sensor to satisfy. Of course, if the distances are accurate, or in other words, are exact, only three equations need to be solved as done in the basic algorithm, while all other equations are satisfied automatically. However, in practice, the distances may have errors and therefore, the distance equations may not be consistent, and satisfying three of them does not necessarily satisfy all the equations. Besides, (2.1) cannot be reduced to (2.2) any more because there may not be a solution to the equations in (2.1) or, in other words, the equations may never hold and hence cannot add or subtract. The extended geometric buildup algorithm is developed to overcome these difficulties.
An extended geometric buildup algorithm works as follows. It again takes the anchors as the initial set of determined sensor. Then, for each undetermined sensor, it finds all the determined sensors that have distances to the undetermined sensor. If there are at least three such determined sensors and if they are not collinear, then the algorithm tries to find the coordinates for the undetermined sensor by solving a system of distance equations corresponding to all these determined sensors. In particular, since the equations may not be consistent, they are solved approximately in a leastsquares sense as described in the following.
Let be the coordinate vector of the sensor to be determined. Let be the coordinate vectors of the determined sensors to be used for the determination of . Let be the distances from to . Then the distance equations to be solved are The equations can be solved by using for example a standard nonlinear leastsquares method, but we implement a method similar to that proposed in [24] and obtain a more direct solution to the equations. Instead of working on the system in (2.4), we expand it to the following system: Note that in the added equations may or may not be available in the given distance data, but they can be computed if some of them are not because are already known. We then consider all as unknowns and determine them all by solving the system of equations in (2.5). Since the relative positions of these sensors are invariant under any translation and orthogonal transformation, we can set a reference system so that the sensor to be determined is located at the origin or, in other words, . It follows that and Define a coordinate matrix and an induced distance matrix as follows: It is easy to verify that , which has been widely studied in the classical multidimensional scaling or “MDS” [27–29]. If the distances have errors, the system may not be consistent. It is natural to consider a leastsquares problem where is the matrix Frobenius norm. [24] applied the best rank matrix approximation coming from the classical EckartYoung Theorem [26], which involves the singular value decomposition. Here, we apply a best positive semidefinite approximation which involves the spectral decomposition. The solution to the problem in (2.8) can be obtained from the following theorem.
Theorem 2.1 (see [19, 27]). Let be the spectral decomposition of the symmetric matrix , where . Then , where , is the best positive semidefinite approximation to the following problem,
Now suppose that the spectral decomposition of is , where the diagonal entries of are in a decreasing order. Let and be the diagonal matrix with , where . Then solves the problem in (2.8), and the coordinates of all the sensors are obtained, with the sensor to be determined located at . To obtain the coordinates of this sensor in the original reference system, it can be transformed along with other sensors so that the recalculated coordinates of those sensors agree with their old ones as much as possible. The latter can be done by minimizing the socalled RMSD (rootmeansquare deviation) of the coordinates (details at the end of this subsection).
It seems that the system of equations in (2.4) is simpler and easier to solve than that in (2.5), and the coordinates of are also recalculated in (2.5). It turns out that solving (2.5) instead of (2.4) is critical for the stability of the buildup algorithm. The solution to the system in (2.4) depends on previously calculated coordinates and, therefore, may inherit errors from previous calculations. If such errors are continuously passed down to later calculations, the buildup algorithm is most likely to end up with an incorrect set of coordinates for the sensors. In contrast, the solution to the system in (2.5) depends only on the distances among the sensors, most of which are given in the original distance data. The recalculation of the coordinates also “cutoffs” possible propagations of calculation errors, making the algorithm much more stable [24].
As we have mentioned above, the coordinates of are determined in an independent reference system. In order to move the coordinates back to their original reference system, we need to make a proper translation and orthogonal transformation for the coordinates. Let and be the previously calculated and recalculated coordinate matrices of the determined sensors, respectively. We first calculate the geometric centers of and , and then update and : where is an vector with all elements . After such a translation, the geometric centers of and coincide at the origin. We then implement an orthogonal transformation on so that is aligned with as much as possible. This can be done by choosing an appropriate orthogonal transform so that the rootmeansquare deviation of and are minimized, that is, where is an orthogonal matrix. Let , and let be the singular value decomposition of . It follows that is the optimal matrix of the above problem [30]. The coordinates of the determined sensors can then be obtained by setting and the coordinates of the sensor by An outline of the extended geometric buildup algorithm is given in Algorithm 2.

2.3. The TwoPhase Geometric Buildup Algorithm
The basic and extended geometric buildup algorithms both start building up from the anchors. If only a few anchors are available and if the distance data is also very sparse, the algorithms may not be able to determine any sensors since they may not be able to find an undetermined sensor that has at least three given distances to the anchors. Even if the algorithms can proceed, they may not be able to determine all the sensors if some undetermined sensors do not have enough required distances to the determined sensors. Here, we present a twophase geometric buildup algorithm to deal with these situations.
In Phase 1, we proceed with the extended geometric buildup algorithm until no sensors can be determined. In Phase 2, we find, in the undetermined sensors, a subset of at least three sensors where the distances between every pair of sensors are given (details are in Algorithm 3 “choose an initial set in Phase 2”). More discussions on finding a clique can be found in [31, 32], and so forth. If such a set of sensors, say sensors, are found, a system of distance equations as in (2.5) can be formed, and the positions of the sensors can be determined by solving these equations in the same way as we described in the previous subsection: we first set . We then define and as in (2.7). Let the spectral decomposition of be , where the diagonal entries of are in a decreasing order. Let and be the diagonal matrix with , where . Then gives the positions of the rest of the sensors. Once the positions of these sensors are determined, we can use them as an initial set of sensors to start the extended geometric buildup algorithm again. Upon finishing, another set of determined sensors is obtained.

Hopefully, the two sets of sensors determined in Phases 1 and 2 have an overlapping subset of at least three sensors, say sensors. Let and be the coordinate matrices of these sensors obtained in Phases 1 and 2, respectively. We can then make a proper translation and orthogonal transformation so that the rootmeansquare deviation of and are minimized. An outline of the twophase buildup algorithm is given in Algorithm 4. Note that the parameter TH is a threshold used in the algorithm. If the percentage of the undetermined sensors in Phase 1 is greater than TH, the algorithm enters Phase 2, otherwise it stops, leaving a few sensors undecided. In principle, if there are a few sensors without enough distance constraints (e.g., each with fewer than three distances), they are considered to be undecidable.

3. Numerical Results
In this section, we present some numerical results from applying the twophase geometric buildup algorithm (abbreviated as BU) to a set of test problems for sensor network localization. The test problems were generated in a similar way as used in [1]. We randomly generate points with a uniform distribution in a square of size centered at the origin. Without loss of generality we choose the first points to be the anchors. We compute the distances between every pair of sensors, but select only those less than the given radio range . We also add a multiplicative random noise to every selected distance, where is a specified noisy factor, and is a standard Gaussian random variable. We set the threshold . The 10% threshold for starting Phase II is indeed arbitrary. It was used for our testing purposes. In real applications, it may be set to a practically acceptable value. That is, if the percentage is lower than that value, the algorithm can terminate.
The output includes three parameters and all of our outputs are the average results from five independent test problems. One parameter is , the average CPU time in seconds over five cases except the time to generate the test problems. The buildup algorithm tries to determine all the points, but may terminate with only a subset of points as determined. In the latter case, we use another parameter NumUndet to report the average number of undetermined sensors. This is reasonable because there could be cases that some points are not determinable uniquely, for example, when a point has only one or two distances. If the undetermined points do have more than two distances, we would suggest using a general optimization algorithm to followup. However, in this paper, we have not included followup optimization, for we want to evaluate the performance of the buildup algorithm only. The last parameter is the RMSD value, measuring the average rootmeansquare deviation of the calculated and actual locations of the determined sensors: where is the number of the determined sensors, and are the true and calculated locations of the determined sensors, respectively. For convenience, we list all the input and output parameters in Table 1. Note that as an input the original coordinates matrix of all sensors (i.e., “”) is used only to generate distances we need and evaluate the accuracy of the algorithms in numerical simulations.

All our calculations are done in MATLAB 7.9.0 (R2009b) on a Dell xps M1330 laptop with 2.00 GHz CPU and 3.00 GB memory.
3.1. Problems with Exact Distances
Example 3.1. We have generated a set of sensor networks with 500, 1000, 2000, and 4000 nodes, respectively. We downloaded the code “SFSDP V111” of the SFSDP approach [16] from http://www.is.titech.ac.jp/~kojima/SFSDP/SFSDP.html. In Table 2, the “RMSD” of SFSDP are the average results over five cases without postrefinement of locations of sensors by the MATLAB function “lsqnonlin”. The “T” of SFSDP is the average CPU time consumed by SeDuMi with the same accuracy parameter pars.eps as [16]. The numerical results in Table 2 show that for these problems with exact distances, the SFSDP approach performs well when is relatively larger, while the BU algorithm can find solutions to the problems with smaller RMSD values in shorter running time with fewer distance data (i.e., smaller ). Figure 1 shows a graph of 1000 node network determined by the geometric buildup algorithm and all the sensors are accurately positioned.

We have also tested some largerscale problems with exact distances. The results for each problem size are obtained and shown in Table 2. Note that in particular, a sensor network of 10000 nodes was solved by the geometric buildup algorithm in less than 1 minute. Recently Krislock and Wolkowicz [19, 20] proposed an SNLSDPclique approach which is very efficient for noiseless problems. We also ran “SNLSDPclique0.2” downloaded from http://orion.math.uwaterloo.ca/~hwolkowicz/henry/software/EDM.shtml and present the results in Tables 2 and 3. We find that in these cases when the sensor network is relatively small (e.g., ), the two algorithms perform very closely and the BU algorithm is a little more accurate than the SNLSDPclique algorithm (note that these results of SNLSDPclique have been very accurate); when the sensor network is relatively big (e.g., ), the SNLSDPclique algorithm runs faster than the BU algorithm and the BU algorithm is still a little more accurate. We will further demonstrate the performance behaviors of these two algorithms on the noisy problems in Table 7.

3.2. Problems with a Few Anchors
Example 3.2. We have also tested a special network generated by [1, 12]. This network consists of 50 sensors, including 3 anchors. Exact distances are assumed and therefore . The radio range takes values from 0.2 to 0.35. The average performance results for are listed in Table 4. We can see that the problems were solved in less than 1 second. Note that for each in these tests, in two runs only Phase 1 was executed, while in the other three runs Phase 2 was also invoked. It showed that sometimes Phase 2 was necessary for sparse distance data. However, when we reduced to 0.25 or 0.2, the distances became very sparse, and even in Phase 2, only a few sensors could be determined.

Example 3.3. Another problem we have tested comes from [14]. We have randomly generated 500 sensors and the anchors were chosen to be the four points at . The distance set A was generated as follows. Initially, set . Then for each from 1 to 500, compute the set ; if , let be the subset of consisting of the 10 smallest integers; otherwise, let ; then let . The distance set B is chosen such that , that is, every anchor is connected to all the sensors that are within distance 0.3. The whole distance set is . Since there are no noises, .
In this problem, the four anchors are far away from each other. If one unknown sensor has distances to at least three of them, the radio range has to be at least the distance from one of them to the origin (), which is not possible. Therefore, the geometric buildup algorithm has to go to Phase 2 to solve the problem. The average performance results are listed in Table 5. We also list the results of the SOS approach [14] and the ESDP approach [13] in Table 5. Since the SOS code is not published online and the published ESDP code implements the steepest descent local search refinement, while the BU algorithm does not implement any postrefinement, we decided to directly cite their original results. From Table 5 we see that on this test problem the BU algorithm outperforms the SOS approach in the accuracy and running time and it outperforms the ESDP approach in the accuracy at least.
 
^{
a}This time indicates all the running time including that to generate problems. ^{ b}BU was implemented on a laptop with 3.00 GB memory and 2.00 GHz CPU. ^{ c}SOS [14] was implemented on a Linux machine with 0.98 GB RAM and 1.46 GHz CPU. The “RMSD” and “Time” of SOS come from [14]. ^{ d}ESDP [13] was implemented on a laptop with 1.99 GB RAM and 1.06 GHz CPU. The “RMSD” and “Time” of ESDP come from [13]. 
3.3. Problems with Noisy Distances
Example 3.4. We have also tested a set of problems with a large fraction of anchors but low distance noises (e.g., and ). These problems are mid to largescale, tested by SOCP [15], ESDP [13], and LPCGD [18]. The parameters are set as follows: for for . For each set of parameters, the average results are in Table 6. We see that the numbers of undetermined sensors are relatively small (less than 5% of the total number of sensors). In particular, for the problem with 4000 sensors, there are only a few sensors undetermined. The average RMSD values of the BU algorithm without postrefinement are close to those of ESDP with postrefinement on noisy problems. Figure 2 shows one example of 1000 sensors with in which the locations of sensors are fairly accurate. Note that in the five cases of 4000 nodes with , although the average RMSD is , the best RMSD value is actually without any postrefinement.
 
^{
a}RMSD of ESDP is obtained by implementing the steepest descent local search refinement for noisy sensor network problems. RMSD of BU is obtained without postrefinement. The RMSD values of ESDP come from [13]. 

We also compared the running time of the BU algorithm with the ESDP [13], SOCP1(SeDuMi) [15], SOCP2(SCGD) [15], and LPCGD [18] approaches. Based on their published results and our running results, we think on these problems the BU algorithm is most likely to run faster than ESDP, SOCP1(Se DuMi), SOCP2(SCGD), and LPCGD may run faster than BU. Since the running environments are quite different and only the ESDP code with a postrefinement is published online, it is hard to compare these approaches exactly in terms of running time, which makes us not list their running time here. Interested readers can refer to the above papers.
We have also tested some problems with larger noises, for example, . The average results are shown in Table 7. As in Example 3.1, the running time of SFSDP is the average CPU time in seconds over five cases consumed by SeDuMi with the accuracy parameter pars.eps . Kim et al. [16] used three different values of for each problem and we chose the with the best result. We also ran “SNLSDPclique0.2” [19, 20] and show the average results over five cases in Table 7. We can see that although the SFSDP approach is a little more accurate than the BU algorithm, BU obtains similar accuracy with SFSDP (i.e., their RMSD values have the same orders) in shorter running time with fewer distance data. The SNLSDPclique approach runs faster than the BU algorithm, but BU needs fewer distance data with large noises than SNLSDPclique to obtain same orders of RMSD values. We also see that the RMSD values of the BU algorithm become larger than those of problems with low noises. This may be due to the fact that the buildup algorithm is an iterative algorithm and large noises affect the accuracy of calculations. However, we see from Table 7 that the errors of the BU algorithm may be improved by increasing the number of anchors.
Note that for SFSDP, larger values result in smaller RMSDs, but for BU, larger values may result in larger RMSD, as shown in Table 8. We can see that for the network of 2000 nodes with , when varies from 0.05 to 0.11, RMSD increases from to . For the network of 1000 nodes with , as varies from 0.06 to 0.22, RMSD decreases first, then increases. The reason is that for an undetermined sensor, larger may result in more neighboring determined sensors and thus a largersize noisy leastsquares problem, the solution to which may involve larger errors.

3.4. Impact of Noise, the Number of Anchors, and the Radio Range
We now summarize in the following on how the distance noise, the number of anchors, and the radio range affect the performance of the geometric buildup algorithm.
First, as shown in Table 6, the RMSD value of a network determined by the geometric buildup algorithm increases as increases. For example, for a network of 4000 nodes, when the noise factor increases from 0.001 to 0.01, the RMSD value increases from around to .
Second, as shown in Table 7, increasing the number of anchors increases the accuracy of localization. It may reduce the time to find the required determined sensors for an undetermined sensor as well. For example, for a network of 4000 nodes, when increases from 100 to 400, the RMSD value decreases from to and the running time decreases from 75.7 s to 43.0 s.
Third, as further demonstrated in Table 8, the impact of the radio range depends on the noise. As mentioned in Example 3.4, for an undetermined sensor, larger values may result in more neighboring determined sensors and thus a largersize noisy leastsquares problem whose optimal solution may involve larger errors. For example, if is small, increasing in an appropriate range can improve the accuracy of localization, while if is large, increasing may increase the RMSD value.
4. Conclusion
In this paper, we have investigated a geometric buildup approach to the sensor network localization problem. We follow the buildup scheme [24] which was applied to protein structure determination problems. The main difference between our algorithm and [24] is that we employ a lowrank positive semidefinite approximation scheme, which requires a spectral decomposition for a small distance matrix and guarantees a bestpossible approximation to the solution of the distance equations in a leastsquares sense. We have also implemented a twophase buildup algorithm to handle problems with a few anchors and sparse distances. In principle, the initial clique in Phase II may find only several points while there are still larger cliques in the graph. We would like to consider some efficient clique searching algorithms in our future efforts.
We have tested the geometric buildup algorithm on a set of simulated sensor network localization problems with sparse and exact or inexact distances. The results showed that the algorithm runs fast on the test problems with acceptable accuracy. The algorithm is easy to follow and implement, and if further developed, may particularly be suitable for largescale applications. The algorithm still needs to be improved to handle problems with large distance noises and problems with extremely sparse distances, which we will work on in our future efforts.
Acknowledgments
Zheng’s work was done during her visit to Iowa State University. Her work was supported by the postdoctoral fellowship provided by the Laurence H. Baker Center for Bioinformatics and Biological Statistics and the Department of Mathematics, Iowa State University. Luo’s work was done during his visit to Iowa State University. His work was supported by the Grant 2007CB310604 from National Basic Research Program of China and Chinese Scholar Council no. [2007]3091. Wu’s work was supported partially by the NIH/NIGMS Grant R01GM081680 from the National Institutes of Health, and the NSF/DMS Grant DMS0914354 from the National Science Foundation, United States. The first author appreciates Professor Yinyu Ye for the SDP code of the sensor network localization given in a workshop (Beijing, 2006) and her advisor Professor Yaxiang Yuan for his encouragement and help all the time. The authors would like to thank Atilla Sit for sharing his initial SVD buildup code and Vladimir Sukhoy and the referees for many helpful discussions and suggestions.
References
 P. Biswas and Y. Ye, “Semidefinite programming for ad hoc wireless sensor network localization,” in Proceedings of the Third International Symposium on Information Processing in Sensor Networks, (IPSN '04), pp. 46–54, New York, NY, USA, April 2004. View at: Google Scholar
 M. W. Carter, H. H. Jin, M. A. Saunders, and Y. Ye, “SpaseLoc: an adaptive subproblem algorithm for scalable wireless sensor network localization,” SIAM Journal on Optimization, vol. 17, no. 4, pp. 1102–1128, 2006. View at: Publisher Site  Google Scholar
 D. Culler and W. Hong, “Wireless sensor networks,” Communications of the ACM, vol. 47, pp. 30–33, 2004. View at: Google Scholar
 T.H. Yi, H.N. Li, and M. Gu, “Optimal sensor placement for health monitoring of highrise structure based on genetic algorithm,” Mathematical Problems in Engineering, vol. 2011, Article ID 395101, 12 pages, 2011. View at: Google Scholar
 T. Gao, D. Greenspan, M. Welsh, R. R. Juang, and A. Alm, “Vital signs monitoring and patient tracking over a wireless network,” in Proceedings of the 27th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, (EMBS '05), pp. 102–105, Shanghai, China, September 2005. View at: Google Scholar
 M. Lawlor, “Small systems, big business,” Signal Magazine, 2005. View at: Google Scholar
 A. Dragoon, “Small wonders,” CIO Magazine, 2005. View at: Google Scholar
 J. B. Saxe, “Embeddability of weighted graphs in kspace is strongly NPhard,” in Proceedings of the 17th Allerton Conference in Communication, Control and Computing, pp. 480–489, Monticello, Ill, USA, 1979. View at: Google Scholar
 G. M. Crippen and T. F. Havel, Distance Geometry and Molecular Conformation, Research Studies Press, Chichester, UK, 1988.
 J. J. More and Z. Wu, “εoptimal solutions to distance geometry problems via global continuation,” in Global Minimization of NonConvex Energy Functions, P. M. Pardalos, D. Shalloway, and G. Xue, Eds., pp. 151–168, American Mathematical Society, Providence, RI, USA, 1996. View at: Google Scholar
 Q. Dong and Z. Wu, “A lineartime algorithm for solving the molecular distance geometry problem with exact interatomic distances,” Journal of Global Optimization, vol. 22, no. 14, pp. 365–375, 2002. View at: Publisher Site  Google Scholar
 P. Biswas, T.C. Lian, T.C. Wang, and Y. Ye, “Semidefinite programming based algorithms for sensor network localization,” ACM Transactions on Sensor Networks, vol. 2, no. 2, pp. 188–220, 2006. View at: Publisher Site  Google Scholar
 Z. Wang, S. Zheng, Y. Ye, and S. Boyd, “Further relaxations of the semidefinite programming approach to sensor network localization,” SIAM Journal on Optimization, vol. 19, no. 2, pp. 655–673, 2008. View at: Publisher Site  Google Scholar
 J. Nie, “Sum of squares method for sensor network localization,” Computational Optimization and Applications, vol. 43, no. 2, pp. 151–179, 2009. View at: Publisher Site  Google Scholar
 P. Tseng, “Secondorder cone programming relaxation of sensor network localization,” SIAM Journal on Optimization, vol. 18, no. 1, pp. 156–185, 2007. View at: Publisher Site  Google Scholar
 S. Kim, M. Kojima, and H. Waki, “Exploiting sparsity in SDP relaxation for sensor network localization,” SIAM Journal on Optimization, vol. 20, no. 1, pp. 192–215, 2009. View at: Publisher Site  Google Scholar
 Z. Zhu, A. M.C. So, and Y. Ye, “Universal rigidity and edge sparsification for sensor network localization,” SIAM Journal on Optimization, vol. 20, no. 6, pp. 3059–3081, 2010. View at: Publisher Site  Google Scholar
 T. K. Pong and P. Tseng, “(Robust) edgebased semidefinite programming relaxation of sensor network localization,” Mathematical Programming. In press. View at: Publisher Site  Google Scholar
 N. Krislock and H. Wolkowicz, “Explicit sensor network localization using semidefinite representations and facial reductions,” SIAM Journal on Optimization, vol. 20, no. 5, pp. 2679–2708, 2010. View at: Publisher Site  Google Scholar
 N. Krislock, Semidefinite facial reduction for lowrank euclidean distance matrix completion, Ph.D. thesis, University of Waterloo, Waterloo, Canada, 2010.
 Q. Dong and Z. Wu, “A geometric buildup algorithm for solving the molecular distance geometry problem with sparse distance data,” Journal of Global Optimization, vol. 26, no. 3, pp. 321–333, 2003. View at: Publisher Site  Google Scholar
 D. Wu and Z. Wu, “An updated geometric buildup algorithm for solving the molecular distance geometry problems with sparse distance data,” Journal of Global Optimization, vol. 37, no. 4, pp. 661–673, 2007. View at: Publisher Site  Google Scholar
 D. Wu, Z. Wu, and Y. Yuan, “Rigid versus unique determination of protein structures with geometric buildup,” Optimization Letters, vol. 2, no. 3, pp. 319–331, 2008. View at: Publisher Site  Google Scholar
 A. Sit, Z. Wu, and Y. Yuan, “A geometric buildup algorithm for the solution of the distance geometry problem using leastsquares approximation,” Bulletin of Mathematical Biology, vol. 71, no. 8, pp. 1914–1933, 2009. View at: Publisher Site  Google Scholar
 A. Sit and Z. Wu, “Solving a generalized distance geometry problem for protein structure determination,” Bulletin of Mathematical Biology. In press. View at: Publisher Site  Google Scholar
 C. Eckart and G. Young, “The approximation of one matrix by another of lower rank,” Psychometrika, vol. 1, no. 3, pp. 211–218, 1936. View at: Publisher Site  Google Scholar
 R. Mathar and R. Meyer, “Preorderings, monotone functions, and best rank r approximations with applications to classical MDS,” Journal of Statistical Planning and Inference, vol. 37, no. 3, pp. 291–305, 1993. View at: Publisher Site  Google Scholar
 T. F. Cox and M. A. A. Cox, Multidimensional Scaling, Chapman and Hall, London, UK, 2en edition, 1994.
 W. S. Torgerson, “Multidimensional scaling. I. Theory and method,” Psychometrika, vol. 17, pp. 401–419, 1952. View at: Google Scholar
 G. H. Golub and C. F. V. Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, Md, USA, 1989.
 R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., pp. 85–103, Plenum Press, New York, NY, USA, 1972. View at: Google Scholar
 J. M. Robson, “Finding a maximum independent set in time O(2^{n/4}),” Technical Report 125101, Université Bordeaux I, Bordeaux, France, 2001. View at: Google Scholar
Copyright
Copyright © 2012 Zhenzhen Zheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.