On the public citation graph

Minimizing Interference of a Wireless Ad-Hoc Network in a Plane

https://doi.org/10.1007/11963271_7

0 signed · 23 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.1007/978-3-642-03942-3openalex-snapshot

Geometric Discrepancy: An Illustrated Guide

inferredcites →https://doi.org/10.1007/bf02187876openalex-snapshot

ɛ-nets and simplex range queries

inferredcites →https://doi.org/10.1109/ipdps.2005.65openalex-snapshot

A Robust Interference Model for Wireless Ad-Hoc Networks

inferredcites →https://doi.org/10.1137/0211059openalex-snapshot

On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems

inferredcites →https://doi.org/10.1145/1080810.1080816openalex-snapshot

Minimizing interference in ad hoc and sensor networks

inferredcites →https://doi.org/10.1145/98524.98530openalex-snapshot

How to net a lot with little: small ε-nets for disks and halfspaces

inferredcites →https://doi.org/10.1145/989459.989462openalex-snapshot

Does topology control reduce interference?

inferredcites →https://doi.org/10.5860/choice.35-5707bopenalex-snapshot

Handbook of discrete and computational geometry

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-319-09333-8_63openalex-snapshot

An Effective Algorithm for Interference Minimization in Wireless Sensor Networks

inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_3openalex-snapshot

Sensor Networks Continue to Puzzle: Selected Open Problems

inferred← citeshttps://doi.org/10.1007/978-3-540-92295-7_9openalex-snapshot

Heuristics for Minimizing Interference in Sensor Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_15openalex-snapshot

Minimum Interference Planar Geometric Topology in Wireless Sensor Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-14654-1_7openalex-snapshot

Minimum Edge Interference in Wireless Sensor Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-17994-5_35openalex-snapshot

Minimum Total Node Interference in Wireless Sensor Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_43openalex-snapshot

Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-28209-6_10openalex-snapshot

Minimizing Average Interference through Topology Control

inferred← citeshttps://doi.org/10.1016/j.jnca.2018.10.016openalex-snapshot

Time-optimized management of mobile IoT nodes for pervasive applications

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.041openalex-snapshot

Exact algorithms to minimize interference in wireless sensor networks

inferred← citeshttps://doi.org/10.1109/euc.2010.73openalex-snapshot

Interference Minimization in Wireless Networks

inferred← citeshttps://doi.org/10.1109/icccn.2011.6006021openalex-snapshot

The Complexity of Minimizing Receiver-Based and SINR Edge Interference

inferred← citeshttps://doi.org/10.1109/tnet.2008.926506openalex-snapshot

Algorithmic Models of Interference in Wireless Ad Hoc and Sensor Networks

inferred← citeshttps://doi.org/10.15837/ijccc.2012.2.1409openalex-snapshot

A General Approach for Minimizing the Maximum Interference of a Wireless Ad-Hoc Network in Plane

inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1174openalex-snapshot

Construction of Self-Stabilizing k Disjoint Sense-Sleep Trees with Application to 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.