Abstract
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 language | English |
---|---|
Pages (from-to) | 38-42 |
Number of pages | 5 |
Journal | Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University |
Volume | 43 |
Issue number | 8 |
Publication status | Published - Aug 2009 |
Externally published | Yes |
Keywords
- Node localization
- Semi-definite programming
- Wireless sensor network