• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2004년도 추계학술대회 학술발표 논문집 제14권 제2호
• /
• pp.553-559
• /
• 2004

In todays security industry, personal identification is also based on biometric. Biometric identification is performed basing on the measurement and comparison of physiological and behavioral characteristics, Biometric for recognition includes voice dynamics, signature dynamics, hand geometry, fingerprint, iris, etc. Iris can serve as a kind of living passport or living password. Iris recognition system is the one of the most reliable biometrics recognition system. This is applied to client/server system such as the electronic commerce and electronic banking from stand-alone system or networks, ATMs, etc. A new algorithm using nonlinear function in recognition process is proposed in this paper. An algorithm is proposed to determine the localized iris from the iris image received from iris input camera in client. For the first step, the algorithm determines the center of pupil. For the second step, the algorithm determines the outer boundary of the iris and the pupillary boundary. The localized iris area is transform into polar coordinates. After performing three times Wavelet transformation, normalization was done using sigmoid function. The converting binary process performs normalized value of pixel from 0 to 255 to be binary value, and then the converting binary process is compare pairs of two adjacent pixels. The binary code of the iris is transmitted to the by server. the network. In the server, the comparing process compares the binary value of presented iris to the reference value in the University database. Process of recognition or rejection is dependent on the value of Hamming Distance. After matching the binary value of presented iris with the database stored in the server, the result is transmitted to the client.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1152-1168
• /
• 2010

Recently, due to the prevalence of various mobile devices and wireless broadband networks, there has been a significant increase in interest and demand for multimedia streaming services such as the mobile IPTV. In such a wireless broadband network, transmitting a continuous stream of multimedia data is difficult to achieve due to mobile stations (MSs) movement. Providing Quality of Service (QoS) for multimedia video streaming applications requires the server and/or client to be network-aware and adaptive. Therefore, in order to deploy a mobile IPTV service in wireless broadband networks, offering users efficient wireless resource utilization and seamlessly offering user perceived QoS are important issues. In this paper, we propose a new adaptive streaming scheme, called MARC (Mobile-aware Adaptive Rate Control), which adjusts the quality of bit-stream and transmission rate of video streaming based on the wireless channel status and network status. The proposed scheme can control the rate of multimedia streaming to be suitable for the wireless channel status by using awareness information of the wireless channel quality and the mobile station location. The proposed scheme can provide a seamless multimedia playback service in wireless broadband networks in addition to improving the QoS of multimedia streaming services. The proposed MARC scheme alleviates the discontinuity of multimedia playback and allocates a suitable client buffer to the wireless broadband network. The simulation results demonstrate the effectiveness of our proposed scheme.

• 정보처리학회논문지C
• /
• 제9C권1호
• /
• pp.79-88
• /
• 2002

트랜스코딩(transcoding) 프록시 서버는 무선 이동 데이터 망을 통한 웹 검색 시의 응답지연을 줄이기 위하여 널리 채택되고 있는 기술 중 하나이다. 그러나, 프록시 서버로 네트워크 트래픽이 집중되는 병목현상이 발생할 수 있다는 점과 프록시 서버에 문제가 발생하면 전체 서비스가 중단된 수 있다는 점이 이 기술이 갖는 단점이다. 본 논문에서는 이러한 문제를 해결하기 위하여 분산 프록시 서버 시스템을 제안한다. 제안하는 시스템은 지역적으로 분산된 다수의 프록시 서버로 구성되며, 각 프록시 서버는 하나 또는 다수의 셀들로 구성되는 지역내의 서비스를 담당하도록 하여 프록시 서버의 작업량을 분담시킨다. 이들 서비스 지역 간에 클라이언트의 이동이 발생한 경우 프록시 서버간의 핸드오프 프로토콜에 의하여 변환 서비스가 지속적으로 이루어지도록 한다. 또한, 프록시 서버 간의 핸드오프 처리론 수행할 수 있도록 개선된 프록시 서버와 클라이언트 에이전트의 구조를 소개하고 이들의 성능을 실험을 통하여 분석한다.

• 정보와 통신
• /
• 제31권3호
• /
• pp.103-116
• /
• 2014

This paper proposes the design of Vehicular Cyber-Physical Systems (called VCPS) based on vehicular cloud for smart road networks. Our VCPS realizes mobile cloud computing services where vehicles themselves or mobile devices (e.g., smartphones and tablets of drivers or passengers in vehicles) play a role of both cloud server and cloud client in the vehicular cloud. First, this paper describes the architecture of vehicular networks for VCPS and the delay modeling for the event prediction and data delivery, such as a mobile node's travel delay along its navigation path and the packet delivery delay in vehicular networks. Second, the paper explains two VCPS applications as smart road services for the driving efficiency and safety through the vehicular cloud, such as interactive navigation and pedestrian protection. Last, the paper discusses further research issues for VCPS for smart road networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2895-2921
• /
• 2018

Security has become one of the major concerns in mobile adhoc networks (MANETs). Data and voice communication amongst roaming battlefield entities (such as platoon of soldiers, inter-battlefield tanks and military aircrafts) served by MANETs throw several challenges. It requires complex securing strategy to address threats such as unauthorized network access, man in the middle attacks, denial of service etc., to provide highly reliable communication amongst the nodes. Intrusion Detection and Prevention System (IDPS) undoubtedly is a crucial ingredient to address these threats. IDPS in MANET is managed by Command Control Communication and Intelligence (C3I) system. It consists of networked computers in the tactical battle area that facilitates comprehensive situation awareness by the commanders for timely and optimum decision-making. Key issue in such IDPS mechanism is lack of Smart Learning Engine. We propose a novel behavioral based "Smart Multi-Instance Multi-Label Intrusion Detection and Prevention System (MIML-IDPS)" that follows a distributed and centralized architecture to support a Robust C3I System. This protocol is deployed in a virtually clustered non-uniform network topology with dynamic election of several virtual head nodes acting as a client Intrusion Detection agent connected to a centralized server IDPS located at Command and Control Center. Distributed virtual client nodes serve as the intelligent decision processing unit and centralized IDPS server act as a Smart MIML decision making unit. Simulation and experimental analysis shows the proposed protocol exhibits computational intelligence with counter attacks, efficient memory utilization, classification accuracy and decision convergence in securing C3I System in a Tactical Battlefield environment.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.7-12
• /
• 1996

This research is on an interactive animation prototype which can be used by many users from different computers, that means a network with one server and many clients. In our research, a complete motion is represented by simple motion characteristics. We establish databases which contain all kinds of human motion characteristics. Using flexible connection and appropriate time control, we are able to recompose a sequential serial motion data. Moreover, an interactive application system is needed among the uses with a server from animator. In this research, we also investigate three methods of“connect motion database”. We are planing to use the method of connecting motion database under networks with a client-server application system.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.499-510
• /
• 2011

Any server offering a routing service in the Internet would naturally be in competition for clients, and clients may need to utilize service from a specific server in order to achieve a desired result. We study the various properties of this competition, such as the fraction of route requests handled by a routing service provider and the fraction of total revenue obtained. As the routing service providers (i.e., servers or routers in this context) compete, they may alter behavior in order to optimize one of the above properties. For example, a service provider may lower the price charged for its service, in order to increase the number of clients served. Our models are based on servers offering a routing service to clients within representative network topologies based on actual Internet sub-graphs. These models provide, a framework for evaluating competition in the Internet. We monitor key aspects of the service, as several variables are introduced into the models. The first variable is the fraction of client requests that will pay more for a better quality route. The remaining requests are normal client requests that are satisfied by the most economical route. The second variable is the fraction of servers who choose to lower service prices in order to maximize the number of client requests served. As this fraction increases, it is more likely that a server will lower the price. Finally, there are some resource constraints applied to the model, to increase the difficulty in providing a routing solution, i.e., to simulate a realistic scenario. We seek to understand the effect on the overall network, as service providers compete. In simple cases, we show that this competition could have a negative impact on the overall efficiency of a service. We show that the routing variety present in the larger models is unable to mask this tendency and the routing service performance is decreased due to competition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.811-829
• /
• 2015

One-way authenticated key agreement protocols, aiming at solving the problems to establish secure communications over public insecure networks, can achieve one-way authentication of communicating entities for giving a specific user strong anonymity and confidentiality of transmitted data. Public Key Infrastructure can design one-way authenticated key agreement protocols, but it will consume a large amount of computation. Because one-way authenticated key agreement protocols mainly concern on authentication and key agreement, we adopt multi-server architecture to realize these goals. About multi-server architecture, which allow the user to register at the registration center (RC) once and can access all the permitted services provided by the eligible servers. The combination of above-mentioned ideas can lead to a high-practical scheme in the universal client/server architecture. Based on these motivations, the paper firstly proposed a new one-way authenticated key agreement scheme based on multi-server architecture. Compared with the related literatures recently, our proposed scheme can not only own high efficiency and unique functionality, but is also robust to various attacks and achieves perfect forward secrecy. Finally, we give the security proof and the efficiency analysis of our proposed scheme.

• 한국멀티미디어학회논문지
• /
• 제6권1호
• /
• pp.128-135
• /
• 2003

지금까지 분산-큐 이중-버스(DQDB)의 공정성을 위한 제어는 대부분 평형 트래픽, 대칭형 트래픽, 역대칭형 트래픽 같은 특정 트래픽를 대상으로 연구하였다. 본 논문에서는 이러한 특정 트래픽이 아닌 일반적인 트래픽 형태인 클라이언트-서버 트래픽 환경에서 DQDB 네트워크의 대역폭을 모든 스테이션에 공평하게 분배 할 수 있는 효율적인 제어 방식을 제안한다. 제안한 방식은 접근 임계값을 기준으로 서버에게는 APS(Access Protection Scheme)를 적용하고, 클라이언트에게는 접근 임계값만으로 대역 폭 할당을 제어한다. 시뮬레이션을 통하여 다른 방식보다 제안한 방식이 더 우수하다는 것을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권6호
• /
• pp.312-332
• /
• 2008

Password-based authentication key exchange (PAKE) protocols in the literature typically assume a password that is shared between a client and a server. PAKE has been applied in various environments, especially in the “client-server” applications of remotely accessed systems, such as e-banking. With the rapid developments in modern communication environments, such as ad-hoc networks and ubiquitous computing, it is customary to construct a secure peer-to-peer channel, which is quite a different paradigm from existing paradigms. In such a peer-to-peer channel, it would be much more common for users to not share a password with others. In this paper, we consider password-based authentication key exchange in the three-party setting, where two users do not share a password between themselves but only with one server. The users make a session-key by using their different passwords with the help of the server. We propose an efficient password-based authentication key exchange protocol with different passwords that achieves forward secrecy in the standard model. The protocol requires parties to only memorize human-memorable passwords; all other information that is necessary to run the protocol is made public. The protocol is also light-weighted, i.e., it requires only three rounds and four modular exponentiations per user. In fact, this amount of computation and the number of rounds are comparable to the most efficient password-based authentication key exchange protocol in the random-oracle model. The dispensation of random oracles in the protocol does not require the security of any expensive signature schemes or zero-knowlegde proofs.