Energy efficient spatial TDMA scheduling in wireless networks
From MaRDI portal
Publication:1761130
DOI10.1016/j.cor.2011.10.009zbMath1251.90080OpenAlexW1987491325MaRDI QIDQ1761130
Diogo Quintas, Vasilis Friderikos
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.10.009
Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Perfect periodic scheduling for binary tree routing in wireless networks ⋮ A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem ⋮ 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 ⋮ Perfect periodic scheduling for three basic cycles
Cites Work
- A combinatorial algorithm for the TDMA message scheduling problem
- Lower bounds and reduction procedures for the bin packing problem
- Approximate dynamic programming for link scheduling in wireless mesh networks
- Radio resource allocation problems for OFDMA cellular systems
- Local search algorithms for the bin packing problem and their relationships to various construction heuristics
- Wireless Link Scheduling With Power Control and SINR Constraints
- Ant colony optimization and local search for bin packing and cutting stock problems
- Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning
- Generating Multiple Solutions for Mixed Integer Programming Problems
- New heuristics for one-dimensional bin-packing
This page was built for publication: Energy efficient spatial TDMA scheduling in wireless networks