On the public citation graph
MAP: Multiconstrained Anypath Routing in Wireless Mesh Networks
0 signed · 66 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.1002/net.3230140109openalex-snapshot
Algorithms for finding paths with multiple constraints
inferredcites →https://doi.org/10.1007/11753810_17openalex-snapshot
A Comparison of Exact and ε -Approximation Algorithms for Constrained Routing
inferredcites →https://doi.org/10.1007/978-1-4842-7077-6_3openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-00224-3_8openalex-snapshot
Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/s00224-007-9096-4openalex-snapshot
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications
inferredcites →https://doi.org/10.1016/j.adhoc.2007.07.002openalex-snapshot
Exploiting path diversity in the link layer in wireless ad hoc networks
inferredcites →https://doi.org/10.1016/s0167-6377(01)00069-4openalex-snapshot
A simple efficient approximation scheme for the restricted shortest path problem
inferredcites →https://doi.org/10.1016/s1389-1286(00)00209-7openalex-snapshot
A randomized algorithm for finding a path subject to multiple QoS requirements
inferredcites →https://doi.org/10.1109/49.536364openalex-snapshot
Quality-of-service routing for supporting multimedia applications
inferredcites →https://doi.org/10.1109/65.752646openalex-snapshot
An overview of quality of service routing for next-generation high-speed networks: problems and solutions
inferredcites →https://doi.org/10.1109/90.993305openalex-snapshot
Heuristic algorithms for multiconstrained quality-of-service routing
inferredcites →https://doi.org/10.1109/icc.1998.685137openalex-snapshot
On finding multi-constrained paths
inferredcites →https://doi.org/10.1109/infcom.2009.5061904openalex-snapshot
Multirate Anypath Routing in Wireless Mesh Networks
inferredcites →https://doi.org/10.1109/infocom.2007.133openalex-snapshot
On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks
inferredcites →https://doi.org/10.1109/infocom.2008.133openalex-snapshot
On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks
inferredcites →https://doi.org/10.1109/mcom.2002.1106159openalex-snapshot
An overview of constraint-based path selection algorithms for QoS routing
inferredcites →https://doi.org/10.1109/secon.2010.5508266openalex-snapshot
Multi-Constrained Anypath Routing in Wireless Mesh Networks
inferredcites →https://doi.org/10.1109/tmc.2003.1255648openalex-snapshot
Geographic random forwarding (geraf) for ad hoc and sensor networks: multihop performance
inferredcites →https://doi.org/10.1109/tnet.2003.815299openalex-snapshot
Precomputation schemes for QoS routing
inferredcites →https://doi.org/10.1109/tnet.2006.890089openalex-snapshot
Finding a Path Subject to Many Additive QoS Constraints
inferredcites →https://doi.org/10.1109/tnet.2007.900712openalex-snapshot
Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing
inferredcites →https://doi.org/10.1145/1023720.1023732openalex-snapshot
Routing in multi-radio, multi-hop wireless mesh networks
inferredcites →https://doi.org/10.1145/1151659.1159921openalex-snapshot
Measurement-based models of delivery and interference in static wireless networks
inferredcites →https://doi.org/10.1145/1159913.1159921openalex-snapshot
Measurement-based models of delivery and interference in static wireless networks
inferredcites →https://doi.org/10.1145/1215976.1215978openalex-snapshot
On selection of candidates for opportunistic anypath forwarding
inferredcites →https://doi.org/10.1145/1282380.1282400openalex-snapshot
Trading structure for randomness in wireless opportunistic routing
inferredcites →https://doi.org/10.1145/509506.509517openalex-snapshot
Selection diversity forwarding in a multihop packet radio network with fading channel and capture
inferredcites →https://doi.org/10.1145/938985.939000openalex-snapshot
A high-throughput path metric for multi-hop wireless routing
inferredcites →https://doi.org/10.1145/938998.939000openalex-snapshot
A high-throughput path metric for multi-hop wireless routing
inferredcites →https://doi.org/10.1145/972374.972388openalex-snapshot
MAC-layer anycasting in 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.1007/978-3-030-89543-3_40openalex-snapshot
Finding Cheapest Deadline Paths
inferred← citeshttps://doi.org/10.1007/s42979-023-02054-yopenalex-snapshot
Opportunistic Networks: An Empirical Research of Routing Protocols and Mobility Models
inferred← citeshttps://doi.org/10.1016/j.jnca.2020.102802openalex-snapshot
Opportunistic routing metrics: A timely one-stop tutorial survey
inferred← citeshttps://doi.org/10.1016/j.neunet.2017.03.002openalex-snapshot
A time-delay neural network for solving time-dependent shortest path problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.06.008openalex-snapshot
Dynamic threshold P systems with delay on synapses for shortest path problems
inferred← citeshttps://doi.org/10.1109/comst.2015.2411335openalex-snapshot
A Survey on Opportunistic Routing in Wireless Communication Networks
inferred← citeshttps://doi.org/10.1109/comst.2015.2500960openalex-snapshot
New Perspectives on Future Smart FiWi Networks: Scalability, Reliability, and Energy Efficiency
inferred← citeshttps://doi.org/10.1109/icc.2018.8422110openalex-snapshot
Job Scheduling for Acceleration Systems in Cloud Computing
inferred← citeshttps://doi.org/10.1109/icomis.2018.8644725openalex-snapshot
Genetic Algorithm-Based Routing Performance Enhancement in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/iscc.2015.7405625openalex-snapshot
QADC-MORE: A new QoS-aware dynamic credit MORE protocol for wireless mesh networks
inferred← citeshttps://doi.org/10.1109/mass.2011.62openalex-snapshot
DART: Directional Anypath Routing in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/spcom.2018.8724487openalex-snapshot
Routing and Scheduling Transient Flows for QoS in Multi-hop Wireless Networks
inferred← citeshttps://doi.org/10.1109/tgcn.2021.3074563openalex-snapshot
Heterogeneous Mobile Networking for Lightweight UAV Assisted Emergency Communication
inferred← citeshttps://doi.org/10.1109/tmc.2016.2582173openalex-snapshot
Spectrum-Aware Anypath Routing in Multi-Hop Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/tmc.2026.3715717openalex-snapshot
Environment-Aware Jamming-Resilient UAV Routing Against Gray-Hole Attacks in Maritime Networks
inferred← citeshttps://doi.org/10.1109/twc.2013.071113.121529openalex-snapshot
A New MPLS-Based Forwarding Paradigm for Multi-Radio Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/twc.2023.3269785openalex-snapshot
A Novel Routing Control Method Using Federated Learning in Large-Scale Wireless Mesh Networks
inferred← citeshttps://doi.org/10.12720/jcm.11.2.126-131openalex-snapshot
A Fast Algorithm for the Optimal Constrained Path Routing in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.12720/jcm.11.8.733-739openalex-snapshot
A Fast Algorithm for Multicast Routing Subject to Multiple QoS Constrains in WMNs
inferred← citeshttps://doi.org/10.14257/ijfgcn.2016.9.9.09openalex-snapshot
An Approximation Scheme for Optimal Multicast Routing with Multiple QoS Constrains
inferred← citeshttps://doi.org/10.14257/ijsh.2016.10.10.09openalex-snapshot
A Multicast Routing Algorithm Based on Prior Objective Nodes
inferred← citeshttps://doi.org/10.17148/iarjset.2018.51102openalex-snapshot
Improved Energy Efficient Routing Wireless Sensor Networks Based On Clusters
inferred← citeshttps://doi.org/10.20944/preprints201903.0118.v1openalex-snapshot
Review on Opportunistic Routing Protocols for Dynamic Ad hoc Networks: Taxonomy, Applications and Future Research Directions
inferred← citeshttps://doi.org/10.20944/preprints201907.0239.v1openalex-snapshot
A Comprehensive Survey on Opportunistic Routing Protocols for MANETs: Issues, Challenges and Future Directions
inferred← citeshttps://doi.org/10.2139/ssrn.5499250openalex-snapshot
Fully Polynomial Time Approximation Schemes for Finding Cheapest Deadline Paths
inferred← citeshttps://doi.org/10.21817/ijet/2016/v8i5/160805409openalex-snapshot
Analysing the Behaviour and Performance of Opportunistic Routing Protocols in Highly Mobile Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.22214/ijraset.2019.4301openalex-snapshot
Optimal Path Routing in Partially Connected Wireless Mesh Network
inferred← citeshttps://doi.org/10.3390/fi8030038openalex-snapshot
A Novel QoS Provisioning Algorithm for Optimal Multicast Routing in WMNs
inferred← citeshttps://doi.org/10.3390/math10234557openalex-snapshot
A Guaranteed Approximation Algorithm for QoS Anypath Routing in WMNs
inferred← citeshttps://doi.org/10.34218/ijecet.10.3.2019.004openalex-snapshot
SAMCAR: SPECTRUM AWARE MULTI-COEFFICIENT BASED SHORTEST ANYPATH ROUTING IN COGNITIVE RADIO NETWORKS
inferred← citeshttps://doi.org/10.37896/ymer21.02/36openalex-snapshot
PERFORMNACE ANALYSIS OF OPPORTUNISTIC ROUTING PROTOCOLS FOR MANETs
inferred← citeshttps://doi.org/10.4018/978-1-5225-5693-0.ch001openalex-snapshot
Moving From Topology-Dependent to Opportunistic Routing Protocols in Dynamic Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2012.00850openalex-snapshot
Opportunistic Routing Metrics: A Timely One-Stop Tutorial Survey
inferred← citeshttps://doi.org/10.5121/iju.2015.6302openalex-snapshot
Determining the Network Throughput and Flow Rate Using GSR and AAL2R
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.