Pith. Sign in

RECORD

Two Dimensional Connectivity for Vehicular Ad-Hoc Networks

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Masoud Farivar, Behzad Mehrdad, Farid Ashtiani

Networking and Internet Architecture · Submitted 9 Dec 2008

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In this respect, we find thresholds for the arrival rates of vehicles at entrances of a block of streets such that the connectivity is guaranteed for any desired probability.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID0812.1628 (version 1)
Pith IDFSHEH5K5, Pith's permanent record of this paper and its review
CitationBehzad Mehrdad, Farid Ashtiani, Masoud Farivar. "Two Dimensional Connectivity for Vehicular Ad-Hoc Networks." arXiv:0812.1628 (2008). https://pith.science/paper/FSHEH5K5
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,605 input tokens, $0.0002 reported.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.14 · human participants 0.02 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.54 · compares with prior results 0.14 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

In this paper, we focus on two-dimensional connectivity in sparse vehicular ad hoc networks (VANETs). In this respect, we find thresholds for the arrival rates of vehicles at entrances of a block of streets such that the connectivity is guaranteed for any desired probability. To this end, we exploit a mobility model recently proposed for sparse VANETs, based on BCMP open queuing networks and solve the related traffic equations to find the traffic characteristics of each street and use the results to compute the exact probability of connectivity along these streets. Then, we use the results from percolation theory and the proposed fast algorithms for evaluation of bond percolation problem in a random graph corresponding to the block of the streets. We then find sufficiently accurate two dimensional connectivity-related parameters, such as the average number of intersections connected to each other and the size of the largest set of inter-connected intersections. We have also proposed lower bounds for the case of heterogeneous network with two transmission ranges. In the last part of the paper, we apply our method to several numerical examples and confirm our results by simulations.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 In this paper, we focus on two-dimensional connectivity in sparse vehicular ad hoc networks (VANETs). background 0.68 0.42 0.04 asserted 0.70
s1 In this respect, we find thresholds for the arrival rates of vehicles at entrances of a block of streets such that the connectivity is guaranteed for any desired probability. result 0.57 0.95 0.45 asserted 1.00
s2 To this end, we exploit a mobility model recently proposed for sparse VANETs, based on BCMP open queuing networks and solve the related traffic equations to find the traffic characteristics of each street and use the results to compute the exact probability of connectivity along these streets. method 1.00 0.90 0.06 asserted 1.00
s3 Then, we use the results from percolation theory and the proposed fast algorithms for evaluation of bond percolation problem in a random graph corresponding to the block of the streets. method 0.99 0.68 0.04 asserted 0.91
s4 We then find sufficiently accurate two dimensional connectivity-related parameters, such as the average number of intersections connected to each other and the size of the largest set of inter-connected intersections. result 0.81 0.96 0.15 asserted 0.98
s5 We have also proposed lower bounds for the case of heterogeneous network with two transmission ranges. contribution 0.87 0.94 0.08 asserted 0.99
s6 In the last part of the paper, we apply our method to several numerical examples and confirm our results by simulations. method 0.71 0.95 0.11 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.83 · evidence from proof or derivation 0.72.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

In this paper, we focus on two-dimensional connectivity in sparse vehicular ad hoc networks (VANETs). In this respect, we find thresholds for the arrival rates of vehicles at entrances of a block of streets such that the connectivity is guaranteed for any desired probability. To this end, we exploit a mobility model recently proposed for sparse VANETs, based on BCMP open queuing networks and solve the related traffic equations to find the traffic characteristics of each street and use the results to compute the exact probability of connectivity along these streets. Then, we use the results from percolation theory and the proposed fast algorithms for evaluation of bond percolation problem in a random graph corresponding to the block of the streets. We then find sufficiently accurate two dimensional connectivity-related parameters, such as the average number of intersections connected to each other and the size of the largest set of inter-connected intersections. We have also proposed lower bounds for the case of heterogeneous network with two transmission ranges. In the last part of the paper, we apply our method to several numerical examples and confirm our results by simulations.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.