An improved distributed data aggregation scheduling in wireless sensor networks

DOI10.1007/S10878-012-9504-9MaRDI QIDQ2444150zbMATH OpenOpenAlexFDO

Authors Deying Li, Jianzhong Li, QingHua Zhu, Hongwei Du

Publication date 8 April 2014

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9504-9

zbMATH Keywords

collision-freedata aggregation schedulingdistributed approximation algorithmlatencywireless sensor networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimum-latency aggregation scheduling in wireless sensor network
• Improved algorithm for minimum data aggregation time problem in wireless sensor networks
• Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
• Layer-based data aggregation and performance analysis in wireless sensor networks
• Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

Cites work

• Approximation for a scheduling problem with application in wireless networks
• scientific article; zbMATH DE number 3975775 (Why is no real title available?)
• Unit disk graphs

Cited in

(5)

• OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
• An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models
• Efficient accuracy evaluation for multi-modal sensed data
• Minimum-latency aggregation scheduling in wireless sensor network
• Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

This page was built for publication: An improved distributed data aggregation scheduling in wireless sensor networks

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