• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.53-60
• /
• 2006

Handover of WiBro is based on 802.16e hard handover scheme. When PSS is handover, it is handover that confirm neighbor's cell condition and RAS ID in neighbor advertisement message. Serving RAS transmits HO-notification message to neighbor RAS. Transmiting HO-notification message to neighbor RAS, it occurs many signaling traffics. Also, When WiBro is handover, It occurs many packet loss. Therefore, user suffer service degradation. LPM handover is supporting seamless handover because it buffers data packets during handover. So It is proposed scheme that predicts is LPM handover and reserves target RAS with pre-authentication. These schemes occur many signaling traffics. In this paper, we propose PSS Movement Prediction to solve signaling traffic. Target RAS is decided by old data in history cache. When serving RAS receives HO-notification-RSP message to target RAS, target RAS inform to crossover node. And crossover node bicast data packet. If handover is over, target RAS forward data packet. Therefore, It reduces signaling traffics but increase handover success rate. When history cache success, It decrease about 48% total traffic. But When history cache fails, It increase about 6% total traffic

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.69-75
• /
• 2006

P2P services occupy more then 50% of the internet traffics. A huge number of query packets are generated since pure P2P based models rely on message flooding for their query mechanisms. In this study, the numbers of query messages generated in the pure P2P and hybrid P2P model are analyzed. The results show that hybrid P2P models also could suffer from message flooding. To reduce the message flooding, this study proposes an interest based clustering mechanism for hybrid P2P services. By applying this clustering algorithm, it could reduce 99.998% of the message flooding. The proposed algorithm also reduces the cost of the joining operations by storing previous supernodes.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.279-286
• /
• 2011

This paper proposes techniques for wireless sensor network routing algorithm with small routing traffics. It reduces routing traffic by gathering routing messages for fixed duration of time and the routing message for the configuration result is sent once. The routing traffic gathering technique has disadvantage of longer network configuration time. To overcome this, first one or first few routing messages are delivered immediately and later routing messages are gathered for fixed duration of time. The proposed scheme was modelled and implemented in Qualnet simulator using C language. Experimental results show that the proposed techniques are effective for reducing routing traffics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.546-548
• /
• 2011

Various technologies for resource monitoring such as network traffic, IP resource usages have been developed. PING protocol message is one of the most simple, powerful way to monitor the network resources. In this paper we describe the efficient way to serves a real-time traffic information reports such as IP usage statistics by using saved database information. And we serve web-based traffic information services, so it can monitor a traffics more efficiently.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.446-457
• /
• 2007

In wireless sensor network, to provide the proper responses quickly for diverse events, wireless sensor nodes have to cooperate with each other. For successful cooperation, the time synchronization among sensor nodes is an important requirement for application execution. In the wireless sensor network, the message packets including time information are used for the time synchronization. However, the transmission of many message packets will exhaust the battery of wireless sensor nodes. Since wireless sensor nodes works on the limited battery capacity, the excessive transmission of message packets has an negative impact upon their lifetime. In this paper, the Reference Interpolation Protocol (RIP) is proposed to reduce the number of message packets for the time synchronization. The proposed method performs the time interpolation between the reference packet's time and the global time of the base station. The proposed method completes the synchronization operation with only 2 message packets when compared to the previous Reference Broadcast Synchronization (RBS) technique. Due to the simple synchronization procedure, our method greatly reduces the number of synchronization messages and showed the 12.7 times less power consumption than the RBS method. From the decrease in the transmission of message packets, the convergence time among wireless sensor nodes is shortened and the lifetime of wireless sensor nodes is also prolonged as much as the amount of saved battery energy.

• Journal of Navigation and Port Research
• /
• v.33 no.6
• /
• pp.423-428
• /
• 2009

Recently, the marine traffics have been increased along with enlargement of overseas commerce. Increasing the marine traffic may make higher the risk of marine accidents. Especially, the rate of accidents on costal area are more frequently. As if the marine safety information can be afforded to vessel and shore, the accident rate would be down. AIS AtoN is the navigational safety support device which is subject to functional requirements of IALA and technical standards of ITU. In this paper, we extend and implement the user-defined specification of AIS AtoN with message 21 for AIS basic information, messsage 6 for status report and message 12/14 for safety management.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.345-354
• /
• 2004

In these days, such services are popularized as E-commerce, E-government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of server resources when heavy requests reach the web server Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.781-786
• /
• 2004

In these days, such services are popularized as E-commerce, E- government, multimedia services, and home networking applications. Most web traffics generated contemporarily basically use the Hyper Text Transfer Protocol(HTTP). Unfortunately, the HTTP is improper for these applications that comprise significant components of the web traffics. In this paper, we introduce a real-time contents compression architecture that maximizes the web service performance as well as reduces the response time. This architecture is built into the linux kernel-based web accelerating module. It guarantees not only the freshness of compressed contents but also the minimum time delay using an server-state adaptive algorithm, which can determine whether the server sends the compressed message considering the consumption of sewer resources when heavy requests reach the web server. Also, We minimize the CPU overhead of the web server by exclusively implementing the compression kernel-thread. The testing results validates that this architecture saves the bandwidth of the web server and that elapsed time improvement is dramatic.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1306-1313
• /
• 1999

본 연구는 인터넷 기반 공유가상공간에서 시스템의 확장성을 유지하기 위하여 이동객체를 대상으로 하는 이벤트 필터링 기법을 제안하고자 한다. 제안된 다중격자 모델 기법은 이동객체의 경로 상에서 대표적인 이벤트를 샘플링하는 방식을 사용한다. 이 방식은 메시지 트래픽의 양을 동적으로 조절하기 위하여 이동객체 간의 관심정도 정보를 수치적으로 변환하여 이벤트 갱신빈도에 반영한다. 대량의 이동객체를 생성하여 제안된 기법을 적용한 성능평가 실험에서 기존의 방식에 비하여 평균 메시지 전송량이 50%이상 감소하는 것으로 확인할 수 있었다. 다중격자 모델은 참여자의 수와 메시지 트래픽 상황에 따라 가상환경의 공유 QoS를 동적으로 조절할 수 있으며, 인터넷 상에서 다수 사용자를 위한 3차원 가상사회 구축 및 온라인 네트워크 게임 개발 등에 활용될 수 있을 것이다.Abstract This paper proposes an event filtering technique that can dynamically control a large amount of event messages produced by moving objects like avatars or autonomous objects in a distributed virtual environment. The proposed multi-level grid model technique uses the method that extracts the representative events from the paths of moving objects. For dynamic control of message traffics, this technique digitizes the DOIs of the avatars and reflects the interest information controlling the frequency of message transmission. For the performance evaluation, a large number of moving objects were created and the model was applied to these avatar groups. In the experiments, more than 50% of messages have been reduced in comparison with the existing AOI-based filtering techniques. The proposed technique can dynamically control the QoS in proportion to the number of users and the amount of messages where a large number of users share a virtual space. This model can be applied to the development of 3D collaborative virtual societies and multi-user online games in the Internet.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.4
• /
• pp.747-761
• /
• 2024

Recently, modern vehicles have been controlled by Electronic Control Units (ECUs), by which the safety and convenience of drivers are highly improved. It is known that a luxury vehicle has more than 100 ECUs to electronically control its function. However, the modern vehicles are getting targeted by cyber attacks because of this computer-based automotive system. To address the cyber attacks, automotive manufacturers have been developing some methods for securing their vehicles, such as automotive Intrusion Detection System (IDS). This development is only allowed to the automotive manufacturers because they have databases for their in-vehicle network (i.e., DBC Format File) which are highly confidential. This confidentiality poses a significant challenge to external researchers who attempt to conduct automotive security researches. To handle this restricted information, in this paper, we propose a method to partially understand the DBC Format File by analyzing in-vehicle network traffics. Our method is designed to analyze Controller Area Network (CAN) traffics so that checksum signals are identified in CAN Frame Data Field. Also, our method creates a Lookup Set by which a checksum signal is correctly estimated for a given message. We validate our method with the publicly accessible dataset as well as one from a real vehicle.