An efficient clusterhead placement for hybrid sensor networks

9Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wireless sensor networks (WSN) have attracted considerable interest in recent years as a convenient, flexible and low cost alternative to wired sensor in many contexts. Deployment of sensor nodes is a critical task as deployment should be efficient to increase network lifetime. To address this problem, a hierarchical architecture is employed. In this paper, we propose an incremental deployment algorithm. By examining the node position, and the sensing cover area, the proposed algorithm indicates which position should deployed clusterheads and how many new clusterhead are necessary to cover the desired monitoring area. A comparison between the proposed algorithm with grid-based and augmenting placement are analyzed. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Chehri, A., & Mouftah, H. (2010). An efficient clusterhead placement for hybrid sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6288 LNCS, pp. 123–134). https://doi.org/10.1007/978-3-642-14785-2_10

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