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.
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...
Today, applications that take the congestions caused by traffic jams into account already exist. During rush hour, it is common that multiple congestions occur on the road network. If the number of traffic jams is too big, the radio stations that transmit TMC messages to the end user often only report the longest traffic jams. Those applications use the Traffic Message Channel (TMC) technique to calculate...
Multi-Constrained Path (MCP) algorithms are path finding algorithms, unlike conventional routing algorithms, they not only give a path between source and destination, also verifies whether the path satisfies the given constraints (Right turn, Left turn and U turn). MCP algorithms are NPComplete. The MCP algorithms are aimed to find the shortest path in a road network that satisfies the turn prohibitions...
The message deliveries based on the store-carry-forward routing schemes, such as Epidemic Routing(ER), are one of useful methods for communication under challenged environments. However, these methods commonly have their own limitations in reach ability of messages to destinations and scalability. For example, as the distance to the destination increases, the delivery delay of a message between source...
In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A simple approach to this problem would be to recompute the best path for all queries on arrival of every delay update. However, such a naive approach scales poorly when there are many users who have requested routes in the system...
Due to the deficiency of logistics distribution, this paper presents a new approach to deal with VRP problems and utilizes network analysis function of GIS. Firstly, this paper specifies how to establish road network based on GIS. Secondly, this paper focuses on Vehicle Routing Problems with Time Window constraints. Finally, article based on the network analysis function of GIS, routing results on...
Information Hovering applies in many applications in Vehicular Ad Hoc Networks, where useful information needs to be made available to all vehicles within a confined geographical area for a specific time interval. A straightforward approach is to have all vehicles within the hovering area exchange messages with each other. However, this method does not guarantee that all vehicles within the hovering...
This paper introduces a platform for realistic and computationally efficient online vehicular networks simulation. It permits decentralized traffic management applications simulation as nodes mobility is modifiable at runtime thanks to the integration of two state-of-the-art network and traffic simulators. The platform embeds a tool that generates vehicular traces based on traffic counting data and...
In the near future vehicular networks based on wireless technology will be part of our lives. Efficient and robust routing algorithms will play a key role in the success of such technology. In this paper we present TrafRoute, an efficient and robust routing scheme for vehicular networks, suitable for both Vehicle-to-Vehicle and Vehicle-to-Infrastructure communications. TrafRoute introduces a novel...
Evacuation routing problem with mixed traffic flow is complex due to the interaction among different types of evacuees. The positive feedback mechanism of single ant colony system may lead to congestion on some optimum routes. Like different ant colony systems in nature, different components of traffic flow compete and interact with each other during evacuation process. In this paper, an approach...
A vehicular network is a promising application of mobile ad hoc networks. In this paper, we introduce a near-optimal broadcast technique, called CB-S (Cell Broadcast for Streets), for vehicular networks. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. Each mobile node is equipped with a GPS (Global Positioning...
In the Vehicle Ad-hoc NETwork (VANET), moving vehicles organize into a mobile wireless Ad-hoc network to share online traffic information. Each vehicle can issue a declarative query for aggregating the traffic information from others in order to facilitate the navigation and avoid traffic jam. Existing query methods suffer from high latency, incomplete results, and large messages due to the movement...
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.