On the public citation graph
Network Topology Models for Multihop Wireless Networks
0 signed · 104 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/(sici)1098-2418(199909)15:2<145::aid-rsa2>3.0.co;2-gopenalex-snapshot
Onk-connectivity for a geometric random graph
inferredcites →https://doi.org/10.1002/0471656895.ch16openalex-snapshot
Algorithmic Challenges in AD HOC Networks
inferredcites →https://doi.org/10.1002/3527602755.ch1openalex-snapshot
Mathematical results on scale‐free random graphs
inferredcites →https://doi.org/10.1002/rsa.1009openalex-snapshot
The degree sequence of a scale‐free random graph process
inferredcites →https://doi.org/10.1007/11564126_17openalex-snapshot
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
inferredcites →https://doi.org/10.1007/3-540-48686-0_1openalex-snapshot
The Web as a Graph: Measurements, Models, and Methods
inferredcites →https://doi.org/10.1007/978-0-387-77320-9_2openalex-snapshot
Random Graph Models and the Limits of Scalability in Ad Hoc and Sensor Networks
inferredcites →https://doi.org/10.1007/978-1-4612-1784-8_33openalex-snapshot
Critical Power for Asymptotic Connectivity in Wireless Networks
inferredcites →https://doi.org/10.1007/978-3-540-24614-5_19openalex-snapshot
High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1007/978-3-540-30216-2_4openalex-snapshot
A Geometric Preferential Attachment Model of Networks
inferredcites →https://doi.org/10.1007/978-3-540-78808-9_3openalex-snapshot
Expansion and Lack Thereof in Randomly Perturbed Graphs
inferredcites →https://doi.org/10.1007/978-3-642-03367-4_49openalex-snapshot
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
inferredcites →https://doi.org/10.1007/bfb0093472openalex-snapshot
Probability Theory of Classical Euclidean Optimization Problems
inferredcites →https://doi.org/10.1007/s00453-007-9078-6openalex-snapshot
On the Fundamental Limits of Topology Control in Ad Hoc Networks
inferredcites →https://doi.org/10.1007/s11036-006-5188-7openalex-snapshot
Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model
inferredcites →https://doi.org/10.1007/s11276-007-0045-6openalex-snapshot
Ad hoc networks beyond unit disk graphs
inferredcites →https://doi.org/10.1007/s11786-007-0026-2openalex-snapshot
A General Tractable Density Concept for Graphs
inferredcites →https://doi.org/10.1016/j.adhoc.2007.06.005openalex-snapshot
On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks
inferredcites →https://doi.org/10.1016/j.comnet.2004.12.001openalex-snapshot
Wireless mesh networks: a survey
inferredcites →https://doi.org/10.1016/j.cor.2007.02.009openalex-snapshot
Efficient blocking probability computation of complex traffic flows for network dimensioning
inferredcites →https://doi.org/10.1016/j.dam.2005.05.007openalex-snapshot
On the typical case complexity of graph optimization
inferredcites →https://doi.org/10.1016/j.peva.2010.08.024openalex-snapshot
Asymptotically optimal trade-off between local and global connectivity in wireless networks
inferredcites →https://doi.org/10.1016/j.tcs.2008.01.029openalex-snapshot
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
inferredcites →https://doi.org/10.1016/s0378-4371(00)00018-2openalex-snapshot
Scale-free characteristics of random networks: the topology of the world-wide web
inferredcites →https://doi.org/10.1016/s1389-1286(00)00083-9openalex-snapshot
Graph structure in the Web
inferredcites →https://doi.org/10.1016/s1389-1286(99)00040-7openalex-snapshot
Trawling the Web for emerging cyber-communities
inferredcites →https://doi.org/10.1017/cbo9780511619632openalex-snapshot
Random Networks for Communication
inferredcites →https://doi.org/10.1023/a:1025193929081openalex-snapshot
MERIT: A Scalable Approach for Protocol Assessment
inferredcites →https://doi.org/10.1023/b:wine.0000013081.09837.c0openalex-snapshot
The Number of Neighbors Needed for Connectivity of Wireless Networks
inferredcites →https://doi.org/10.1038/scientificamerican0503-60openalex-snapshot
Scale-Free Networks
inferredcites →https://doi.org/10.1080/08839510802164234openalex-snapshot
ALGORITHMIC CHALLENGES IN LEARNING PATH METRICS FROM OBSERVED CHOICES
inferredcites →https://doi.org/10.1080/15427951.2004.10129081openalex-snapshot
The Average Distance in a Random Graph with Given Expected Degrees
inferredcites →https://doi.org/10.1080/15427951.2004.10129094openalex-snapshot
Coupling Online and Offline Analyses for Random Power Law Graphs
inferredcites →https://doi.org/10.1080/15427951.2005.10129111openalex-snapshot
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
inferredcites →https://doi.org/10.1080/15427951.2008.10129305openalex-snapshot
A Spatial Web Graph Model with Local Influence Regions
inferredcites →https://doi.org/10.1093/acprof:oso/9780198506263.001.0001openalex-snapshot
Random Geometric Graphs
inferredcites →https://doi.org/10.1109/18.42219openalex-snapshot
Connectivity properties of a packet radio network model
inferredcites →https://doi.org/10.1109/broadnets.2004.8openalex-snapshot
A multi-radio unification protocol for IEEE 802.11 wireless networks
inferredcites →https://doi.org/10.1109/glocom.2009.5425728openalex-snapshot
Increased Connectivity at Lower Cost: The Case for Multi-Radio Nodes in Multi-Hop Wireless Networks
inferredcites →https://doi.org/10.1109/glocom.2009.5425846openalex-snapshot
Analysis of Fundamental Limits for Partial Connectivity in Wireless Networks
inferredcites →https://doi.org/10.1109/hpcc.2011.105openalex-snapshot
Connecting Two Worlds: Physical Models and Graph Models of Wireless Network Topologies
inferredcites →https://doi.org/10.1109/infcom.2003.1208989openalex-snapshot
On the capacity of hybrid wireless networks
inferredcites →https://doi.org/10.1109/infcom.2004.1354518openalex-snapshot
Throughput-delay trade-off in wireless networks
inferredcites →https://doi.org/10.1109/infcom.2004.1356976openalex-snapshot
MultiNet: connecting to multiple IEEE 802.11 networks using a single wireless card
inferredcites →https://doi.org/10.1109/infocom.2006.177openalex-snapshot
Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks
inferredcites →https://doi.org/10.1109/jsac.2009.090919openalex-snapshot
Scalability of node degrees in random wireless network topologies
inferredcites →https://doi.org/10.1109/mcom.2005.1404606openalex-snapshot
Mesh networks: commodity multihop ad hoc networks
inferredcites →https://doi.org/10.1109/mnet.2009.5191140openalex-snapshot
Spectrum management in cognitive radio ad hoc networks
inferredcites →https://doi.org/10.1109/mobhoc.2006.278582openalex-snapshot
Distributed Channel Assignment for Multi-radio Wireless Networks
inferredcites →https://doi.org/10.1109/pimrc.2008.5173153openalex-snapshot
The effect of multi-radio nodes on network connectivity -- a graph theoretic analysis
inferredcites →https://doi.org/10.1109/qest.2009.44openalex-snapshot
Quantifying the Trade-off Between the Level of Connectivity and Local Complexity in Random Wireless Network Topologies
inferredcites →https://doi.org/10.1109/sfcs.2001.959927openalex-snapshot
Random evolution in massive graphs
inferredcites →https://doi.org/10.1109/tit.2006.874537openalex-snapshot
On the throughput scaling of wireless relay networks
inferredcites →https://doi.org/10.1109/tit.2006.876254openalex-snapshot
Communication over a wireless network with random connections
inferredcites →https://doi.org/10.1109/tit.2007.905002openalex-snapshot
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
inferredcites →https://doi.org/10.1109/tnet.2002.801403openalex-snapshot
Mobility increases the capacity of ad hoc wireless networks
inferredcites →https://doi.org/10.1109/tnet.2005.852873openalex-snapshot
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
inferredcites →https://doi.org/10.1109/tnet.2005.861250openalex-snapshot
Understanding Internet topology: principles, models, and validation
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1145/1022630.1022632openalex-snapshot
On the fundamental limits of topology control
inferredcites →https://doi.org/10.1145/1023720.1023732openalex-snapshot
Routing in multi-radio, multi-hop wireless mesh networks
inferredcites →https://doi.org/10.1145/1039111.1039122openalex-snapshot
Reconsidering wireless systems with multiple radios
inferredcites →https://doi.org/10.1145/1062689.1062700openalex-snapshot
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
inferredcites →https://doi.org/10.1145/1073814.1073826openalex-snapshot
On the locality of bounded growth
inferredcites →https://doi.org/10.1145/1080829.1080832openalex-snapshot
Improving loss resilience with multi-radio diversity in wireless networks
inferredcites →https://doi.org/10.1145/1080829.1080835openalex-snapshot
Capacity of multi-channel wireless networks
inferredcites →https://doi.org/10.1145/1080829.1080836openalex-snapshot
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks
inferredcites →https://doi.org/10.1145/316188.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/381677.381684openalex-snapshot
Capacity of Ad Hoc wireless networks
inferredcites →https://doi.org/10.1145/778415.778426openalex-snapshot
On the maximum stable throughput problem in random networks with directional antennas
inferredcites →https://doi.org/10.1145/778415.778429openalex-snapshot
On the capacity improvement of ad hoc wireless networks using directional antennas
inferredcites →https://doi.org/10.1145/938985.938991openalex-snapshot
Characterizing achievable rates in multi-hop wireless networks
inferredcites →https://doi.org/10.1145/938985.938992openalex-snapshot
Throughput capacity of random ad hoc networks with infrastructure support
inferredcites →https://doi.org/10.1145/989459.989461openalex-snapshot
Asymptotic critical transmission radius and critical neighbor number for k -connectivity in wireless ad hoc networks
inferredcites →https://doi.org/10.1145/989459.989477openalex-snapshot
Capacity bounds for three classes of wireless networks
inferredcites →https://doi.org/10.1214/aoap/1034625335openalex-snapshot
The longest edge of the random minimal spanning tree
inferredcites →https://doi.org/10.1214/aop/1022677261openalex-snapshot
A Strong Law for the Longest Edge of the Minimal Spanning Tree
inferredcites →https://doi.org/10.1515/9781400841356openalex-snapshot
The Structure and Dynamics of Networks
inferredcites →https://doi.org/10.2307/1428077openalex-snapshot
The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d
inferredcites →https://doi.org/10.2307/3214317openalex-snapshot
The limit distribution of the largest nearest-neighbour link in the unit d-cube
inferredcites →https://doi.org/10.4310/cis.2001.v1.n1.a3openalex-snapshot
Internets in the sky: The capacity of three-dimensional wireless networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/tee.22149openalex-snapshot
Optimal control of multi‐hop control networks based on the MLD framework
inferred← citeshttps://doi.org/10.1109/iecon.2013.6700061openalex-snapshot
Modeling and optimal control of multi-hop control networks based on the MLD framework
inferred← citeshttps://doi.org/10.12783/dtetr/mdm2016/4912openalex-snapshot
Wireless Sensor Network Model Based on Non Uniform Clustering Mechanism
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.406openalex-snapshot
Periodic Model Predictive Control of Multi-Hop Control Networks
inferred← citeshttps://doi.org/10.23919/sice.2017.8105657openalex-snapshot
Stochastic model predictive control of multi-hop control networks with packet dropouts
inferred← citeshttps://doi.org/10.2991/icmmcce-15.2015.221openalex-snapshot
Research on Some Topology Model of Wireless Sensor Networks Based on Complex Network Theory
inferred← citeshttps://doi.org/10.2991/icmmcce-15.2015.354openalex-snapshot
A Topology Model with Energy- and Location-awareness based on the Laws of Internal Evolution of the Wireless Sensor Network
inferred← citeshttps://doi.org/10.32474/ctcsa.2020.02.000130openalex-snapshot
Random Graph Models with Non-Independent Edges
inferred← citeshttps://doi.org/10.3390/electronics11132078openalex-snapshot
Multi-Hop Routing Protocols for Oil Pipeline Leak Detection Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2012.02050openalex-snapshot
A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties
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.