• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6B
• /
• pp.199-206
• /
• 2008

Broadcast encryption is a cryptographical primitive which is designed for a content provider to distribute contents to only privileged qualifying users through an insecure channel. Anyone who knows public keys can distribute contents by means of public key broadcast encryption whose technique can also be applicable to many other applications. In order to design public key broadcast encryption scheme, it should devise some methods that convert a broadcast encryption scheme based on symmetric key cryptosystem to a public key broadcast encryption. Up to this point, broadcast encryption scheme on trial for converting from symmetric key setting to asymmetric public key setting has been attempted by employing the Hierarchical Identity Based Encryption (HIBE) technique. However, this converting method is not optimal because some of the properties of HIBE are not quite fitting for public key broadcast schemes. In this paper, we proposed new converting method and an efficient public key broadcast encryption scheme Pub-PI which is obtained by adapting the new converting method to the PI scheme [10]. The transmission overhead of the Pub-PI is approximately 3r, where r is the number of revoked users. The storage size of Pub-PI is O($c^2$), where c is a system parameter of PI and the computation cost is 2 pairing computations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1597-1601
• /
• 2013

Multiple antenna technique is attracting attention as a core technology for next-generation mobile communication systems to accommodate explosively increasing mobile data traffic. Especially, recent researches focus on multi-user multiple input multiple output (MU-MIMO) system where base stations are equipped with several tens of transmit antennas and transmit data to multiple terminals (users) simultaneously. To enhance the performance of MU-MIMO systems, we, in this paper, propose an adaptive user selection algorithm which adaptively selects a user set according to varying channel states. According to Monte-Carlo based computer simulations, the performance of proposed scheme is significantly improved compared to the conventional scheme without user selection and approaches that of exhaustive search-based optimal scheme. On the other hand, the proposed scheme can reduce the computational complexity to $K/(2^K-1)$ compared to the optimal scheme where K denotes the number of total users.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.5
• /
• pp.61-69
• /
• 2017

The study on interference channel is very important information theoretically and many studies have been done on it. However, even in the simplest case, even in the case of two user interfering channels, the channel capacity is not yet known except in special cases. Recently, research on the multiplexing gain that shows the tendency of the transmission rate in the high signal to noise ratio (SNR) band has been actively carried out, instead of accurately grasping the channel capacity. Obtaining optimal multiplexing gain can reveal trends in channel capacity at high signal-to-noise ratio bands. In an interfering channel with two users, the best multiplexing gain can be obtained by eliminating the interference. However, recent research shows that when the number of users is more than three, the optimal multiplexing gain can not be obtained only by zero forcing and a new technique called interference sorting is needed. There are two types of interference sorting techniques. Beamforming A method of effectively separating signals and interference by properly selecting matrices and constructing structured codes using rational numbers and irrational numbers. The interference alignment technique can achieve optimal multiplexing gain in various environments such as interference channel, X channel, compound broadcast channel, and multi hop network for multi source multi destination. In recent years, it has also been applied to distributed storage. Lee et al., "Lattice Code Interference Alignment in Cooperative Multipoint Transmission (COMP) for Interference Channels of Three Users", Journal of the Institute of Electronics Engineers, vol.49-TC,no.6,2012. In this paper, the DoF of delayed channel information is obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.971-989
• /
• 2015

With the development of cloud computing, more and more Web services are deployed on geo-distributed datacenters and are offered to cloud users all over the world. Through service composition technologies, these independent fine-grain services can be integrated to value-added coarse-grain services. During the composition, a number of Web services may provide the same function but differ in performance. In addition, the distribution of cloud datacenters presents a geographically dispersive manner, which elevates the impact of the network on the QoS of composite services. So it is important to select an optimal composition path in terms of QoS when many functionally equivalent services are available. To achieve this objective, we first present a graph model that takes both QoS of Web services and QoS of network into consideration. Then, a novel approach aiming at selecting the optimal composition path that fulfills the user's end-to-end QoS requirements is provided. We evaluate our approach through simulation and compare our method with existing solutions. Results show that our approach significantly outperforms existing solutions in terms of optimality and scalability.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.57-71
• /
• 2009

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.4 no.3
• /
• pp.32-48
• /
• 1994

This paper proposes the compensation algorithm of conventional shift pattern using fuzzy reasoning in automatic transmission vehicles. Recently, automatic transimssion vehicles are continually increasing because of theire ease to drive. Also users require the high performance which includes the smooth shift quality and shift scheduling that matches driver;s intentions. So the shift scheduling has been inproved significantly through the application of electronic control. But, in spite of this development, vehicles using conventional shift pattern are sometimes in discord with driver's intention on roads. In this paper, the paper, the proposed compensation algorithm makes a automatic transmission vehicle be able to select an optimal gear shifting time and position using fuzzy reasoning and make a vehicle driver feel confortable even when the vehicle runs on roads which is extremely changed. Therefore, a vehicle driver can expect to reduce the nimber of unnecessary gear shifting and expect the fuel efficiency high. To show usefulness of the proposed method, some simulation are made to compared with conventional gear shifting. Paper prosposes the compensation mehtod of conventional shift pattern using fuzzy reasoning for the purpose that a vehicle can select an optimal gerar shifting time and position in automatic vehicle. Though the conventional shift pattern has no pliability, vehicle driver can feel comfortable and can reduce the number of unnecessary gear shifting using the proposed method on variable road condition. Therefore, it can be expected the fuel efficiency.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.4
• /
• pp.63-82
• /
• 2008

The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.1-7
• /
• 2000

Generally, one-dimensional fiber optic code-division multiple-access(CDMA) system is encoded and decoded using optical orthogonal codes(OOC’s), where two-dimensional fiber optic CDMA system uses optical orthogonal signature pattern codes(OOSPC’s) for parallel data link process. The OOSPC’s should have good autocorrelation and cross-correlation properties. However, if timing information or synchronization of OOSPC’s can be obtained by other means, the property of autocorrelation may not be restricted and we can increase the number of pattern codes. In this paper we introduce the fiber optic CDMA system for parallel transmission of two-dimensional data and investigate methods of generation of two-dimensional pattern codes. The probability density function of interference noise is calculated in interfering OOSPC’s of the users and the corresponding bit error rate is derived.. We compare each OOSPC’s by plotting bit error rate versus threshold values and the number of simultaneous users, from the result, we propose the optimal OOSPC’s conditions for the parallel transmission of two-dimensional data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.652-658
• /
• 2008

In this paper, a new random access scheme is proposed to improve the probability of successful access. In the conventional scheme, a packet is transmitted by a user using one slot and considered successfully transmitted if a collision does not occur. In comparison, a packet of the proposed scheme is transmitted by a user using one or more slots and considered successfully transmitted if there is at least one slot without collision. We evaluate the optimal number of slots selected by users to maximize the probability of successful access when the probability distribution functions for the number of users are given such as Binomial and Poission distribution. From the numerical analysis, it is shown that the proposed scheme performs better than conventional scheme.

• Journal of Ocean Engineering and Technology
• /
• v.26 no.6
• /
• pp.1-6
• /
• 2012

The purpose of this paper is to present a rational method for analyzing, designing, or evaluating the spread mooring systems used with floating drilling units. This paper presents a validated model to calculate the catenary static configuration. A semi-resolution approach is presented in this paper that is capable of predicting the static performance of a caisson mooring system. The solution is derived as a function of only three parameters, which can be solved numerically by implementing different kinds of boundary conditions. The efficiency and accuracy of the method permit quick parametric studies for the optimal selection of the system particle, which is undoubtedly useful for a preliminary design. A number of numerical examples demonstrate the validity of the adopted approach. The paper contains a complete description of the test cases and reports the results in such a way that it can provide a "benchmark" test for users and programmers of computer codes for flexible riser analysis.