On the public citation graph
Latency Constrained Aggregation in Sensor Networks
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11841036_11openalex-snapshot
Latency Constrained Aggregation in Sensor Networks
inferredcites →https://doi.org/10.1016/s1389-1286(01)00302-4openalex-snapshot
Wireless sensor networks: a survey
inferredcites →https://doi.org/10.1016/s1389-1286(03)00212-3openalex-snapshot
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
inferredcites →https://doi.org/10.1016/s1570-8705(03)00009-xopenalex-snapshot
Aggregation in sensor networks: an energy–accuracy trade-off
inferredcites →https://doi.org/10.1109/aero.2002.1035242openalex-snapshot
PEGASIS: Power-efficient gathering in sensor information systems
inferredcites →https://doi.org/10.1109/glocom.2003.1258234openalex-snapshot
Synchronization of multiple levels of data fusion in wireless sensor networks
inferredcites →https://doi.org/10.1109/hicss.2000.926982openalex-snapshot
Energy-efficient communication protocol for wireless microsensor networks
inferredcites →https://doi.org/10.1109/icdcs.2002.1022289openalex-snapshot
Impact of network density on data aggregation in wireless sensor networks
inferredcites →https://doi.org/10.1109/itcc.2005.219openalex-snapshot
Optimized scheduling for data aggregation in wireless sensor networks
inferredcites →https://doi.org/10.1145/1061318.1061322openalex-snapshot
TinyDB: an acquisitional query processing system for sensor networks
inferredcites →https://doi.org/10.5555/644108.644191openalex-snapshot
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
inferredcites →https://doi.org/10.5555/982792.982886openalex-snapshot
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_12openalex-snapshot
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_3openalex-snapshot
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_24openalex-snapshot
Latency Constrained Aggregation in Chain Networks Admits a PTAS
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_18openalex-snapshot
Capacitated max -Batching with Interval Graph Compatibilities
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_19openalex-snapshot
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_34openalex-snapshot
Online Function Tracking with Generalized Penalties
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_16openalex-snapshot
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9503-8openalex-snapshot
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/s10107-015-0920-3openalex-snapshot
The submodular joint replenishment problem
inferred← citeshttps://doi.org/10.1007/s11276-014-0853-4openalex-snapshot
Minimizing tardiness in data aggregation scheduling with due date consideration for single-hop wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.043openalex-snapshot
Data aggregation in sensor networks: Balancing communication and delay costs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.047openalex-snapshot
Capacitated Max-Batching with interval graph compatibilities
inferred← citeshttps://doi.org/10.1051/ro:2007024openalex-snapshot
Clique partitioning of interval graphs with submodular costs on the cliques
inferred← citeshttps://doi.org/10.1109/cdc.2009.5399718openalex-snapshot
Maximizing aggregated revenue in sensor networks under deadline constraints
inferred← citeshttps://doi.org/10.1109/cyberc.2009.5342205openalex-snapshot
An adaptive feedback timing control algorithm of delay-constrained data aggregation in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462134openalex-snapshot
Delay Performance of Scheduling with Data Aggregation in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/rtss.2009.13openalex-snapshot
When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tmc.2011.81openalex-snapshot
When In-Network Processing Meets Time: Complexity and Effects of Joint Optimization in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2016.2552083openalex-snapshot
Online Algorithms for Information Aggregation From Distributed and Correlated Sources
inferred← citeshttps://doi.org/10.1145/1400751.1400778openalex-snapshot
Tight bounds for delay-sensitive aggregation
inferred← citeshttps://doi.org/10.1145/1644015.1644028openalex-snapshot
Latency-constrained aggregation in sensor networks
inferred← citeshttps://doi.org/10.1145/3326066openalex-snapshot
Resource Management in Fog/Edge Computing
inferred← citeshttps://doi.org/10.1155/2013/502381openalex-snapshot
Layer-Based Data Aggregation and Performance Analysis in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2015/631937openalex-snapshot
MIDAS: A Data Aggregation Scheduling Scheme for Variable Aggregation Rate WSNs
inferred← citeshttps://doi.org/10.1201/b18001-7openalex-snapshot
In-Network Processing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.3929/ethz-a-005904768openalex-snapshot
Algorithmic Challenges in Wireless Networks: Interference, Energy and Incentives
inferred← citeshttps://doi.org/10.46298/dmtcs.489openalex-snapshot
Tight Bounds for Delay-Sensitive Aggregation
inferred← citeshttps://doi.org/10.47749/t/unicamp.2021.1169412openalex-snapshot
Algoritmos de aproximação para problemas de estoque e roteirização
inferred← citeshttps://doi.org/10.7939/r3w37kx2qopenalex-snapshot
A PTAS for Minimum Clique Partition in Unit Disk Graphs
showing the first 30 of 31 · page through all 31
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.