• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11A
• /
• pp.878-891
• /
• 2011

We consider the throughput-maximization problem for both the up- and downlink in a wireless network with interference channels. For this purpose, we design an iterative and distributive uplink algorithm based on Lagrangian relaxation. Using the uplink power prices and network duality, we achieve throughput-maximization in the dual downlink that has a symmetric channel and an equal power budget compared to the uplink. The network duality we prove here is a generalized version of previous research [10], [11]. Computational tests show that the performance of the up- and downlink throughput for our algorithms is close to the optimal value for the channel orthogonality factor, ${\theta}{\in}$(0.5, 1]. On the other hand, when the channels are slightly orthogonal (${\theta}{\in}$(0, 0.5]), we observe some throughput degradation in the downlink. We have extended our analysis to the real downlink that has a nonsymmetric channel and an unequal power budget compared to the uplink. It is shown that the modified duality-based approach is thoroughly applied to the real downlink. Considering the complexity of the algorithms in [6] and [18], we conclude that these results are quite encouraging in terms of both performance and practical applicability of the generalized duality theorem.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• The Journal of Bigdata
• /
• v.4 no.2
• /
• pp.159-173
• /
• 2019

Last-Mile delivery optimization plays a key role in the urban supply chain operation, which is the most expensive and time-consuming and most complicated part of the whole delivery process. The urban consolidation center (UCC) is regarded as a significant asset for supporting customer demand in the last-mile delivery service. It is the key benefit of UCC to improve the load balance of vehicles and to reduce the total traveling distance by finding the better route with the well-organized multi-leg vehicle journey in the urban area. This paper presents the model using multiple scenario analysis integrated with mathematical optimization techniques using Geographic Information System (GIS). The model aims to find the best solution for the distribution network consisted of DC and UCC, which is applied to the case of Ulaanbaatar Mongolia. The proposed methodology integrates two sub-models, location-allocation model and vehicle routing problem. The multiple scenarios devised by selecting locations of UCC are compared considering the general performance and delivery patterns together. It has been adopted to make better decisions the quantitative metrics such as the economic value of capital cost, operating cost, and balance of using available resources. The result of this research may help the manager or public authorities who should design the distribution network for the last mile delivery service optimization using UCC within the urban area.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.437-441
• /
• 2006

Wireless sensor network consists of sensor nodes which are disseminated closely to each other to collect informations for the various requests of a sensor application applied for sensing phenomenons in real world. Each sensor node delivers sensing informations to an end user by conducting cooperative works such as processing and communicating between sensor nodes. In general, the power supply of a sensor node is depends on a battery so that the power consumption of a sensor node decides the entire life time of a sensor network. To resolve the problem, optimal routing algorithm can be used for prolong the entire life time of a sensor network based on the information on the energy level of each sensor node. In this paper, different from the existing Directed Diffusion and SPTN method, we presents a data dissemination protocol based on lower-power consumption that effectively maximizes the whole life time of a sensor network using the informations on the energy level of a sensor node and shortest-path hops. With the proposed method, a data transfer path is established using the informations on the energy levels and hops, and the collected sensing information from neighboring nodes in the event-occurring area is merged with others and delivered to users through the shortest path.

• Journal of Korean Society of Steel Construction
• /
• v.17 no.6 s.79
• /
• pp.661-672
• /
• 2005

For the efficient stochastic optimization of steel structures for which a large number of analyses is required, artificial neural networks,which have emerged as a powerful tool that could have been used to replace time-consuming procedures in many scientific or engineering applications, are applied. They are utilized for the solution of the equilibrium equations resulting from the application of the finite element method in connection with the reanalysis type of problem, for which a large number of finite element analyses are required in this study. As such, the use of artificial neural networks to predict finite element analysis outputs simplifies and facilitates the performance of the stochastic optimal design of structural systems where a trained neural network is used to replace the structural reanalysis phase. Moreover, to improve efficiency of used artificial neural networks, genetic algorithm is utilized. The stochastic optimizer used in this study is an algorithm based on the evolution theory. The efficiency of the proposed procedure is examined in problems with both volume (weight) functions and real-world cost functions

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1077-1083
• /
• 2015

In this paper, we introduce an energy-efficient opportunistic interference alignment (OIA) scheme that greatly improves the sum-rates in multi-cell uplink networks. Each user employs optimal transmit vector design and power control in the sense of minimizing the amount of generated interference to other-cell base stations while satisfying a required signal quality. As our main result, it is shown that owing to the reduced interference level, the proposed OIA schemes attains larger sum-rates than those of OIA with no power control for almost all signal-to-noise ratio regions. In addition, when both zero-forcing and minimum mean square error (MMSE) detectors are employed at the receiver along with the OIA scheme, it is shown that the OIA scheme with MMSE detection shows superior performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.63-68
• /
• 2018

In this paper, We intended to design various things for the realization of SoS(System on Substrate) with SIW in 24GHz ISM 밴드(24-24.25GHz). As part of them, We integrated SIW, transition and MPAA as SoS on the same substrate and investigated its characteristics. We used Rogers Ro4350 with relative permittivity of 3.48 and thickness of 20mil. As results of optimal design, insertion loss of the SIW with 11.55mm length showed 0.32dB and insertion loss of 0.19dB occurred in transition to $50{\Omega}$ microstrip. Characteristics of the MPAA integrated on the same substrate as SoS are very similar to those of stand-alone MPAA. But the integrated MPAA decreased by 0.58dB in gain, which is the sum of SIW insertion loss and transition insertion loss, and by 0.7dB in SLL compared that of stand-alone MPAA. However, the bandwidth was increased by 19.4% as it changed from 670MHz to 800Mhz.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2E
• /
• pp.32-40
• /
• 1994

It is the purpose of this paper to describe the methods for establishing loudness ratings and talker echo out of transmission quality of ISDN telephone connected to fully digital network. In order to design the desirable loudness ratings and talker echo for ISDN telephone, the model system of digital speech communication for subjective tests is developed. Using this model system, opinion tests which decide the optimal CODEC input level, the range of overall loudness rating, sidetone masking rating and talker echo are performed. From the results of tests, we decided that the loudness ratings are 6 to 8dB for sending, 0 to 2dB for receiving, and 8 to 12dB for sidetone masking rating. And, the terminal coupling loss of TCLw of at least 40dB is necessary to provide echo-free telephone communications to telophone users when the overall loudness rating of ISDN telephone is normalized to 10dB.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.31-43
• /
• 1999

The main goal of this paper is to design a high performance SVP(Stack based Video Processor) for network applications. The SVP is a comprehensive scheme; 'better' in the sense that it is an optimal selection of previously proposed enhancements of a stack machine and a video processor. This can process effectively object-based video data using a S-RISC(Stack-based Reduced Instruction Set Computer) with a semi -general-purpose architecture having a stack buffer for OOP(Object-Oriented Programming) with many small procedures at running programs. And it includes a vector processor that can improve the MPEG coding speed. The vector processor in the SVP can execute advanced mode motion compensation, motion prediction by half pixel and SA-DCT(Shape Adaptive-Discrete Cosine Transform) of MPEG-4. Absolutors and halfers in the vector processor make this architecture extensive to a encoder. We also designed a VLSI stack-oriented video processor using the proposed architecture of stack-oriented video decoding. It was designed with O.5$\mu\textrm{m}$ 3LM standard-cell technology, and has 110K logic gates and 12 Kbits SRAM internal buffer. The operating frequency is 50MHz. This executes algorithms of video decoding for QCIF 15fps(frame per second), maximum rate of VLBV(Very Low Bitrate Video) in MPEG-4.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.5
• /
• pp.26-37
• /
• 2009

This paper suggests a sensor's placement method for detecting the dilemma zone problem when real-time driver's safety service is provided at signalized intersections by multiple pointed traffic sensors using USN environments. For detecting the dangerous situations from vehicles accelerating through yellow intervals, red-light running and stopping abruptly like as dilemma zone problem, VISSIM(microscopic, behavior-based multi-purpose traffic simulation program) is used to perform a real-time multiple detection situation by changing the input data like as various inflow-volume, design speed change, driver perception and response time. As a result, the optimal interval of traffic sensors is 20~27m, and the initialized sensor location from stop-line is different according to road design speed. Moreover, the pattern of detection about dilemma zone is also different according to inflow-volumes. This paper shows that the method is useful to evaluate the sensor's placement problem based on micro-simulation and the results can be used as the basic research for USN services.