Optimal multi-TDMA scheduling in ring topology networks

DOI10.1155/2015/837074zbMath1394.90309OpenAlexW2033561211WikidataQ59119615 ScholiaQ59119615MaRDI QIDQ1666713

Gyula Simon, Gergely Vakulya, Zsolt Tuza

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/837074

Mathematics Subject Classification ID

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

Cites Work

• Medium access control in wireless sensor networks
• Hamiltonian circuits in random graphs
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• Data-gathering wireless sensor networks: organization and capacity.
• Distributed time-optimal scheduling for convergecast in wireless sensor networks
• On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
• Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks

This page was built for publication: Optimal multi-TDMA scheduling in ring topology networks