Related papers: On the Maximal Shortest Path in a Connected Compon…
We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the…
Now a days Many car manufacturers are planning to install wireless connectivity equipment in their vehicles to enable communications with "roadside base station" and also between vehicles, for the purposes of safety, driving assistance, and…
This paper deals with broadcasting problem in vehicular ad hoc networks (VANETs). This communication mode is commonly used for sending safety messages and traffic information. However, designing an efficient broadcasting protocol is hard to…
Spreading according to simple rules (e.g. of fire or diseases), and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections (``Small-World'' lattices). The volume V(t) covered…
We study, via combinatorial enumeration, the probability of k-hop connection between two nodes in a wireless multi-hop network. This addresses the difficulty of providing an exact formula for the scaling of hop counts with Euclidean…
Data delivery relying on the carry-and-forward strategy of vehicle-to-vehicle (V2V) communications is of significant importance, however highly challenging due to frequent connection disruption. Fortunately, incorporating…
Vehicular Ad-hoc NETworks (VANET) can efficiently detect traffic congestion, but detection is not enough because congestion can be further classified as recurrent and non-recurrent congestion (NRC). In particular, NRC in an urban network is…
Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example…
This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann…
In the context of evolving smart cities and autonomous transportation systems, Vehicular Ad-hoc Networks (VANETs) and the Internet of Vehicles (IoV) are growing in significance. Vehicles are becoming more than just a means of…
In vehicular ad-hoc networks (VANETs) the impact of vehicles as obstacles has largely been neglected in the past. Recent studies have reported that the vehicles that obstruct the line-of-sight (LOS) path may introduce 10-20 dB additional…
Vehicular ad-hoc network (VANET) is subclass of mobile ad-hoc network which is vehicle to vehicle and vehicle to infrastructure communication environment, where nodes involve themselves as servers and/or clients to exchange and share…
Given a public transportation network of stations and connections, we want to find a minimum subset of stations such that each connection runs through a selected station. Although this problem is NP-hard in general, real-world instances are…
We investigate the problem of locating the source of diffusion in complex networks without complete knowledge of nodes' states. Some currently known methods assume the information travels via a single, shortest path, which by assumption is…
We calculate the distribution of the distance headways (i.e., the instantaneous gap between successive vehicles) as well as the distribution of instantaneous distance between successive jams in the Nagel-Schreckenberg (NS) model of…
To date, VANET research efforts have relied heavily on simulations, due to prohibitive costs of deploying real world testbeds. Existing channel models implemented in discrete-event VANET simulators are by and large simple stochastic radio…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
Shortest paths are representative of discrete geodesic distances in graphs, and many descriptors of networks depend on their counting. In multiplex networks, this counting is radically important to quantify the switch between layers and it…
Hopping transport in a one-dimensional system is studied numerically. A fast algorithm is devised to find the lowest-resistance path at arbitrary electric field. Probability distribution functions of individual resistances on the path and…
The meta distribution of the signal-to-interference-ratio (SIR) is an important performance indicator for wireless networks because, for ergodic point processes, it describes the fraction of scheduled links that achieve certain reliability,…