Cluster-based architecture for range-free localization in wireless sensor networks

9Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

In wireless sensor networks, the existing range-free localization techniques are based on either centralized approach or distributed approach. The centralized approach causes overhead, latency, and so forth, while the distributed approach is more complex. In order to overcome these issues, in this paper, we propose a cluster based architecture for range-free localization in wireless sensor network. Initially cluster-heads are selected based on the parameters such as link quality, residual energy, and coverage. An event based localization technique is applied to each cluster that involves straight line scanning of the clusters with deployed multiple sinks. The scanning process helps in estimating the location of target nodes with reference to the anchor nodes position. In case if any target node in the cluster is not localized, a distance based localization technique is executed that localizes the target node. By simulation results, we show that the proposed technique reduces the overhead and latency and increases the localization accuracy. © 2014 S. V. Manisekaran and R. Venkatesan.

Cite

CITATION STYLE

APA

Manisekaran, S. V., & Venkatesan, R. (2014). Cluster-based architecture for range-free localization in wireless sensor networks. International Journal of Distributed Sensor Networks, 2014. https://doi.org/10.1155/2014/963473

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