Intelligent Lane Reservation System for Highway(s)

Highways tend to get congested because of the increase in the number of cars travelling on them. There are two solutions to this. The first one, which is also expensive, consists in building new highways to support the traffic. A much cheaper alternative consists in the introduction of advanced intelligent traffic control systems to manage traffic and increase the efficiency of the already existing highways. Intelligent lane reservation system for highways (ILRSH) is such a software control system. It is designed to assist and automate the use of a highway lane as a reserved lane. The idea is to allow and support drivers to travel at a speed higher, if in return they are willing to pay a small fee to reserve an empty virtual slot on the reserved lane. This slot is valid for a portion and of the highway and a time window, so each driver pays the fee depending thier its travelling needs. In return, drivers are guaranteed a congestion-free travel on that portion. In this paper, we present the proposed architecture of the ILRSH and its subsystems. The system is based on several proposed algorithms designed to assist the drivers, enter or exit the reserved lane, based on real-world driving observations. We present extensive simulation results showing the feasibility of the proposed approach, that can easily be implemented with little costs on already-existing highways, and the increase in traffic efficiency.


Introduction
Increasing passenger and freight travel led to growing congestions, with negative consequences on wasted energy, time, and money, increased pollution, and threats to safety. Highways especially are preferred for traveling at high speeds between distant locations. But today the highway infrastructures tend to remain behind the increase in the number of cars traveling on them. As public authorities fail to build new highways fast enough, congestions start to appear on the already existing ones. Previous studies showed that building new highways is not the answer to solving congestions [1,2], mainly because of the costs involved. Also the attractiveness of new routes just attracts more vehicles. In this paper we propose the intelligent lane reservation system for highway(s) (or ILRSH) system designed to increase the efficiency of already existing highways. ILRSH implements a system for "lane reservation." We propose reserving a lane of the highway for cars traveling on high speeds. Drivers wanting to travel on this lane have to pay a small fee to reserve an empty slot for a specific portion on that lane. In exchange, they are guaranteed a congestionfree travel on the highway. The lane is electronically managed by ILRSH, using sideway sensors, and mobile devices in cars communicating with a control server.
In this we present an extended version of the position paper first presented by Ravi et al. [3]. The authors describe the idea of using a reserved lane on the highway, together with a possible intelligent traffic control (ITC) system designed to manage it. They mention the components of such a system, present the (not so small) problems that have to be solved, and provide several preliminary solutions. In this we explore further the proposal and give concrete solutions to previous problems. We propose algorithms designed to support the systems. We validate our ideas using modeling and simulation, and we present results to sustain the feasibility of the proposed system.
The idea of implementing and enforcing an intelligent lane reservation system is novel and little explored. Lane reservation shares some goals with congestion pricing [4]. Congestion Pricing aims at equitable distribution of traffic across highways in order to handle congestion [5]. This is achieved by setting toll prices for different highways in proportion to the level of congestion in order to encourage drivers to travel on less congested roads. ILRSH also aims at handling congestion by prioritizing certain lanes on the highway. However, unlike congestion pricing which attempts to address the congestion of a roadway in a uniform manner, we propose differentiating services by introducing highpriority lanes to the roadway.
ILRSH includes several components. Because cars travel at high speeds, we propose components to electronically assist drivers to entry and exit the lane with minimum disruption on already-existing traffic. Special algorithms are designed to assist the drivers take safe decisions for entering and exiting the highway and/or the reserved lane. ILRSH, through its proposed components, is able to automatically manage reservations, and traffic management. As an extent, various ILRSH system can be interconnected and can communicate with each other in order to achieve higher goals: provide multileg reservations (routes spanning multiple highways), cancel/delay reservations for highway H 1 in case of a major incident on highway H 2 , and so forth. Having one ILRSH for each highway simplifies maintenance and provides a clear jurisdiction for each ILRSH. From a software design view, the ILRSH system's design (and implementation) can provide a clear set of services and methods that can also be used by other services/companies (it could support a public interface, in the form of an application programming interface or a web service). From an economical approach, because different ILRSHs would be managed by different companies, this can further generate competition and improvements in the management and scheduling algorithms in order to increase revenue. This will lead to higher quality of service, higher efficiency in using the reserved lane, lower prices for slots, and so forth. So ILRSH has important economic and social implications that benefit, in the end, the drivers as well as the public authorities.
The rest of this paper is structured as follows. In Section 2 we present the architecture of ILRSH. This is followed by the description of the proposed solutions for the reservation and monitoring components. They are at the foundation of the proposed algorithms for the lane entry assistance and the lane exit assistance components, presented next. In Section 8, we present evaluation results obtained using modeling and simulation. Section 9 gives conclusions and presents future work.

System Architecture
The general architecture of ILRSH is presented in Figure 1. The system includes several components: (1) a reservation and decision subsystem, (2) a lane entrance subsystem, and (3) an enforcement subsystem. The driver can reserve a slot on the reserved lane through the lane reservation subsystem. This subsystem includes a decision component, responsible with the scheduling of traffic slots, depending on the requests versus current traffic conditions. It uses a monitoring subsystem, which is responsible for preserving a correct model of the real-time traffic. The monitoring information is obtained either from sensors available within the highway infrastructure, but also from the wireless devices available in cars (the driver can monitor its current speed and feed-it back to the system, in return possibly negotiating smaller travelling fees). The monitoring sub-system also serves the lane-entrance subsystem (to support the decision of letting the driver enter/exit the reserved lane), and also the enforcement subsystem. The latter is used to control which cars are allowed and or not to travel on the reserved lane. If this subsystem detects a car on the reserved lane that did not pay the reservation fee, it could alert the competent In what follows we describe the design options for all these components. The reservation subsystem is served by an online service, invoked by the user either from his/her home PC (for advance booking), or from a mobile device (for on-spot reservations the driver can use his smartphone, or for the effective implementation of the proposed system any navigation device can be used). The lane entrance assistance system is based on vehicle-to-vehicle communication.
The decision system itself is composed of several logical components represented in Figure 2. The Monitoring subsystem is responsible for receiving context information from a set of monitoring boxes (sensors on the road level, monitoring the cars) and from the cars themselves (sending their positions).
The reservation subsystem is responsible for the management of the reservations. It takes decisions to accept or reject a request for a reservation, based on whether an empty slot is available (in case of requests for reservations specifying a certain interval of time in the future) or on the occupancy percentage of the reserved lane at current time and the number of valid reservations in the near future (for adhoc reservations). The component uses the services provided by an optional reservation policy subsystem, which implements the pricing policy (the policy regarding the fees that has to be paid by drivers for using the reserved lane), based for example on estimations of the profit made by the company managing ILRSH. Finally, the intermediary between the reservations and current road conditions is the management (and scheduling) of traveling cars subsystem. This component is responsible with monitoring and instructing drivers (in forms of suggestions that they receive ad hoc on their mobile phones) on how to modify their speeds in order to make the best usage of the reserved lane. All these components, together with their functions, are described in details in the next sections.
For ILRSH, we made several assumptions. The reserved lane is considered the leftmost lane for the countries where cars are driven on the right side (and the rightmost lane for the countries where cars are driven on the left side), because that is the lane with the greatest speed limit on highways.
The points where the highway is connected with an entry or exit road are called entry and exit connections.
The cruise speed (CruiseSpeed) on the reserved lane is considered to be 150 km/h, a bit higher than the allowed maximum speed (≈120-140 km/h) in some countries. When the local law requires the use of a lower cruise speed, the system is still able to perform well (in fact our simulation experiments show that lower speeds help cars to faster reach the speeds required to enter safe on the lane). Also, the minimum safety distance (D min-car-car ) between two consecutive cars traveling at CruiseSpeed is set by the local authorities. In our experiments we considered a safety distance of 100 m. This is different than the recommended distance between two cars traveling at top speed, which was set to D car-car = 125 m. These parameters are important as they affect the maximum capacity of the reserved lane.
We also made several assumptions about cars. First, a car traveling on the reserved lane must be able to reach a top speed of at least 16 km/h above the CruiseSpeed. This is because the system may require the driver, at some point, to drive faster in order to better arrange the cars traveling on the reserved lane. Also, we assumed an average car acceleration (considering the technical characteristics of several considered car models). For a smooth acceleration (to maintain the comfort of the passengers inside the car), we considered 15 seconds to be the time needed for the car to reach 100 km/h starting from 0. In our experiments we considered an acceleration of 1.85 m/s 2 . We considered similar values for the car's deceleration.
We also state that several ILRSH can be interconnected, and exchange information with each other to achieve higher goals: (1) provide multi-leg reservations, and (2) cancel/delay reservations for highway H 1 in case of a major incident on highway H 2 (in the event of an incident, cars pass very slow on H 2 , so the ones having a reservation on H 1 shall obviously be late or not able to make it at all).
Having one ILRSH for each highway simplifies their maintenance and provides a clear jurisdiction for each ILRSH. Supposing the system is applied on highways in a specific geographic area, all ILRSH are able to work as a distributed system. From a software design view, having one ILRSH for each highway, forces the ILRSH design (and implementation) to provide a clear set of services and methods that can also be called by other services/companies (i.e. a car renting company would also be able to provide a reservation for a hurried customer for a specific route).
From an economic point of view, because various ILRSH can be managed by various companies, the system can generate competition (just as between airlines, mobile phone operators, or Internet service providers), and improvements in the management and scheduling algorithms to increase revenue.

The Reservation Subsystem
The reservation subsystem is responsible for matching a free slot (empty space between two consecutive cars traveling on the reserved lane) with a reservation request, on a specific time interval. The free slot is a place that can be occupied by a car on the reserved lane, for a specified section of the highway. As mentioned, the relative distance between slots is approximately D car-car , and the relative time is T car-car , considering that cars travel at CruiseSpeed. A slot is valid from one entry point to another exit point (or connections on the highway, from where the car enters the highways until where it wants to exit), for a specific time window. The construction of such a slot depends on the reservation: where the driver wants to start, the required traveling time, and the distance until the desired entry/exit connection. The distance and time difference between slots follows safety regulations (the systems cannot be instructed to "squeeze" a car between two others, if this contradicts safety regulations).
A slot is considered empty on a section of the highway when, for that segment and specific time window, it has not yet been previously reserved. Once a driver reserves an empty slot for a specific section/segment, they are notified on the specific time the slot is centered at. The system allows for a time interval of 15 minutes before that time and 15 minutes after the time for the driver to reach the lane next to the reserved lane and to request to enter the reserved lane.
Reservations can be made from home or a mobile phone connected to the Internet. The user specifies the desired interval of time when will be traveling on the highway, the entry connection and also the exit connection. The reservation subsystem ( Figure 2) will search for an empty slot in that interval and will confirm the reservation centered at an exact time. The driver is then notified that he/she can request to enter the reserved lane in an interval of time 15 minutes before that exact time and at most 15 minutes after.
The system also allows adhoc reservations. The reservation subsystem will query the database for an empty slot as close as possible to the current time. If a reservation is found, the system informs the driver about the exact time the reservation is centered at. And it will also call the Lane entry assistance component to start the whole procedure for assisting the driver in entering the reserved lane.
Regarding the reservation policy, Ravi, et al. [3] describes several potential reservation policies. The general architecture of the ILRSH allows a reservation Policy subsystem to be designed and to directly communicate with the Reservation Subsystem. This reservation policy subsystem is important for the company managing the ILRSH since it will generate all its income (and therefore its profit).

Monitoring the Travelling Cars
The monitoring subsystem uses monitoring boxes within the road infrastructure and mobile applications running on cars. A monitoring box is equipped with sensors (to identify a car) and communications capabilities (to send back the acquired information to the Monitoring subsystem). For sensing these boxes could be equipped, for example, with video cameras. For communication each box could wirelessly send information to an area server (responsible for data collection), which in turns could send the data over wired links to the main monitoring server (such an architecture can lower costs, since each box would be equipped limited hardware).
In the proposed architecture, we use a specific naming convention: the monitoring boxes contain the same equipment, but have different names to distinguish their functions and placement on highway and side roads (the roads connected with the highway through entry and exit points, a difference used, e.g., by the Reservation subsystem). The first part of the name describes the function of the monitoring box, and the second part is used to represent its road placement (in all figures below).
The "after exit connection positioned on road" (AExC PoR) monitoring box (see Figures 3 and 4) is used to confirm that a car has exited the highway. It also records the speed of cars traveling on the exit road, and in case this speed goes below a specific limit, the monitoring Subsystem may conclude that the exit connection is jammed. It is positioned at a Dmb AExC PoR distance after the end of the exit connection. The AExC PoH monitoring box is used to confirm that a car has exited the reserved lane.
The "after exit connection, positioned on (the reserved lane of the) Highway" (AExC PoH) monitoring box is used to confirm that a car has exited the reserved lane, and to provide a clear image of all cars passing on the reserved lane. It is positioned at a Dmb AExC PoH distance after the end of the exit connection.
Another monitoring box could be the "after entry connection positioned on (the reserved lane of the) Highway" (AEnC PoH) one, but (as presented in Figures 3 and 4) this can be omitted. In fact, the system does not need to know what cars are on the reserved lane shortly after the entry connection-the reserved lane entrance algorithm (described below) is not tied to the road from where cars enter. After the entry connection, each car can travel for a while (short or long, depending on where the next free slot starts or is located) on the other lanes (just like the rest of cars), until it is allowed to enter the reserved lane. The same logic applies for a "before exit Connection, Positioned On (the reserved lane of the) Highway" (BExC PoH) monitoring box. There is no need for the system to monitor what cars are on the reserved lane shortly before the exit connection because drivers may leave the reserved lane (at various distances) before the exit connection (some drivers may decide to leave the reserved lane sooner, others shortly just before the exit connection). The important information is what cars are travelling on the reserved lane after the exit connection, which is handled by the AExC PoH monitoring boxes.
The "before entry connection positioned on road" (BEnC PoR) monitoring box is used by the Monitoring subsystem to control what (and how many) cars are entering the highway. It records the speeds of cars traveling on a particular entry road. In case the average speed decreases below a limit, the Monitoring subsystem may decide that the entry connection is jammed or working very slow. Therefore, the decision subsystem can use this information and compute or predict when to expect cars with valid requests to enter the reserved lane. Such monitoring boxes are also useful for implementing speculative execution algorithms for  The monitoring information includes the speeds of the cars passing through (this information is used by the monitoring subsystem to verify if a particular entry or exit connection is congested), and possible the identifiers of the cars passing by. The identifiers are used by the system to control when a car enters (using the BEnC PoR monitoring boxes) or exits the highway (using the AExC PoR monitoring boxes). From a security perspective the privacy of drivers is still preserved, the system could use virtual identifiers, disregarding the driver's identity, constructed in turn by the reservation subsystem.
In addition to the monitoring boxes, the monitoring system also relies on cars traveling on the highway to construct an accurate real-time model of traffic conditions. Cars can send data to the monitoring subsystem when entering the wireless communication range of the monitoring boxes. They can broadcast monitoring information back to these boxes, including their identifiers and current GPS-based locations (and travelling speeds). But the system can also function even in the absence of car's information. The monitoring boxes could, for example, be responsible with recognizing the cars. But when cars are used the monitoring information becomes more accurate, and can be used to increase the fidelity of the traffic model. In return, when cars participate in the sending process, they can receive incentives in the form of reduced negotiated fees to enter the reserved lane.
When a car at the entry on the highway receives broadcast information from a monitoring box, it will query the Monitoring subsystem whether that monitoring box is valid or not. Cars ignore by default the information they receive from monitoring boxes they are not expecting. To be considered expected, the box must either be "the next valid one" according to the broadcast information of the last valid box, or be "the next valid one" when the car queried the monitoring subsystem.
We also propose several solutions for placing the monitoring boxes. A first possible solution envisions the monitoring boxes placed on the highway and on side roads (at the connection with the highway). This solution uses all types of monitoring boxes. In this approach, the monitoring   boxes will be placed as previously described. The monitoring process will not require cars to send monitoring information, because it relies only on the information sent by the monitoring boxes. An alternative approach consists in the use of only a few monitoring boxes combined with the information (position, time) sent by cars. Such a solution uses the AExC PoH monitoring boxes to send broadcast requests for cars to report data when they are within wireless communication range. The system monitors the status of the reserved lane by relying on the information sent by cars. When a car passes through a monitoring box, it sends its identifier and current position. In this case a 100-150 m distance can provide a good resolution and not flood the system with information sent by cars. The issue of trusting the data received from cars can be resolved using the approach we previously explored in [6].
Finally, a third solution combines the first and second approaches. First, using the monitoring boxes, the system receives monitoring data from its own equipment. Second, the cars are reporting as they pass the monitoring boxes. This offers a fine resolution for the whole system on the actual situation on the reserved lane. The comfortable number of monitoring boxes assures against also any "hacker drivers." International Journal of Vehicular Technology 7

Explored Solutions of Decelerating and Accelerating the Cars
Several solutions are proposed for advising the drivers when to decelerate and then accelerate in a controlled and stable manner to allow the safe entrance on the reserved lane of another car. The solutions presented in this Section are used by the lane entry assistance component of the proposed system. We first introduce several concepts. The absolute deceleration position (ADP) is a point where the platoon of passing cars must start a deceleration process with a reference deceleration. By platoon we do not mean that cars are automatically assisted in following each others, but we use the term to denote a queue of cars driving together along the reserved lane in a formation, a line, filling up as best as possible (as instructed by our proposed system) the spaces on that lane. The absolute acceleration position (AAP) indicates where cars should start accelerating with a reference acceleration. Also, car 1 is the first car reaching the ADP, and car n the last car that is affected by ADP. Cars following/after car n keep driving with CruiseSpeed. The acc and dec are the values for the reference acceleration and reference deceleration (values are equal).
We present a first solution called the decelerated platoon. It works as follows. At t = t y,ADP , the car y reaches ADP and starts decelerating. At t = t y+1,ADP = t y,ADP + T car-car , car y+1 reaches ADP after T car-car , and starts decelerating. When car y+1 reaches ADP, car y would have gone a distance equal to Δx y,y+1 t y+1,ADP = CruiseSpeed · T car-car − dec · T car-car 2 . (1) Because car y and car y+1 decelerate with the same deceleration, Δv is preserved as follows: Δv y,y+1 t y+1,ADP = v y t y+1,ADP − v y+1 t y+1,ADP = CruiseSpeed − dec · T car-car .
Since car y and car y+1 start decelerating when they reach the same ADP and accelerate at the same AAP, the time between them is preserved. In this case car y+1 reaches the same position and speed as car y at exactly T car-car after car y .
Because v y (t y,AAP ) is the same for all car y , we can use: At t = t y,AAP + τ y,ADP−AAP = t y,ADP + 2 · τ ADP−AAP , car y reaches CruiseSpeed. At t = t y+1,AAP + τ y+1,ADP−AAP = t y,ADP + 2 · τ ADP−AAP + T car-car , car y+1 reaches CruiseSpeed. So the distance between these cars is In conclusion, the distance between cars is preserved. The solution has the advantage that after cars reach CruiseSpeed again, the initial configuration is fully restored. Slowing down car 1 has created a larger distance between it and the car in front of it, which is recovered by slowing down cars once they reach ADP (and accelerating them to CruiseSpeed after AAP).
To delete the decelerated platoon, we first explored the alternative of suddenly deleting the ADP. The problem is that car n travels at a speed that keeps decreasing, while car An continue traveling at CruiseSpeed. In this case at t = t n,ADP , car n starts to decelerate. At t = t n,ADP + T car-car , car An reaches ADP, but still drives at CruiseSpeed, while car n still decelerates. At t = t warning , car n and car An reach the smallest allowed distance (for safety reason), which is D min car-car . Considering Δt = t warning − t n,ADP , it is easy to see that (because the rule Δx n,An > D min car-car must apply), which results in: (D car-car − D min car-car ) · 2 dec > Δt.
For ILRSH's considered parameters, this means that the maximum allowed value is Δt ≈ 5.2 s. Otherwise, in the best case car An will get to close to car n . Such a small time is insufficient for a safe implementation of the proposed system. We next turned to an alternative solution, where the ADP is allowed to move towards AAP with a speed v ADP , right after the first cars in the platoon passes by. When ADP reaches AAP, the platoon is basically deleted. AAP, ADP and v ADP can be computed from the beginning, based on the target low speed V that car 1 needs to have when it reaches AAP.
The formulas again consider the generic case of two cars, car y and car y+1 , traveling on the reserved lane. At t = t y,ADP , car y reaches ADP. At t = t y+1,ADP = t y,ADP +T car-car +t d , car y+1 reaches ADP. Between the two moments ADP travels the x d distance.
Because ADP moves with v ADP , the distance x d decreases starting from the initial distance between ADP and AAP, denoted by d ADP−AAP . The two cars will travel different distances: At time t = t y,AAP = t y,ADP + τ y,ADP−AAP , car y reaches AAP. The τ y,ADP−AAP is the required time for car y to travel between ADP and AAP. Consider v y t y,AAP = CruiseSpeed 2 − 2 · dec · d y,ADP−AAP (9) τ y,ADP−AAP = CruiseSpeed − v y t y,AAP /dec.
At time t = t y+1,AAP = t y+1,ADP + τ y+1,ADP−AAP , car y+1 reaches AAP. Consider  Note that v y+1 t y+1,AAP > v y t y,AAP , which means the low speed cars reach AAP at increased speeds (cars with higher y index will have a higher low speed when they reach AAP). Also because we get τ y+1,ADP−AAP < τ y,ADP−AAP , which means cars take less time to travel between ADP and AAP. By continuing this logic, it is easy to see that the smallest distance between cars is when y = 1. This is why the parameters are computed so that the minimum distance Δx 1,2 = D min car-car .
The implementation of the proposed algorithm is described in Algorithm 1. Figure 6 gives a good representation of all values v ADP can take. We also present in a subsequent section more results for several computed parameters of the decelerated platoon, constructed for various values of V .

The Lane Entry Assistance Component
Since cars travel on the reserved with 150 km/h, consecutive cars pass a fixed observation point every 3-4 seconds. It is difficult for a driver to observe where a free slot is, and enter the reserved lane and reach the CruiseSpeed. The lack of automated assistance can, therefore, lead to accidents (the worst case) and great traffic disruptions (the best case scenarios). So, a lane entry assistance component (LEAC) is needed to assist both the entering car and the already traveling on the reserved lane cars.

Rules of Assisting the Entrance the Reserved Lane.
A car can be assisted to enter the reserved lane after it has traveled a distance of at least D afterMB after any valid AExC PoH monitoring box or, in case the AExC PoH is broken, after a valid IB PoH monitoring box. D afterMB is equal or greater than the RD computed by the LEAC's algorithm when the car requests to enter the reserved lane.
A car is not allowed to enter the reserved lane 200 m prior to the exit connection (for a car traveling at 150 km/h this means roughly 5 seconds; this is a sensitive time interval when the driver prepares to exit the highway and does not need any interference, and it will not pay attention to the system, assuming the system tries to assist another car to enter the reserved lane).

The Proposed Algorithm.
The algorithm is based on the relative speed between cars and will create a "decelerated platoon," inside it cars have lower speeds the closer they are to the empty slot. The new car will occupy the empty slot. Basically, in the first phase, when each car passes by "absolute slowing down position" ASDP it will be required to slow down with the reference deceleration; the distance between the cars in the platoon will decrease. Then, in the second phase, ASDP will be deleted and absolute acceleration point (AAP) will be created; when each of the cars in the platoon passes by the AAP, it will be required to accelerate, and so the initial configuration will be reconstructed (when they all reach CruiseSpeed).
We propose several names for the key cars in this case. NC-"new car"-is the car that wants to enter the reserved lane and will occupy an empty place there on the reserved lane. AEP-"after empty place" car-is the car occupying its own slot on the reserved lane, but after the empty place. IFEP-"in front of the empty place" car-is the car right in front of the empty place, the opposite of AEP.
When the car having a valid reservation enters the lane, next to the reserved lane it can send a request to enter the reserved lane. At this point, the lane entry assistance component becomes aware that the car is traveling with a speed v low while the cars on the reserved lane travel at the high speed of CruiseSpeed.
The system computes the required distance RD and time RT for a car traveling on the reserved lane to decrease its speed by half of Δv CS−NC = CruiseSpeed − v low (this way when AEP has traveled RD, AEP and NC will be traveling on the reserved lane at approximately the same speed). Afterwards, based on the NC's position, it will search for an empty place on the reserved lane (therefore an empty slot) at a distance equal or greater that RD; the LEAC can also "invent" an empty place at half the distance between 2 cars traveling at a regular distance, so it will basically "insert" NC between them, and in the end arrange all of them to respect D car-car . The system will keep track of that empty place and will position NC on it at the right time; it will send an estimated time to NC on how long it will take that empty place to reach it; it will also send an estimated time to AEP and the cars after it, so these drivers will know how long they have before starting to slow down. 1. First decide the v 1 (t 1,AAP ) = V ≤ CruiseSpeed 2. Then compute d ADP-AAP = (CruiseSpeed 2 − V 2 )/2dec, and τ 1,ADP-AAP = (CruiseSpeed − V )/dec. 3. ADP will be placed at d ADP-AAP before AAP. 4. Compute Compute v ADP = x d /(T car-car + (x d /CruiseSpeed)). 6. Compute d ValidLarge (the number of cars affected by the decelerated platoon) and broadcast it to all cars at maximum d ValidLarge after car 1 .
Algorithm 1: The proposed algorithm for decelerated platoon.
After the entry connection, NC will travel for a while on the other lanes until it is allowed to enter the reserved lane. When that empty place is at a distance of RD from NC, that position becomes ASDP. When AEP passes by ASDP, it will receive the signal to slow down with the reference deceleration. When the car occupying the next slot right after AEP passes by ASDP, it will receive the same information, and will start decelerating. Technically, since it occupies right the next slot after AEP, this car will start slowing down after T car-car seconds (the distance between these cars will decrease in the first phase by car d ·T 2 car-car /2, and then every second due to the difference in speeds between them Δv = car d · T car-car ). After it passes ASDP, the same thing will happen for the next car, but now having as reference the one after the AEP and so on. So, the difference in speed between every 2 cars that occupy consecutive slots in the decelerated platoon is Δv. The same difference in speed will be between the last car of the platoon and the first one after the platoon.
When IFEP passes by NC, it will signal it to enter the reserved lane; the same signaling will come from the lane entry assistance system in case there is no car right in front of the empty place (i.e., when the reserved lane is free on that portion).
After NC enters the reserved lane, it will start accelerating with at least the reference acceleration. When AEP has traveled RD from ASDP, no car passing by ASDP will start decelerating any longer; the current position of AEP will become AAP and each of the cars in the platoon will start accelerating when they pass by AAP; also, at this point AEP and NC should approximately have the same speed and the distance between them will be v low · RT + car a · t 2 /2, which is greater than D min car-car and around D car-car .
When NC reaches CruiseSpeed, there is a greater distance (GD) than D car-car between it and IFEP; at the same time the last car in the decelerated platoon has a smaller distance (SD) than D car-car between it and the car right after it. To make up for this, first NC will be brought at around D car-car of AEP, and then NC and the platoon will be told to drive at a speed of 16 km/h greater than CruiseSpeed, so GD will decrease by 4.47 m/s and the SD increases by the same value; they will use CruiseSpeed when GD reaches D car-car .

The Lane Exit Assistance Component
The reasons for the design of lane entry assistance component (LEAC) are similar to the ones presented for the lane exit assistance component. First, to avoid accidents due to the speed difference, cars on the reserved lane travel at a much higher speed than the speed required when entering the dedicated exit or the speed that cars travel on the lane next to the reserved one. Second, we want to minimize the traffic disruption generated by the exiting car (which is slowing down).

The Considered Cases for the Exit Connection
When the Driver Reaches It. When the driver reaches the desired exit connection, the following possible cases need to be considered.
(i) Ideal case: the desired exit connection is free, so the driver can exit the highway.
(ii) Win-Win case: the desired exit connection is jammed, but the driver is still allowed to drive on the reserved lane (the system still has free slots) until reaches the next exit connection. The driver wins because it will travel fast to the next exit, and the system wins because it will charge the driver for the additional use of the reserved lane.
(iii) "Driver loses" case: when it reaches the exit connection, the driver is forced to exit the reserved lane, although the exit is jammed, because there are no free slots that the system can sell. The driver loses time because they will be forced either to use the low speed lanes until it reaches the next free exit, or stand in lane at the jammed exit connection.
(iv) "Lane loses" case: this approach tries to solve the "driver loses" case by making the reservation Subsystem reserve by default the following next x exits after the one the driver has specified. This way, the system International Journal of Vehicular Technology knows for sure that the driver will be able to exit the highway using the first free exit connection, from the interval up to the xth implicitly reserved. So, the driver wins. The system loses because the slot starting from the driver's desired exit up to the x th exit is considered reserved, although there is quite a small probability that the driver will go all the way and pay for all; the driver will pay for all just in the case all the exits are jammed until the xth. (v) ""Lane loses" solution based on statistics": We can compute statistics on the occupancy level of each exit connection, on days and hours. Each exit will receive a score reflecting its occupancy level. Based on these statistics, the system will be able to determine whether an exit connection is likely to be jammed or not for the specific time that the driver will use it. If the system decides that the exit is going to be jammed, it will search until the xth exit and find the first exit that it expects to be free. It will tell the driver that it has reserved until the xth exit connection because that is the first exit that the system expects to be free starting from the driver's desired exit connection. The system risks because it will get to charge the driver just like in the "lane loses" case, that is, in the case the driver is forced to travel to another exit than the desired one. However, the system only risks in part, because it expects all those exits until the xth to be jammed, so it is very likely that the driver will drive to the free exit, and the system will get paid. In case that even the xth exit connection is jammed, although it should not have been, ILRSH will try to apply the "win-win" case if possible; if it is not possible, then the "driver loses" case.

The Algorithm.
The lane exit assistance component is somewhat similar to the LEAC (lane entry assistance component), since it uses the same concept of "decelerated platoon." Let us consider that the exiting car (EC) can exit through an exit connection. If it is a dedicated exit connection, then the exit point is exactly the exit connection. If it is a standard exit connection, then the exit point is somewhere before that exit connection, so EC can exit the reserved lane, enter a low speed lane on the right, and may cross the other lanes until it reaches the exit connection. Both cases require EC to reach a v low speed until the exit point.
The system will compute the required distance (RD) and required time (RT) for the car to reach v low at the exit point, considering it decelerates with the reference deceleration. So, at RD before the exit point, the system will define the ASDP (just as in the algorithm for LEAC). All cars, when passing by ASDP, will receive the signal to slow down with the reference deceleration and they will form the "decelerated platoon." Same observations apply here, regarding the decreasing distance between cars and the relative speed Δv between cars.
After EC has exited the reserved lane, no cars passing by ASDP will start decelerating any longer; at the absolute position of AEP, the system will create AAP; when each of the cars in the platoon passes by AAP, they will start accelerating and when they all reach CruiseSpeed the initial configuration is reconstructed. Of course, the distance (called SD) between the last car in the platoon and the slot after it is smaller than D car-car , so just like in LEAC all the platoon will be brought at a speed higher than CruiseSpeed until SD reaches D car-car .

Experimental Results
To evaluate the performance of the proposed solution, we next performed a series of simulation experiments. In these experiments the simulated model consisted of different cars and monitoring boxes. For the presentation of the decelerated platoon, the simulation scenario consists of a platoon of 10 cars. The simulated conditions are the ones assumed and presented in the previous sections (cars on the reserved lane can travel, e.g., at approximately 150 km/h). For the obtained results, the dotted lines are positions of ADP and AAP. Figure 7 shows how the decelerated platoon preserves the distance and time between the members of the platoon. As noticed, the created distance between car 1 and the car in front of it is recovered by having a decreased distance between the last car of the platoon and the car after it (see Figure 7(c)). Figures 8 and 9 show that collisions are more likely to occur when V decreases. Of course such an approach cannot work, and this is why we next turned to the decelerated platoon algorithm previously presented. In these figures the "position" is measured in meters. For the decelerated platoon, the two extra horizontal lines that appear are the fixed positions of ADP and AAP that affect the predefined platoon of 10 cars. For the graphics based on the solution of Decelerated Platoon, two extra lines appear: the horizontal line is the fixed position of AAP and the one below is ADP, which starts moving towards AAP once it becomes active (once active, ADP affects cars only until it reaches AAP).
The "speed" is measured in meters/seconds. It shows how the speed of each car modifies over time (CruiseSpeed = 41.67 m/s and the cars affected by deceleration record lower speeds); the main goal is to obtain values closer to the CruiseSpeed because that means less disturbance for cars since they have to decelerate less.
Finally, the "distance between cars when they reach CruiseSpeed again" is measured in meters and is measured for every two consecutive cars.
Next we evaluated the lane entry algorithm. We started with V NC (t 0 ) = 0.00 m/s, meaning that car NC is stopped on the lane next to the reserved lane, because that lane is jammed. Figure 10 shows how the lane entry algorithm works based on the solution of deceleration/acceleration of cars implemented in the ILRSH. Figures 11 and 12 show how the lane entry algorithm works. Figure 11 considers the case of 125 m between all cars, and Figure 12 considers the case of a distance of 250 m between car IF and car 1       better. This is why for small values of V NC (t 0 ) the number of affected cars is also small.

Conclusions
In this paper, we made a case for prioritizing lanes on highways in order to provide congestion free travel during   periods of high volume. We described the design rationale of an intelligent lane reservation system.      The ILRSH's general architecture has been described, together with its components: reservation subsystem, monitoring subsystem, lane entry assistance component, and lane exit assistance component. We presented architectural design details for these components, together with algorithms to assist the driver take safe decisions, without disturbing International Journal of Vehicular Technology 13 the normal flow of cars on the highway. We also presented evaluation results that demonstrate the feasibility of the system.
The proposed system is capable to increase the efficiency of the highway. Without ILRSH cars are forced to travel at a lower speed (depending on the local traffic regulations). When the ILRSH system assists the driver, the result is a lane where cars travel at a higher speed, while still travelling in safe driving conditions. With the support of modern technology drivers are, therefore, assisted in taking the most efficient driving decisions. In turn, the capacity of the highway increases because the flow of cars increases per time interval.
Algorithms similar to speculative execution could be further implemented in the management of traveling cars subsystem, in order to better arrange the traveling cars and prepare the free slots for those cars that have just entered the highway and, since they are having a valid reservation, they are expected to request to enter the reserved lane as soon as they get on the lane near the reserved lane. (The speculative execution may start when BEnC PoR monitoring boxes identify such cars). These new algorithms may require "positioned on road" monitoring boxes to send more information.