A NOVEL VEHICLE SEQUENCING ALGORITHM WITH VEHICULAR INFRASTRUCTURE INTEGRATION FOR AN ISOLATED INTERSECTION
|
|
- Vernon Walker
- 6 years ago
- Views:
Transcription
1 8 th International Conference of Modeling and Simulation - MOSIM 10 - May 10-12, Hammamet - Tunisia Evaluation and optimization of innovative production systems of goods and services A NOVEL VEHICLE SEQUENCING ALGORITHM WITH VEHICULAR INFRASTRUCTURE INTEGRATION FOR AN ISOLATED INTERSECTION F. YAN, M. DRIDI and A. EL MOUDNI Laboratoire Systèmes et Transports Université de Technologie de Belfort-Montbéliard Belfort cedex, France {fei.yan, mahjoub.dridi, abdellah.el-moudni}@utbm.fr ABSTRACT: In this paper, we study a novel vehicle sequencing algorithm for an isolated intersection with a new control method. The control method is based on the utilization of Vehicular Infrastructure Integration and the consideration that each vehicle arrives individually. We consider knowledge of each vehicle s arrival time and the time each vehicle needs to traverse the intersection. Our objective is to schedule all approaching vehicles to pass this intersection in the shortest duration, the throughput of the intersection will then be increased. A Branch and Bound algorithm and a heuristic are proposed to evacuate the approaching vehicles as soon as possible. Structural properties of the problem are carefully investigated to simplify the search procedure of an optimal passing sequence. Simulation results in evacuation time, average waiting time and average queue size demonstrate the performance gain obtained when using the proposed schemes. KEYWORDS: Isolated intersection, Vehicular Infrastructure Integration, Vehicle arrival time, Branch and bound. 1 INTRODUCTION Traffic congestion at intersections is one of the main issues to be addressed by today s traffic management schemes. Countless efforts have been made directed toward efficiently improving the traffic situation at intersections. However, although there are well-planned road management schemes, sufficient infrastructure for transportation, we still face the congestion of traffic, especially at the intersections. The construction of additional infrastructure may be considered as one of the solution for the problem, but it is less feasible owing to political and environmental concerns. This urges researchers to find other methods to improve the efficiency of traffic control at intersections. The enhancement of high-tech information and communication technology such as the low cost wireless connectivity, miniaturization of computing devices, and availability of Global Positioning System (GPS) provoked the emergence of intelligent vehicles equipped with In-vehicle Information System (IVIS). The Vehicular Infrastructure Integration (VII) technology came forth under this background. Many realtime message dissemination systems and reliable information exchange protocols were proposed to cater to the development of new traffic control systems. For example, a wireless traffic light system is proposed, where information about current lights status, location of intersection, and a reference point are broadcasted periodically (Huang Q.-F. and R. Miller, 2003). Intelligent devices that can be embedded in next generation vehicles were invented to provide the drivers with a real-time view of the road traffic far beyond what they can physically see (Nadeem T. et al., 2004). Vehicles equipped with this device can disseminate traffic information using short-range wireless communication. Besides, approaches and algorithms were proposed focusing on scheduling the traffic signal to maximize the traffic throughput while minimizing the average latency with various theories. For instance, based on new embedded devices and communication technologies, car platooning investigations aiming at increasing the capacity of roads by reducing temporal distances between vehicles were extensively discussed (Pan Y.-J., 2008), (Contet J.-M. et al., 2007). A reservation based system for alleviating traffic congestion at intersections is proposed in (Dresner K. and P. Stone, 2004) and (Dresner K. and P. Stone, 2006). Vehicles are controlled by agents under the assumption. Queuing theory is implemented in traffic control, and the problem of scheduling traffic at an intersection was addressed by structuring the problem as a Markov decision process (Yu X.-H. and A. R. Stub-
2 berud, 1997). A new approach of traffic control at intersection is proposed that requires communication with a center controller at intersection (Wunderlich R. et al., 2008). This approach needs the information about the intended route of each vehicle that reaches the intersection. There are also researches to predict vehicle s accurate arrival time at the intersection with both the historical and real-time GPS vehicle location data (Tan C.-W. et al., 2008). Based on the knowledge of each vehicle s arrival time at intersection, algorithms in (Wu J. et al., 2009) aim at scheduling approaching vehicles to pass the intersection taking into account each vehicle arrives individually, but authors only considered the control strategy for a 2-way intersection. All these efforts in wireless communication and schedule algorithms share a common goal: to improve the traffic situation at controlled intersection while guaranteeing the driver safety. We study in this paper a more general problem to guide vehicles through the intersection with the consideration of Vehicular-to-Infrastructure communications. We assume that there is a controller in the center of the intersection and all vehicles equipped with IVIS are capable of communicating with the center controller in some fashion. The vital telemetry data of each vehicle can be obtained by the controller once the vehicle enters the controller s control range. Basically, we assume knowledge of the vehicle s accurate arrival time at the intersection, which is possible in very near future with development of Intelligent Transportation System. Decision of vehicle passing sequence will then be made and broadcasted to all vehicles. A Branch and Bound algorithm and a heuristic are proposed for finding an optimal vehicle passing sequence. Structural properties of the problem are carefully studied to simplify the search procedure of the Branch and Bound algorithm. The rest of this paper is structured as follows: In Section 2, we specify the studied problem, along with some useful notations that will be used in the sequel. In Section 3, the structural properties of the problem are carefully investigated. Algorithms are presented in the section follows. In Section 5, various traffic scenarios are simulated to compare the proposed control strategies with a traditional fix-cycle time traffic lights technique. Conclusions are drawn in the last section. 2 PROBLEM DEFINITION 2.1 System model To specify the problem we study, an example of the intersection under consideration is presented in figure. 1. This intersection appears frequently in realword traffic networks. It is a four-approach intersection with through lanes (some also serve as right-turn lanes) and exclusive left-turn lanes. The controller is located in the center of intersection with same control range for the four directions. Vehicles approaching the intersection should inform the center controller their data after enter the control range, and vehicle overtaking on same lane is not allowed. According to frequently used traffic convention, lanes on which vehicles can pass through intersection without conflicts are compatible. For example, lane 1 and lane 2 in figure. 1 are compatible lanes. We define all the vehicles on compatible lanes as one Vehicle Class (VC). Thus, all the vehicles in the control range can be divided into several vehicle classes according to the lanes they are running on. Vehicles on incompatible lanes (or vehicles in different vehicle classes) can not traverse the intersection at same time. For the reason of safety, there is usually a time duration between two vehicles from different vehicle classes during which no vehicles behind the stop lines can pass intersection. We define this time as the integral stop time and we assume that this time duration is a constant only decided by the vehicle class that will get the authorization of using the intersection. For instance, the integral stop time when changing authorization from vehicles on lane 1 to vehicles to lane 3 is only decided by the vehicles class that contains lane 3. Suppose at time t 0 = 0, there are n vehicles in the control range approaching the intersection from different directions, and the data of all vehicles have been received by the controller in a very short time. The information of each vehicle contains four parts: Vehicle identification (ID): used to identify the records belonging to different vehicles. Lane number: which lane it is moving on. Vehicle arrival time: the precise time it arrives at the stop line from time t 0. Vehicle passing time: the time it needs to accelerate from stop line until it reaches a safe distance to its follower on same lane (only related to the type of vehicles). The vehicle passing time depends on the type of vehicles, for example, cars and trucks. Normally, trucks are slower to change speed and, therefore, use more time to accelerate until it can reach a safe distance for the vehicle following it on same lane to start. Our objective is to decide an vehicle passing sequence to minimize the evacuation time (the time all vehicles passing the intersection) of all vehicles. The minimization of the evacuation time will naturally increase the throughput of the intersection in consequence. It should be noted that the control technique may be applied to any intersection layout.
3 l i, the number of lanes in VC i. l (i,l), the l th lane in VC i, where 1 l l i. n (i,l), the number of vehicles on lane l (i,l). v (i,l,j), the j th vehicle on lane l (i,l), the j is indexed according the arrival precedence of vehicles on lane l (i,l). a (i,l,j), the arrival time of v (i,l,j), i.e., the time v (i,l,j) needs to arrive at the stop lane (or the waiting queue) from time t 0. s (i,l,j), the time vehicle v (i,l,j) starts to pass the intersection. Figure 1: Schematic of intersection control with Control Device As a conclusion, the constraints of the problem can be described as: 1. All vehicles approaching the intersection are partitioned into several vehicle classes. 2. There are several lanes in each vehicle class. 3. Vehicles on each lane need to pass the intersection in First In First Out (FIFO)-way. 4. Before a vehicle pass the intersection, the vehicle after it on same lane cannot start to pass even it has arrived. 5. Vehicles in same class but not the same lane may pass the intersection simultaneously. 6. There is a time duration (integral stop time) between two vehicles from different vehicle classes during which no vehicles behind the stop line can pass intersection. 2.2 Formulation In the following, the formal description of the problem is given. At first, some notations that will be used are defined. Suppose there are n vehicles approaching the intersection and all vehicles are partitioned into m vehicle classes according to the lanes where they are running on. In each class, vehicles are separated on different lanes. VC i, the i th vehicle class, where 1 i m. n i, the number of vehicles in VC i. s i, the integral stop time of VC i. p (i,l,j), the passing time of v (i,l,j), i.e., the time v (i,l,j) needs to accelerate from stop line until it reaches a safe space to the vehicle following it on same lane. C (i,l,j), the time that vehicle v (i,l,j) have a safe space to the vehicle following it on the same lane. Thus, for n vehicles detected at time t 0, the objective function to minimize can be described as max{c (i,l,j) } 1 i m, 1 l l i, 1 j n (i,l) s (i,l,j) a (i,l,j) C s.t. (i,l,j) = s (i,l,j) + p (i,l,j) s (i,l,j+1) C (i,l,j) C (i,l,j) C (i,l,j ) s i, if i i and C (i,l,j) C (i,l,j ) In order to design an efficient algorithm, we need to study the structural properties of the problem first. 3 PROPERTIES OF THE PROBLEM In order to derive an algorithm that can find an optimal vehicle passing order from time t 0 = 0, we need study the structural properties of vehicle data. These properties will be used to simplify the search procedure of the algorithms we are going to present. First, we need some definition about the vehicle group. A vehicle group G is defined as a set of vehicles from same VC that pass intersection without the interruption of vehicles in other VC. Specifically, a vehicle group will have the following properties: 1. A vehicle class has at least one group of vehicles. 2. Each vehicle should be in one and only one group. 3. There may be idle time waiting for some vehicles to arrive in a group, but there is no integral stop time during the passing process of vehicles in one group.
4 The completion time of a vehicle group is defined as the maximum completion time of vehicles in this group, i.e., C G = max{c (i,l,j) }, where v (i,l,j) G. It is easy to notice that vehicles pass intersection in the sequence of vehicle group. Then we can describe the order of vehicles as a group sequence GS: GS = (G 1, G 2,..., G b ), b m. The problem of finding an optimal passing order of vehicles changes to the problem of partitioning vehicles into different groups and finding an optimal group sequence to minimize the vehicle evacuation time. Since there are lanes in each vehicle class and vehicles on each lane should pass the intersection in a FIFOway, we need to partition vehicles into groups, taking into account the vehicle sequence on different lanes. We can then have the following lemma. Lemma 3.1 Consider there are two vehicles v (i,l,j), v (i,l,j ) on lane l (i,l) with v (i,l,j ) arriving at the stop line after v (i,l,j), i.e., j < j. Then we have: time of all un-partitioned vehicles on this lane after G r. Then we can have the following property: Property 3.2 There is an optimal vehicle group sequence, in which any group G x from VC i (1 x b) has at least one vehicle belonging to lane l (i,1). Proof. Suppose there are only two lanes in VC i, the last group before G x is G r and its completion time is C Gr. l (i,1) is the lane that has maximum P (i,l) of these two lanes after time C Gr, we denote another lane as l (i,2). Let v (i,1,y) and v (i,2,y ) denote the first un-partitioned vehicle on lane l (i,1) and l (i,2) after time C Gr, respectively. An example is presented in figure. 2. In the figure, each rectangle indicates a vehicle in control range, the left side of rectangle shows the arrival time of this vehicle and the length of rectangle represents its passing time. The rectangle order from left to right denotes the vehicle arriving sequence on same lane. Suppose 1. a (i,l,j) < a (i,l,j ), and C (i,l,j) < C (i,l,j ). 2. In the required group sequence, either v (i,l,j) and v (i,l,j ) (j < j ) are included in same group, or included in two different groups: (a) if v (i,l,j) and v (i,l,j ) in group G, any {v (i,l,k), j < k < j } G. (b) if v (i,l,j) and v (i,l,j ) are contained by two different group G and G, respectively, there must be G passing the intersection before G in the group sequence. Suppose there is a partial group sequence, in which some groups are already made, but no decision has been taken yet on partitioning the remaining unpartitioned vehicles. Some extra notations are given: C Gr, the completion time of the partial vehicle group sequence, i.e., the completion time of the last group G r of the partial sequence, where 1 r < b. v (i,l,y), the first un-partitioned vehicle on lane l (i,l) of VC i after G r. P (i,l), the sum of passing time of all unpartitioned vehicles on lane l (i,l) of VC i, i.e., P (i,l) = n (i,l) j=y {p (i,l,j)}. Each time after a group is formed, we reindex the lane that has the maximum P (i,l) of all lanes in VC i as lane 1, i.e., l (i,1) and P (i,1) is the sum of passing Figure 2: Example of property 3.2 that G x only contains vehicle v (i,2,y ) without v (i,1,y) in the required group sequence GS. It s easy to see that after the pass of group G x, the lower bound of evacuating all un-partitioned vehicles in VC i is the maximum P (i,l) of these two lanes plus the integral stop time of VC i, i.e., P (i,1) + s i. We can obtain a new vehicle group sequence GS by deleting group G x and inserting v (i,2,y ) into the group that contains v (i,1,y). One can notice that this change will reduce the overall evacuation time. Thus, GS is also optimal. Continuing this procedure, we can eventually have an optimal group sequence with this property. This property can be easily applied to the vehicle class with more than two lanes. Consider we are going to partition vehicles in class VC i after a partial group sequence, and the completion time of this partial sequence is C Gr. We can have the property follows: Property 3.3 Suppose G x (1 x b) is a group containing vehicles in VC i, If 1. C (i,l,y ) C (i,1,y) or
5 2. 0 < C (i,l,y ) C (i,1,y) P (i,l) (P (i,1) p (i,1,y) ), there is an optimal group sequence, in which vehicle v (i,1,y) and v (i,l,y ) are both contained in G x. Proof. Suppose there are only two lanes in VC i : l (i,1) and l (i,2). Under the assumptions above, we can deduce that the completion time of these two vehicles v (i,1,y) and v (i,2,y ) are C (i,1,y) = max{c Gr + s i, a (i,1,y) } + p (i,1,y) and C (i,2,y ) = max{c Gr + s i, a (i,2,y )} + p (i,2,y ). By property 3.2 we know that there is an optimal group sequence in which G x contains vehicle v (i,1,y). If C (i,2,y ) C (i,1,y) (figure. 3. for example), it is is an optimal group sequence in which vehicle v (i,1,y) and v (i,2,y ) are contained in same vehicle group. Properties 3.2, 3.3 are mainly about the first unpartitioned vehicle on each lane of same vehicle class after the completion time C Gr of a partial sequence. we now give a property with regard to all the unpartitioned vehicles of same vehicle class. Property 3.4 There is an optimal sequence, in which a vehicle group G x contains all un-partitioned vehicles in VC i after time C Gr if we have 2s i C Gx C Gr P (i,1). Proof. Suppose there are only two lanes in VC i, the last group before G x is G r and its completion time is C Gr. An example is given in figure. 5. In the Figure 3: Example of property 3.3, 1) Figure 5: Example of property 3.4 clearly to see that the containing of vehicle v (i,2,y ) in group G x does not delay rest vehicles. Otherwise, it will probably cause a time duration to make vehicle v (i,2,y ) pass the intersection in a group after G x. The first item above then stands. Since from time C Gr, the lower bound of evacuating all un-partitioned vehicles in VC i is P (i,1) + s i. Then, if C (i,1,y) < C (i,2,y ) (see figure. 4. as an example), and group G x contains both v (i,1,y) and v (i,2,y ), this lower bound will be increased from Figure 4: Example of property 3.3, 2) P (i,1) + s i to P (i,1) + s i + (C (i,2,y ) C (i,1,y) ) because of the containing of v (i,2,y ). However, if G x does not contain v (i,2,y ), a time duration at least P (i,2) (P (i,1) p (i,1,y) ) will be added to make rest vehicles in VC i pass. If 0 < C (i,2,y ) C (i,1,y) P (i,2) (P (i,1) p (i,1,y) ), one can deduce that there example, there are three un-partitioned vehicles on lane 1 and two on lane 2 after time C Gr. By property 3.2, there is an optimal sequence in which v (i,1,y) is contained in G x. Since P (i,1) + s i means the lower bound of evacuating all un-partitioned vehicles in VC i, it s easy to see that C Gx (C Gr + s i + P (i,1) ) denotes that the extra time caused by making all un-partitioned vehicles in VC i pass intersection at one time if we group all these vehicles into G x, and s i C Gx (C Gr + s i + P (i,1) ) indicates that the integral stop time of VC i is equal to or bigger than this extra time. Thus, the overall evacuation time will be increased if we do not put all these five vehicles in group G x because it will cost at least one extra integral stop time for the rest un-partitioned vehicles. Suppose G r is from vehicle class VC j and G x is from VC i, i j. Set q i = C Gx (s i + C Gr ) P Gx, where P Gx is the sum of passing time of vehicles in l (i,1). Then q i denotes the extra time used in the group G x if we partition G x after G r. Similarly, if we add new vehicles into the last group G r of partial sequence, define q j as the extra time caused by the new added vehicles. We can have the following proposition to predict the minimum time that will be wasted by the coming vehicles for each partial sequence. Proposition 3.5 In a partial group sequence, where some groups have been formed, but no decision
6 has been taken yet on grouping the remaining unpartitioned vehicles, a group penalty, noted as, attaches to each partial group sequence to estimate the minimum time that will be wasted by the coming vehicles. The algorithm for obtaining is given as follows. Algorithm 1: Group penalty begin /* initialization,, */ while there are still un-partitioned vehicles in VC j do for Vehicle class VC i, i [1, m] and i j do Form a group G x from the un-partitioned vehicles in VC i, count q i ; if there are un-partitioned vehicles in VC r then i = q i + q j + s j ; else i = q i + q j ; end min {, i }; min {, }; Add vehicles to G r from VC j by virtue of property 3.2, 3.3 and 3.4. Compute the C Gr ; For each partial group sequence, the group penalty is the estimation of the minimum extra time wasted by the coming vehicles, this parameter will be used to form the lower bound of the following Branch and Bound Algorithm. 4 BRANCH AND BOUND ALGORITHM In this section, we present a Branch-and-Bound algorithm for finding an optimal passing sequence of the approaching vehicles. At beginning, the P (i,l) of each lane of all vehicle classes is computed { } and we index the lane that has max 1 l li P(i,l) as l(i,1) of vehicle class VC i, where l [1, l i ] and i [1, m]. This computation and reindex procedure should be done each time after a group is formed during the searching process. In this branch-and-bound scheme, each node is partitioned into k branches: one branch indicates the group just formed should add more vehicles in same vehicle class if there are still vehicles in it, other k 1 branches indicate that we give the authorization of using intersection to vehicles in other k 1 vehicle classes, where k m. The search tree is constructed in a depth-first fashion. Other components of the branch-and-bound scheme are presented as follows. 4.1 Fathoming and backtracking In this branch-and-bound algorithm, a node is fathomed if: 1. It is a leaf node, i.e., a complete solution finished. 2. The lower bound exceeds or equals the incumbent upper bound. In the process of branch and bound algorithm, if a complete solution that has smaller evacuation time than the current upper bound is found, the new evacuation time should be regarded as a new upper bound. Fathoming initiates backtracking to the first node that still not fathomed. If no such node is found, the search terminates. 4.2 Lower bound Finding a tight lower bound is crucial to the Branch and Bound algorithm. We can obtain the lower bound of each node by three parts. 1. LBS: time used by the vehicles already grouped. 2. LBR: the lower bound of the time that will be used by the rest vehicles. 3. LBP = : the group penalty of the partial group sequence. The LBS can be easily obtained by the data of the vehicles already partitioned. For calculating the LBR, we have the following proposition. Proposition 4.1 In a partial group schedule, where some vehicles have been formed in groups, but no decision has been taken yet on grouping the remaining un-partitioned vehicles, a lower bound of the time that will be used by all un-partitioned vehicles is m i=1 (s i + P (i,1) ) s i, where s i is the integral stop time of vehicle class that contains the last vehicle in the partial schedule. Proof. For each vehicle class VC i, the time used by all the vehicles in it after time C Gr should be at least P (i,1). Integral stop time for switching authorization between different vehicle classes are also necessary. Thus, the m i=1 (s i + P (i,1) ) s i can be seemed as the minimum time that will be used by the rest vehicles. Thus, the lower bound of each node in the searching process will be LB = LBS + LBR + LBP.
7 4.3 Initial upper bound (heuristic) Providing a low initial upper bound is important for enhancing the exclusion rate of the branch-andbound, i.e., the rate with which nodes are fathomed. Thus, it is worth expending some computational effort to achieve that end. Moreover, such a upper bound can be used as an stand-alone heuristic for solving the problem. The algorithm of finding initial upper bound is given as follows. Algorithm 2: Initial upper bound (IUB) begin while there are un-partitioned vehicles do /* from time C Gr (the completion time of the last group in partial group), C Gr 0 at beginning */ for vehicle class VC i, i [1, m] do Reindex the lane l (i,1) in each VC i ; Form a group G x in VC i by virtue of property 3.2, 3.3 and 3.4; Count q i ; /* q i is the extra time caused by group G x */ q min {q i }; Add G x with q to the end of the partial sequence; C Gr C Gx ; IUB C Gr ; /* the final C Gr is the evacuation time of an approximate solution. */ end Vehicle class 3 Vehicle class 2 Vehicle class Lane 3 Figure 6: Arrival time and passing time of example the first vehicle group. Note that the vehicles enclosed by are the vehicles partitioned in one group. Thus, the initial lower bound is LB = LBS+LBR+LBP = 27s. Initial upper bound: Calculated by the algorithm stated earlier, IUB = 32s, which gives the following vehicle group sequence: v (1,1,1) ; v (2,1,1), v (2,2,1) ; v (1,1,2), v (1,2,1), v (1,3,1) ; v (2,1,2), v (2,2,2) ; v (3,1,1), v (3,1,2), v (3,1,3), v (3,2,1), v (3,2,2) ; v (1,1,3), v (1,2,2). Branch and bound: The search tree is presented in figure. 7 and the index of the node corresponds to the sequence of the search procedure. Some important nodes are listed as follows, and an explanation is provided whenever necessary. root 4.4 Numerical example To make the algorithm more understandable, we give the following example end Consider from a start time, there are 15 vehicles approaching an isolated intersection and vehicles are partitioned in three vehicle classes. The integral stop time of each vehicle class is: s 1 = 1s, s 2 = 2s, s 3 = 3s. The arrival time and the passing time of vehicles are given in the figure. 6. In this figure, each rectangle represents a vehicle. Three colors are used to distinguish vehicle classes. The length of each rectangle shows the passing time of the corresponding vehicle. Initial lower bound: At the beginning, lower bound of un-partitioned vehicles can be computed by proposition 4.1: LBS + LBR = = 24s. Group penalty can be computed by proposition 3.5. Since there is no partitioned group at beginning, we suppose that the previous groups is from one of three vehicle classes and choose the smallest group penalty: = LBP = = 3s. This penalty is obtained by scheduling the vehicles as v (1,1,1), v (1,1,2), v (1,2,2) as Figure 7: Search tree of example Node 1: Vehicle group obtained: v (1,1,1), LBS = 4, LBR = 20, LBP = 3; LB = 27. Node 2: Vehicle group obtained: v (1,1,1), v (1,1,2), v (1,2,1), LBS = 8, LBR = 17, LBP = 3; LB = 28. Node 5: Vehicle group obtained: v (1,1,1), v (1,1,2), v (1,2,1) ; v (3,1,1), v (3,2,1), LBS = 13, LBR = 14,
8 LBP = 4; LB = 31. Node 7: Vehicle group obtained: v (1,1,1), v (1,1,2), v (1,2,1) ; v (3,1,1), v (3,2,1) ; v (2,1,1), v (2,1,2), v (2,2,1), v (2,2,2), LBS = 20, LBR = 11, LBP = 0; LB = 31. Node 9: Vehicle group obtained: v (1,1,1), v (1,1,2), v (1,2,1) ; v (3,1,1), v (3,2,1) ; v (2,1,1), v (2,1,2), v (2,2,1), v (2,2,2) ; v (3,1,2), v (3,1,3), v (3,2,2), LBS = 26, LBR = 5, LBP = 0; LB = 31. Node 10: First leaf node: v (1,1,1), v (1,1,2), v (1,2,1) ; v (3,1,1), v (3,2,1) ; v (2,1,1), v (2,1,2), v (2,2,1), v (2,2,2) ; v (3,1,2), v (3,1,3), v (3,2,2) ; v (1,1,2), v (1,2,2), v (1,3,1). Time used: 31s. After the first leaf node is found, the incumbent upper bound is changed to 31s. Other nodes are fathomed by this upper bound in the following search procedure. An final optimal solution is obtained by Node 10. This passing sequence is illustrated in figure. 8. Vehicle lass 1 Vehicle class 2 Vehicle class Figure 8: Obtained optimal passing sequence 4.5 Algorithm application The proposed Branch and Bound algorithm aims at minimizing the evacuation time of a set of vehicles in the control range. Since at the real-world intersection, vehicles keep entering the control range of the center controller, the algorithm should be executed when new vehicles are detected. However, if a group of vehicles are authorized to pass intersection, the recalculation process is delayed until all vehicles in this group have passed through intersection. Consider the numerical example above. At time 0s, 15 vehicles are detected in the control range, algorithm is executed to get an passing sequence. If at time 12s, a new vehicle of vehicle class 2 enters the control range. Since at t = 12s, the vehicles in class 3 have the authorization to use the intersection (v (3,1,1), v (3,2,1) ), the algorithm should be re-executed without the vehicles already passed and v (3,1,1), v (3,2,1), but the new detected vehicle should be considered. Then, the new obtained vehicle sequence will be applied after v (3,1,1), v (3,2,1) pass the intersection. Lane 3 5 SIMULATION AND COMPUTATIONAL EXPERIMENTS The fundamental measures for evaluating the performance of a traffic control algorithm at isolated intersection include the evacuation time, average queue size and average vehicle waiting time. The average queue size indicates the number of vehicles on each lane waiting to cross the intersection at same time. Average vehicle waiting time measures how long a vehicle has to wait before traversing the intersection. All the three measures are frequently used to evaluate the performance of a control algorithm. In this section, We will analyze the three measures with different relative traffic loads. Comparisons are done among the Branch and Bound algorithm, the heuristic and an optimized traditional fix-cycle traffic light control scheme. The simulation is implemented at an isolated fourapproach intersection, each approach has two lanes for incoming vehicles. Vehicles approaching the intersection are partitioned into four vehicle classes. According to statistics, we consider that the maximum traffic load for each of the four approach is 1800 vehicles/h (one vehicle every 2 seconds) and the traffic load for each incoming lane is quarter of the maximum load of one approach. In addition, each data point is obtained by taking the average over several separate simulation. Each simulation run 10 minutes of traffic flow. Besides, the integral stop time for each vehicle class is randomly generated integers varied from 3 to 8 seconds. Passing time of vehicles are varied from 2 to 8 seconds. Vehicles are equally distributed among the compatible lanes of one vehicle class. All approaches are coded in C++ and run on a desktop computer with Linux system (kernel ). Since the algorithm aims at evacuating approaching vehicles as soon as possible, we first simulate the overall evacuation time of all vehicles entering the control range during the 10 minutes of traffic flow. The result is presented in figure. 9. We observe that the Branch and Bound algorithm and the heuristic reduce significantly the overall evacuation time for about 20 seconds, then the throughput can be improved in consequence. The comparisons of average queue size and average vehicle waiting time are given in figure. 10 and figure. 11. One can notice that the performance of the Branch and Bound algorithm and heuristic are almost the same in reducing the average queue length and average vehicle waiting time. However, the Branch and Bound algorithm shows a little better than the heuristic at high relative traffic load, i.e., > 0.4. For some data points, the heuristic performs a little better than the Branch and Bound which is an exact searching method, this is because our objective function is to
9 6 CONCLUSION ADN FUTURE WORK Evacuation time [s] Branch and Bound Heuristic Fix Cycle Time Relative traffic load Figure 9: Simulation results of evacuation time for 10 min of traffic flow Average Queue Length [veh] Branch and Bound Heuristic Fix Cycle Time Relative Traffic Load Figure 10: Simulation results of average queue length Branch and Bound Heuristic Fix Cycle Time In this paper, we presented a new approach to sequence the vehicles passing an isolated intersection via Vehicle-to-Infrastructure communications. Vehicles were treated as discrete individuals in the proposed control strategy and our objective was to evacuate detected vehicles as soon as possible. A Branch and Bound algorithm and a heuristic were developed based on the carefully analysis of structural properties of the problem. Both methods were compared with a traditional fix-cycle time traffic light technique. The results showed that on the one hand, the proposed algorithms can significantly improve the traffic situation; On the other hand, the average running time of the proposed algorithms can satisfy the need of an real-time control system. In the future, differences between normal vehicles and special used vehicles such as ambulances, police cars will be considered. Special used vehicles should have the privileges to pass through intersection. Besides, pedestrian crossings will be taken into consideration. Further more, several neighbor intersections will be controlled together by one controller to save the computational resources as well as guarantee a more global optimization. REFERENCES Contet J.-M., F. Gechter, P. Gruer, and A. Koukam, Application of reactive multiagent system to linear vehicle platoon.the 19th IEEE International Conference on Tools with Artificial Intelligence, vol. 2, pp Tan C.-W., S. Park, H.C. Liu, Q. Xu, P. Lau, Prediction of transit vehicle arrival time for signal priority control: Algorithm and performance. IEEE Transactions on Intelligent Transportation Systems, vol.9, No. 4, pp Average Waiting Time[s] Relative Traffic Load Dresner K. and P. Stone, Multiagent traffic management: a reservation-based intersection control mechanism. Autonomous Agents and Multiagent Systems (AAMAS 04), New York, USA, pp Dresner K. and P. Stone, Traffic intersections of the future. The 21th National Conference on Artificial Intelligence, NECTARTrack (AAAI 06), pp Figure 11: Simulation results of average waiting time minimize the overall evacuation time, not the average queue size or average vehicle waiting time. WU J., A. Abbas-Turki and A. El Moudni, Discrete Methods for Urban Intersection Traffic Controlling. The IEEE 69th Vehicular Technology Conference, (VTC Spring 09), Barcelona. Huang Q.-F. and R. Miller, The design of reliable protocols for wireless traffic signal systems.
10 Department of Computer Science and Engineering, Washington University, Tech. Rep. Wunderlich R., C.-B. Liu, I. Elhanany, and T. Urbanik, II, A novel signal-scheduling algorithm with quality-of-service provisioning for an isolated intersection. IEEE Transactions on Intelligent Transportation Systems, Vol.9, No.3, pp Nadeem T., S. Dashtinezhad, C.-Y. Liao and L. Iftode, TrafficView: A Scalable Traffic Monitoring System. The 2004 IEEE International Conference on Mobile Data Management (MDM 04), Berkeley, California, USA, pp Yu X.-H. and A. R. Stubberud, Markovian decision control for traffic signal systems. The 36th IEEE Conference Decision Control, San Diego, vol. 5, pp Pan Y.-J., Decentralized control of vehicles in platoons with robust nonlinear state estimation. The 4th IEEE Conference on Automation Science and Engineering, Key Bridge Marriott, Washington DC, USA, pp
OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS
Chapter 2 OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN VEHICULAR AD-HOC NETWORKS Hanan Luss and Wai Chen Telcordia Technologies, Piscataway, New Jersey 08854 hluss@telcordia.com, wchen@research.telcordia.com Abstract:
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationNetwork Layer Enhancements
Network Layer Enhancements EECS 122: Lecture 14 Department of Electrical Engineering and Computer Sciences University of California Berkeley Today We have studied the network layer mechanisms that enable
More informationPreface MOTIVATION ORGANIZATION OF THE BOOK. Section 1: Basic Concepts of Graph Theory
xv Preface MOTIVATION Graph Theory as a well-known topic in discrete mathematics, has become increasingly under interest within recent decades. This is principally due to its applicability in a wide range
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationEmerging Connected Vehicle based
Exposing Congestion Attack on Emerging Connected Vehicle based Traffic Signal Control Qi Alfred Chen, Yucheng Yin, Yiheng Feng, Z. Morley Mao, Henry X. Liu Presented by Sezana Fahmida Outline Introduction
More informationScheduling with Bus Access Optimization for Distributed Embedded Systems
472 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 8, NO. 5, OCTOBER 2000 Scheduling with Bus Access Optimization for Distributed Embedded Systems Petru Eles, Member, IEEE, Alex
More informationEnhancement of Routing in Urban Scenario using Link State Routing Protocol and Firefly Optimization
Enhancement of Routing in Urban Scenario using Link State Routing Protocol and Firefly Optimization Dhanveer Kaur 1, Harwant Singh Arri 2 1 M.Tech, Department of Computer Science and Engineering, Lovely
More informationConnection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information
Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information Javad Ghaderi, Tianxiong Ji and R. Srikant Coordinated Science Laboratory and Department of Electrical and Computer Engineering
More informationfor a Fleet of Driverless Vehicles
for a Fleet of Driverless Vehicles Olivier Mehani olivier.mehani@inria.fr La Route Automatisée A -Mines Paris/INRIA Rocquencourt- Joint Research Unit February 14, 2007 Eurocast 2007 Plan 1 2 3 Solution
More informationEnd-To-End Delay Optimization in Wireless Sensor Network (WSN)
Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,
More informationJoint Entity Resolution
Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute
More informationBUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications
BUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications Kai-Juan Wong, Bu-Sung Lee, Boon-Chong Seet, Genping Liu, Lijuan Zhu School of Computer
More informationDepartment of Civil and Environmental Engineering, University of California, Irivne, CA Corresponding author
An Urban Intersection Model Based on Multi-commodity Kinematic Wave Theories LIANG CHEN WEN-LONG JIN JIANMING HU, YI ZHANG Department of Automation University of Science and Technology of China Hefei,
More informationContext-Aware Vehicular Cyber-Physical Systems with Cloud Support: Architecture, Challenges, and Solutions
Context-Aware Vehicular Cyber-Physical Systems with Cloud Support: Architecture, Challenges, and Solutions Siran Pavankumar(149344152) siranpavankumar@gmail.com Computer Science Department Seoul National
More informationScheduling Algorithms to Minimize Session Delays
Scheduling Algorithms to Minimize Session Delays Nandita Dukkipati and David Gutierrez A Motivation I INTRODUCTION TCP flows constitute the majority of the traffic volume in the Internet today Most of
More informationTitle: Increasing the stability and robustness of simulation-based network assignment models for largescale
Title: Increasing the stability and robustness of simulation-based network assignment models for largescale applications Author: Michael Mahut, INRO Consultants Inc. Larger-scale dynamic network models
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationFUTURE communication networks are expected to support
1146 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 13, NO 5, OCTOBER 2005 A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast Ariel Orda, Senior Member, IEEE, and Alexander Sprintson,
More informationOptimal Detector Locations for OD Matrix Estimation
Optimal Detector Locations for OD Matrix Estimation Ying Liu 1, Xiaorong Lai, Gang-len Chang 3 Abstract This paper has investigated critical issues associated with Optimal Detector Locations for OD matrix
More informationIII Data Structures. Dynamic sets
III Data Structures Elementary Data Structures Hash Tables Binary Search Trees Red-Black Trees Dynamic sets Sets are fundamental to computer science Algorithms may require several different types of operations
More informationVARIATIONS IN CAPACITY AND DELAY ESTIMATES FROM MICROSCOPIC TRAFFIC SIMULATION MODELS
VARIATIONS IN CAPACITY AND DELAY ESTIMATES FROM MICROSCOPIC TRAFFIC SIMULATION MODELS (Transportation Research Record 1802, pp. 23-31, 2002) Zong Z. Tian Associate Transportation Researcher Texas Transportation
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Technical Report UU-CS-2008-042 December 2008 Department of Information and Computing Sciences Utrecht
More informationMotion Planning Algorithms for Autonomous Intersection Management
Motion Planning Algorithms for Autonomous Intersection Management Tsz-Chiu Au Department of Computer Science The University of Texas at Austin 1 University Station C5 Austin, Texas 78712-1188 chiu@cs.utexas.edu
More informationSwitched Network Latency Problems Solved
1 Switched Network Latency Problems Solved A Lightfleet Whitepaper by the Lightfleet Technical Staff Overview The biggest limiter to network performance is the control plane the array of processors and
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationMultiagent Traffic Management: An Improved Intersection Control Mechanism PRESENTED BY: PATRICIA PEREZ AND LAURA MATOS
Multiagent Traffic Management: An Improved Intersection Control Mechanism PRESENTED BY: PATRICIA PEREZ AND LAURA MATOS Outline Introduction The Original System Improving the Original Model Protocol Intersection
More informationOn The Complexity of Virtual Topology Design for Multicasting in WDM Trees with Tap-and-Continue and Multicast-Capable Switches
On The Complexity of Virtual Topology Design for Multicasting in WDM Trees with Tap-and-Continue and Multicast-Capable Switches E. Miller R. Libeskind-Hadas D. Barnard W. Chang K. Dresner W. M. Turner
More informationInternational Journal of Advance Engineering and Research Development. Improved OLSR Protocol for VANET
Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 11, November -2017 Improved OLSR Protocol for VANET Ravi Shrimali
More informationSearch Algorithms for Discrete Optimization Problems
Search Algorithms for Discrete Optimization Problems Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar To accompany the text ``Introduction to Parallel Computing'', Addison Wesley, 2003. 1 Topic
More informationLiterature Review on Characteristic Analysis of Efficient and Reliable Broadcast in Vehicular Networks
International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 6, Number 3 (2013), pp. 205-210 International Research Publication House http://www.irphouse.com Literature Review
More informationEvaluation of Seed Selection Strategies for Vehicle to Vehicle Epidemic Information Dissemination
Evaluation of Seed Selection Strategies for Vehicle to Vehicle Epidemic Information Dissemination Richard Kershaw and Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering, Viterbi School
More informationGreedy Algorithms CHAPTER 16
CHAPTER 16 Greedy Algorithms In dynamic programming, the optimal solution is described in a recursive manner, and then is computed ``bottom up''. Dynamic programming is a powerful technique, but it often
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Abstract We present two parameterized algorithms for the Minimum Fill-In problem, also known as Chordal
More informationDSRC Field Trials Whitepaper
DSRC Field Trials Whitepaper August 19, 2017 www.cohdawireless.com 1 Overview Cohda has performed more than 300 Dedicated Short Range Communications (DSRC) field trials, comparing DSRC radios from multiple
More informationMark Sandstrom ThroughPuter, Inc.
Hardware Implemented Scheduler, Placer, Inter-Task Communications and IO System Functions for Many Processors Dynamically Shared among Multiple Applications Mark Sandstrom ThroughPuter, Inc mark@throughputercom
More informationDecentralized Traffic Management: A Synchronization-Based Intersection Control
Decentralized Traffic Management: A Synchronization-Based Intersection Control Mohamed Tlig, Olivier Buffet, Olivier Simonin To cite this version: Mohamed Tlig, Olivier Buffet, Olivier Simonin. Decentralized
More informationAn Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks
An Efficient Bandwidth Estimation Schemes used in Wireless Mesh Networks First Author A.Sandeep Kumar Narasaraopeta Engineering College, Andhra Pradesh, India. Second Author Dr S.N.Tirumala Rao (Ph.d)
More informationOn the Maximum Throughput of A Single Chain Wireless Multi-Hop Path
On the Maximum Throughput of A Single Chain Wireless Multi-Hop Path Guoqiang Mao, Lixiang Xiong, and Xiaoyuan Ta School of Electrical and Information Engineering The University of Sydney NSW 2006, Australia
More informationDistributed minimum spanning tree problem
Distributed minimum spanning tree problem Juho-Kustaa Kangas 24th November 2012 Abstract Given a connected weighted undirected graph, the minimum spanning tree problem asks for a spanning subtree with
More informationScan Scheduling Specification and Analysis
Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract
More informationGUI: GPS-Less Traffic Congestion Avoidance in Urban Area with Inter-Vehicular Communication
GUI: GPS-Less Traffic Congestion Avoidance in Urban Area with Inter-Vehicular Communication Zhen Jiang, Jie Wu, Paul Sabatino CIS Dept., Temple University CS Dept., West Chester Unviersity Information
More informationCohda Wireless White Paper DSRC Field Trials
Cohda Wireless White Paper DSRC Field Trials Copyright Cohda Wireless Pty Ltd ABN 84 107 936 309 Cohda Wireless Pty Ltd 82-84 Melbourne Street North Adelaide, SA 5006 Australia P +61 8 8364 4719 F +61
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationMethods to Resolve Traffic Jams using VANET
Methods to Resolve Traffic Jams using VANET Rohit Kumar Department of Computer Sc. & Engineering Chandigarh University, Gharuan Mohali, Punjab Abstract - In this paper we have proposed a method to avoid
More informationAdvanced Transportation Optimization Systems (ATOS)
Advanced Transportation Optimization Systems (ATOS) By Andrew Andrusko Undergraduate Student Student in Civil Engineering, Urban & Regional Studies, Social Studies, Geography, Geology Programs Minnesota
More informationAN IMPROVED TAIPEI BUS ESTIMATION-TIME-OF-ARRIVAL (ETA) MODEL BASED ON INTEGRATED ANALYSIS ON HISTORICAL AND REAL-TIME BUS POSITION
AN IMPROVED TAIPEI BUS ESTIMATION-TIME-OF-ARRIVAL (ETA) MODEL BASED ON INTEGRATED ANALYSIS ON HISTORICAL AND REAL-TIME BUS POSITION Xue-Min Lu 1,3, Sendo Wang 2 1 Master Student, 2 Associate Professor
More informationEstimate the Routing Protocols for Internet of Things
Estimate the Routing Protocols for Internet of Things 1 Manjushree G, 2 Jayanthi M.G 1,2 Dept. of Computer Network and Engineering Cambridge Institute of Technology Bangalore, India Abstract Internet of
More informationA simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints
A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints Sohaib Afifi 1, Duc-Cuong Dang 1,2, and Aziz Moukrim 1 1 Université de Technologie de Compiègne
More informationCHAPTER 5 PROPAGATION DELAY
98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More informationChapter-4. Simulation Design and Implementation
Chapter-4 Simulation Design and Implementation In this chapter, the design parameters of system and the various metrics measured for performance evaluation of the routing protocols are presented. An overview
More informationAutonomous Navigation in Unknown Environments via Language Grounding
Autonomous Navigation in Unknown Environments via Language Grounding Koushik (kbhavani) Aditya (avmandal) Sanjay (svnaraya) Mentor Jean Oh Introduction As robots become an integral part of various domains
More informationByzantine Consensus in Directed Graphs
Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationOn A Traffic Control Problem Using Cut-Set of Graph
1240 On A Traffic Control Problem Using Cut-Set of Graph Niky Baruah Department of Mathematics, Dibrugarh University, Dibrugarh : 786004, Assam, India E-mail : niky_baruah@yahoo.com Arun Kumar Baruah Department
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationModelling traffic congestion using queuing networks
Sādhanā Vol. 35, Part 4, August 2010, pp. 427 431. Indian Academy of Sciences Modelling traffic congestion using queuing networks TUSHAR RAHEJA Mechanical Engineering Department, Indian Institute of Technology
More informationAN INTELLIGENT TRAFFIC CONTROLLER BASED ON FUZZY LOGIC
AN INTELLIGENT TRAFFIC CONTROLLER BASED ON FUZZY LOGIC Bilal Ahmed Khan; Nai Shyan Lai Asia Pacific University of Technology and Innovation belalkhn22@gmail.com Abstract Traffic light plays an important
More informationLecture 6: Vehicular Computing and Networking. Cristian Borcea Department of Computer Science NJIT
Lecture 6: Vehicular Computing and Networking Cristian Borcea Department of Computer Science NJIT GPS & navigation system On-Board Diagnostic (OBD) systems DVD player Satellite communication 2 Internet
More informationTraffic balancing-based path recommendation mechanisms in vehicular networks Maram Bani Younes *, Azzedine Boukerche and Graciela Román-Alonso
WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 2016; 16:794 809 Published online 29 January 2015 in Wiley Online Library (wileyonlinelibrary.com)..2570 RESEARCH ARTICLE Traffic
More informationWorst-case Ethernet Network Latency for Shaped Sources
Worst-case Ethernet Network Latency for Shaped Sources Max Azarov, SMSC 7th October 2005 Contents For 802.3 ResE study group 1 Worst-case latency theorem 1 1.1 Assumptions.............................
More information: Principles of Automated Reasoning and Decision Making Midterm
16.410-13: Principles of Automated Reasoning and Decision Making Midterm October 20 th, 2003 Name E-mail Note: Budget your time wisely. Some parts of this quiz could take you much longer than others. Move
More informationEnhanced Broadcasting and Code Assignment in Mobile Ad Hoc Networks
Enhanced Broadcasting and Code Assignment in Mobile Ad Hoc Networks Jinfang Zhang, Zbigniew Dziong, Francois Gagnon and Michel Kadoch Department of Electrical Engineering, Ecole de Technologie Superieure
More informationDatabase Management System Prof. D. Janakiram Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No.
Database Management System Prof. D. Janakiram Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No. # 20 Concurrency Control Part -1 Foundations for concurrency
More informationdistractions Les distractions BIZART
3 distractions Les distractions Using Le a téléphone while au driving volant R Le système Navigation de navigation system R February 2012 BIZART Using a phone while driving It s better to keep both hands
More informationComponent Connectivity of Generalized Petersen Graphs
March 11, 01 International Journal of Computer Mathematics FeHa0 11 01 To appear in the International Journal of Computer Mathematics Vol. 00, No. 00, Month 01X, 1 1 Component Connectivity of Generalized
More informationData Pouring and Buffering on The Road: A New Data Dissemination Paradigm for Vehicular Ad Hoc Networks
Data Pouring and Buffering on The Road: A New Data Dissemination Paradigm for Vehicular Ad Hoc Networks Jing Zhao, Yang Zhang and Guohong Cao Department of Computer Science and Engineering The Pennsylvania
More informationTemporally Adaptive A* Algorithm on Time Dependent Transportation Network
Temporally Adaptive A* Algorithm on Time Dependent Transportation Network Nianbo Zheng, Feng Lu Institute of Geographic Sciences and Natural Resources Research Chinese Academy of Sciences Beijing, 100101,
More informationLecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture
More informationQueue Length Stability in Trees Under Slowly Convergent Traffic Using Sequential Maximal Scheduling
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering November 2008 Queue Length Stability in Trees Under Slowly Convergent Traffic Using
More informationDiversity Coloring for Distributed Storage in Mobile Networks
Diversity Coloring for Distributed Storage in Mobile Networks Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Abstract: Storing multiple copies of files is crucial for ensuring
More informationLecture 5: Search Algorithms for Discrete Optimization Problems
Lecture 5: Search Algorithms for Discrete Optimization Problems Definitions Discrete optimization problem (DOP): tuple (S, f), S finite set of feasible solutions, f : S R, cost function. Objective: find
More informationControl Challenges in the Vehicle Infrastructure Initiative (VII)
Control Challenges in the Vehicle Infrastructure Initiative (VII) Hemant Sardar Automotive IEEE TCAC Workshop on Open Problems & Challenges in Automotive Control Introduction Background of ITS Overview
More informationProbabilistic Double-Distance Algorithm of Search after Static or Moving Target by Autonomous Mobile Agent
2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel Probabilistic Double-Distance Algorithm of Search after Static or Moving Target by Autonomous Mobile Agent Eugene Kagan Dept.
More informationInfinite locally random graphs
Infinite locally random graphs Pierre Charbit and Alex D. Scott Abstract Motivated by copying models of the web graph, Bonato and Janssen [3] introduced the following simple construction: given a graph
More informationCompSci 356: Computer Network Architectures. Lecture 7: Switching technologies Chapter 3.1. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 7: Switching technologies Chapter 3.1 Xiaowei Yang xwy@cs.duke.edu Types of switching Datagram Virtual circuit Source routing Today Bridges and LAN switches
More informationCS 4100 // artificial intelligence
CS 4100 // artificial intelligence instructor: byron wallace Constraint Satisfaction Problems Attribution: many of these slides are modified versions of those distributed with the UC Berkeley CS188 materials
More informationDetermining Resource Needs of Autonomous Agents in Decoupled Plans
Determining Resource Needs of Autonomous Agents in Decoupled Plans Jasper Oosterman a Remco Ravenhorst a Pim van Leeuwen b Cees Witteveen a a Delft University of Technology, Algorithmics group, Delft b
More informationLecture 3: Graphs and flows
Chapter 3 Lecture 3: Graphs and flows Graphs: a useful combinatorial structure. Definitions: graph, directed and undirected graph, edge as ordered pair, path, cycle, connected graph, strongly connected
More informationRHODES and Next Generation RHODES
RHODES and Next Generation RHODES Pitu Mirchandani ATLAS Research Laboratory Arizona State University Is adaptive right for you? Panel ITE Meeting, Phoenix March 9, 2011 Acknowledgements: David Lucas,
More informationColumn Generation Method for an Agent Scheduling Problem
Column Generation Method for an Agent Scheduling Problem Balázs Dezső Alpár Jüttner Péter Kovács Dept. of Algorithms and Their Applications, and Dept. of Operations Research Eötvös Loránd University, Budapest,
More informationSolving NP-hard Problems on Special Instances
Solving NP-hard Problems on Special Instances Solve it in poly- time I can t You can assume the input is xxxxx No Problem, here is a poly-time algorithm 1 Solving NP-hard Problems on Special Instances
More informationCHAPTER 5. Simulation Tools. be reconfigured and experimented with, usually this is impossible and too expensive or
CHAPTER 5 Simulation Tools 5.1 Introduction A simulation of a system is the operation of a model of the system. The model can be reconfigured and experimented with, usually this is impossible and too expensive
More informationEfficient Authentication and Congestion Control for Vehicular Ad Hoc Network
Efficient Authentication and Congestion Control for Vehicular Ad Hoc Network Deivanai.P 1, K.Sudha 2, K.Radha 3 Department of CSE, Muthayammal Engineering College, Rasipuram, India 1 Assistant Professor,
More informationChapter 3: Solving Problems by Searching
Chapter 3: Solving Problems by Searching Prepared by: Dr. Ziad Kobti 1 Problem-Solving Agent Reflex agent -> base its actions on a direct mapping from states to actions. Cannot operate well in large environments
More informationWireless Environments
A Cyber Physical Systems Architecture for Timely and Reliable Information Dissemination in Mobile, Aniruddha Gokhale Vanderbilt University EECS Nashville, TN Wireless Environments Steven Drager, William
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationCS 204 Lecture Notes on Elementary Network Analysis
CS 204 Lecture Notes on Elementary Network Analysis Mart Molle Department of Computer Science and Engineering University of California, Riverside CA 92521 mart@cs.ucr.edu October 18, 2006 1 First-Order
More informationStudy on Indoor and Outdoor environment for Mobile Ad Hoc Network: Random Way point Mobility Model and Manhattan Mobility Model
Study on and Outdoor for Mobile Ad Hoc Network: Random Way point Mobility Model and Manhattan Mobility Model Ibrahim khider,prof.wangfurong.prof.yinweihua,sacko Ibrahim khider, Communication Software and
More informationAd Hoc Distributed Simulation of Surface Transportation Systems
Ad Hoc Distributed Simulation of Surface Transportation Systems Richard Fujimoto Jason Sirichoke Michael Hunter, Randall Guensler Hoe Kyoung Kim, Wonho Suh Karsten Schwan Bala Seshasayee Computational
More informationOnline Graph Exploration
Distributed Computing Online Graph Exploration Semester thesis Simon Hungerbühler simonhu@ethz.ch Distributed Computing Group Computer Engineering and Networks Laboratory ETH Zürich Supervisors: Sebastian
More informationOptimization I : Brute force and Greedy strategy
Chapter 3 Optimization I : Brute force and Greedy strategy A generic definition of an optimization problem involves a set of constraints that defines a subset in some underlying space (like the Euclidean
More informationMin-Cost Multicast Networks in Euclidean Space
Min-Cost Multicast Networks in Euclidean Space Xunrui Yin, Yan Wang, Xin Wang, Xiangyang Xue School of Computer Science Fudan University {09110240030,11110240029,xinw,xyxue}@fudan.edu.cn Zongpeng Li Dept.
More informationA Synchronization Algorithm for Distributed Systems
A Synchronization Algorithm for Distributed Systems Tai-Kuo Woo Department of Computer Science Jacksonville University Jacksonville, FL 32211 Kenneth Block Department of Computer and Information Science
More informationReducing Message Loss in DSRC Networks using Dynamic Distribution of Safety Messages over EDCA Access Categories
, October 21-23, 215, San Francisco, USA Reducing Message Loss in DSRC Networks using Dynamic Distribution of Safety Messages over EDCA Access Categories Mohammad A. Alsmirat, Saleh Yousef Al-Rifai, and
More informationApplied Algorithm Design Lecture 3
Applied Algorithm Design Lecture 3 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 3 1 / 75 PART I : GREEDY ALGORITHMS Pietro Michiardi (Eurecom) Applied Algorithm
More informationModelling and simulation of guaranteed throughput channels of a hard real-time multiprocessor system
Modelling and simulation of guaranteed throughput channels of a hard real-time multiprocessor system A.J.M. Moonen Information and Communication Systems Department of Electrical Engineering Eindhoven University
More informationGrowth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs.
Internetworking Multiple networks are a fact of life: Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Fault isolation,
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed
More information