The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Although IEEE 802.11p technology is standardized for road safety and efficiency applications, the channel congestion problem is its key weakness necessitating distributed congestion control (DCC) algorithms on different layers of the communication stack. In this paper, we propose DCC-enabled Contention based Forwarding scheme targeting multi-hop dissemination of Decentralised Event Notification Messages...
This study addresses issues of vehicular mobility scenario generation using the framework called En Route. By applying the framework to planet scale imagery dataset (traffic cameras) we were able to model the traffic demand of a large scale urban scenario (city of London) by means of origin/destination matrix and trips starting within 30 minutes. Along the way, we investigate the relationship of traffic...
Vehicular mobility scenarios are utilized to study vehicular networks and transportation systems. However, the generation of vehicular simulation scenarios at scale poses several research challenges. Large-scale vehicular datasets (in geographic coverage and time span) are not easily or publicly available, which hinders the generation of data-driven scenarios. In this paper, we introduce a systematic...
This study investigates a light-weight data reduction technique for speeding-up shortest path and distance queries on large graphs. We propose a notion of routing proxies (or simply proxies), each of which represents a small subgraph, referred to as deterministic routing areas (DRAs). We show that routing proxies hold good properties for speeding-up shortest path and distance queries, and there exists...
Trajectories contain considerable routing information, and trajectory-based routing gains the attention of researchers recently. This paper argues the problem of searching time period Longest Frequent Path(TPLFP). The TPLFP, as one of the reasonable alternative Most Frequent Path (MFP), is close to MFP enough and maximizes the number of frequent route segments. First, we define TPLFP formally. To...
In this paper, we are concerned with the resilience of locally routed network flows with finite link capacities. In this setting, an external inflow is injected to the so-called origin nodes. The total inflow arriving at each node is routed locally such that none of the outgoing links are overloaded unless the node receives an inflow greater than its total outgoing capacity. A link irreversibly fails...
In this work we tackle the bus stop selection step for the School Bus Routing Problem (SBRP). Our goal is to minimize the number of bus stops in order to assign all students to a bus stop respecting a home-to-bus-stop walking distance constraint. Our strategy creates a large number of possible bus stops points in a road network and uses a pseudo-random constructive heuristic algorithm to assign students...
Unexpected road traffic congestion caused by en-route events, such as car crashes, road works, unplanned parades etc., is a real challenge in today's urban road networks as it considerably increases the drivers' travel time and decreases travel time reliability. To face this challenge, this paper extends our previous work named Next Road Rerouting (NRR) by designing a novel vehicle rerouting strategy...
Store-carry-and-forward is extensively used in vehicular environments for many and varied purposes, including routing, disseminating, downloading, uploading, or offloading delay-tolerant content. The performance gain of store-carry-and-forward over traditional connected forwarding is primarily determined by the fact that it grants a much improved network connectivity. Indeed, by letting vehicles physically...
This paper, addresses to the issues arising during the application of ITS. In this context, a study is done about chain collision and Intelligent Traffic Light Systems (ITLS). There is a need for these methods because nowadays, traffic causes traffic congestions which remain for long that is generally due to the inefficient management of road congestions. Vehicular Ad hoc Networks (VANETs) is a rising...
Recently, geocast routing (GR) has been extensively investigated for reliable and efficient dissemination of information due to increasing number of intelligent transport system (ITS) applications favoring geocasting. In this paper, a qualitative survey of recent protocols of GR and some precise future research issues have been provided. A functional and qualitative description of each considered...
In this article, we propose a general-purpose disaster support system based on generalized (multiplicatively-weighted order-k Minkowski-metric) Voronoi diagrams. The proposed system is capable of handling disasters (or emergency units) having different weights in the complete order from 1 to k in the three popular Minkowski metrics (Euclidean, Manhattan and Maximum distance space). The proposed model...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.