• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.165-170
• /
• 2007

The main goal of research concerning clustering protocols is to minimize the energy consumption of each node and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols mainly focused on the design and formation of clusters, leaving the consideration of communication between the cluster head and the sink behind. In this paper, we propose efficient multi path routing algorithm by using MAC-NET Cross-layering. multi path needed only one tiny packet from sink to setup. In addition proposed algorithm can be used for any cluster-based hierarchical inter-clustering routing algorithm. The simulation results demonstrate that proposed algorithm extended the overall survival time of the network by reducing the load of cluster heads. The performance of proposed algorithm is less affected by the extension of sensing field than other inter-clustering operation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.471-479
• /
• 2008

In this paper, we propose a novel algorithm to automatically generate an RTP timestamp value that is required for the RTP packetization in order to transmit SVC video over various If networks such as Internet. Unlike the conventional single layer coding algorithms such as H.263, MPEG-4 and H.264, SVC generates a multi-layered single bitstream which is composed of a base layer and one or more enhancement layers in order to simultaneously provide temporal, spatial, and SNR scalability. Especially, in order to provide temporal scalability based on hierarchical B-picture prediction structure, the encoding (or transmission) and display order of pictures in SVC coding is completely decoupled. Thus, the timestamp value to be specified at the header of each RTP packet in video transmission does not increase monotonically according to the display time instant of each picture. Until now, no method for automatically generating an RTP timestamp when SVC video is loaded in a RTP packet has teen introduced. In this paper, a novel automatic RTP timestamp generation method exploiting the TID (temporal ID) field of the SVC NAL unit header is proposed to accommodate the SVC video transmission.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.626-626
• /
• 2015

본 연구에서는 하천공간정보의 웹서비스를 위해 SOAP(Simple Object Access Protocol) API 및 REST(Representation State Transfer) API로 제공하는 HydroG-OneFlow 웹서비스를 개발하였다. HydroG-OneFlow는 GML 기반의 서비스를 제공하며 GetBasin, GetGeoVariable 및 GetData 등의 기본서비스로 구성된다. GML은 GIS S/W의 벡터 GML 포맷과 공간정보 오픈플랫폼 서비스인 브이월드 데이터 API에서 제공하는 GML 포맷을 참고하여 하천공간 벡터정보를 제공할 수 있도록 GML을 구성하였다. GDM 공간 데이터에 대한 벡터정보 ML 수용 수준을 향상시킬 수 있도록 벡터구조의 점, 선, 면 정보에 대하여 GML의 PointPropertyType, CurvePropertyType, SurfacePropertyType을 도입하였다. 또한 일반적인 공간자료에서는 Multi 객체에 대한 지원도 필요하다. 현 GDM 데이터베이스에서도 OGC 표준의 MultiPoint, MultiLineString, MultiPolygon을 지원하고 있다. 이를 위하여 GML의 상응 요소인MultiPointPropertyType, MultiCurvePropertyType, MultiSurfacePropertyType을 하천공간정보 벡터 스키마에 도입하여 활용하였다. 클라이언트 서버 통신은 메시지 교환프로토콜인 SOAP을 사용하여 서버의 객체를 직접 호출하여 이루어진다. 서버는 서버의 제공 서비스를 WSDL(Web Service Description Language)를 통하여 게시하고 클라이언트는 이 기준(Criteria)을 참고하여 접근한다. GetData의 경우 Type(GRID or VECTOR), GDM(Geospatial Data Model) 여부(true or false), LayerName, BasinID, GenTime을 인자로 받아 GeoData에서 검색된 정보를 반환한다. SOAP버전은 1.1과 1.2를 지원하여 접근하는 클라이언트에서 선택할 수 있도록 개발하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.132-140
• /
• 2003

In this paper, we propose a new scheme for view-dependent transmission of three-dimensional (3-D) polygonal mesh models with hierarchial partitioning. In order to make a view-dependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. By setting higher priorities to visible parts than invisible parts, we can obtain good qualify of 3-D models in a limited transmission bandwidth. In this paper, we use a multi -layer representation of 3-D mesh models based on hierarchical partitioning. After representing the 3-D mesh model in a hierarchical tree, we determine resolutions of partitioned submeshes in the last level. Then, we send 3-D model data by view-dependent selection using mesh merging and mesh splitting operations. By the partitioned mesh merging operation, we can reduce the joint boundary information coded redundantly in the partitioned submeshes. We may transmit additional mesh information adaptively through the mesh spritting operation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.4
• /
• pp.118-129
• /
• 2008

This paper describes an IEEE 802.15.4-based hierarchical sensor network model for a VAWS(Vehicle Approach Warning System) which provides the drivers of vehicles approaching a sharp turn with the information about vehicles approaching the same turn from the opposite end. In the proposed network model, a tree-structured topology, that can prolong the lifetime of network is formed in a self-organizing manner by a topology control protocol. A simple but efficient routing protocol, that creates and maintains routing tables based on the network topology organized by the topology control protocol, transports data packets generated from the sensor nodes to the base station which then forwards it to a display processor. These protocols are designed as a network layer extension to the IEEE 802.15.4 MAC. In the simulation, which models a scenario with a sharp turn, it is shown that the proposed network model achieves a high-level performance in terms of both energy efficiency and throughput simultaneously.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.67-74
• /
• 2009

This paper presents a method of improving the service availability by distributing the traffic of voice/data calls over the multi-layer cells in a mobile communication network. The traffic model is described and the call handling performance is analyzed. In our method, a fast moving call is moved to and serviced in the upper layer cell. A call is also moved upward when an overflow occurs. But unlike other methods, the call that is moved upward in the overflow case is the one which has the longest sojourn time in the cell. Moreover, when the call that was moved upward due to overflow condition stays longer than a certain period of time in the upper layer cell, the system moves the call back to the lower layer in order to save the more expensive resources of the upper layer cell. Call handling performance of this method evaluated from M/M/C/K models shows clear improvement with respect to call blocking probability and forced termination probability.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.555-559
• /
• 1998

The human chromosome analysis is widely used to diagnose genetic disease and various congenital anomalies. Many researches on automated chromosome karyotype analysis have been carried out, some of which produced commercial systems. However, there still remains much room for improving the accuracy of chromosome classification. In this paper, We proposed an optimal pattern classifier by neural network to improve the accuracy of chromosome classification. The proposed pattern classifier was built up of two-step multi-layer neural network(TMANN). We reconstructed chromosome image to improve the chromosome classification accuracy and extracted four morphological features parameters such as centromeric index (C.I.), relative length ratio(R.L.), relative area ratio(R.A.) and chromosome length(C.L.). These Parameters employed as input in neural network by preprocessing twenty human chromosome images. The experiment results shown that the chromosome classification error was reduced much more than that of the other classification methods.

• Journal of Korea Multimedia Society
• /
• v.23 no.12
• /
• pp.1540-1551
• /
• 2020

Aiming at the problem that the existing human behavior recognition algorithm cannot fully utilize the multi-level spatio-temporal information of the network, a human behavior recognition algorithm based on a dense three-dimensional residual network is proposed. First, the proposed algorithm uses a dense block of three-dimensional residuals as the basic module of the network. The module extracts the hierarchical features of human behavior through densely connected convolutional layers; Secondly, the local feature aggregation adaptive method is used to learn the local dense features of human behavior; Then, the residual connection module is applied to promote the flow of feature information and reduced the difficulty of training; Finally, the multi-layer local feature extraction of the network is realized by cascading multiple three-dimensional residual dense blocks, and use the global feature aggregation adaptive method to learn the features of all network layers to realize human behavior recognition. A large number of experimental results on benchmark datasets KTH show that the recognition rate (top-l accuracy) of the proposed algorithm reaches 93.52%. Compared with the three-dimensional convolutional neural network (C3D) algorithm, it has improved by 3.93 percentage points. The proposed algorithm framework has good robustness and transfer learning ability, and can effectively handle a variety of video behavior recognition tasks.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.7-14
• /
• 2010

In this paper, we introduce a hierarchical internet application traffic classification system based on SVM as an alternative overcoming the uppermost limit of the conventional methodology which is using the port number or payload information. After selecting an optimal attribute subset of the bidirectional traffic flow data collected from the campus, the proposed system classifies the internet application traffic hierarchically. The system is composed of three layers: the first layer quickly determines P2P traffic and non-P2P traffic using a SVM, the second layer classifies P2P traffics into file-sharing, messenger, and TV, based on three SVDDs. The third layer makes specific classification of the entire 16 application traffics. By classifying the internet application traffic finely or coarsely, the proposed system can guarantee an efficient system resource management, a stable network environment, a seamless bandwidth, and an appropriate QoS. Also, even a new application traffic is added, it is possible to have a system incremental updating and scalability by training only a new SVDD without retraining the whole system. We validate the performance of our approach with computer experiments.

• Convergence Security Journal
• /
• v.12 no.1
• /
• pp.35-42
• /
• 2012

Increase of data traffic and the advent of new real-time services require to change from the traditional TDM-based (Time Division Multiplexing) networks to the optical networks that soft and dynamic configuration. Voice and lease line services are main service area of the traditional TDM-based networks. This optical network became main infrastructure that offer many channel that can convey data, video, and voice. To provide high resilience against failures, Packet-optical networks must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Packet-optical networks with a Generalized Multi-Protocol Label Switching(GMPLS) control plane. The goal of this paper is to provide packet-optical network with a hierarchical multi-layer recovery in order to fast and coordinated restoration in packet-optical network/GMPLS, focusing on new implementation information. The proposed schemes do not need an extension of optical network signaling (routing) protocols for support.