• 한국항공운항학회지
• /
• 제17권3호
• /
• pp.32-39
• /
• 2009

Due to the lack of navigable airspace caused by worldwide air traffic increases, air traffic control(ATC) services are becoming more complex, which results in the increase of aircraft accidents. To cope with these challenges, major aviation institutes abroad are actively conducting research regarding the human factors affecting controllers but as of late, no such specialized activities have been found in Korea. Due to the dynamic attributes of ATC operations, management of controller's situation awareness(SA) and workload, and knowledge on the impact of abnormal aircraft to controllers are very important. Furthermore, using actual flight data of each country will lead to valuable results, because individually, it has different airspace characteristics and air traffic volumes. This study assumed that air traffic difficulties would affect the controller's SA and workload. To testify the above hypothesis, the abnormal air traffic situations are simulated by using ATC simulator. The findings indicated that the effect of traffic situations containing abnormal aircraft on the controller's SA and workload, it led to demand increase and supply decrease in SA, and increased mental demand, temporal demand, effort and mean workload score in the workload.

• International Journal of Aeronautical and Space Sciences
• /
• 제17권4호
• /
• pp.604-613
• /
• 2016

In this paper, Human-in-the-Loop (HiTL) simulations of Remotely Piloted Aircraft System (RPAS) operations in two different Air Traffic Management (ATM) concepts, conventional radar vectoring and Trajectory Based Operations (TBO), were performed to assess the impacts of RPAS integration in the future ATM environment. TBO concept maximizes the throughput by planning and sharing 4-D trajectories between pilots and controllers, and it is considered one of the key concepts to enable RPASs to operate with manned aircraft in congested airspaces. RPASs are characterized by having communication delay or temporary loss of communication. TBO capability was added to the integrated air traffic simulation system for this study, which was developed in the Inha University. HiTL simulations were performed by a trainee air traffic controller with three scenarios, and the data were analyzed using safety, efficiency, and controller workload metrics. The results suggest that TBO were effective in reducing delays and controller workload while maintaining the level of safety.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.15-25
• /
• 2000

In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2007년도 추계학술대회 및 정기총회
• /
• pp.325-329
• /
• 2007

The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.

• 한국경영과학회지
• /
• 제26권4호
• /
• pp.125-132
• /
• 2001

Traffic unbalance between uplink and downlink is one of the most notable characteristics in the next generation cellular mobile systems which provide multimedia services such as voice and video telephony, high-speed internet access, and mobile computing, etc. The CDMA/TDD system with unbalanced slot allocation between two links is a good solution for the traffic unbalance in this paper, we formulate the time slot and channel allocation problem for the CDMA/TDD systems in general multicell environments, which is to maximize the system capacity under the given traffic unbalance, and solve that problem by simulated annealing technique. Computational experiments show that the proposed scheme yields a good performance.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.23-36
• /
• 1997

In the design of telecommunication network, the network configuration using hubbing topology is useful for designing and managing the network efficiently : i. e. all of central offices (COs) are grouped into clusters. Each cluster has one hub consisting of large-scale transmission facilities like digital cross-connect systems and ATMs. In clustering process, the community of interest and geographical factor should be considered. However, there exists a tradeoff between two factors. One is to minimize total link costs for geographical factor and the other is to maximize the total intra-cluster traffics for community of interest. Hence, this can be solved by multiobjective linear programming techniques. In this paper, the problem under considerations is formulated as two p-median subproblems taking into considerations total costs and total intra-traffics, respectively. Then we propose the algorithm to solve the problem based on the concept of cost-traffic tradeoff. The algorithm enables to identify efficient cost-traffic tradeoff pairs. An illustration is also presented.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.138-141
• /
• 1997

In this study, a simulation model is developed to analyze the effects of routing and scale-economy of transmission facilities on the traffic network topology and investment cost changes in a metropolitan telephone network. Computational experiments showed that the wide deployment of bifurcated routing in a dual-homing configuration reduces significantly the traffic network connectivity and the investment cost. Its enhanced version, when combined with the subscriber network cost model, can be used as a prototype cost proxy model for figuring out the access charges in a multi-operator environment.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.303-312
• /
• 1994

The problem of optimally allocating available communication channels in a cellular mobile system with nonuniform traffic distribution is considered. This problem is to minimize the weighted average blocking probability subject to cochannel interference constraints. We use the concept of pattern to deal with the problem more conveniently. Using Lagrangian relaxation and subgradient optimization techniques, we obtain high-quality solutions with information about their deviations from true optimal solutions. Computational experiments show that our method works very well.

• 한국경영과학회지
• /
• 제26권2호
• /
• pp.1-11
• /
• 2001

This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcelluar system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieved. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem requires real time solution, heuristic algorithms are proposed and the computational results are discussed.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 1999년도 춘계공동학술대회:정보화시대의 지식경영
• /
• pp.371-372
• /
• 1999