On the public citation graph
Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks
0 signed · 77 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.1016/0031-3203(80)90066-7openalex-snapshot
The relative neighbourhood graph of a finite planar set
inferredcites →https://doi.org/10.1016/j.comcom.2007.05.022openalex-snapshot
On-demand Geographic Forwarding for data delivery in wireless sensor networks
inferredcites →https://doi.org/10.1023/a:1012319418150openalex-snapshot
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1023/a:1013985610753openalex-snapshot
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
inferredcites →https://doi.org/10.1109/71.963415openalex-snapshot
Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks
inferredcites →https://doi.org/10.1109/98.904899openalex-snapshot
Geographical routing using partial information for wireless ad hoc networks
inferredcites →https://doi.org/10.1109/glocom.2006.1008openalex-snapshot
WSNp1-3: Largest Forwarding Region Routing Protocol for Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1109/icdcs.2003.1203451openalex-snapshot
SPEED: a stateless protocol for real-time communication in sensor networks
inferredcites →https://doi.org/10.1109/icdcsw.2005.42openalex-snapshot
Angular Routing Protocol for Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1109/icnp.2005.32openalex-snapshot
Path Vector Face Routing: Geographic Routing with Local Face Information
inferredcites →https://doi.org/10.1109/icpp.2000.876111openalex-snapshot
Depth first search and location based localized routing and QoS routing in wireless networks
inferredcites →https://doi.org/10.1109/infcom.2004.1354667openalex-snapshot
Locating and bypassing routing holes in sensor networks
inferredcites →https://doi.org/10.1109/lcomm.2007.061612openalex-snapshot
Greedy Geographic Routing using Dynamic Potential Field for Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1109/tvt.2005.851327openalex-snapshot
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks
inferredcites →https://doi.org/10.1109/wowmom.2005.50openalex-snapshot
Hello Protocols for Ad-Hoc Networks: Overhead and Accuracy Tradeoffs
inferredcites →https://doi.org/10.1145/1080810.1080818openalex-snapshot
On the pitfalls of geographic face routing
inferredcites →https://doi.org/10.1145/1132905.1132908openalex-snapshot
Minimizing recovery state In geographic ad-hoc routing
inferredcites →https://doi.org/10.1145/1161089.1161133openalex-snapshot
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
inferredcites →https://doi.org/10.1145/570810.570814openalex-snapshot
Asymptotically optimal geometric mobile ad-hoc routing
inferredcites →https://doi.org/10.1145/778415.778447openalex-snapshot
Worst-Case optimal and average-case efficient geometric ad-hoc routing
inferredcites →https://doi.org/10.1504/ijahuc.2006.010498openalex-snapshot
Avoid 'void' in geographic routing for data aggregation in sensor networks
inferredcites →https://doi.org/10.21236/ada180187openalex-snapshot
Routing and Addressing Problems in Large Metropolitan-Scale Internetworks
inferredcites →https://doi.org/10.2307/2412323openalex-snapshot
A New Statistical Approach to Geographic Variation Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.5899openalex-snapshot
Fault‐tolerant independent gradient forwarding routing for wireless sensor network
inferred← citeshttps://doi.org/10.1007/978-1-4614-3363-7_5openalex-snapshot
TGAR: Trust Dependent Greedy Anti-Void Routing in Wireless Sensor Networks (WSNs)
inferred← citeshttps://doi.org/10.1007/978-3-319-59105-6_25openalex-snapshot
Localization based Anti-Void Clustering Approach (LAVCA) for Energy Efficient Routing in Wireless Sensor Network
inferred← citeshttps://doi.org/10.1007/978-981-10-3226-4_47openalex-snapshot
Rolling Circle Algorithm for Routing Along the Boundaries of Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-981-13-8222-2_11openalex-snapshot
Secure Anti-Void Energy-Efficient Routing (SAVEER) Protocol for WSN-Based IoT Network
inferred← citeshttps://doi.org/10.1007/978-981-19-2538-2_8openalex-snapshot
Cloud Based “Energy Aware” Routing Protocol for Predetection and Its Prevention of Fault Tolerance
inferred← citeshttps://doi.org/10.1007/s11036-021-01848-9openalex-snapshot
Edge Network Routing Protocol Base on Target Tracking Scenario
inferred← citeshttps://doi.org/10.1007/s11276-021-02569-3openalex-snapshot
Energy-efficient routing in the proximity of a complicated hole in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11277-023-10541-xopenalex-snapshot
Energy-Efficient Void Size Adaptable Graded Greedy Gradient Approach to Bypass Holes in Wireless Sensor Network
inferred← citeshttps://doi.org/10.1016/j.adhoc.2013.05.013openalex-snapshot
Void traversal for efficient non-planar geometric routing
inferred← citeshttps://doi.org/10.1016/j.adhoc.2015.03.003openalex-snapshot
A load-balancing routing algorithm for wireless sensor networks based on domain decomposition
inferred← citeshttps://doi.org/10.1016/j.adhoc.2016.04.012openalex-snapshot
Efficient and robust serial query processing approach for large-scale wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2020.102157openalex-snapshot
An enhanced geographical routing protocol based on multi-criteria decision making method in mobile ad-hoc networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2018.10.006openalex-snapshot
Efficient information gathering from large wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.09.007openalex-snapshot
A distributed routing algorithm for sensor networks derived from macroscopic models
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.12.008openalex-snapshot
A scalable approach for serial data fusion in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.10.007openalex-snapshot
An enhanced location-free Greedy Forward algorithm with hole bypass capability in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.11.007openalex-snapshot
Spreading Aggregation: A distributed collision-free approach for data aggregation in large-scale wireless sensor networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxv036openalex-snapshot
A Study on Maximizing the Parallelism of Macroscopically Derived Routing Algorithms for WSNs
inferred← citeshttps://doi.org/10.1109/comst.2017.2657881openalex-snapshot
Void-Handling Techniques for Routing Protocols in Underwater Sensor Networks: Survey and Challenges
inferred← citeshttps://doi.org/10.1109/dcoss.2017.9openalex-snapshot
Distributed Collision-Free Data Aggregation Approach for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icc.2016.7511314openalex-snapshot
Cooperative rotational sweep schemes for geographic routing
inferred← citeshttps://doi.org/10.1109/icc42927.2021.9500906openalex-snapshot
Reliable Coverage with Circumferential WMSNs
inferred← citeshttps://doi.org/10.1109/icdcsw.2011.12openalex-snapshot
Predict Energy Consumption of Trigger-Driven Sensor Network by Markov Chains
inferred← citeshttps://doi.org/10.1109/icip.2014.7025958openalex-snapshot
A simple and efficient algorithm for dot patterns reconstruction
inferred← citeshttps://doi.org/10.1109/icrtit.2012.6206781openalex-snapshot
An Efficient Localized Voronoi algorithm for obstacle detection in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470408openalex-snapshot
Contention-based georouting with guaranteed delivery, minimal communication overhead, and shorter paths in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/jsen.2011.2163503openalex-snapshot
Tone-Based Localization for Distinguishing Relative Locations in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/mcom.2017.1600348openalex-snapshot
Coordinate-Assisted Routing Approach to Bypass Routing Holes in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/nics.2018.8606882openalex-snapshot
Stable low-stretch routing scheme for wireless sensor networks with a large hole of complicated shape
inferred← citeshttps://doi.org/10.1109/tc.2012.148openalex-snapshot
Optimizing Communication Overhead while Reducing Path Length in Beaconless Georouting with Guaranteed Delivery for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tc.2013.180openalex-snapshot
Localized Routing Approach to Bypass Holes in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tc.2014.2345400openalex-snapshot
By-Passing Infected Areas in Wireless Sensor Networks using BPR
inferred← citeshttps://doi.org/10.1109/tmc.2017.2771424openalex-snapshot
Energy-Aware Dual-Path Geographic Routing to Bypass Routing Holes in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tvt.2010.2068065openalex-snapshot
Active Route-Guiding Protocols for Resisting Obstacles in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/2387238.2387304openalex-snapshot
Routing through holes in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/3127540.3127568openalex-snapshot
Serial In-network Processing for Large Stationary Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/3231053.3231090openalex-snapshot
Detecting gaps and voids in WSNs and IoT networks
inferred← citeshttps://doi.org/10.1145/3616390.3618286openalex-snapshot
Spatial Anti-Void Querying in IoT-enabled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.11606/t.18.2012.tde-12032012-155631openalex-snapshot
Estratégias de roteamento e de controle de acesso ao meio para redes de sensores sem fio destinadas a redes urbanas
inferred← citeshttps://doi.org/10.1186/s13638-015-0492-1openalex-snapshot
Geographical model-derived grid-based directional routing for massively dense WSNs
inferred← citeshttps://doi.org/10.14201/adcaij.30865openalex-snapshot
SRG: Energy-Efficient Localized Routing to Bypass Void in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.14569/ijarai.2012.010208openalex-snapshot
Improving Performance Analysis Of Routing Efficiency In Wireless Sensor Networks Using Greedy Algorithm
inferred← citeshttps://doi.org/10.17577/ijertv5is060510openalex-snapshot
BPR: An Efficient Technique to by-pass the Infected Areas in WSN
inferred← citeshttps://doi.org/10.18090/samriddhi.v14spli01.2openalex-snapshot
Energy Efficient Protocol for Multipath Transmission in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.18280/rces.100301openalex-snapshot
Optimization of Data Analysis Algorithms for Geographic Information System
inferred← citeshttps://doi.org/10.36948/ijfmr.2023.v05i06.8762openalex-snapshot
Employing Energy-aware Multipath Geographical Routing to Bypass Routing Gaps in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.3745/kipstc.2009.16c.5.629openalex-snapshot
An Energy Efficient Hybrid Routing Protocol Based on LEACH and PEGASIS
inferred← citeshttps://doi.org/10.4304/jnw.8.10.2317-2323openalex-snapshot
Greedy Forwarding Routing Strategy Based on Energy Efficiency in Wireless Sensor Network
inferred← citeshttps://doi.org/10.7840/kics.2016.41.2.189openalex-snapshot
DT-GPSR: Delay Tolerant-Greedy Perimeter Stateless Routing Protocol
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.