Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks

DOI10.1016/j.cor.2011.06.013zbMath1251.90077OpenAlexW2049314924MaRDI QIDQ1762081

Ye Xia, J. Cole Smith, Behnam Behdani, Young Sang Yun

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.06.013

zbMATH Keywords

linear programmingcolumn generationwireless sensor networklifetime maximizationmobile sink

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (6)

Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks ⋮ Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks ⋮ Maximizing lifetime in wireless sensor networks with multiple sensor families ⋮ A column generation heuristic for optimal wireless sensor network design with mobile sinks ⋮ The \( N\)-policy of a discrete time Geo/G/1 queue with disasters and its application to wireless sensor networks ⋮ Optimal power consumption control of sensor node based on (N, D)-policy discrete-time queues

Cites Work

• Distributed computation on graphs
• Unnamed Item

This page was built for publication: Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks