Approximate dynamic programming for link scheduling in wireless mesh networks

DOI10.1016/J.COR.2007.02.010MaRDI QIDQ925829zbMATH OpenOpenAlexFDO

Authors Vasilis Friderikos, Katerina Papadaki

Publication date 23 May 2008

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

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

zbMATH Keywords

approximate dynamic programmingschedulingwireless mesh networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks
• SINR based maximum link scheduling in wireless mesh networks
• The Linear Programming Approach to Approximate Dynamic Programming
• Limitations of current wireless link scheduling algorithms
• Approximation algorithms for wireless link scheduling with flexible data rates

Cites work

• An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem
• An analysis of temporal-difference learning with function approximation
• Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem
• Handbook on modelling for discrete optimization.
• scientific article; zbMATH DE number 1321699 (Why is no real title available?)
• scientific article; zbMATH DE number 5070513 (Why is no real title available?)
• Link scheduling in polynomial time
• ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
• Wireless mesh networks: a survey

Cited in

(8)

• Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks
• Robust gateway placement in wireless mesh networks
• Energy efficient spatial TDMA scheduling in wireless networks
• Flow shop scheduling with reinforcement learning
• Perfect periodic scheduling for binary tree routing in wireless networks
• Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks
• Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
• On-line hand-drawn electric circuit diagram recognition using 2D dynamic programming

This page was built for publication: Approximate dynamic programming for link scheduling in wireless mesh networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925829)