Related papers: On the Maximal Shortest Path in a Connected Compon…
We examine adaptive strategies adopted by vehicles for route selection en-route in transportation networks. By studying a model of two-dimensional cellular automata, we model vehicles characterized by a parameter called path-greediness,…
We consider a Mobile Ad-hoc NETworks (MANET) formed by "n" nodes that move independently at random over a finite square region of the plane. Nodes exchange data if they are at distance at most "r" within each other, where r>0 is the node…
With the emergence of autonomous driving and 5G mobile communication systems, how to design vehicular networks to meet the requirements of ultra-reliable low-latency communication (URLLC) between autonomous vehicles is widely concerned by…
In a circuit-switched network, traffic can be characterized by several factors that define how communication resources are allocated and utilized during a connection. The amount of traffic basically determines how frequently connection…
Vehicle-to-vehicle (V2V) communication can improve road safety and traffic efficiency, particularly around critical areas such as intersections. We analytically derive V2V success probability near an urban intersection, based on empirically…
This paper concerns the performance of vehicle-to-everything (V2X) communications. More precisely, we analyze the broadcast of safety-related V2X communications in cellular networks where base stations and vehicles are assumed to share the…
As large graph datasets become increasingly common across many fields, sampling is often needed to reduce the graphs into manageable sizes. This procedure raises critical questions about representativeness as no sample can capture the…
Randomized shortest paths (RSP) are a tool developed in recent years for different graph and network analysis applications, such as modelling movement or flow in networks. In essence, the RSP framework considers the temperature-dependent…
The vehicular ad hoc networks (VANETs) have been researched for over twenty years. Although being a fundamental communication approach for vehicles, the conventional VANETs are challenged by the newly emerged autonomous vehicles (AVs) which…
In this paper we analyze synthetic mobility traces generated for three-lane unidirectional motorway traffic to find that the locations of vehicles along a lane are better modeled by a hardcore point process instead of the widely-accepted…
Let $G=(V,E,w)$ be a weighted directed graph without negative cycles. For two vertices $s,t\in V$, we let $d_{\le h}(s,t)$ be the minimum, according to the weight function $w$, of a path from $s$ to $t$ that uses at most $h$ edges, or hops.…
We derive exact expressions for the shortest path length to a point of a Poisson line Cox process (PLCP) from the typical point of the PLCP and from the typical intersection of the underlying Poisson line process (PLP), restricted to a…
Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…
This paper considers a multi-UAV network with a ground station (GS) that uses multi-hop relaying structure for data transmission in a power-efficient manner. The objective is to investigate the best possible multi-hop routing structure for…
In this letter, we investigate the performance of multiple-input multiple-output techniques in a vehicle-to-vehicle communication system. We consider both transmit antenna selection with maximal-ratio combining and transmit antenna…
Numerous problems of both theoretical and practical interest are related to finding shortest (or otherwise optimal) paths in networks, frequently in the presence of some obstacles or constraints. A somewhat related class of problems focuses…
Hopsets and spanners are fundamental graph structures, playing a key role in shortest path computation, distributed communication, and more. A (near-exact) hopset for a given graph $G$ is a (small) subset of weighted edges $H$ that when…
In vehicular communications, traffic-related information should be spread over the network as quickly as possible to maintain a safe and reliable transportation system. This motivates us to develop more efficient information propagation…
Vehicular communications (VCs) protocols offer useful contributions in the context of accident prevention thanks to the transmission of alert messages. This is even truer at road intersections since these areas exhibit higher collision…
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are,…