Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2009, Vol. 26 ›› Issue (6): 812-819.DOI: 10.7523/j.issn.2095-6134.2009.6.012

• Research Articles • Previous Articles     Next Articles

A 2-hop spanning tree based scalable clustered localization algorithm for wireless sensor networks

MIAO Fu-You1, XIONG Yan1, WANG Xin-Xia2   

  1. 1. Department of Computer Science, University of Science and Technology of China, Hefei 230027, China;
    2. Department of Computer Science, Xinyang Normal University, Xinyang 464000, China
  • Received:2008-12-04 Revised:2009-06-04 Online:2009-11-15

Abstract:

The proposed localization algorithm first generates clusters and a spanning tree consisting of cluster heads, and then the cluster head computes local coordinates of all member nodes in the cluster. Finally, it generates a global coordinate of all nodes through the above spanning tree. Analysis and simulation show that the proposed algorithm has higher cover rate and precision of localization, lower network traffic, less time consumption, and higher scalability than the existing SDGPSN.

Key words: wireless sensor networks, relative localization, clustering, 2 hop spanning tree

CLC Number: