Connected \(K\)-target coverage problem in wireless sensor networks with different observation scenarios

DOI10.1016/J.COMNET.2008.03.009zbMath1154.68332OpenAlexW2061716952MaRDI QIDQ937387

Qun Zhao, Mohan Gurusamy

Publication date: 15 August 2008

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2008.03.009

zbMATH Keywords

algorithmsconnectivitycoveragewireless sensor networkslifetime maximizationsensor activity scheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks ⋮ Target coverage optimisation of wireless sensor networks using a multi-objective immune co-evolutionary algorithm

This page was built for publication: Connected \(K\)-target coverage problem in wireless sensor networks with different observation scenarios