On the public citation graph

Virtual Coordinates with Backtracking for Void Traversal in Geographic Routing

0 signed · 76 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/11429647_24openalex-snapshot
Geometric Routing Without Geometry
inferredcites →https://doi.org/10.1007/3-540-36978-3_22openalex-snapshot
Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network
inferredcites →https://doi.org/10.1007/978-3-540-27820-7_3openalex-snapshot
On a Conjecture Related to Geometric Routing
inferredcites →https://doi.org/10.1016/0166-218x(95)00106-2openalex-snapshot
Landmarks in graphs
inferredcites →https://doi.org/10.1016/j.tcs.2005.06.022openalex-snapshot
On a conjecture related to geometric routing
inferredcites →https://doi.org/10.1023/a:1012319418150openalex-snapshot
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1109/2.940014openalex-snapshot
Location systems for ubiquitous computing
inferredcites →https://doi.org/10.1109/infcom.2004.1354667openalex-snapshot
Locating and bypassing routing holes in sensor networks
inferredcites →https://doi.org/10.1109/infcom.2005.1497887openalex-snapshot
GPS free coordinate assignment and routing in wireless sensor networks
inferredcites →https://doi.org/10.1109/infcom.2005.1497904openalex-snapshot
GLIDER gradient landmark-based distributed routing for sensor networks
inferredcites →https://doi.org/10.1109/mahss.2004.1392181openalex-snapshot
GCRP: geographic virtual circuit routing protocol for ad hoc networks
inferredcites →https://doi.org/10.1109/mcsa.1999.749281openalex-snapshot
Ad-hoc on-demand distance vector routing
inferredcites →https://doi.org/10.1109/real.2004.8openalex-snapshot
A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/wsc.2004.1371400openalex-snapshot
Simulation Analysis of Virtual Geographic Routing
inferredcites →https://doi.org/10.1145/1022630.1022633openalex-snapshot
Virtual coordinates for ad hoc and sensor networks
inferredcites →https://doi.org/10.1145/1023720.1023728openalex-snapshot
Practical robust localization over large-scale 802.11 wireless networks
inferredcites →https://doi.org/10.1145/313239.313282openalex-snapshot
Routing with guaranteed delivery in ad hoc wireless networks
inferredcites →https://doi.org/10.1145/345910.345953openalex-snapshot
GPSR
inferredcites →https://doi.org/10.1145/938985.938995openalex-snapshot
Range-free localization schemes for large scale sensor networks
inferredcites →https://doi.org/10.1145/938985.938996openalex-snapshot
Geographic routing without location information
inferredcites →https://doi.org/10.1145/958491.958501openalex-snapshot
GEM
inferredcites →https://doi.org/10.1145/958499.958501openalex-snapshot
GEM
inferredcites →https://doi.org/10.1145/984622.984633openalex-snapshot
On the effect of localization errors on geographic face routing in sensor networks
inferredcites →https://doi.org/10.5555/1251203.1251219openalex-snapshot
Geographic routing made practical
inferredcites →https://doi.org/10.5555/1251203.1251227openalex-snapshot
Beacon vector routing: scalable point-to-point routing in wireless sensornets

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-51281-5_18openalex-snapshot
Computing the Metric Dimension of Hypercube Graphs by Particle Swarm Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-19-7014-6_8openalex-snapshot
On Fault-Tolerant Metric Dimension of Heptagonal Circular Ladder and Its Related Graphs
inferred← citeshttps://doi.org/10.1007/s10878-022-00899-2openalex-snapshot
On metric dimension of plane graphs with $$\frac{m}{2}$$ number of 10 sided faces
inferred← citeshttps://doi.org/10.1007/s11227-024-06053-5openalex-snapshot
Fault-tolerant basis of generalized fat trees and perfect binary tree derived architectures
inferred← citeshttps://doi.org/10.1007/s11241-010-9093-6openalex-snapshot
Exploiting slack time for just-in-time scheduling in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11277-016-3675-0openalex-snapshot
Billiardo: A Novel Virtual Coordinates Routing Protocol Based on Multiple Sinks for Wireless Sensor Network
inferred← citeshttps://doi.org/10.1007/s12190-026-02895-9openalex-snapshot
Exact metric and fault-tolerant metric dimensions of hexagonal and rectangular octahedral-cell tessellation graphs
inferred← citeshttps://doi.org/10.1007/s44427-026-00027-6openalex-snapshot
Metric Dimension and General Codes of Ramanujan Graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2012.03.047openalex-snapshot
Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
inferred← citeshttps://doi.org/10.1016/j.amc.2018.07.010openalex-snapshot
On the fault-tolerant metric dimension of convex polytopes
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128037openalex-snapshot
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
inferred← citeshttps://doi.org/10.1016/j.comcom.2011.01.005openalex-snapshot
Convex Subspace Routing (CSR): Routing via anchor-based convex virtual subspaces in sensor networks
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2017.07.016openalex-snapshot
Void handling using Geo-Opportunistic Routing in underwater wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.cor.2008.08.002openalex-snapshot
Computing minimal doubly resolving sets of graphs
inferred← citeshttps://doi.org/10.1016/j.future.2017.05.015openalex-snapshot
GSR: Geographic Secured Routing using SHA-3 algorithm for node and message authentication in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.08.001openalex-snapshot
Location verification and trust management for resilient geographic routing
inferred← citeshttps://doi.org/10.1016/j.procs.2016.03.101openalex-snapshot
Novel Energy Efficient Election Based Routing Algorithm for Wireless Sensor Network
inferred← citeshttps://doi.org/10.1016/j.proeng.2011.12.674openalex-snapshot
EBVCR: A Energy Balanced Virtual Coordinate Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.032openalex-snapshot
Resolvability and fault-tolerant resolvability structures of convex polytopes
inferred← citeshttps://doi.org/10.1038/s41598-025-24939-zopenalex-snapshot
Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications
inferred← citeshttps://doi.org/10.1080/09728600.2025.2601753openalex-snapshot
Swapped optical transpose interconnection system: Fault-tolerant resolvability on cycle graphs
inferred← citeshttps://doi.org/10.1080/10406638.2021.2019066openalex-snapshot
Multiset and Mixed Metric Dimension for Starphene and Zigzag-Edge Coronoid
inferred← citeshttps://doi.org/10.1080/23799927.2024.2364650openalex-snapshot
On hendecagonal circular ladder and its metric dimension
inferred← citeshttps://doi.org/10.1109/access.2020.3014883openalex-snapshot
Fault-Tolerant Metric Dimension of Interconnection Networks
inferred← citeshttps://doi.org/10.1109/access.2024.3357147openalex-snapshot
Edge Version of Doubly Resolving Sets for Grid and Generalized Prism Networks
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461986openalex-snapshot
Pressure Routing for Underwater Sensor Networks
inferred← citeshttps://doi.org/10.1109/mahss.2008.4660071openalex-snapshot
Stateless and guaranteed geometric routing on virtual coordinate systems
inferred← citeshttps://doi.org/10.1109/mobhoc.2006.278577openalex-snapshot
Aligned Virtual Coordinates for Greedy Routing in WSNs
inferred← citeshttps://doi.org/10.1109/tmc.2012.53openalex-snapshot
VAPR: Void-Aware Pressure Routing for Underwater Sensor Networks
inferred← citeshttps://doi.org/10.1142/s1793830920500706openalex-snapshot
Computing edge version of metric and double metric dimensions of Kayak paddle graphs
inferred← citeshttps://doi.org/10.1142/s1793830921501329openalex-snapshot
Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder
inferred← citeshttps://doi.org/10.1142/s1793830923500246openalex-snapshot
Fractional local edge dimensions of a graph
inferred← citeshttps://doi.org/10.1155/2021/9958969openalex-snapshot
Computation of the Double Metric Dimension in Convex Polytopes
inferred← citeshttps://doi.org/10.1155/2022/1818734openalex-snapshot
Minimal Doubly Resolving Sets of Some Classes of Convex Polytopes
inferred← citeshttps://doi.org/10.1155/2022/2448032openalex-snapshot
Computing Edge Version of Resolvability and Double Resolvability of a Graph
inferred← citeshttps://doi.org/10.1155/2022/5884924openalex-snapshot
Double Metric Resolvability in Convex Polytopes
inferred← citeshttps://doi.org/10.1155/2022/8200046openalex-snapshot
Fault‐Tolerant Resolvability of Swapped Optical Transpose Interconnection System
inferred← citeshttps://doi.org/10.11648/j.mlr.20230801.12openalex-snapshot
Hybridizing Slime Mould Algorithm with Simulated Annealing for Solving Metric Dimension Problem
inferred← citeshttps://doi.org/10.1504/ijsnet.2008.019008openalex-snapshot
Aligned virtual coordinates for greedy geometric routing in WSNs
inferred← citeshttps://doi.org/10.21496/ams.2017.002openalex-snapshot
On Minimal Doubly Resolving Sets of Circulant Graphs
inferred← citeshttps://doi.org/10.32604/cmes.2023.022819openalex-snapshot
Minimal Doubly Resolving Sets of Certain Families of Toeplitz Graph
inferred← citeshttps://doi.org/10.3389/fphy.2021.749166openalex-snapshot
Computing Edge Metric Dimension of One-Pentagonal Carbon Nanocone
inferred← citeshttps://doi.org/10.3390/math10111815openalex-snapshot
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
inferred← citeshttps://doi.org/10.3390/math7010078openalex-snapshot
Fault-Tolerant Resolvability and Extremal Structures of Graphs
inferred← citeshttps://doi.org/10.3934/math.20241074openalex-snapshot
Optimizing SNARK networks via double metric dimension
inferred← citeshttps://doi.org/10.4236/am.2012.35071openalex-snapshot
On Certain Connected Resolving Parameters of Hypercube Networks
inferred← citeshttps://doi.org/10.47836/mjms.19.4.12openalex-snapshot
Metric Dimension of 4-Regular Cyclic Bipartite Graphs
inferred← citeshttps://doi.org/10.52846/ami.v50i2.1722openalex-snapshot
On metric dimension of hendecagonal circular ladder $H_{n}$
inferred← citeshttps://doi.org/10.52846/ami.v52i2.2056openalex-snapshot
On metric dimension of tridecagonal circular ladder
inferred← citeshttps://doi.org/10.61091/jcmcc119-18openalex-snapshot
On Minimal Edge Version of Doubly Resolving Sets of a Graph
inferred← citeshttps://doi.org/10.7763/ijfcc.2013.v2.128openalex-snapshot
Topological Properties of few Poly Oxide, Poly Silicate, DOX and DSL 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.