• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.310-317
• /
• 2005

In opposition to conventional networks, mobile ad hoc networks usually do not offer trust about nodes or online access through certificate authorities or centralized servers. But, nodes in those systems need process that can search path as well as trust each other to exchange data in safety For these reasons, traditional security measures that require online trusted authorities or certificate storages are not well-suited for securing ad hoc networks. In this paper, I propose a secure and effective method to search the optimized path using profitable flooding techniques on certificate chains in MANETS(Mobile Ad hoc NETworks). This system includes not only using routing protocols that are generally broadcasting packets but also finding nodes securely and verifing the process through tiust relationships between nodes that are searched.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1037-1053
• /
• 1991

Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.795-806
• /
• 1996

A structure which transmits and receives 3 subscribers packet data through an optical splitter node in an optical subscriber network of PON wave suggested and realized. All the functions which are necessary to use PON structure such as 155.52Mb/s multiplexer/demultiplexer of down-stream signal, 25.92Mb/s multiplexer/demultiplexer of up-stream signal, frame synchronizer, and phase aligner for aligning phase of the clock and received data have been integrated within 2 ICs using CMOS technonology. TDMAtechnology was suggested for up-stream transmission. In the optical up-stream transmission of the urst signals transmissionquality degradataion by APC and AGC of optical tranceiver was observed. By compensating the degradation, more than 17dB of link budget which is enough to satisfy 11.2dBthat is required in SWAN of PON architecture has been obtained with optical transceiver whose power and sensitivity are -17dBm and -34dBm respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1381-1387
• /
• 2014

According to continuous development of information technology, it is needed to make convergence of other disciplines such as humanities and area studies. Among convergence fields related to information technology and humanities/area studies, electronic cultural atlas represents various digitalized cultural information on electronic map using spatial data such as points, lines, and polygons through time, spatial, and subject axises. Knowledge map is to represent special academic information based on electronic cultural atlas. In details, knowledge map can provide integrated information sharing and spread because academic information associated with electronic cultural atlas and data related to per subjects, regions, and period become organically connected. Therefore, knowledge map may be utilized to promote scholastic research and diffuse research result. In this paper, we describe basic concept and composition of knowledge map and propose design method to construct knowledge map.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2409-2417
• /
• 1994

The ODR(orthogonal double-rotation) digital lattice filters have desirable properties for VLSI implementation such as local connection, regularity and pipelinability. These filters are also known to exhibit good numerical behavior for finite precision implementation. Although these filters can be pipelined by the cut-set localization procedure, it should be noted that the maximum sample rate obtained by this technique is limited by the feedback computations. In this paper, a pipelining method for the ODR digital lattice filter is proposed, by which the sample rate can be increased at any desired level. it is also shown that the low-power CMOS digital implementation of ODR digital lattice filters can be done successfully using our pipelining method. The pipelining method is based on the properties of the Schur algoithm, constrained filter design methods, and the polyphase decomposition technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1395-1404
• /
• 2000

In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1A
• /
• pp.50-58
• /
• 2008

The use of space-division multiple access(SDMA) in the downlink of multiuser multi-input/multi-output(MIMO) wireless transmission systems can provide substantial gains in system throughput. When the channel state information(CSI) is available at the transmitter, a considerable performance improvement can be attained by adapting the transmission rates to the reported CSI. In addition, to combat frequency selective fadings in wideband wireless channels, bit-interleaved coded OFDM(BIC-OFDM) modulation schemes are employed to provide reliable packet delivery by utilizing frequency diversity through channel coding. In this paper, we propose an adaptive modulation and coding(AMC) scheme combined with an opportunistic scheduling technique for the MIMO BIC-OFDM with bandwidth-limited feedback channels. The proposed scheme enhances the link performance by exploiting both the frequency diversity and the multiuser diversity. To reduce the feedback information, the proposed AMC scheme employs rate adaptation methods based on an OFDM symbol rather than on the whole subchannels. Simulation results show that the proposed scheme exhibits a substantial performance gain with a reasonable complexity over single antenna systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.745-748
• /
• 2011

현재 양돈산업에서의 인공수정(Artificial Insemination, AI) 기술은 1994년 이후 본격적으로 국내 양돈농가에 보급되어 양돈 산업 발전에 많은 영향을 주었다. 현재 국내 비육돈 임신의 80% 이상이 인공수정 센터에 공급하는 정액에 의해 이뤄지는 등 양돈 산업에서 차지하는 비중과 중요성이 매우 중요하며, 또한 국내 양돈 산업분야의 인공수정 기술은 번식과 육종개량 분야에서 절대적인 영향을 미치고 있다. 이러한 중요성에도 불구하고 전국 AI센터의 정액 생산 및 공급에 관한 기록은 53%이상 수기에 의존하고 있다. 그나마 이에 대한 수집된 현장자료는 전국 AI센터의 개별시스템에 수작업으로 입력 관리되어 원시 데이타의 오류 및 통합정보 활용이 매우 어렵다. 이에 XML을 기반으로 전국 AI센터의 통합정보 관리시스템 모델을 제안한다. 제안된 정보관리 모델은 웹을 기반으로 전국 AI센터의 정보를 통합관리 활용할 수 있으며, 이를 통해 통합된 정보의 통계분석, 미래 예측분석 자료 등으로 활용되어 효율적인 돼지개량 체계를 구축할 것으로 기대한다.

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

For group security to protect group data or to charge, group keys should be updated via key update messages when the membership of group changes. If we lose these messages, it is not possible to decrypt the group data and so this is why the recovery of lost keys is very significant. Any message lost during a certain member is logged off can not be recovered in real-time. Saving all messages and resending them by KDC (Key Distribution Center) not only requests large saving spaces, but also causes to transmit and decrypt unnecessary keys. This paper analyzes the problem of the loss of key update messages along with other problems that may arise during member login procedure, and also gives an efficient method for recovering group keys and auxiliary keys. This method provides that group keys and auxiliary keys can be recovered and sent effectively using information stored in key-tree. The group key generation method presented in this paper is simple and enable us to recover any group key without storing. It also eliminates the transmissions and decryptions of useless auxiliary keys.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1175-1184
• /
• 1992

A new classification method and recognition algorithms for printed Korean and Chinese character is studied for Korean text which contains both Korean and Chinese characters. The proposed method utilizes structural features of the vertical and horizontal vowel in Korean character. Korean characters are classified into 6 groups. Vowel and consonant are separated by means of different vowel extraction methods applied to each group. Time consuming thinning process is excluded. A modified crossing distance feature is measured to recognize extracted consonant. For Chinese character, an average of stroke crossing number is calculated on every characters, which allows the characters to be classified into several groups. A recognition process is then followed in terms of the stroke crossing number and the black dot rate of character. Classification between Korean and Chinese character was at the rate of 90.5%, and classification rate of Ming-style 2512 Korean characters was 90.0%. The recognition algorithm was applied on 1278 characters. The recognition rate was 92.2%. The densest class after classification of 4585 Chinese characters was found to contain only 124 characters, only 1/40 of total numbers. The recognition rate was 89.2%.