Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks

DOI10.1016/J.COMNET.2008.05.002zbMath1147.68321DBLPjournals/cn/AltinelAGE08OpenAlexW2017697460WikidataQ62681084 ScholiaQ62681084MaRDI QIDQ936562

B. E. Eshmatov

Publication date: 14 August 2008

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

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

zbMATH Keywords

heuristics approximation algorithms coverage sensor networks integer linear programing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (4)

Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks ⋮ Optimal sensor deployment to increase the security of the maximal breach path in border surveillance ⋮ A column generation heuristic for optimal wireless sensor network design with mobile sinks ⋮ A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks

This page was built for publication: Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks