Skip to Main Content
Current localization algorithms for ad-hoc wireless sensor networks are categorized either as distributed or centralized ones. Typical distributed algorithms include DV-hop, DV-distance , etc., which need the deployment of certain amount of anchor nodes; on the contrary, the centralized algorithms, such as MDS-MAP , need less anchor nodes, while the computation complexity is higher as a result of centralized computing. In this paper, a hierarchical and partial-distributed scheme for ad-hoc wireless sensor networks is proposed. The scheme can be implemented with lower computation complexity and less anchor nodes; moreover, the transmission of localization information among different nodes is easier than that in the scheme utilizing completely distributed algorithms. In addition, the implementation approach of the scheme in NS-2 is given in the simulation section.
Date of Conference: 13-16 July 2008