Approximation for a scheduling problem with application in wireless networks

DOI10.1007/S11425-010-3077-9zbMATH Open1206.68368OpenAlexW1989170887MaRDI QIDQ989801FDOQ989801

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

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

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)

Cites Work

• Smallest-last ordering and clustering and graph coloring algorithms
• Faster communication in known topology radio networks
• Title not available (Why is that?)

Cited In (17)

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

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)