Approximation for a scheduling problem with application in wireless networks

DOI10.1007/S11425-010-3077-9MaRDI QIDQ989801zbMATHOpenAlexFDO

Authors QingHua Zhu, Deying Li

Publication date 23 August 2010

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-010-3077-9

zbMATH Keywords

approximation algorithmwireless sensor networklatencyconflict-awaremany-to-one data aggregation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Conflict-aware data aggregation scheduling in wireless sensor networks with adjustable transmission range
• Radio aggregation scheduling
• Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks
• Improved Algorithms for Latency Minimization in Wireless Networks
• Improved algorithms for latency minimization in wireless networks

Cites work

• scientific article; zbMATH DE number 3975775 (Why is no real title available?)
• Faster communication in known topology radio networks
• Smallest-last ordering and clustering and graph coloring algorithms

Cited in

(19)

• Conflict-aware data aggregation scheduling in wireless sensor networks with adjustable transmission range
• Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna
• Approximation and Online Algorithms
• Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks
• Generalizing the Square Root Rule for Optimal Periodic Scheduling in Push-Based Wireless Environments
• Scheduling sensors by tiling lattices
• Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks
• Radio aggregation scheduling
• Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
• A fast localized algorithm for scheduling sensors
• Approximability of OFDMA Scheduling
• Multi-channel assignment and link scheduling for prioritized latency-sensitive applications
• Constant-approximation for optimal data aggregation with physical interference
• Optimal Scheduling for Emptying a Wireless Network: Solution Characterization, Applications, Including Deadline Constraints
• Effective Wireless Scheduling via Hypergraph Sketches
• An improved distributed data aggregation scheduling in wireless sensor networks
• Approximation schemes for wireless networks
• A Large Deviations Analysis of Scheduling in Wireless Networks
• Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks

This page was built for publication: Approximation for a scheduling problem with application in wireless networks

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