Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks
From MaRDI portal
Publication:2506800
DOI10.1016/j.comnet.2005.11.001zbMath1102.68358OpenAlexW1968481625WikidataQ60402822 ScholiaQ60402822MaRDI QIDQ2506800
Hai Liu, Peng-Jun Wan, Xiao-Hua Jia
Publication date: 10 October 2006
Published in: Computer Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comnet.2005.11.001
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Theoretical treatment of target coverage in wireless sensor networks ⋮ A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
This page was built for publication: Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks