• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3706-3714
• /
• 2011

This study deals with the algorithm to finding the maximum capacity and their schedule of extra freight while honoring planned timetable of trains on railway network. Time-expanded network, a kind of space-time graph, can be shown both planned train timetable and dynamic features of given problem. Pre-processing procedure is a series of infeasible arcs removal from time-expanded network honoring planned timetable. In the result, this preprocessing transforms dynamic features of given problem into static maximal flow problem which can be easily solved.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.407-410
• /
• 1997

This paper analytically derives the variance of service time of a station in the symmetric IEEE 802.4 token bus network with single access class and finite buffer capacity. This performance measure is represented in terms of the total number of stations, the token hold time, the arrival rate of frames, the service rate, and other parameters. Using computer simulations, presented performance measure is validated.

• Journal of Information Technology Applications and Management
• /
• v.14 no.2
• /
• pp.97-115
• /
• 2007

The present paper investigates the technological and conceptional characteristics of peering and transit in internet interconnection. Especially, the market with two ISP competing for customers is modeled and the outcome with peering is compared with transit. This paper also analyze the congestion effects on retail price and network capacity. When there is congestion effects occurring from network sharing, the retail price is increased and the fixed fee is decreased with the degree of congestion. Finally, the optimal access charge assuring the socially optimal retail price and network capacity is derived.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.1841-1865
• /
• 2017

This paper proposes a new interference mitigation scheme for device-to-device (D2D) communications underlaying a cellular network. The object of the proposed scheme is to determine the number of data streams, a precoding matrix, and a decoding matrix of D2D networks so as to maximize the system capacity given the number of data streams of a cellular network while satisfying the constraint of the inter-system interference from D2D networks to the cellular network. Unlike existing interference mitigation schemes based on the interference alignment technique, the proposed scheme operates properly regardless of the number of data streams of a cellular network and moreover it does not require changing the precoding and decoding matrices of a cellular network. The simulation results demonstrate that the proposed scheme significantly increases the system capacity by mitigating the intra- and inter-system interference.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.394-400
• /
• 2022

The radio resources available in a wireless network system are limited. Therefor, job of managing resources is not easy task. Because the resources are shared among the UEs that are connected, the process of assigning resources must be carefully controlled. The packet scheduler in an LTE network is in charge of allocating resources to the user equipment (UE). Femtocells networks are being considered as a promising solution for poor channel performance for mulitple environments. The implementation of femtocells into a macrocell (traditional base station) would boost the capacities of the cellular network. To increase femtocells network capacity, a reliable Packet Scheduler mechanism should be implemented. The Packet Scheduler technique is introduced in this paper to maximize capacity of the network while maintaining fairness among UEs. The proposed solution operates in a manner consistent with this principle. An analysis of the proposed scheme's performance is conducted using a computer simulation. The results reveal that it outperforms the well-known PF scheduler in terms of cell throughput and average throughput of UEs.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.55-65
• /
• 2010

We present a method for increasing network lifetime without link failure due to lack of battery capacity of nodes in wireless ad-hoc networks with low mobility. In general, a node with larger remaining battery capacity represents the one with lesser traffic load. Thus, a modified AODV routing protocol is proposed to determine a possible route by considering a remaining battery capacity of a node. Besides, the total energy consumption of all nodes increase rapidly due to the huge amount of control packets which should be flooded into the network. To reduce such control packets efficiently, a source node can store information about alternative routes to the destination node into its routing table. When a link failure happens, the source node should retrieve the route first with the largest amount of the total remaining battery capacity from its table entries before initiating the route rediscovery process. To do so, the possibility of generating unnecessary AODV control packets should be reduced. The method proposed in this paper increases the network lifetime by 40% at most compared with the legacy AODV and MMBCR.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2405-2410
• /
• 2012

The 4th generation mobile communication system, LTE, does not support an additional core network to provide voice service, and it is merged into a packet network based on all IP. Although Voice service over LTE can be supported by VoIP, it will be provided by the existing 3G networks because of the discontinuity of LTE coverage. However, it is inevitable to adopt VoIP over LTE to provide high quality voice service. In this paper, we investigate the capacity of VoIP over LTE. Our results indicate that spectral efficiency can be significantly improved as channel bandwidth increases in terms of VoLTE capacity. In addition, we can achieve higher VoLTE capacity without decreasing control channel capacity.

• Journal of the Korean Geotechnical Society
• /
• v.22 no.6
• /
• pp.15-26
• /
• 2006

Although numerous investigations have been performed over the years to predict the behavior and bearing capacity of piles, the mechanisms are not yet entirely understood. The prediction of bearing capacity is a difficult task, because large numbers of factors affect the capacity and also have complex relationship one another. Therefore, it is extremely difficult to search the essential factors among many factors, which are related with ground condition, pile type, driving condition and others, and then appropriately consider complicated relationship among the searched factors. The present paper describes the application of Artificial Neural Network (ANN) in predicting the capacity including its components at the tip and along the shaft from dynamic load test of the driven piles. Firstly, the effect of each factor on the value of bearing capacity is investigated on the basis of sensitivity analysis using ANN modeling. Secondly, the authors use the design methodology composed of ANN and genetic algorithm (GA) to find optimal neural network model to predict the bearing capacity. The authors allow this methodology to find the appropriate combination of input parameters, the number of hidden units and the transfer structure among the input, the hidden and the out layers. The results of this study indicate that the neural network model serves as a reliable and simple predictive tool for the bearing capacity of driven piles.

• International journal of advanced smart convergence
• /
• v.11 no.2
• /
• pp.205-210
• /
• 2022

To achieve the higher network capacity and mass connectivity in the forthcoming mobile network, revolutionary technologies have been considered. Recently, an upper bound on capacity of intelligent reflecting surface (IRS) transmissions towards the sixth generation (6G) mobile systems has been proposed. In this paper, we consider a tighter upper bound on capacity of IRS transmissions than the existing upper bound. First, using integration by parts, we derive an upper bound on capacity of IRS transmissions under Rician fading channels and a Rayleigh fading channel. Then, we show numerically that the proposed upper bound is closer to Monte Carlo simulations than the existing upper bound. Furthermore, we also demonstrate that the bounding error of the proposed upper bound is much smaller than that of the existing upper bound, and the superiority of the proposed upper bound over the existing upper bound becomes more significant as the signal-to-noise ratio (SNR) increases.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.4
• /
• pp.513-521
• /
• 2012

With the advent of smart grid, distribution network charges have been one of keystones of ongoing deregulation and privatization in power industries. This paper proposes a new charging methodology to allocate the existing distribution network cost with an aim of reflecting the true cost and benefit of network customers, especially of distribution generator (DG). The proposed charging methodology separates distribution network costs due to the respective real and reactive power flows. The costs are then allocated to network users according to each charge for the actual line capacity used and available capacity. This distribution network charging model is able to provide the economic signals to reward network users who are contributing to better power factors, while penalizing customers who worsen power factors. The proposed method is shown on IEEE 37 bus system for distribution network, and then the results are validated through the comparison with the MW-Miles and MVA-Miles methods. The charges derived from the proposed method can provide appropriate incentives/penalties to network customers to behave in a manner leading to a better network condition.