On the public citation graph
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
0 signed · 50 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.1006/jagm.1994.1042openalex-snapshot
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
inferredcites →https://doi.org/10.1007/11864219_25openalex-snapshot
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
inferredcites →https://doi.org/10.1007/978-1-4612-1784-8_33openalex-snapshot
Critical Power for Asymptotic Connectivity in Wireless Networks
inferredcites →https://doi.org/10.1007/978-3-540-27820-7_8openalex-snapshot
Scale Free Aggregation in Sensor Networks
inferredcites →https://doi.org/10.1109/infcom.2003.1208944openalex-snapshot
Unreliable sensor grids: coverage, connectivity and diameter
inferredcites →https://doi.org/10.1109/infcom.2007.184openalex-snapshot
Energy Efficient Sleep/Wake Scheduling for Multi-Hop Sensor Networks: Non-Convexity and Approximation Algorithm
inferredcites →https://doi.org/10.1109/iscas.2005.1464671openalex-snapshot
On the Construction of Efficient Data Gathering Tree in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/twc.2002.804190openalex-snapshot
An application-specific protocol architecture for wireless microsensor networks
inferredcites →https://doi.org/10.1142/9789812776730_0055openalex-snapshot
MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS
inferredcites →https://doi.org/10.1145/1023720.1023735openalex-snapshot
On k-coverage in a mostly sleeping sensor network
inferredcites →https://doi.org/10.1145/1031495.1031498openalex-snapshot
A wireless sensor network For structural monitoring
inferredcites →https://doi.org/10.1145/570748.570751openalex-snapshot
Wireless sensor networks for habitat monitoring
inferredcites →https://doi.org/10.1145/958492.958494openalex-snapshot
Taming the underlying challenges of reliable multihop routing in sensor networks
inferredcites →https://doi.org/10.1145/984622.984653openalex-snapshot
Flexible power scheduling for sensor networks
inferredcites →https://doi.org/10.1145/989459.989469openalex-snapshot
Rate allocation in wireless sensor networks with network lifetime requirement
inferredcites →https://doi.org/10.1201/9780203487068.sec6openalex-snapshot
Query Processing in Sensor Networks
inferredcites →https://doi.org/10.4304/jcm.1.2.12-21openalex-snapshot
A Learning-based Adaptive Routing Tree for Wireless 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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/wcm.2592openalex-snapshot
Network throughput maximization in unreliable wireless sensor networks with minimal remote data transfer cost
inferred← citeshttps://doi.org/10.1007/978-3-319-48743-4_21openalex-snapshot
Minimum Spanning Tree on Uncertain Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00672-2_50openalex-snapshot
Optimizing Many-to-Many Data Aggregation in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-17679-1_26openalex-snapshot
Energy Aware Fault Tolerant Routing in Two-Tiered Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-21378-6_4openalex-snapshot
Constructing Maximum-Lifetime Data Gathering Tree without Data Aggregation for Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31638-8_2openalex-snapshot
Improved Approximation Bounds for Maximum Lifetime Problems in Wireless Ad-Hoc Network
inferred← citeshttps://doi.org/10.1007/978-3-642-36071-8_18openalex-snapshot
Power Efficient Data Gathering for Sensor Network
inferred← citeshttps://doi.org/10.1007/978-981-13-3600-3_27openalex-snapshot
A Novel Virtual Tunneling Protocol for Underwater Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s11235-009-9218-1openalex-snapshot
Distributed and localized construction of routing structure for sensor data gathering
inferred← citeshttps://doi.org/10.1007/s11276-012-0456-xopenalex-snapshot
Cooperative data collection in ad hoc networks
inferred← citeshttps://doi.org/10.1007/s11276-019-02033-3openalex-snapshot
Energy-saving routing metric for aggregate low-rate wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11704-009-0039-xopenalex-snapshot
Approximation algorithm for constructing data aggregation trees for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/access.2017.2788877openalex-snapshot
Construction of Optimal Trees for Maximizing Aggregation Information in Deadline- and Energy-Constrained Unreliable Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/bigcom53800.2021.00043openalex-snapshot
Optimal Data Collection for A Mobile Sink
inferred← citeshttps://doi.org/10.1109/comst.2017.2759725openalex-snapshot
A Critical Analysis of Research Potential, Challenges, and Future Directives in Industrial Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/cse-euc.2017.35openalex-snapshot
An Estimation of Distribution Algorithm Based Load-Balanced Clustering of Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/globecom38437.2019.9014179openalex-snapshot
Deep Reinforcement Learning-Based Topology Optimization for Self-Organized Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/glocom.2015.7417776openalex-snapshot
DAO-R: Integrating Data Aggregation and Offloading in Sensor Networks via Data Replication
inferred← citeshttps://doi.org/10.1109/icecds.2017.8389583openalex-snapshot
Joint design of Dijkstra's shortest path routing and sleep-wake scheduling in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/igeht.2017.8094108openalex-snapshot
The data aggregation approach to enhance the lifetime of wireless sensor network
inferred← citeshttps://doi.org/10.1109/jsyst.2019.2899986openalex-snapshot
An Efficient Privacy-Friendly Hop-by-Hop Data Aggregation Scheme for Smart Grids
inferred← citeshttps://doi.org/10.1109/jsyst.2020.2983002openalex-snapshot
Distributed Data Gathering Algorithm Based on Spanning Tree
inferred← citeshttps://doi.org/10.1109/tii.2017.2691586openalex-snapshot
Lossless In-Network Processing in WSNs for Domain-Specific Monitoring Applications
inferred← citeshttps://doi.org/10.1109/tkde.2009.203openalex-snapshot
Effective Determination of Mobile Agent Itineraries for Data Aggregation on Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2010.68openalex-snapshot
Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks
inferred← citeshttps://doi.org/10.1109/usbereit.2018.8384583openalex-snapshot
Construction of a maximum lifetime route tree in wireless sensor networks for nodes with a two-level transmission power
inferred← citeshttps://doi.org/10.1145/1614320.1614339openalex-snapshot
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
inferred← citeshttps://doi.org/10.1145/1998476.1998486openalex-snapshot
Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks
inferred← citeshttps://doi.org/10.1145/2107502.2107534openalex-snapshot
On optimal energy efficient convergecasting in unreliable sensor networks with applications to target tracking
inferred← citeshttps://doi.org/10.3390/s121217128openalex-snapshot
Prioritized Degree Distribution in Wireless Sensor Networks with a Network Coded Data Collection Method
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.556-562.6311openalex-snapshot
Enable Efficient Data Aggregation for Region-Based Top-K Queries in Wireless Sensor Networks
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.