• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.329-342
• /
• 2003

Most of the existing multicast routing protocols for ad-hoc networks do not take into account the efficiency of the protocol for the cases when there are large number of sources in the multicast group, resulting in either large overhead or poor data delivery ratio when the number of sources is large. In this paper, we propose a multicast routing protocol for ad-hoc networks, which particularly considers the scalability of the protocol in terms of the number of sources in the multicast groups. The proposed protocol designates a set of sources as the core sources. Each core source is a root of each tree that reaches all the destinations of the multicast group. The union of these trees constitutes the data delivery mesh, and each of the non-core sources finds the nearest core source in order to delegate its data delivery. For the efficient operation of the proposed protocol, it is important to have an appropriate number of core sources. Having too many of the core sources incurs excessive control and data packet overhead, whereas having too little of them results in a vulnerable and overloaded data delivery mesh. The data delivery mesh is optimally reconfigured through the periodic control message flooding from the core sources, whereas the connectivity of the mesh is maintained by a persistent local mesh recovery mechanism. The simulation results show that the proposed protocol achieves an efficient multicast communication with high data delivery ratio and low communication overhead compared with the other existing multicast routing protocols when there are multiple sources in the multicast group.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.10
• /
• pp.3626-3632
• /
• 2010

Some design changes were made to enhance the uniformity of temperature distribution inside the chamber of semiconductor test equipment. The design changes include the installation of adjustable airflow controller inside the chamber, the alignment of the centers of heater and match plate, the change in the size and the shape of holes in match plate base, and the addition of new holes of 2 mm diameter in order to allow airflow directly to the temperature sensors. In order to verify their effects, the temperature distributions inside the chambers were measured using 32 RTD sensors before and after the design changes. The temperature distributions were in the ranges of 87.1 to $91.5^{\circ}C$ ($90{\pm}2.9^{\circ}C$) and 89.5 to $90.8^{\circ}C$ ($90{\pm}0.8^{\circ}C$) before and after the design changes, respectively. The above temperature distribution after design changes was maintained for longer than 15 minutes, which satisfied the target temperature range of $90{\pm}1^{\circ}C$ for longer than 10 minutes.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.9
• /
• pp.385-396
• /
• 2017

Many IoT platforms have been proposed for various IoT devices, from low-end to high-end performance. We previously proposed a new IoT platform called MinT that supports the operation of the sensing devices and network communication. In the proposed platform, the things can flexibly connect to each other and efficiently share their information. Most IoT platforms, including the MinT, support thread pooling to quickly process requests. However, using a thread pool with a fixed thread count can cause network delay and inefficient energy consumption. In this paper, we propose an enhanced method to manage the thread pool efficiently by adjusting the number of threads every cycle to regulate the device's performance. In particular, we aim to improve the performance of the Interaction Thread Pool Group, which is responsible for analyzing, processing, and re-transmitting the received packets. The experiment shows that the improved method increases the average throughput by approximately 25% compared to the existing platforms. Finally, using the proposed method, the MinT can reduce the transmission delay and energy consumption of devices in the IoT environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1444-1455
• /
• 1999

In the standard location strategy such as IS-41 and GSM, Home Location Register(HLR) and Visitor Location Register(VLR) databases are used to manage the location of mobile terminals. The primary goal that location management schemes investigate is to reduce the cost of database access and the traffic for signaling network. When mobile terminals move frequently, one of problems in the standard location management scheme is that HLR database is highly updated and the traffic in signaling network can be occurred significantly due to high message transfer rate between HRL and VLR. As a solution to these problems, this paper proposes the location management scheme using VLR Gateway(VG) to reduce the both traffics of HLR update and signaling network which are resulted from location registration requirements of mobile terminals whenever they cross their registration area boundary. VG is a kind of database that is placed between HLR and VLR. It integrates one or more registration area defined in a system into one group and plays a role on behalf of HLR in a integrated registration scope so that the call delivery and the movement of mobile terminals are possible without HLR access in the scope. In order to evaluate performance of IS-41 and proposed scheme, we simulate two schemes based on wide range of call to mobility ratio. Its experiment result shows that in the proposed scheme total database cost increased slightly whereas HLR and signaling traffic decreased remarkably.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.39-48
• /
• 2006

In this paper, we analyze the spectral efficiency of multicarrier-code division multiple access (MC-CDMA) scheme. First, we derive a generalized formula for the spectral efficiency according to the number of subcarriers involved in, code division multiplexing and the number of codes used (i.e., loading factor), under a given set of channel coefficients. Also, we derive a generalized formula for spectral efficiency of various reduced-complexity systems that divide the full sets of subcarriers into several groups of subcarriers for code division multiplexing. Then, through these derivations, we establish an inter-relationship between the frequency selectivity and diversity order according to the number of multipaths. From the results, we choose the smallest code length while maximizing the diversity effect, provide an optimum subcarrier allocation strategy, and finally suggest a system structure for capacity-maximizing under the smallest code length. Through numerical analyses under simulated environments, we analyze the properties of spectral efficiency of various systems with reduced complexity and choose a major contributing factors to system design and a better system design methodology. Finally, we compare the spectral efficiency of the MC-CDMA scheme and orthogonal frequency division multiplexing (OFDM) scheme to make a relationship between both schemes.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.341-354
• /
• 2005

The main bottleneck for large scale VOD systems is bandwidth of storage or network I/O due to the large number of client requests simultaneously, and then efficient techniques are required to solve the bottleneck problem of the VOD system. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, called P2P proxy patching, for improving the typical patching technique by jointly using the prefix caching and P2P proxy. In our proposed scheme, each client plays a role in a proxy to multicast a regular stream to other clients that request the same video stream. Due to the use of the P2P proxy and the prefix caching, the client requests that ive out of the patching window range can receive the regular stream from other clients in the previous patching group without allocating the new regular channels from the VOD server to the clients. In the performance study, we show that our patching scheme can reduce the server bandwidth requirement about $33\%$ less than that of the existing patching technique with respect to prefix size and request interval.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.136-138
• /
• 2005

무선 브로드캐스트 환경에서는 모바일 클라이언트의 제한된 배터리와 클라이언트에서 서버로의 제한된 상향 대역폭 등의 문제로 기존의 동시성 제어 기법을 그대로 사용할 수 없다. 이런 문제를 해결하고자 많은 동시성 제어 기법들이 연구되어 왔는데, 지금까지 제안된 기법들은 편향된 데이터의 접근 패턴을 반영한 브로드캐스트 환경을 고려하지 못하고 있다. 무선 브로드캐스트 환경에서 서버는 일반적으로 모바일 클라이언트의 접근 패턴을 고려하여 편향된 접근 빈도를 갖는 데이터 아이템을 브로드캐스트 한다. 본 논문에서는 무선 브로드캐스트 환경에서 편향된 데이터 접근 패턴을 고려한 동시성 제어 기법을 제안한다. 제안하는 기법은 브로드캐스트 디스크 모델에서 전체 메이저 브로드캐스트 주기마다. 모바일 트랜잭션을 위한 제어 정보를 보내는 것이 아니라 일정한 마이너 브로드캐스트 주기마다. 제어 정보를 전송한다. 이는 접근 빈도가 놓은 데이터가 갱신된 경우 갱신된 내용을 마이너 그룹마다 반영하므로 읽기 전용 트랜잭션이 접근하는 데이터가 최신 정보임을 보장할 뿐만 아니라 갱신 트랜잭션이 최종 검증을 위해서 상향 통신 대역폭을 이용하는 횟수를 줄이고, 보다. 빠른 재실행을 통해 모바일 트랜잭션의 평균 응답시간을 줄여줄 수 있다. 또한 모바일 트랜잭션의 요청이 편향된 경우, 반복적인 트랜잭션의 중단, 재실행으로 인한 성능 저하를 개선하고자 정적 백오프 기법을 이용하여 모바일 트랜잭션 간 충돌 가능성을 줄여준다. 마지막으로 시뮬레이션을 통해 기존의 기법들에 비해 평균 접근 시간, 상향 통신 대역폭 등의 사용량이 현저히 줄어드는 것을 보임으로써 제안하는 기법의 성능을 검증한다.한 평균 access time을 최소화하는 동시에 클라이언트들의 제한된 에너지 소비를 최소화하는데 목적이 있다. 제안기법에 대한 평가는 수학적 분석을 통해 HIDAF 기법과 기존의 브로드캐스트 기법의 성능을 비교 분석한다.하였으나 사료효율은 증진시켰으며, 후자(사양, 사료)와의 상호작용은 나타나지 않았다. 이상의 결과는 거세비육돈에서 1) androgen과 estrogen은 공히 자발적인 사료섭취와 등지방 침적을 억제하고 IGF-I 분비를 증가시키며, 2) 성선스테로이드호르몬의 이 같은 성장에 미치는 효과의 일부는 IGF-I을 통해 매개될 수도 있을을 시사한다. 약 $70 {\~} 90\%$의 phenoxyethanol이 유상에 존재하였다. 또한, 미생물에 대한 항균력도 phenoxyethanol이 수상에 많이 존재할수록 증가하는 경향을 나타내었다. 따라서, 제형 내 oil tomposition을 변화시킴으로써 phenoxyethanol의 사용량을 줄일 수 있을 뿐만 아니라, 피부 투과를 감소시켜 보다 피부 자극이 적은 저자극 방부시스템 개발이 가능하리라 보여 진다. 첨가하여 제조한 curd yoghurt는 저장성과 관능적인 면에서 우수한 상품적 가치가 인정되는 새로운 기능성 신제품의 개발에 기여할 수 있을 것으로 사료되었다. 여자의 경우 0.8이상이 되어서 심혈관계 질환의 위험 범위에 속하는 수준이었다. 삼두근의 두겹 두께는 남녀 각각 $20.2\pm8.58cm,\;22.2\pm4.40mm$으로 남녀간에 유의한 차이는 없었다. 조사대상자의 식습관 상태는 전체 대상자의 $84.4\%$가 대부분

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.107-114
• /
• 2002

In these days, rapid advances of the computer system and the high speed network have made the multimedia services popularized among various applications and services in the internet. Internet live broadcasting, a part of multimedia services, makes it possible to provide not only existing broadcasting services including audio and video but also interactive communications which also expand application scopes by freeing from both temporal and spatial limitation. In the Paper, an interned Personal-live broadcasting server system is developed by allowing individual users to actively create or join live-broadcasting services with such basic multimedia devices as a PC camera and a sound card. As the number of broadcasters and participants increases, concurrent multiple channels are established and groups are to be expanded. The system should also guarantee High Availability (HA) for continuous services even in the presence of partial failure of the cluster. Furthermore, a transmission mode switching is supported to consider network environments in the user system.

• Archives of design research
• /
• v.12 no.4
• /
• pp.61-68
• /
• 1999

Most of the time, developers spend their energy to analyze the main function of the system or make source codes. As a result, they can not consider user interface on their own system and this is true in most programmer's world. But we want to consider the design concept in developing mechanism. In this case we have to upgrade the legacy system which maintaining the transmission system using the copper cables, and add the transmission system using the optical fiber cables. Therefore we design the user interface make easy for end users who are using the maintaining system on copper cables not to confuse the new system which include optical fibers. Especially, we are consider the developing model of design policy and real user to make easy to use new system. In this paper we will describe the instance to adapt the design concept on Broadband Access Network Operation Support System.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.53-61
• /
• 2008

Public Key Broadcast Encryption (PKBE) allows a sender to distribute a message to a changing set of users over an insecure channel. PKBE schemes should be able to dynamically exclude (i.e., revoke) a certain subset of users from decrypting a ciphertext, so that only remaining users can decrypt the ciphertext. Another important requirement is for the scheme to be forward-secrecy. A forward-secure PKBE (fs-PKBE) enables each user to update his private key periodically. This updated private key prevents an adversary from obtain the private key for certain past period, which property is particularly needed for pay-TV systems. In this paper, we present a fs-PKBE scheme where both ciphertexts and private keys are of $O(\sqrt{n})$ size. Our PKBE construction is based on Boneh-Boyen-Goh's hierarchical identity-based encryption scheme. To provide the forward-secrecy with our PKBE scheme, we again use the delegation mechanism for lower level identities, introduced in the BBG scheme. We prove chosen ciphertext security of the proposed scheme under the Bilinear Diffie-Hellman Exponent assumption without random oracles.