• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• 정보처리학회논문지C
• /
• 제19C권4호
• /
• pp.247-252
• /
• 2012

네트워크 코딩(Network Coding)은 통신망의 성능 향상에 도움을 줄 수 있으나 이의 소프트웨어적 구현은 부호화/복호화 단계에서 매우 큰 지연시간을 유발할 수 있어 이를 줄일 수 있는 병렬화된 구현이 필수적이라 할 수 있다. 본 논문에서는 랜덤 리니어 네트워크 코딩(Random Linear Network Coding)과 랜덤 리니어 네트워크 코딩의 단점을 보완하고자 최근 제안된 파이프라인 네트워크 코딩(Pipeline Network Coding)의 병렬처리 성능을 비교한다. 또한, 네트워크 코딩의 CPU에서의 병렬처리 기법과 GPGPU(General Purpose Graphics Processing Units)에서의 병렬처리 기법을 비교하여 네트워크 코딩의 사용 시 그 파라미터에 따라 적절한 병렬처리 기법을 선택할 필요성이 있음을 보여준다.

• 산업공학
• /
• 제24권2호
• /
• pp.97-104
• /
• 2011

Research for multi-variate classification has been studied through two kinds of procedures which are feature selection and classification. Feature Selection techniques have been applied to select important features and the other one has improved classification performances through classifier applications. In general, each technique has been independently studied, however consideration of the interaction between both procedures has not been widely explored which leads to a degraded performance. In this paper, through integrating these two procedures, classification performance can be improved. The proposed model takes advantage of KBANN (Knowledge-Based Artificial Neural Network) which uses prior knowledge to learn NN (Neural Network) as training information. Each NN learns characteristics of the Feature Selection and Classification techniques as training sets. The integrated NN can be learned again to modify features appropriately and enhance classification performance. This innovative technique is called ALBNN (Algorithm Learning-Based Neural Network). The experiments' results show improved performance in various classification problems.

• 대한용접접합학회:학술대회논문집
• /
• 대한용접접합학회 2002년도 Proceedings of the International Welding/Joining Conference-Korea
• /
• pp.301-306
• /
• 2002

This paper presents the use of the neural network technology to establish a mathematical model for predicting bead geometry (top-bead width, top-bead height, back-bead width and back-bead height) for multi-pass welding, and understand relationships between process parameters and bead geometry for robotic GMA welding process. Using a series of robotic arc welding, additional multi-pass butt welds were carried out in order to verify the performance of the developed neural network model. The results show that not only the proposed model can predict the bead geometry with reasonable accuracy and guarantee the uniform weld quality, but also the neural network model could be better than the linear and curvilin ear equations developed from Lee [8].

• 한국인터넷방송통신학회논문지
• /
• 제14권3호
• /
• pp.99-104
• /
• 2014

본 논문은 유무선융합망에서 스마트스크린 서비스를 효과적으로 제공하기 위하여 이기종 네트워크 환경의 멀티전송기법을 제시하였다. 유무선 융합 이종망 환경에서 다수 협업 장치간에 스마트 스크린 핸드오버 알고리즘과, AV 스트리밍과 파일의 스마트 스크린 서비스를 제공하는 NAS 장치와 서비스 관리 및 운영 시스템을 연구함으로써 이종망간 심리스 스마트 스크린 협업 서비스 호처리 엔진 및 이동성 관리, 멀티 사용자/멀티 스트림 지원하는 AV 스트리밍전송 서비스, 스마트 스크린 협업 서비스 등의 타당성을 제안하였다.

• 한국컴퓨터그래픽스학회논문지
• /
• 제3권1호
• /
• pp.29-36
• /
• 1997

기존의 많은 가상현실시스템은 단일 사용자를 위한 단일 시스템으로 개발되었다. 그러나 최근의 증가 되는 인터넷등 통신망의 이용가치로 인해 많은 사람들이 분산 가상 현실- 네트워크를 통해 다수의 참여자가 상호작용을 공유하는 가상 환경- 기술에 큰 관심을 가지게 되었다. 본 연구에서는 LAN상에서 가상환경과 상호작용을 공유하기 위해서 3차원 가상세계표현화 네트워크 모델에 관한 연구를 하였다. 상호작용이 가능한 3차원 가상세계표현은 멀티유저 환경을 지원하도록 확장한 VRML을 기반으로 하였고 네트워크 모델은 IP멀티캐스트 환경하에서 멀티유저와 상호작용을 지원하고 3차원 가상 세계를 공유하도록 하는 구조와 프로토콜로 구성되었다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.177-179
• /
• 2006

This paper presents an analysis architecture of embedded operating systems for wireless sensor network. Wireless multi-hop sensor networks use battery-operated computing and sensing device. We expect sensor networks to be deployed in an ad hoc fashion, with very high energy constraints. These characteristics of multi-hop wireless sensor networks and applications motivate an operating system that is different from traditional embedded operating system. These days new wireless sensor network embedded operating system come out with some advances compared with previous ones. The analysis is focusing on understanding differences of dominant wireless sensor network OS, such as TinyOS 2.0 with TinyOS 1.x.

• 정보처리학회논문지C
• /
• 제12C권6호
• /
• pp.875-880
• /
• 2005

제한된 자원을 가진 센서 노드들로 구성된 센서 네트워크에서 가장 중요한 이슈 중 하나는 쑤어진 에너지를 최대한 활용하여 네트워크 수명을 연장하는 것이다. 네트워크 수명을 연장하는 가장 대표적인 방법은 클러스터링 방법이다. 본 논문에서는 CH(Cluster Head) 및 후보 CH 노드들로부터 주어지는 통신 부하(load)와 잔여 에너지 양에 대한 정보를 기반으로 클러스터 크기를 동적으로 변화시켜 클러스터 내의 노드 밀도에 상관없이 각 CH에게 주어지는 부담을 일정하게 유지시키는 새로운 동적 크기 다중홉 클러스터링 방법을 제안한다. 시뮬레이션을 통해 제안된 방법이 기존의 단일홉 모드나 고정 크기 다중홉 모드 클러스터링 방법보다 우수함을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.35-57
• /
• 2014

Multi-criteria decision making (MCDM) algorithms play an important role in ensuring quality of service in an integrated HetNets (Heterogeneous Networks). The primary objective of this paper is to develop a multi-criteria vertical handoff decision algorithm (VHDA) for best access network selection in an integrated Wireless Local Area Network (WLAN)/Universal Mobile Telecommunications System (UMTS)/Worldwide Interoperability for Microwave Access (WiMAX) system. The proposed design consists of two parts, the first part is the evaluation of an Analytic Hierarchy Process (AHP) to decide the relative weights of handoff decision criteria and the second part computes the final score of the weights to rank network alternatives using Simple Additive Weighting (SAW). SAW ranks the network alternatives in a faster and simpler manner than AHP. The AHP-SAW mathematical model has been designed, evaluated and simulated for streaming video type of traffic. For other traffic type, such as conversational, background and interactive, only simulation results have been discussed and presented in brief. Simulation results reveal that the hierarchical modelling and computing provides optimum solution for access network selection in an integrated environment as obtained results prove to be an acceptable solution to what could be expected in real life scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권1호
• /
• pp.157-176
• /
• 2011

An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.