Perfect periodic scheduling for binary tree routing in wireless networks

DOI10.1016/j.ejor.2015.05.031zbMath1346.90357OpenAlexW592494983MaRDI QIDQ319999

Eun-Seok Kim, Celia A. Dr. Glass

Publication date: 6 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.031

zbMATH Keywords

schedulingcombinatorial optimizationChinese remainder theoremOR in telecommunicationsmobile and ad hoc networks (MANETs)

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls

Uses Software

• Mathematica

Cites Work

• Perfect periodic scheduling for three basic cycles
• A combinatorial algorithm for the TDMA message scheduling problem
• Adaptive general perfectly periodic scheduling
• Approximate dynamic programming for link scheduling in wireless mesh networks
• Energy efficient spatial TDMA scheduling in wireless networks
• Efficient algorithms for periodic scheduling
• Wireless mesh networks: a survey
• General perfectly periodic scheduling
• Elementary Number Theory
• Dispatching in perfectly-periodic schedules
• Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning
• Nearly optimal perfectly periodic schedules
• Minimizing Service and Operation Costs of Periodic Scheduling

This page was built for publication: Perfect periodic scheduling for binary tree routing in wireless networks