Related papers: On the Maximal Shortest Path in a Connected Compon…

Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…

Many significant functionalities of vehicular ad hoc networks (VANETs) require that nodes have knowledge of the positions of other vehicles, and notably of those within communication range. However, adversarial nodes could provide false…

In the Vehicular ad hoc networks (VANETs), due to the high mobility of vehicles, the network parameters change frequently and the information which the sender maintains may outdate when it wants to transmit data packet to the receiver, so…

Vehicular Ad-Hoc Networks (VANETs) are special forms of Mobile Ad-Hoc Networks (MANETs) that allows vehicles to communicate together in the absence of fixed infrastructure.In this type of network beaconing is the means used to discover the…

Vehicular Ad-hoc Networks (VANETs) are integral to intelligent transportation systems, enabling vehicles to offload computational tasks to nearby roadside units (RSUs) and mobile edge computing (MEC) servers for real-time processing.…

In this paper we present an analytic study of sampled networks in the case of some important shortest-path sampling models. We present analytic formulas for the probability of edge discovery in the case of an evolving and a static network…

In this paper, we consider the problem of joint secure routing and transmit power optimization for a multi-hop ad-hoc network under the existence of randomly distributed eavesdroppers following a Poisson point process (PPP). Secrecy…

To alleviate computational load on RSUs and cloud platforms, reduce communication bandwidth requirements, and provide a more stable vehicular network service, this paper proposes an optimized pinning control approach for heterogeneous…

We study traffic clearance distributions (i.e., the instantaneous gap between successive vehicles) and time headway distributions by applying Beck and Cohen's superstatistics. We model the transition from free phase to congested phase with…

Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile stations, or mobile nodes (MNs). Mobility model is a hot topic in many areas, for example, protocol evaluation, network performance analysis and so on.How to simulate…

This paper focuses on the routing algorithm for the communications between vehicles and places in urban VANET. As one of the basic transportation facilities in an urban setting, buses periodically run along their fixed routes and widely…

Connectivity analysis is a crucial metric for network performance in vehicular ad-hoc networks (VANETs). Although VANET connectivity has been intensively studied and investigated under no-fading channel models for their simplicity, these…

Vehicle-to-vehicle communications can be used effectively for intelligent transport systems (ITS) and location-aware services. The ability to disseminate information in an ad-hoc fashion allows pertinent information to propagate faster…

Various hypotheses exist about the paths used for communication between the nodes of complex networks. Most studies simply suppose that communication goes via shortest paths, while others have more explicit assumptions about how routing…

We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular…

Vehicular Ad Hoc Networks (VANETs) play a key role in Intelligent Transportation Systems (ITS), particularly in enabling real-time communication for emergency vehicles. However, Distributed Denial of Service (DDoS) attacks, which interfere…

The rapid increase of vehicular traffic and congestion on the highways began hampering the safe and efficient movement of traffic. Consequently, year by year, we see the ascending rate of car accidents and casualties in most of the…

We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…

Communication protocols for mobile ad hoc networks (MANETs) follow either an Optimum Routing Approach (ORA) or the Least Overhead Routing Approach (LORA): With ORA, protocols tend to determine and use the optimal communication structure at…

This paper proposes a data-driven distributionally robust shortest path (DRSP) model where the distribution of the travel time in the transportation network can only be partially observed through a finite number of samples. Specifically, we…