Abstract
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 [1], etc., which need the deployment of certain amount of anchor nodes; on the contrary, the centralized algorithms, such as MDS-MAP [3], 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.
Original language | English |
---|---|
Title of host publication | Proceedings - IEEE INDIN 2008 |
Subtitle of host publication | 6th IEEE International Conference on Industrial Informatics |
Pages | 25-29 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 31 Oct 2008 |
Externally published | Yes |
Event | IEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics - Daejeon, Korea, Republic of Duration: 13 Jul 2008 → 16 Jul 2008 |
Conference
Conference | IEEE INDIN 2008: 6th IEEE International Conference on Industrial Informatics |
---|---|
Country/Territory | Korea, Republic of |
City | Daejeon |
Period | 13/07/08 → 16/07/08 |
ASJC Scopus subject areas
- Computer Science Applications
- Information Systems