http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
이동 애드혹 네트워크에서 DSR 프로토콜을 이용한 QoS 지원
박경배(Park, Gyong-Bae),강경인(Kang, Kyoeng-In),오세덕(Oh, Se-Duck) 한국전기전자학회 2003 전기전자학회논문지 Vol.7 No.1
본 논문에서는 이동 애드혹 네트워크에서 신뢰성 향상을 위한 QoS 지원 DSR 프로토콜을 제안하였다. 제안된 알고리즘에서는 DSR을 기본 프로토콜로서 QoS를 지원하도록 구성하였고, 송수신 노드 사이의 중간노드들을 QoS 지원 노드로서 이용하였다. 이동 애드혹 네트워크 특성상 노드들의 움직임은 신뢰성 있는 데이터 전송을 제한하는 문제점이 있다. 이러한 문제점을 해결하기 위하여, 송신노드는 수신노드와 QoS 링크를 설정하고 데이터 전송 중 노드의 움직임으로 데이터 전송경로 상실을 발견한 중간 노드는 전송중인 데이터를 임시 저장한 후 수신노드까지의 새로운 경로를 탐색한 후 저장된 데이터를 수신노드까지 안전하게 전송한다. 그 결과로서, 제안된 QoS 지원 알고리즘은 움직임이 적은 네트워크에서는 100[%]에 근접하는 신뢰성을 보였고, 기존의 이동 애드혹 네트워크보다 평균 3.7737[%] 증가한 96[%]의 데이터 수신율을 보장하였다. In this paper, we propose an DSR(Dynamic Source Routing) protocol to support QoS for reliable data transmission in the mobile ad-hoc network. The proposed algorithm uses DSR protocol to support QoS as its basic routing protocol, and uses the nodes which are between source and destination nodes as key QoS support. Because of moving nodes there is some problem that is restricted reliable data transmission. For solve this problem, source node set up the QoS link with destination node. The nodes that are located at QoS link and find out loss of transmission path save the transmitting data packets. Those search a new transmission path to destination node and transmit the saved data packet to destination node. As the result of evaluation, we found the proposed QoS network guaranteed reliable data transmission with almost 100% data reception rate for slowly moving mobile ad-hoc network and with more 96% data reception rate, which is improvement of 3.7737% reception rate compared with none QoS network, for continuously fast moving mobile ad-hoc network
한지훈(Han Ji Hoon),박경배(Park Gyong Bae),곽승욱(Kwak Seung Uk),김정일(Kim Jeong II),정근원(Jeong Keun Won),송인근(Song In Keun),이광배(Lee Kwang Bae),김현욱(Kim Hyen Uk) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.1
Uses can share information and use resources effectively by using TCP/IP-based networks. So, a protocol to manage complex networks effectively is needed. For the management of the distributed networks, the SNMP(Simple Network Management Protocol) has been adopted as an international standard in 1989, and the SNMPv2 in which a security function was added was published in 1993. There are two encryption schemes in SNMPv2, the one is a DES using symmetric encryption scheme and the other is a MD5(Message Digest5) hash function for authentication. But the DES has demerits that a key length is a few short and the encryption and the authentication is executed respectively. In order to solve these problems, we use a RSA cryptography in this paper. In this paper, we examine the items related with SNMP. In addition to DES and MD5 proposed in SNMPv3, we enhance security functionality be adopting RSA, a public key algorithm executing the encryption and the authentication simultaneously. The proposed SNMPv3 security module is written in JAVA under Windows NT environment.
이광배(Lee Kwang Bae),김현욱(Kim Hyen Ug),송광석(Song Kwang Suk),김정일(Kim Jeong Il),강경인(Kang Kyeong In),박경배(Park Gyong Bae) 한국정보처리학회 1996 정보처리학회논문지 Vol.3 No.5
In this paper, we propose a fast fractal image coding algorithm to shorten long to take on fractal image encoding. For its performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make the corresponding image to be compared with. Then, the whole area of the contracted image is searched in order to find the fixed point of contractive transformation of the original image corresponding to the contracted image. It needs a lot of searching time on encoding. However, the proposed algorithm considerably reduces encoding time by using scaling method and limited search area method. On comparison of the proposed algorithm with Jacquin''s method, the proposed algorithm is at least 180 times as fast as that of Jacquin''s method on encoding time with a little degradation of the decoded image quality and a little increase of the compression rate. Therefore, it is found that the proposed algorithm largely improves the performance in the aspect of encoding time when compared with other fractal image coding methods.
강경인(Kyung-In Kang),박경배(Gyong-Bae Park) 한국컴퓨터정보학회 2009 韓國컴퓨터情報學會論文誌 Vol.14 No.9
본 논문에서는 AODV(Ad hoc On demand Distance Vector)에 기초한 트래픽 관리 이동 애드 혹 라우팅 프로토콜을 제안하고 시뮬레이션을 통하여 성능을 평가한다. 각 노드에서 사용 가능한 통신 자원을 미리 고려하여 트래픽 관리에 적합한 최단경로를 설정함으로써 평균데이터수신율을 증가시킨다. 성능평가를 위해, 노드들의 이동성을 고려하여 평균데이터수신율을 분석한다. In this paper we propose a mobile ad-hoc routing protocal based on AODV(Ad hoc On demand Distance Vector) with traffic management support and evaluate the performance through simulation. The average reception rate is increased by establishing the shortest route, considering in advance the usable communication resources at each node. For performance evaluation, we analyze the average data reception rate, considering the node mobility.
대학 부설 평생 교육원에 대한 실증적 연구 - 여주대학을 중심으로 -
김진용(Jin-yong Kim),오병완(Byeong-wan Oh),유재휘(Jae-hwi Yoo),박경배(Gyong-bae Park) 한국컴퓨터정보학회 2004 韓國컴퓨터情報學會論文誌 Vol.9 No.4
다지털 사회, 지식정보화 사회인 21세기는 유익한 정보를 획득·분석하고 가공하여 새로운 가치를 창출 할 수 있는 창의력과 종합사고능력을 요구하고 있다. 이를 위해 양성교육 중심의 학교교육의 차원을 넘어서 향상교육, 재교육, 계속교육, 열린교육 관점의 평생학습에 대한 중요성이 더욱 강조되고 있는 시기이다. 이러한 사회의 강력한 요구에 부합할 수 있는 것 중의 하나가 바로 지역거점의 대학부설 평생(사회)교육원의 역할이다. 특히 지역거점 대학의 교육환경과 우수한 인적자원을 지역주민에게 제공하고 봉사함으로써 지역의 교육적 혜택과 정보와 문화적 기반을 구축하는데 기여할 것이다. 따라서, 본 연구는 지역을 거점으로 하는 대학 부설 평생교육원의 실증적 연구를 통해 평생학습을 위한 방향과 지표를 제공하고자 한다.<br/> <br/> <br/> This study is an empirical research about lifelong education provided YIT(YeoJoo of Institue of Technology). This study aims at suggesting fundamental materials for the activation of the lifelong education provided by YIT by analyzing the participation of students and neghbouring district's residents in the programs and their requests. The lifelong education conditions should reflect the requests and levels of participants, and thereby encourage their positive participation and enhance their satisfaction with the programs.<br/>
박경배,임경묵,강경인,김정일,정근원,이광배,김현욱 명지대학교 대학원 1997 대학원논문집 Vol.1 No.-
As recently the need for electronic commerce and infra information system using Internet increases, several organizations have attempted to develop mutual authentication mechanism between Certification Authorities(CA's) as well as fundamental authentication mechanism, based on Public-key. In this paper, we propose a new efficient authentication protocol which is applicable to various servers. For the protocol, we complement Public-key certificate structure and authentication protocol defined in X.509 with self-arithmetic function and data security function of 1C card.
김병천,박경배 안성산업대학교 1997 論文集 Vol.29 No.1
Most fractal image codings schemes require too much encoding time because a large amount of computation is needed to find an optimal affine transformation point. In general, it is possible to predict more precise and various types of blocs in frequency domain rather than in spatial domain. In this paper, we propose a block classifier to predict the block type using characteristics of DCT(Discrete Cosine Transform) coefficient. AC coefficient values in frequency domain make possible to predict various types of blocks. As the results, the number of comparisons between a range block an the correspoding domain blocks to reach an optimal affine transformation point ca be reduced. Specially, signs of DCT coefficients help to find the optimal affine transformation point with only two onto by eliminating unnecessary isometric transformations among eight isometric transformations used in traditional fractal codings.