Optimal placement, scheduling, and routing to maximize lifetime in sensor networks

DOI10.1057/JORS.2008.187zbMath1196.90033OpenAlexW2072046587WikidataQ62681047 ScholiaQ62681047MaRDI QIDQ4933627

Cem Ersoy, İk Altınel, Necati Aras, Yavuz B. Türkoğulları

Publication date: 14 October 2010

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.2008.187

zbMATH Keywords

heuristicsinteger programmingtelecommunicationssensor networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks ⋮ Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges ⋮ 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: Optimal placement, scheduling, and routing to maximize lifetime in sensor networks