Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks

DOI10.1016/J.COMNET.2010.02.009zbMath1207.68042DBLPjournals/cn/GuneyAAE10OpenAlexW2010122341WikidataQ62681042 ScholiaQ62681042MaRDI QIDQ991437

J. Martínez

Publication date: 7 September 2010

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

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

zbMATH Keywords

routingmixed-integer linear programmingwireless sensor networkssink location

Mathematics Subject Classification ID

Linear programming (90C05) Network design and communication in computer systems (68M10)

Related Items (3)

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

Uses Software

• AS 136

This page was built for publication: Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks