- Title
- A nonsmooth optimization approach to sensor network localization
- Creator
- Bagirov, Adil; Lai, Daniel; Palaniswami, M.
- Date
- 2007
- Type
- Text; Conference paper
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/37635
- Identifier
- vital:3587
- Identifier
-
https://doi.org/10.1109/ISSNIP.2007.4496933
- Identifier
- ISBN:9781424415014
- Abstract
- In this paper the problem of localization of wireless sensor network is formulated as an unconstrained nonsmooth optimization problem. We minimize a distance objective function which incorporates unknown sensor nodes and nodes with known positions (anchors) in contrast to popular semidefinite programming (SDP) methods which use artificial objective functions. We study the main properties of the objective function in this problem and design an algorithm for its minimization. Our algorithm is a derivative-free discrete gradient method that allows one to find a near global solution. The algorithm can handle a large number of sensors in the network. This paper contains the theory of our proposed formulation and algorithm while experimental results are included in later work.
- Publisher
- Melbourne, Victoria : IEEE
- Relation
- Paper presented at 3rd International Conference on Intelligent Sensors, Sensor Networks and Information, ISSNIP 2007, Melbourne, Victoria : 3rd-6th December 2007 p. 727-732; http://purl.org/au-research/grants/arc/DP0666061
- Rights
- Copyright IEEE
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0902 Automotive Engineering; Sensor networks; Nonsmooth optimization; Derivative free algorithms
- Full Text
- Hits: 2897
- Visitors: 3014
- Downloads: 279
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Published version | 296 KB | Adobe Acrobat PDF | View Details Download |