Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments

DOI10.1016/j.ejor.2018.05.047zbMath1403.90348OpenAlexW2804381476WikidataQ111522129 ScholiaQ111522129MaRDI QIDQ724122

Boyuan Gu, Guo-Hui Lin, Wen-Chang Luo

Publication date: 25 July 2018

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

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

zbMATH Keywords

algorithmschedulingdata compressionperformance analysiswireless sensor network

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• 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
• Algorithms for communication scheduling in data gathering network with data compression
• Improved dynamic programming in connection with an FPTAS for the knapsack problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Handbook on Scheduling

This page was built for publication: Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments