• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.10-15
• /
• 2009

Recently, there are tendency that wireless sensor network is one of the important techniques for the future IT industry and thereby application areas in it are getting growing. Researches based on the hierarchical network topology are evaluated in good at energy efficiency in related protocols for wireless sensor network. LEACH is the best well known routing protocol for the hierarchical topology. However, there are problems in the range of message broadcasting, which should be expand into the overall network coverage, in LEACH related protocols. Thereby, this paper proposes a new clustering scheme to solve the co-shared problems in them. The basic idea of our scheme is using the inherent memory restrictions in sensor nodes. The results show that the proposed scheme could support the load balancing by distributing the clusters with a reasonable number of member nodes and thereby the network life time would be extended in about 1.8 times longer than LEACH.

• The Journal of Bigdata
• /
• v.5 no.1
• /
• pp.55-63
• /
• 2020

This study proposed an approach of clustering collective users' activities of location-based social networks using check-in data of Foursquare users in Seoul. In order to cluster the collective activities, we generated sequential rules of the activities using sequential rule mining, and then constructed activity networks based on the rules. We analyzed the activity networks to identify network structure and hub activities, and clustered the activities within the networks. Unlike previous studies that analyzed activity transition patterns of location-based social network users, this study focused on analyzing the structure and clusters of successive activities. Hubs and clusters of activities with the approach proposed in this study can be used for location-based services and marketing. They could also be used in the public sector, such as infection prevention and urban policies.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.89-96
• /
• 2000

ABR service is defined by ATM Forum and ITU for the efficient use of link bandwidth, and 2-pass service policing is proposed for this service. 2-pass service policing is effective by the real-time measurement of the used bandwidth, and this scheme obtains multiplexing gam and control efficiently ABR traffic as dynamically allocating rate by residual bandwidth information. In this study, we propose the real-time bandwidth prediction scheme for ABR traffic control, as using dynamic rate allocation by available bandwidth information. This study can obtain the simple hardware structure by means of as predicting available bandwidth by the total link bandwidth and the sum of transmission rate on the backlogged state connections.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.397-399
• /
• 2005

최근 우선 네트워크 상에서 이동성을 보장하기 위한 다양한 인프라 기술에 대한 연구가 활발히 진행되고 있다. 한국군 전술통신망은 이기종, 다특성 통신장비로 구성된 네트워크가 복합적으로 운용되고 있다. 임무수행을 위한 신속한 상황인식과 지휘통제가 최상위 지휘관으로부터 이동중인 최하위 전투원까지 이음새없는(seamless) 통합망을 통해 전달되어야 하나 현재 각 네트워크간 통합기술이나 통합 아키덱처에 관한 연구는 미흡한 실정이다. 본 논문에서는 현재 가용한 이동 네트워크 기술 현황을 제시하고, 현 한국군 전술통신망의 특징과 장단정을 제시한 후, 복합적인 네트워크 환경 하에서 노드의 이동성을 지원하는 계층적 전술통신망 아키텍처에 대한 통신망 설계시 고려사항, 전체 아키텍처 구조 및 각 계층별 노드의 구조와 이들 노드간의 인터페이싱, 이동노드에 대한 이동성 관리 방안을 제안한다.

• Information and Communications Magazine
• /
• v.15 no.7
• /
• pp.169-179
• /
• 1998

본 논문에서는 현재 연구 개발되고 있는 Fiber-to-the-curb / Very high-rate digital subscriber line(FTTC/VDSL) 시스템의 DAVIC 표준 가입자 전송 기술인 51.84 Mb/s 16-CAP (Carrierless AM/PM) 전송시스템 (downstream)과 1.62 Mb/s QPSK burst-mode TDMA 전송시스템 (upstream)및, 타이밍 복원회로 등의 동작 원리 및 구조를 간략하게 기술하였다. 본 논문은 FTTC/VDSL 전송시스템 개발을 위하여 전체시스템이 운영될 환경, 즉 채널에 대하여 기술한 후, 주어진 채널에 적합한 down-stream전송시스템 알고리즘 및 구조를 설명하였으며, 타이밍 복원 시스템을 기술하였다. FTTC/VDSL시스템은 네트워크의 한 개의 송수신부가 가입자 댁내의 여러 개의 set-top box와 데이터를 주고받는 점 대 다점 (point-to-multipoint) 구조로 이루어져 있으며, 따라서 역 방향 (upstream) 채널 데이터 전송을 위한 QPSK 전송시스템은 네트워크쪽의 QPSK 수신부가 가입자 댁내의 여러개의 QPSK 송신부를 서비스할 수 있게끔 시분할 다중접속 방식인 burst-mode TDMA전송방식으로 구현되었다. FTTC/VDSL 전송시스템은 DAVIC의 시스템 성능 요구조건을 만족하게 설계되었으며, 모든 기능은 디지털로 구현되었고 칩 구현을 위하여 각 기능의 VLSI 시스템 파라메타 들을 추출하고 성능 시험을 실시하였다.

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

In the packet data network systems beyond 3G, the service quality of current users is affected by traffic load due to the packet burstiness. There also exists a hot cell problem, a well-known problem of cellular systems, caused by traffic centraliBation. Hot cell problem is one of the major reasons of degrading system performance because hot cell increases the call drop rate without fully utilization of system resource. Therefore, it is very important to distribute the traffic on the several neighboring cells so that system uses its resource effectively and maintains the quality of service. In this paper, we propose the adaptive handoff algorithms for distributing traffic in the packet data network systems. In addition, we propose a new load estimation method with MAC state diagram suitable for packet data network systems. Through the simulation results, we could find that proposed algorithm is able to improve efficiency of system resource and to assure the service quality of users through traffic distribution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2447-2458
• /
• 2009

Ad hoc wireless networks operate without any infrastructure where a node can be a source and a router at the same time. This indispensably requires high throughput and low delay performance throughout the wireless network coverage span, particularly under heavy traffic conditions. Recent research on using multiple antennas in beam-forming or multiplexing modes over a wireless channel has shown promising results in terms of high throughput and low delay. Directional antennas have shown to increase spatial reuse by allowing multiple transmitters and receivers to communicate using. directional beams as long as they do not significantly interfere with each other. However directional antenna performance asymptotically approaches the omni-directional performance in a high density ad hoc network. Simulation results in QualNet validate that average throughput and packet corruption ratio of directional antenna approach omni-directional performance. Moreover, we further highlight some important issues pertaining to the directional antenna performance in wireless networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.281-292
• /
• 2008

A main application of sensor networks are to monitor and to send information about a possibly hostile environment to a powerful base station connected to a wired network. To conserve power from each sensor, intermediate network nodes should aggregate results from individual sensors. However, it can make it that a single compromised sensor can render the network useless, or worse, mislead the operator into trusting a false reading. In this paper, we propose a protocol to give us a key aggregation mechanism that intermediate network nodes could aggregate data more safely. The proposed protocol is more helpful at multi-tier network architecture in secure sessions established between sensor nodes and gateways. From simulation study, we compare the amount of the energy consumption overhead, the time of key transmission and the ratio of of key process between the proposed method and LHA-SP. The simulation result of proposed protocol is low 3.5% a lord of energy consumption than LHA-SP, the time of key transmission and the ration of key process is get improved result of each 0.3% and 0.6% than LHA-SP.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.6
• /
• pp.1197-1213
• /
• 2014

Due to the increase in size of the computer network, the network security systems such as a firewall, IDS, IPS generate much more vast amount of information related to network security. So detecting signs of hidden security threats has become more difficult. Security personnels' 'Network Security Situational Awareness(NSSA)' is effectively determining the security situation of overall computer network on the basis of the relation between the security events that occur in the several views. The process of situational awareness is divided into three stages of the 'identification,' 'understanding' and 'prediction'. And 'identification' and 'understanding' are prerequisites for 'predicting' and the following appropriate responses. But 'identification' and 'understanding' in the vast amount of information became more difficult. In this paper, we propose Honeycomb security situational awareness visualization system that is designed to help NSSA in large-scale networks by using visualization techniques known effective to the 'identification' and 'understanding' stages. And we identified the empirical effects of this system on the basis of the 'VAST Challenge 2012' data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.8
• /
• pp.1196-1204
• /
• 2022

In this paper, we propose an optimization algorithm that maximizes the network lifetime in wireless ad-hoc networks using the broadcast transmission method. The optimization algorithm proposed in this paper applies tabu search algorithm, a metaheuristic method that improves the local search method using the memory structure. The proposed tabu search algorithm proposes efficient encoding and neighborhood search method to the network lifetime maximization problem. By applying the proposed method to design efficient broadcast routing, we maximize the lifetime of the entire network. The proposed tabu search algorithm was evaluated in terms of the energy consumption of all nodes in the broadcast transmission occurring in the network, the time of the first lost node, and the algorithm execution time. From the performance evaluation results under various conditions, it was confirmed that the proposed tabu search algorithm was superior to the previously proposed metaheuristic algorithm.