Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks
From MaRDI portal
Publication:3467852
DOI10.1007/978-3-319-26626-8_21zbMath1473.68029OpenAlexW2296567878MaRDI QIDQ3467852
Ke-Jia Zhang, Zhipeng Cai, Guisheng Yin, Qilong Han, Junyu Lin
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_21
Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27) Wireless sensor networks as related to computer science (68M18)
Related Items (1)
Cites Work
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
- Induced disjoint paths problem in a planar digraph
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- Computing and Combinatorics
- Minimum-latency aggregation scheduling in wireless sensor network
This page was built for publication: Metric and Distributed On-Line Algorithm for Minimizing Routing Interference in Wireless Sensor Networks