• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2047-2066
• /
• 2016

In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.

• Bulletin of the Korean Chemical Society
• /
• v.31 no.10
• /
• pp.2934-2938
• /
• 2010

Some open tubular (OT) molecule imprinted polymer (MIP) silica capillary columns with templates of camphor derivatives such as 10-camphorsulfonic acid (10-CSA), 10-camphorsulfonamide (10-CS) and camphor-p-tosyl hydrazone (CTH) have been successfully prepared by the prior generalized preparation protocol. The three MIP thin layers of different templates showed quite different morphologies. The chiral selectivity of each MIP column for the template enantiomers was optimized by changing eluent composition and pH. The optimization conditions were found to be different for the three MIPs. This work suggests prospective successful extension of the generalized preparation protocol for OT-MIP silica capillary columns toward templates of a variety of chemical groups.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.146-149
• /
• 2002

The aim of stereotactic radiosurgery(SRS) is to deliver a high dose to a target region and a low dose to critical organ through only one or a few irradiation. To satisfy this aim, optimized irradiating conditions must be searched in the planning. Thus, many mathematical methods such as gradient method, simulated annealing and genetic algorithm had been proposed to find out the conditions automatically. There were some limitations using these methods: the long calculation time, and the difficulty of unique solution due to the different shape of tumor. In this study, optimization protocol using ideal models and data base was proposed. Proposed optimization protocol constitutes two steps. First step was a preliminary work. Some possible ideal geometry shapes, such as sphere, cylinder, cone shape or the combination, were assumed to approximate the real tumor shapes. Optimum variables such as isocenter position or collimator size, were determined so that the high dose region could be shaped to fit ideal models with the arrangement of multiple isocenter. Data base were formed with those results. Second, any shaped real targets were approximated to these models using geometry comparison. Then, optimum variables for ideal geometry were chosen from the data base predetermined, and final parameters were obtained by adjusting these data. Although the results of applying the data base to patients were not superior to the result of optimization in each case, it can be acceptable as a starting point of plan.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.677-684
• /
• 2003

IETF's Mobile IP protocol allows Mobile Node(MN) to keep connection to Correspondent Node(CN) no matter what the MN changes its point of attachment to the Internet. However, the protocol incurs triangle routing problem, because all packets for the MN are routed through its Home Agent(HA). Route optimization mechanism is proposed by IETF in order to resolve triangle routing problem, but it requires that any node in the Internet should also implement route optimization mechanism. In this paper, we propose a new route optimization algorithm. With the algorithm, routers between HA and CN are considered as Intermediate Agent(IA), and packets transmitted by CN are not forwarded to HA but intercepted by IA and tunneled to MN directly.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.2
• /
• pp.7-11
• /
• 2003

Nowadays, as digital technologies are rapidly developed and requirements for the various types of broadband multimedia services increases, the radio broadcasting is moving to digitalization. DAB(Digital Audio Broadcasting), as an alternation of existing analog radio broadcasting, is a new type of multimedia broadcasting system. DAB supports not only high-quality audio broadcasting but also various types of multimedia data services. In this paper, we investigate the performance optimization method of MOT Protocol, as the standard for additional services, to support the multimedia services in the DAB network. Because the performance of the MOT protocol is dependent on various parameters such as segment size, segment repetition and so on, we find those by simulation for performance optimization. According to simulation results, the suitable segment size is about 2Kbyte and segment repetition is 4 times for performance optimization.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.11-25
• /
• 2005

In MIPv6 environment, an important design consideration for public key based binding update protocols is to minimize asymmetric cryptographic operations in mobile nodes with constraint computational power, such as PDAs and cellular phones, For that, public key based protocols such as CAM-DH. SUCV and Deng-Zhou-Bao's approach provides an optimization to offload asymmetric cryptographic operations of a mobile node to its home agent. However, such protocols have some problems in providing the optimization. Especially, CAM-DH with this optimization does not unload all asymmetric cryptographic operations from the mobile node, while resulting in the home agent's vulnerability to denial of service attacks. In this paper, we improve the drawbacks of CAM-DH. Furthermore, we adopt Aura's two hash-based CGA scheme to increase the cost of brute-force attacks searching for hash collisions in the CGA method. The comparison of our protocol with other public key based protocols shows that our protocol can minimize the MN's computation overhead, in addition to providing better manageability and stronger security than other protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1432-1440
• /
• 2022

Recently, as Virtual Desktop Infrastructure(VDI) is widely used not only in office work environments but also in workloads that use high-spec multi-core-based applications, the requirements for real-time and stability of VDI are increasing. Accordingly, the display protocol used for remote access in VDI and performance optimization of virtual machines have also become more important. In this paper, we propose two ways to configure desktop virtualization for multi-core-based application operation. First, we propose a codec configuration of a display protocol with optimal performance in a high load situation due to multi-processing. Second, we propose a virtual CPU scheduling optimization method to reduce scheduling delay in case of CPU contention between virtual machines. As a result of the test, it was confirmed that the H.264 codec of Blast Extreme showed the best and stable frame, and the scheduling performance of the virtual CPU was improved through scheduling optimization.

• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1798-1804
• /
• 2010

TCP with AIMD mechanism, one of the most popular protocols in internet, can solve congestion control in wired networks. This protocol, however, is not efficient in wireless networks. This paper proposes a new mechanism namely General AIMD with Congestion Window Upper Bound in which congestion window is limited by an upper bound. By applying optimization theory, we find an optimal policy for congestion window upper bound to maximize network throughput.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.240-242
• /
• 2007

The game theoretic analysis in wireless networks can be classified into the jamming game of the physical layer, the multiple access game of the medium access layer, the forwarder's dilemma and joint packet forwarding game of the network layer, and etc. In this paper, the game theoretic analysis about the multiple access game that selfish nodes exist in the IEEE 802.11 DCF(Distributed Coordination Function) wireless networks is addressed. In this' wireless networks, the modeling of the CSMA/CA protocol based DCF, the utility or payoff function calculation of the game, the system optimization (using optimization theory or convex optimization), and selection of Pareto-optimality and Nash Equilibrium in game strategies are the important elements for analyzing how nodes are operated in the steady state of system. Finally, the main issues about the game theory in the wireless network are introduced.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.6
• /
• pp.597-604
• /
• 2019

In this paper, we propose an improved method on an adaptive application of the CPP(Chinese Postman Problem) algorithm to the protocol test suite generation for conformance testing. Also, we present an example application of this CPP algorithm to B-ISDN Q.2931 call/connection control procedure for the purpose of showing how it can be adapted to generate a test suite for conformance testing of a communication protocol. The proposed method has an advantage of an optimization technique which finds a minimum cost of test suite from a standardized specification, so this optimization technique of the CPP algorithm can be practically applied to a real environment for testing a conformity of a protocol implementation.