Localization in wireless sensor networks with known coordinate database

23Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Geographic location of nodes is very useful for a sensor network. A novel and practical Radio Frequency (RF)-based localization algorithm called Kcdlocation has been presented for some specific sensor network topologies, such as the grid and linear types. The Kcdlocation algorithm is adapted to those wireless sensor networks deployed with known coordinate database. It examines the ordered sequence of neighboring unknown nodes relative to some anchor nodes so that they are ranked to compute the location of unknown nodes by wireless localization measurements. After the task of distinguishing neighboring unknown nodes is completed through the ranging technology, the correct position for each sensor node would be identified. The localization scalability and fault tolerant performance of this algorithm have been evaluated from the perspective of practicability. Its performances for the real circumstance are verified through different experiments with several RF channels and deployment parameters. The node localization accuracy of Kcdlocation in a 5 4 grid network reaches 100 in a flat open square. Copyright © 2010 Zhen Fang et al.

Cite

CITATION STYLE

APA

Fang, Z., Zhao, Z., Cui, X., Geng, D., Du, L., & Pang, C. (2010). Localization in wireless sensor networks with known coordinate database. Eurasip Journal on Wireless Communications and Networking, 2010. https://doi.org/10.1155/2010/901283

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free