• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.2
• /
• pp.81-89
• /
• 2008

Improved EKF suggests variable path prediction to reduce the event traffic caused by the information sharing among multi-users in networked virtual environment. The three dimensional virtual space is maintained consistently by endless status information exchange among dispersed users, and periodic status transmission brings traffic overhead in network. By using the error between the measured movement trace of dynamic information and the EKF predicted, we propose the method applied to predict the mobile packet of dynamic data which is simultaneously changing. And, the simulation results of DIS dead reckoning algorithms and EKF path prediction is compared here. It followed the specific path and while moving, the proposed method which it proposes predicting with DIS dead reckoning algorithm and to compare to the mobile path of the actual object and it got near it predicts the possibility of knowing it was.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.758-767
• /
• 2017

IoT paradigm which makes a information without direct intervention of a human and interworks with other objects, humans and systems is attracting attention. It will be expected the number of smart devices equipped with sensors and wireless communication capabilities is reached to about 260 billion by 2020. With the vast amount of sending data generated from rapidly increasing number of smart devices, it will bring up the traffic growth over internet and congestion in wireless networks. In this paper, we utilize the smart device as a sink node to collect and forward the sensing data periodically in IoT and propose a heuristic algorithm for a selection of sink nodes' set with each sink node satisfies the QoS its applications because a selection of optimal sink nodes' set is NP-hard problem. The complexity of proposed heuristic algorithm is $O(m^3)$ and faster than the optimal algorithm.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.73-82
• /
• 2009

The peers in the Chord method send messages periodically to keep the routing table updated. In a mobile P2P network, the peers in the Chord method should send messages more frequently to keep the routing table updated and reduce the failure of a request. However this results in increasing the overall network traffic. In our previous method, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but there were disadvantages to generate more traffic if the number of requests per second increases and to have more delay in the request processing time than the existing Chord. In this paper, we propose an improved method of reactive routing table update to reduce the request processing time. In the proposed method, when a data request comes, the routing table is updated only if its information is not recent while it is always updated in the previous method. We perform experiments using Chord simulator (I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.892-900
• /
• 1994

Recently, ITU-TSS recommends a service specific connection oriented protocol (SSCOP) which assures the successful transmission of signalling information for B-ISDN. In the SSCOP, there is a mechanism to exchange periodically status informations for both error and flow controls. In this paper, we analyze the SSCOP with a discrete-time queueing model. We consider two cases for link-by-link and end-to-end controls. As the performance measures, we investigate delay, throughput, and buffer size of the receiver. The average values of these measures are analyzed with respect to the loss probability of messages, the traffic load, and the exchange period of status information. We also verify the accuracy of this model with simulations.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.13-20
• /
• 2009

Recently, as traffic flooding attacks such as DoS/DDoS and Internet Worm have posed devastating threats to network services, rapid detection and proper response mechanisms are the major concern for secure and reliable network services. However, most of the current Intrusion Detection Systems (IDSs) focus on detail analysis of packet data, which results in late detection and a high system burden to cope with high-speed network traffic. In this paper we propose an SNMP-based lightweight and fast detection algorithm for traffic flooding attacks, which minimizes the processing and network overhead of the detection system, minimizes the detection time, and provides high detection rate. The attack detection algorithm consists of three consecutive stages. The first stage determines the detection timing using the update interval of SNMP MIB. The second stage analyzes attack symptoms based on correlations of MIB data. The third stage determines whether an attack occurs or not and figure out the attack type in case of attack.

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

3D A/V services are expected to be a representative service of next generation because it can give more realistic feeling by providing dimensions to the 2D images. In terms of transmission part of 3D A/V systems, however, it is difficult to provide these services on real-time in the wireless OFDMA networks because it has to send large amount of traffic. To address this, we proposed a novel scheduling algorithm which separates a 3D traffic into base layer and enhancement layer, and provides different priority to them. From simulation results, we can show that the proposed algorithm can improve QoS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.97-104
• /
• 2013

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.

• Journal of Internet Computing and Services
• /
• v.15 no.2
• /
• pp.19-31
• /
• 2014

In this paper, a parallel backoff delay procedure on multiple IEEE 802.15.4 channels and a channel searching method considering the frequency spectrum of WiFi traffic are studied for IEEE 802.15.4 nodes to avoid the interference from WiFi traffic. In order to search the channels being occupied by WiFi traffic, we analyzed the methods measuring the powers of adjacent channels simultaneously, checking the duration of measured power levels greater than a threshold, and finding the same periodicity of sampled RSSI data as the beacon frame by signal processing. In an wireless channel overlapped with IEEE 802.11 network, the operation of CSMA-CA algorithm for IEEE 802.15.4 nodes is explained. A method to execute a parallel backoff procedure on multiples IEEE 802.15.4 channels by an IEEE 802.15.4 device is proposed with the description of its algorithm. When we analyze the data measured by the experimental system implemented with the proposed method, it is observed that medium access delay times increase at the same time in the associated IEEE 802.15.4 channels that are adjacent each other during the generation of WiFi traffic. A channel evaluation function to decide the interference from other traffic on an IEEE 802.15.4 channel is defined. A channel searching method considering the channel evaluations on the adjacent channels together is proposed in order to search the IEEE 802.15.4 channels interfered by WiFi, and the experimental results show that it correctly finds the channels interfered by WiFi traffic.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1266-1276
• /
• 2003

Multimedia information containing voice and image is transmitted on Internet, which is ten times or hundred times larger than ordinary information. Analysis types for network management in this environment consist of a real time analysis, a basic analysis and an intensive analysis. The intensive analysis is useful for gathering the trend information of specific objects periodically for certain period in order to monitor network status. When SNMP is applied to collect the trend information of intensive analysis, it brings on the increase of network load, the delay of response time and the decrease of data collection accuracy since an agent responds to manager's every polling. In this paper, an efficient SNMP is proposed and implemented to add time variables in the existing SNMP PDU. It minimizes unnecessary traffic in the intensive analysis between manager and agent, and collects trend information more accurately. The results of experiments show that it has compatibility with the existing SNMP, decreases the amount of network traffic greatly and increases the accuracy of data collection.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.49-56
• /
• 2007

The IEEE 802.15.4 low rate wireless personal area network is a protocol suitable for wireless sensor networks. Thus there has been growing interest in the IEEE 802.15.4 protocol in the home automation networks. This paper proposes a scheduling scheme obtaining optimal parameters regarding the IEEE 802.15.4 frame and subframes in the home automation networks. Guaranteed time slots (GTS) are exploited for the delivery of real-time traffic. Given a set of the requirements for bandwidths and periods assigned to nodes in the network, the beacon interval and the active/inactive subframe duration satisfying the requirements are selected considering the low duty cycle by the proposed scheme. Based on these parameters, analytic results provide the way to efficient use of network resources including energy.