• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.244-253
• /
• 2008

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.250-258
• /
• 1997

A modified IPRMA protocol using priority scheme is proposed to increase the number of maximum users, which prevents the collision between the voice and data traffic. A simple decentralized traffic control scheme is presented for the proposed protocol. The improvement in performance over conventional IPRMA is shown through simulation, and EPA(Equilibrium Point Analysis) is used to evaluate system performance.

• Journal of Korean Society of Transportation
• /
• v.28 no.5
• /
• pp.131-139
• /
• 2010

The transport mode choice problem is to determine which of the alternative transport modes connecting an origin and destination will be used by a traveler. Most of the research relating to transport mode choice have mainly been focused on modeling, properties, and applications of the model, but rarely were concerned with equilibrium among the modes. This paper proves the equilibrium among the modes by using a logit mode choice model, and then verifies it with the Korean Transport Database (KTDB). In order to obtain such an equilibrium, this paper also presents a solution algorithm based on the fixed point theorem. The algorithm was tested with an example and confirmed the equilibrium solution.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.4
• /
• pp.253-259
• /
• 2013

Investment scenarios in the transportation network design problem usually contain installation or expansion of multi-mode transportation links. When one applies the mode choice analysis and traffic assignment sequentially for each investment scenario, it is possible that the travel impedance used in the mode choice analysis is different from the user equilibrium cost of the traffic assignment step. Therefore, to estimate the travel impedance and mode choice accurately, one needs to develop a combined model for the mode choice and traffic assignment. In this paper, we derive the inverse demand and the excess demand functions for the multi-mode multinomial logit mode choice function and develop a combined model for the multi-mode variable demand traffic assignment problem. Using data from the regional O/D and network data provided by the KTDB, we compared the performance of the partial linearization algorithm with the Frank-Wolfe algorithm applied to the excess demand model and with the sequential heuristic procedures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.37-45
• /
• 2005

This paper presents a relationship between Nash bargaining game and Wardrop user equilibrium, which has been widely used in transportation modeling for route choice problem. Wardrop user equilibrium assumes that drivers in road network have perfect information on the traffic conditions and they choose their optimal paths without cooperation each other. In this regards, if the bargaining game process is introduced in route choice modeling, we may avoid the strong assumptions to some extent. For such purpose, this paper derives a theorem that Nash bargaining solution is equivalent to Wardrop user equilibrium as the barging process continues and prove it with some numerical examples. The model is formulated based on two-person bargaining game. and n-person game is remained for next work.

• Journal of Korean Society of Transportation
• /
• v.27 no.3
• /
• pp.71-77
• /
• 2009

The ubiquitous transportation system environments make it possible to collect each vehicle's position and velocity data and to perform more sophisticated traffic flow management at individual vehicle or platoon level through V2V and V2I communications. The VISSIM simulation experiments were performed to address the issues in developing the preventive congestion management algorithm proposed in the companion paper. Traffic flow stability measures were developed based on the platoon profile, which enables us to explicitly consider traffic flow stability in traffic flow management. Traffic flow management strategies according to the traffic flow states were proposed: Maintain the equilibrium speed for free flow state, maintain the traffic flow stability by platoon control for critical state, and surpress the shock wave propagation for congested state. And finally potential benefit of the proposed traffic flow management scheme was evaluated based on the simulation experiment results. It is considered that extensive field experiments should be performed to confirm the simulated results.

• Korean System Dynamics Review
• /
• v.12 no.1
• /
• pp.75-87
• /
• 2011

Congestion problems can be approached from the viewpoint of system dynamics theory. The relationship between road capacity and congestion can be explained by the 'relative control' archetype among four system archetypes suggested by Wolstenholme. There is a balancing feedback loop between road capacity and road congestion. However, there is another balancing loop between road congestion and car traffic volume, which keeps disrupting the equilibrium of the former loop. A system dynamics model, which is based on a partial adjustment model of induced traffic in the literature, is built to simulate three road building scenarios: 'Expanding investment', 'Balancing investment' and 'Frozen road investment' scenarios. The 'Expanding investment' scenario manages to drop congestion levels by 9% over 30 years, however, causing much higher emissions of $CO_2$ than other scenarios. The trade-off relationship between congestion levels and environmental costs must be taken into consideration for road investment policies.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.8
• /
• pp.31-38
• /
• 1995

In this paper, we consider the leaky bucket parameter dimensioning problem in the presence of the cell delay variation(CDV) which arises at the customer premises network dud to the multiplexing with other traffic streams. We consider an ATM multiplexer in which a single CBR stream and several heterogeneous VBR traffic streams are multiplexed. Choosing an MMPP model for the bursty traffic streams, we derive an (MMPP+DD)/D/1/K queueing model for the evaluation of the CDV experienced by the CBR stream. We first evaluate the equilibrium queue length distribution embedded at tagged-cell arrival-time instants, based on whcih we calcuate the inter-cell time distribution and the distribution kof the number of tagged-cell departures in an arbitrary interval. Then we apply the analysis to the dimensionging problem of the leaky bucket parameters, examining how the employed traffic model affects the determination of the bucket size. Through numerical examples, we confirm that the Poisson traffic model can underestimate the bucket size, thus causing a considerable blocking probability for compliant use cells while the MMPP model can optimally design the bucket size which keeps the blocking probability under the target value.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4291-4310
• /
• 2015

This paper investigates the traffic offloading over unlicensed bands for two-tier multi-mode small cell networks. We formulate this problem as a Stackelberg game and apply a hierarchical learning framework to jointly maximize the utilities of both macro base station (MBS) and small base stations (SBSs). During the learning process, the MBS behaves as a leader and the SBSs are followers. A pricing mechanism is adopt by MBS and the price information is broadcasted to all SBSs by MBS firstly, then each SBS competes with other SBSs and takes its best response strategies to appropriately allocate the traffic load in licensed and unlicensed band in the sequel, taking the traffic flow payment charged by MBS into consideration. Then, we present a hierarchical Q-learning algorithm (HQL) to discover the Stackelberg equilibrium. Additionally, if some extra information can be obtained via feedback, we propose an improved hierarchical Q-learning algorithm (IHQL) to speed up the SBSs' learning process. Last but not the least, the convergence performance of the proposed two algorithms is analyzed. Numerical experiments are presented to validate the proposed schemes and show the effectiveness.