TY  - JOUR
SN  - 22277390
PB  - MDPI AG
Y1  - 2020///
VL  - 8
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-85082418830&doi=10.3390%2fmath8030437&partnerID=40&md5=d185b10f26288465e848633700d53981
A1  - Najib, Y.N.A.
A1  - Daud, H.
A1  - Aziz, A.A.
JF  - Mathematics
AV  - none
ID  - scholars13397
TI  - Singular value thresholding algorithm for wireless sensor network localization
N1  - cited By 2
N2  - Wireless Sensor Networks (WSN) are of great current interest in the proliferation of technologies. Since the location of the sensors is one of the most interesting issues in WSN, the process of node localization is crucial for any WSN-based applications. Subsequently, WSN's node estimation deals with a low-rank matrix which gives rise to the application of the Nuclear Norm Minimization (NNM) method. This paper will focus on the localization of 2-dimensional WSN with objects (obstacles). Recent studies introduce Nuclear Norm Minimization (NNM) for node estimation instead of formulating the rank minimization problem. Common way to tackle this problem is by implementing the Semidefinite Programming (SDP). However, SDP can only handle matrices with a size of less than 100 � 100. Therefore, we introduce the method of Singular Value Thresholding (SVT) which is an iterative algorithm to solve the NNM problem that produces a sequence of matrices Xk, Yk and executes a soft-thresholding operation on the singular value of the matrix Yk. This algorithm is a user-friendly algorithm which produces a low computational cost with low storage capacity required to give the lowest-rank minimum nuclear norm solution. © 2020 by the authors.
IS  - 3
ER  -