Algorithms for communication scheduling in data gathering network with data compression

DOI10.1007/s00453-017-0373-6zbMath1410.68069OpenAlexW2754604279WikidataQ111522792 ScholiaQ111522792MaRDI QIDQ1755733

Boyuan Gu, Weitian Tong, Yao Xu, Randy Goebel, Guo-Hui Lin, Wen-Chang Luo

Publication date: 11 January 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0373-6

zbMATH Keywords

schedulingdata compressionapproximation algorithmwireless sensor networkFPTASdual FPTAS

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25)

Related Items (4)

A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks ⋮ Scheduling in data gathering networks with background communications ⋮ Scheduling for gathering multitype data with local computations ⋮ Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments

Cites Work

• Unnamed Item
• Unnamed Item
• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
• Communication scheduling in data gathering networks with limited memory
• Scheduling for data gathering networks with data compression
• Maximizing system lifetime in wireless sensor networks
• Improved dynamic programming in connection with an FPTAS for the knapsack problem
• Handbook on Scheduling

This page was built for publication: Algorithms for communication scheduling in data gathering network with data compression