On the public citation graph

Topological properties of random wireless networks

0 signed · 47 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.1002/(sici)1098-2418(199608/09)9:1/2<137::aid-rsa9>3.0.co;2-yopenalex-snapshot
On the connectivity of a random interval graph
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.1007/978-1-4612-1784-8_33openalex-snapshot
Critical Power for Asymptotic Connectivity in Wireless Networks
inferredcites →https://doi.org/10.1007/978-1-4757-3460-7openalex-snapshot
Scan Statistics
inferredcites →https://doi.org/10.1007/s10586-005-6182-8openalex-snapshot
Optimal Transmission Radius for Flooding in Large Scale Sensor Networks
inferredcites →https://doi.org/10.1007/s11276-005-3513-xopenalex-snapshot
Connectivity of Wireless Multihop Networks in a Shadow Fading Environment
inferredcites →https://doi.org/10.1017/s0963548304006121openalex-snapshot
Threshold Functions for Random Graphs on a Line Segment
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.1090/s0002-9939-96-03732-xopenalex-snapshot
Every monotone graph property has a sharp threshold
inferredcites →https://doi.org/10.1093/acprof:oso/9780198506263.001.0001openalex-snapshot
Random Geometric Graphs
inferredcites →https://doi.org/10.1093/oso/9780198503149.001.0001openalex-snapshot
Methods and Algorithms for Radio Channel Assignment
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/18.825799openalex-snapshot
The capacity of wireless networks
inferredcites →https://doi.org/10.1109/26.31170openalex-snapshot
Critical connectivity phenomena in multihop radio models
inferredcites →https://doi.org/10.1109/infcom.2001.916631openalex-snapshot
Mobility increases the capacity of ad-hoc wireless networks
inferredcites →https://doi.org/10.1109/infcom.2005.1498546openalex-snapshot
Time and energy complexity of distributed computation in wireless sensor networks
inferredcites →https://doi.org/10.1109/jsac.2005.843543openalex-snapshot
Computing and communicating functions over sensor networks
inferredcites →https://doi.org/10.1109/lcomm.2002.1010866openalex-snapshot
A note on the estimation of Nakagami-m fading parameter
inferredcites →https://doi.org/10.1109/lcomm.2002.804241openalex-snapshot
On the connectivity in finite ad hoc networks
inferredcites →https://doi.org/10.1109/tit.2003.814480openalex-snapshot
Towards an information theory of large networks: an achievable rate region
inferredcites →https://doi.org/10.1109/tit.2004.826631openalex-snapshot
A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
inferredcites →https://doi.org/10.1109/tmc.2003.1195149openalex-snapshot
The critical transmitting range for connectivity in sparse wireless 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/wiopt.2005.33openalex-snapshot
On Range Matrices and Wireless Networks in d Dimensions
inferredcites →https://doi.org/10.1109/wowmom.2005.70openalex-snapshot
On the Clustering Properties of Exponential Random Networks
inferredcites →https://doi.org/10.1145/1007352.1007441openalex-snapshot
Sharp thresholds For monotone properties in random geometric graphs
inferredcites →https://doi.org/10.1214/aoap/1034625335openalex-snapshot
The longest edge of the random minimal spanning tree
inferredcites →https://doi.org/10.2307/1428076openalex-snapshot
The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1]d
inferredcites →https://doi.org/10.2307/1428077openalex-snapshot
The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20174openalex-snapshot
Topological properties of the one dimensional exponential random geometric graph
inferred← citeshttps://doi.org/10.1007/978-3-032-11127-2_12openalex-snapshot
Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
inferred← citeshttps://doi.org/10.1007/s12046-007-0046-2openalex-snapshot
A tutorial survey of topics in wireless networking: Part I
inferred← citeshttps://doi.org/10.1007/s12046-007-0047-1openalex-snapshot
A tutorial survey of topics in wireless networking: Part II
inferred← citeshttps://doi.org/10.1016/j.eij.2021.05.002openalex-snapshot
Wireless battery recharging through UAV in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.procs.2015.01.025openalex-snapshot
Reliability Evaluation of Mobile Ad Hoc Network: With and without Mobility Considerations
inferred← citeshttps://doi.org/10.1109/cyberc.2009.5342212openalex-snapshot
Exponential random geometric graph process models for mobile wireless networks
inferred← citeshttps://doi.org/10.1109/ncc.2018.8600199openalex-snapshot
Range Free Localization in Anisotropic Networks using Unbiased Distance Model
inferred← citeshttps://doi.org/10.1109/rteict42901.2018.9012418openalex-snapshot
Random Connectedness in Vehicular ad-hoc Network by Managing Dynamic Spectrum in CRN
inferred← citeshttps://doi.org/10.1109/twc.2009.12.080042openalex-snapshot
Clustering algorithm in initialization of multi-hop wireless sensor networks
inferred← citeshttps://doi.org/10.48550/arxiv.0710.1001openalex-snapshot
Connectivity of Random 1-Dimensional Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0909.2948openalex-snapshot
Laws of Large Numbers of Subgraphs in Directed Random Geometric Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1412openalex-snapshot
Topological Properties of an Exponential Random Geometric Graph Process
inferred← citeshttps://doi.org/10.5281/zenodo.1062985openalex-snapshot
Topological Properties Of An Exponential Random Geometric Graph Process
inferred← citeshttps://doi.org/10.7287/peerj-cs.269v0.1/reviews/1openalex-snapshot
Peer Review #1 of "A survey on exponential random graph models: an application perspective (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.269v0.1/reviews/2openalex-snapshot
Peer Review #2 of "A survey on exponential random graph models: an application perspective (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.269v0.1/reviews/3openalex-snapshot
Peer Review #3 of "A survey on exponential random graph models: an application perspective (v0.1)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.269openalex-snapshot
A survey on exponential random graph models: an application perspective
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.