Dedicated lanes for connected and automated vehicles (CAVs) can not only provide the technological accommodation, but also the desired market incentive for road user to adapt CAVs. Thus far, the majority of the impact assessment of CAV focused on the network-wide benefits. In this paper, we investigate the change of the traffic flow characteristic with two configurations of dedicated CAV lane across levels of market penetration. The traffic flow characteristics are quantified from the perspectives of headway distribution, communication density, and speed-flow diagram. The results highlight the contributions of the CAV lane. First, CAV lanes significantly improves the speed-flow characteristics by extending the stable region of the speed-flow curve and yielding a greater optimum flow. The highest value of optimum flow is 3400 vehicle per lane per hour at 90 MPR with one CAV lane. Furthermore, the concentration of CAVs at a lane results a narrower headway distribution (with smaller standard deviation), even with partial market penetration. Moreover, the CAV lane creates a more consistent CAV density which maintains the communication density level at a predictable level, hence decreasing the probability of packet drop.
A time-dependent deployment framework was proposed in @cite_7 , which was formulated with a network equilibrium model and a diffusion model (for modeling adoption of a new product in a population). With the constraint of a given set of candidate lanes which corresponds to the field condition, the social cost was minimized with the consideration of levels of MPR.
@cite_7
2524294774 2136340918 2611421367 2602199281
Abstract This paper develops a mathematical approach to optimize a time-dependent deployment plan of autonomous vehicle (AV) lanes on a transportation network with heterogeneous traffic stream consisting of both conventional vehicles (CVs) and AVs, so as to minimize the social cost and promote the adoption of AVs. Specifically, AV lanes are exclusive lanes that can only be utilized by AVs, and the deployment plan specifies when, where, and how many AV lanes to be deployed. We first present a multi-class network equilibrium model to describe the flow distributions of both CVs and AVs, given the presence of AV lanes in the network. Considering that the net benefit (e.g., reduced travel cost) derived from the deployment of AV lanes will further promote the AV adoption, we proceed to apply a diffusion model to forecast the evolution of AV market penetration. With the equilibrium model and diffusion model, a time-dependent deployment model is then formulated, which can be solved by an efficient solution algorithm. Lastly, numerical examples based on the south Florida network are presented to demonstrate the proposed models. We consider the problem of resource allocation in downlink OFDMA systems for multi service and unknown environment. Due to users' mobility and intercell interference, the base station cannot predict neither the Signal to Noise Ratio (SNR) of each user in future time slots nor their probability distribution functions. In addition, the traffic is bursty in general with unknown arrival. The probability distribution functions of the SNR, channel state and traffic arrival density are then unknown. Achieving a multi service Quality of Service (QoS) while optimizing the performance of the system (e.g. total throughput) is a hard and interesting task since it depends on the unknown future traffic and SNR values. In this paper we solve this problem by modeling the multiuser queuing system as a discrete time linear dynamic system. We develop a robust H∞ controller to regulate the queues of different users. The queues and Packet Drop Rates (PDR) are controlled by proposing a minimum data rate according to the demanded service type of each user. The data rate vector proposed by the controller is then fed as a constraint to an instantaneous resource allocation framework. This instantaneous problem is formulated as a convex optimization problem for instantaneous subcarrier and power allocation decisions. Simulation results show small delays and better fairness among users. In this paper, a novel framework is proposed for optimizing the operation and performance of a large-scale multi-hop millimeter wave (mmW) backhaul within a wireless small cell network having multiple mobile network operators (MNOs). The proposed framework enables the small base stations to jointly decide on forming the multi-hop, mmW links over backhaul infrastructure that belongs to multiple, independent MNOs, while properly allocating resources across those links. In this regard, the problem is addressed using a novel framework based on matching theory composed of two, highly inter-related stages: a multi-hop network formation stage and a resource management stage. One unique feature of this framework is that it jointly accounts for both wireless channel characteristics and economic factors during both network formation and resource management. The multi-hop network formation stage is formulated as a one-to-many matching game, which is solved using a novel algorithm, that builds on the so-called deferred acceptance algorithm and is shown to yield a stable and Pareto optimal multi-hop mmW backhaul network. Then, a one-to-many matching game is formulated to enable proper resource allocation across the formed multi-hop network. This game is then shown to exhibit peer effects and, as such, a novel algorithm is developed to find a stable and optimal resource management solution that can properly cope with these peer effects. Simulation results show that, with manageable complexity, the proposed framework yields substantial gains, in terms of the average sum rate, reaching up to 27 and 54 , respectively, compared with a non-cooperative scheme in which inter-operator sharing is not allowed and a random allocation approach. The results also show that our framework improves the statistics of the backhaul sum rate and provides insights on how to manage pricing and the cost of the cooperative mmW backhaul network for the MNOs. In this paper, a novel framework is proposed to jointly optimize user association and resource allocation in the uplink cognitive femtocell network (CFN). In the considered CFN, femtocell base stations (FBSs) are deployed to serve a set of femtocell user equipments (FUEs) by reusing subchannels used in a macrocell base station (MBS). The problem of joint user association, subchannel assignment, and power allocation is formulated as an optimization problem, in which the goal is to maximize the overall uplink throughput while guaranteeing FBSs overloading avoidance, data rate requirements of the served FUEs, and MBS protection. To solve this problem, a distributed framework based on the matching game is proposed to model and analyze the interactions between the FUEs and FBSs. Using this framework, distributed algorithms are developed to enable the CFN to make decisions about user association, subchannel allocation, and transmit power. The algorithms are then shown to converge to a stable matching and exhibit a low computational complexity. Simulation results show that the proposed approach yields a performance improvement in terms of the overall network throughput and outage probability, with a small number of iterations to converge.