On the public citation graph

Distributed virtual backbone construction in sensor networks with asymmetric links

https://doi.org/10.1002/wcm.810
0 signed · 33 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.10097openalex-snapshot
A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks
inferredcites →https://doi.org/10.1002/wcm.356openalex-snapshot
On greedy construction of connected dominating sets in wireless networks
inferredcites →https://doi.org/10.1002/wcm.378openalex-snapshot
Virtual backbone construction in multihop ad hoc wireless networks
inferredcites →https://doi.org/10.1007/978-0-387-30162-4_89openalex-snapshot
Connected Dominating Set
inferredcites →https://doi.org/10.1007/978-3-642-27848-8_89-2openalex-snapshot
Connected Dominating Set
inferredcites →https://doi.org/10.1007/pl00009201openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s00453-007-9015-8openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1016/0012-365x(90)90358-oopenalex-snapshot
Unit disk graphs
inferredcites →https://doi.org/10.1016/j.tcs.2004.08.013openalex-snapshot
A greedy approximation for minimum connected dominating sets
inferredcites →https://doi.org/10.1016/j.tcs.2005.08.037openalex-snapshot
Minimum connected dominating sets and maximal independent sets in unit disk graphs
inferredcites →https://doi.org/10.1109/hicss.2000.926982openalex-snapshot
Energy-efficient communication protocol for wireless microsensor networks
inferredcites →https://doi.org/10.1109/hicss.2002.994519openalex-snapshot
New distributed algorithm for connected dominating set in wireless ad hoc networks
inferredcites →https://doi.org/10.1109/ieeeconf11395.2006openalex-snapshot
Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)
inferredcites →https://doi.org/10.1109/infcom.2002.1019411openalex-snapshot
Distributed construction of connected dominating set in wireless ad hoc networks
inferredcites →https://doi.org/10.1109/tmc.2007.1034openalex-snapshot
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
inferredcites →https://doi.org/10.1145/1073814.1073880openalex-snapshot
Reliable broadcast in unknown fixed-identity networks
inferredcites →https://doi.org/10.1145/1146381.1146420openalex-snapshot
Reliable broadcast in radio networks
inferredcites →https://doi.org/10.1145/1374618.1374648openalex-snapshot
Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks
inferredcites →https://doi.org/10.1145/313239.313261openalex-snapshot
On calculating connected dominating set for efficient routing in ad hoc wireless networks
inferredcites →https://doi.org/10.1145/381677.381685openalex-snapshot
Geography-informed energy conservation for Ad Hoc routing
inferredcites →https://doi.org/10.1145/381677.381686openalex-snapshot
Span
inferredcites →https://doi.org/10.1145/513800.513820openalex-snapshot
Message-optimal connected dominating sets in mobile ad hoc networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.adhoc.2017.07.006openalex-snapshot
Optimal energy aware clustering in circular wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2011.03.006openalex-snapshot
Efficient self-organized backbone formation in mobile ad hoc networks (MANETs)
inferred← citeshttps://doi.org/10.1016/j.jnca.2011.07.007openalex-snapshot
A family of simple distributed minimum connected dominating set-based topology construction algorithms
inferred← citeshttps://doi.org/10.1109/access.2019.2903920openalex-snapshot
Wireless Sensor Network MCDS Construction Algorithms With Energy Consideration for Extreme Environments Healthcare
inferred← citeshttps://doi.org/10.1109/cecnet.2011.5768371openalex-snapshot
Energy-aware routing protocol based virtual backbone for wireless sensor network
inferred← citeshttps://doi.org/10.1109/isco.2016.7726958openalex-snapshot
An energy efficient fault tolerance nested clustering algorithm for routing in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/wispnet.2017.8300107openalex-snapshot
Identification of data aggregators in wireless sensor network
inferred← citeshttps://doi.org/10.1186/1687-1499-2012-83openalex-snapshot
An energy efficient MCDS construction algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.12720/jcm.11.1.50-57openalex-snapshot
Connected Dominating Set Construction Algorithm for Wireless Networks Based on Connected Subset
inferred← citeshttps://doi.org/10.4018/978-1-7998-2454-1.ch012openalex-snapshot
An Energy-Efficient Layered Clustering Algorithm for Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.4018/ijdst.2017070103openalex-snapshot
An Energy-Efficient Layered Clustering Algorithm for Routing 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.