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.
Vehicular Disruption Tolerant Networks appear due to the search of information by drivers, which are organized into mobile ad hoc networks that may suffer from long interruptions. In such networks, both humans as well as machines contribute with information about the traffic and road conditions. As humans can be biased or may be compelled to disseminate false information for personal gains, the network...
Gamma Deployment is a metric for evaluating the distribution of roadside units in vehicular networks in terms of two parameters: a) the inter-contact time between vehicles and the infrastructure, and, b) the share of vehicles that must respect the inter-contact time guarantees. We envision the use of the Gamma Deployment metric when the network designer intends to distribute check-points along the...
In this work the allocation of Roadside Units (RSUs) in a V2I network is modeled as a Maximum Coverage Problem. The main objective is to maximize the number of distinct vehicles contacting the infrastructure. Two different approaches are presented to solve the problem. The first one is an ILP model that can found optimal solutions or give sharp upper and lower bounds for the problem. The second one...
In this work we propose Delta-r, a new greedy heuristic for solving the allocation of roadside units in order to meet a Δρ1ρ2-Deployment. The Δρ1ρ2-Deployment is a metric for specifying minimal levels of performance from the infrastructure supporting vehicular networks. As far as we are concerned, this is the first QoS-bounded deployment strategy considering both the contact probability, and the contact...
This work presents a novel algorithm for the deployment of roadside units based on partial mobility information. Instead of relying on the individual vehicles trajectories, our proposal relies on the migration ratios between urban regions in order to infer the better locations for the deployment of the roadside units. Our goal is to identify those α locations maximizing the number of distinct vehicles...
There are several kinds of envisioned vehicular applications: video delivery, accidents detection, dissemination of traffic announcements, and so forth. Such applications demand minimal (and possibly distinct) QoS guarantees that must couple the vehicular network. Given that vehicular networks will soon become reality, we demand strategies for planning and managing such networks. In this work we propose...
This work presents an algorithm for deployment of roadside units based on partial mobility information. We propose the partition of the road network into same size urban cells, and we use the migration ratios between adjacent urban cells in order to infer the better locations for the deployment of the roadside units. Our goal is to identify those α locations maximizing the number of distinct vehicles...
This work presents a probabilistic constructive heuristic to design the roadside infrastructure for information dissemination in vehicular networks. We formulate the problem as a Probabilistic Maximum Coverage Problem (PMCP) and we use them to maximize the number of vehicles in contact with the infrastructure. We compare our approach to a non-probabilistic MCP in simulated urban areas considering...
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.