Maximizing network lifetime for target coverage problem in heterogeneous wireless sensor networks

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

Abstract

This paper presents an energy-efficient distributed target coverage algorithm(EDTC) for heterogeneous wireless sensor networks(HWSN) with multiple sensing units. In order to utilize the energy more efficiently, the sensor priority is introduced in this paper to integrate the sensing ability and the remaining energy together. EDTC is locally and simultaneously carried out at each sensor in a rounding fashion. Each sensor decides the on/off status of its sensing units at the beginning of each round, and then broadcasts the decision to its one-hop neighbors. The higher the priority of a sensor is, the shorter the decision time it needs. Simulation results show that compared with Energy First(EF) scheme and Integer Linear Programming(ILP) solution, EDTC has longer network lifetime than EF, and the performance difference between EDTC and ILP solution is confined within 10%. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Liu, Z. (2007). Maximizing network lifetime for target coverage problem in heterogeneous wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4864 LNCS, pp. 457–468). Springer Verlag. https://doi.org/10.1007/978-3-540-77024-4_42

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