## Semidefinite Programming for Ad Hoc Wireless Sensor Network Localization (2004)

### Cached

### Download Links

- [www.stanford.edu]
- [www.cs.sunysb.edu]
- [www.stanford.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 186 - 12 self |

### BibTeX

@MISC{Biswas04semidefiniteprogramming,

author = {Pratik Biswas and Yinyue Ye},

title = {Semidefinite Programming for Ad Hoc Wireless Sensor Network Localization },

year = {2004}

}

### Years of Citing Articles

### OpenURL

### Abstract

We describe an SDP relaxation based method for the position estimation problem in wireless sensor networks. The optimization problem is set up so as to minimize the error in sensor positions to fit distance measures. Observable gauges are developed to check the quality of the point estimation of sensors or to detect erroneous sensors. The performance of this technique is highly satisfactory compared to other techniques. Very few anchor nodes are required to accurately estimate the position of all the unknown nodes in a network. Also the estimation errors are minimal even when the anchor nodes are not suitably placed within the network or the distance measurements are noisy.

### Citations

851 | GPS-less low cost outdoor localization for very small devices
- Bulusu, Heidemann, et al.
- 2000
(Show Context)
Citation Context ...orks ([6, 7]). Most techniques use distance or angle measurements from a fixed set of reference or anchor nodes, see [5, 9, 10, 11, 12, 13]; or employ a grid of beacon nodes with known positions, see =-=[4, 8]-=-. One closely related approach is described by Doherty et al. [5] wherein the proximity constraints between nodes which are within ’hearing distance’ of each other are modeled as convex constraints. T... |

827 | Location Systems for Ubiquitous Computing
- Hightower, Boriello
- 2001
(Show Context)
Citation Context ...tor x, denoted by �x�, is defined by � 〈x, x〉. A positive semidefinite matrix X is represented by X � 0. A great deal of research has been done on the topic of position estimation in ad-hoc networks (=-=[6, 7]-=-). Most techniques use distance or angle measurements from a fixed set of reference or anchor nodes, see [5, 9, 10, 11, 12, 13]; or employ a grid of beacon nodes with known positions, see [4, 8]. One ... |

702 | Dynamic fine-grained localization in ad-hoc networks of sensors
- Savvides, Han, et al.
- 2001
(Show Context)
Citation Context ...t deal of research has been done on the topic of position estimation in ad-hoc networks ([6, 7]). Most techniques use distance or angle measurements from a fixed set of reference or anchor nodes, see =-=[5, 9, 10, 11, 12, 13]-=-; or employ a grid of beacon nodes with known positions, see [4, 8]. One closely related approach is described by Doherty et al. [5] wherein the proximity constraints between nodes which are within ’h... |

432 | Convex position estimation in wireless sensor networks
- Doherty, Ghaoui, et al.
- 2001
(Show Context)
Citation Context ...t deal of research has been done on the topic of position estimation in ad-hoc networks ([6, 7]). Most techniques use distance or angle measurements from a fixed set of reference or anchor nodes, see =-=[5, 9, 10, 11, 12, 13]-=-; or employ a grid of beacon nodes with known positions, see [4, 8]. One closely related approach is described by Doherty et al. [5] wherein the proximity constraints between nodes which are within ’h... |

340 | Robust positioning algorithms for distributed ad-hoc wireless sensor networks
- Savarese, Rabaey, et al.
(Show Context)
Citation Context ...t deal of research has been done on the topic of position estimation in ad-hoc networks ([6, 7]). Most techniques use distance or angle measurements from a fixed set of reference or anchor nodes, see =-=[5, 9, 10, 11, 12, 13]-=-; or employ a grid of beacon nodes with known positions, see [4, 8]. One closely related approach is described by Doherty et al. [5] wherein the proximity constraints between nodes which are within ’h... |

317 | Ad hoc positioning system (aps - Niculescu, Nath |

308 | Localization from mere connectivity - Shang, Ruml, et al. |

250 | The bits and flops of the n-hop multilateration primitive for node localization problems
- Savvides, Park, et al.
(Show Context)
Citation Context |

208 |
Ad Hoc Positioning System
- Niculescu, Nath
- 2001
(Show Context)
Citation Context |

111 | Solving large-scale sparse semidefinite programs for combinatorial optimization - Benson, Ye, et al. |

80 | An empirical study of epidemic algorithms in large scale multihop wireless networks
- Ganesan, Krishnamurthy, et al.
- 2002
(Show Context)
Citation Context ...tor x, denoted by �x�, is defined by � 〈x, x〉. A positive semidefinite matrix X is represented by X � 0. A great deal of research has been done on the topic of position estimation in ad-hoc networks (=-=[6, 7]-=-). Most techniques use distance or angle measurements from a fixed set of reference or anchor nodes, see [5, 9, 10, 11, 12, 13]; or employ a grid of beacon nodes with known positions, see [4, 8]. One ... |

74 | Relaxation on a mesh: a formalism for generalized localization
- Howard, Mataric, et al.
(Show Context)
Citation Context ...orks ([6, 7]). Most techniques use distance or angle measurements from a fixed set of reference or anchor nodes, see [5, 9, 10, 11, 12, 13]; or employ a grid of beacon nodes with known positions, see =-=[4, 8]-=-. One closely related approach is described by Doherty et al. [5] wherein the proximity constraints between nodes which are within ’hearing distance’ of each other are modeled as convex constraints. T... |

74 | Global continuation for distance geometry problems - Moré, Wu - 1997 |

71 | H.: Solving Euclidean distance matrix completion problems via semidefinite programming - Alfakih, Khandani, et al. - 1999 |

36 | A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization - Biswas, Ye - 2003 |

29 | Semidefinite relaxations, multivariate normal distributions, and order statistics
- Bertsimas, Ye
- 1998
(Show Context)
Citation Context ...ntain random errors. Then the solution to the SDP problem provides the first and second moment information on ˜xj, j = 1, ..., n. Such an interpretation appears to be first stated in Bertsimas and Ye =-=[2]-=-. 6sand where Generally, we have E[˜xj] ∼ ¯xj, j = 1, ..., n E[˜x T i ˜xj] ∼ ¯ Yij, i, j = 1, ..., n. ¯Z = � I ¯ X ¯X T ¯ Y is the optimal solution of the SDP problem. Thus, ¯Y − ¯ X T ¯ X represents ... |

28 | Efficient algorithms for minimizing a sum of euclidean norms with applications
- Xue, Ye
- 1997
(Show Context)
Citation Context ...ively, if the exact distance r1,2 ≤ R is known, we could set the constraint �(x1 − x2)�2 ≤ r1,2. (3) The second-order cone method for solving Euclidean metric problems can be also found in Xue and Ye =-=[15]-=- where its superior polynomial complexity efficiency is presented. However, this technique yields good results only if the anchor nodes are placed on the outer boundary. The estimated positions of the... |

19 | Matrix completion problems - Laurent - 2001 |

5 |
Let sedumi seduce you
- Sturm
- 2001
(Show Context)
Citation Context ...y accurate. Again, the erroneous estimations are reflected in their individual traces. The computational results presented here were generated using the interior-point algorithm SDP solvers SeDuMi of =-=[14]-=- and DSDP2.0 of [1] with their interfaces to Matlab. The average time to solve one of the 50 sensor problem is 8 seconds by SeDuMi (with the primal formulation) or 2 seconds by DSDP2.0 on a Pentium 1.... |