Nodes locating algorithm based on local semi-definite programming for large scale wireless sensor networks

Xu Zhou, Shancang Li, Xinheng Wang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


Aiming at the locating problem in large scale wireless sensor networks, a local SDP algorithm (LSDP) is proposed. A large scale wireless sensor network is split into some local networks according to a node importance index of each node, and a relative map in each local network is then obtained with SDP. All relative maps are patched into a global relative map. After matching with reference nodes, the global relative map is transformed into a global absolute map, and then all nodes in the network are located. Simulation results show that the location error is as little as 98% of that in ideal communications when WSN is regularly deployed. The location error is reduced by 90% if WSN is randomly deployed.

Original languageEnglish
Pages (from-to)38-42
Number of pages5
JournalHsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University
Issue number8
Publication statusPublished - Aug 2009
Externally publishedYes


  • Node localization
  • Semi-definite programming
  • Wireless sensor network

Cite this