A nonsmooth optimization approach to sensor network localization

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.

[1]  Stephen B. Wicker,et al.  On the optimal distribution of sensors in a random field , 2005, TOSN.

[2]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[3]  V. F. Demʹi︠a︡nov,et al.  Constructive nonsmooth analysis , 1995 .

[4]  Alfred O. Hero,et al.  Distributed weighted-multidimensional scaling for node localization in sensor networks , 2006, TOSN.

[5]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[6]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  John W. Fisher,et al.  Nonparametric belief propagation for self-localization of sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[8]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

[9]  R. Mifflin.  Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[10]  Adil M. Bagirov,et al.  Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization , 2006, J. Glob. Optim..

[11]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[12]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[13]  Adil M. Bagirov,et al.  A derivative-free method for linearly constrained nonsmooth optimization , 2006 .

[14]  A. Bagirov,et al.  Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization , 2008 .

[15]  Bruno Sinopoli,et al.  A kernel-based learning approach to ad hoc sensor network localization , 2005, TOSN.

[16]  Yinyu Ye,et al.  Semidefinite programming based algorithms for sensor network localization , 2006, TOSN.

[17]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[18]  R.L. Moses,et al.  Locating the nodes: cooperative localization in wireless sensor networks , 2005, IEEE Signal Processing Magazine.

[19]  Adil M. Bagirov.  Minimization Methods for One Class of Nonsmooth Functions and Calculation of Semi-Equilibrium Prices , 1999 .

[20]  Jan M. Rabaey,et al.  Location in distributed ad-hoc wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[21]  Wheeler Ruml,et al.  Improved MDS-based localization , 2004, IEEE INFOCOM 2004.

[22]  King Lun Yiu.  Ad-hoc positioning system , 2008 .