Intersection-Connectivity-Based Roadside-Unit Allocation

Towards connectivity-aware deployment and adjustment for roadside units

A Connectivity-based Strategy for Roadside Units Placement in Vehicular Ad Hoc Networks

In urban scenario, the imbalanced spatial distribution of traffic flow exerts an important influence on the performance of communication between vehicles and the Roadside Unit (RSU). This paper presents a strategy for RSUs placement based on the road traffic characteristics, aiming at improving connectivity in vehicular ad hoc networks. To divide the coverage area of each RSU, we propose an Exp...

K-connectivity of Uniform S-intersection Graphs

Let W1, . . . ,Wn be independent random subsets of [m] = {1, . . . ,m}. Assuming that each Wi is uniformly distributed in the class of d-subsets of [m] we study the uniform random intersection graph Gs(n,m, d) on the vertex set {W1, . . .Wn}, defined by the adjacency relation: Wi ∼ Wj whenever |Wi ∩Wj | ≥ s. We show that as n,m → ∞ the edge density threshold for the property that each vertex of...

Connectivity of the uniform random intersection graph

A uniform random intersection graph G(n,m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when m...

Data Delivery based on Mobile Roadside Unit and with QoS Guarantee for Vehicular Ad Hoc Networks

The abstract Data delivery in vehicular ad hoc networks (VANETs) has become one of the most challenging problems due to the rapid movement of vehicles and their bounded communication ranges. How to more efficiently transmit the sensing data about the region of interest to AP is discussed in this paper. Previous work hasn’t distinguished node types to forward data packet commonly, the delivery r...