• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1249-1259
• /
• 1998

This paper proposes an efficient channel assignment method for real-time service in the IEEE 802.11 Wireless LAN system, and analyzes the supportability to real-time service and the channel utilzation of that through computer simulations. The improved MAC(Medium Access Control) protocol employing the proposed channel assignment method achieved good throughput over contention period as well as contention-free period by making real-time terminals transmit the information about their desiring value before starts of data transmissions. For performance evaluation of the proposed method, a simulation analyzing the variation of allocated bandwidths to terminals using real-time service and their buffer sizes wasexecuted. Real-time data traffics was modeled s 7-stae transition VBR sources, and asynchronous data traffics modeled as Poisson processes. In the simulation, the proposed method showed smaller variation of the bandwidth of each terminal and samller buffer size than the existing method, and also recorded good throughput over contention period.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.235-244
• /
• 2004

TCP Vegas version provides better performance and more stable services than TCP Tahoe and Reno versions, which are widely used in the current Internet. However, in the situation where TCP Vegas and Reno share the bottleneck link, the performance of TCP Vegas is much smaller than that of TCP Reno. This unfairness is due to the difference of congestion control mechanisms of each TCP use. Several studies have been executed in order to solve this unfairness problem. In this paper, we analyze the minimum window size to maintain the maximum TCP performance of link bandwidth. In addition, we propose an algorithm which maintains the TCP performance and improves fairness by selective packet drops in order to allocate proper window size of each TCP connections. To evaluate the performance of the proposed algorithm, we have measured the number of data bytes transmitted between end-to-end systems by each TCP connections. The simulation results show that the proposed algorithm maintains the maximum TCP performance and improves the fairness.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.359-366
• /
• 2003

Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selective deletion of objects, cache compaction and object structuring step in the clients. The conversion is a time- intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, in order to control the map efficiently in the vector map service based mobile phones, it is necessary to study the methods which reuse cached objects for reducing wireless network bandwidth and overwhelming the limited resources of mobile phones as well. This paper proposes the methods of reusing pre-received spatial objects for map control in the mobile vector map service system based on client-server architecture. The experiments conducted on the Web GIS systems with real data show that the proposed method is appropriate to map services for mobile phone. We also analyze the advantages and drawbacks between the reuse of cached data and transmission of raw data respectively.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.9
• /
• pp.3876-3881
• /
• 2012

In typical master/slave teleoperation systems, a human operator generally manipulates the master to control the slave through the visual information like camera image. However, the operator may get into trouble due to the limited visual information depending on the camera positions and the delay on the visual information because of low communication bandwidth. To cope with this inherit problem in the camera-based teleoperation system, this paper presents a teleoperation system using a reconstructed graphic model instead of the camera image. The proposed teleoperation system consists of a robot control module, a master module using a force-reflective joystick, and a graphic user interface (GUI) module. The graphic user interface module provides the operator with a 3D model reconstructed using a small set of sensing data received from the remote site. The proposed teleoperation system is evaluated through a peg-in-hole assembly task.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3439-3457
• /
• 2014

Clustering is an effective method for improving the performance of large scale mobile ad hoc networks. However, when the moving speed is very fast, the topology changes quickly, which leads to frequent cluster topology updates. The drastically increasing control overheads severely threaten the throughput of the network. SCBCS (Signal Characteristic Based Cluster Scheme) is proposed as a method to potentially reduce the control overheads caused by cluster formation and maintenance in aeronautical ad hoc networks. Each node periodically broadcasts Hello packets. The Hello packets can be replaced by data packets, which preserve bandwidth. The characteristics of the received packets, such as the Doppler shift and the power of two successive Hello packets, help to calculate the relative speed and direction of motion. Then, the link connection lifetime is estimated by the relative speed and direction of motion. In the clustering formation procedure, the node with the longest estimated link connection time to its one-hop neighbors is chosen as the cluster head. In the cluster maintenance procedure, re-affiliation and re-clustering schemes are designed to keep the clusters more stable. The re-clustering phenomenon is reduced by limiting the ripple effect. Simulations have shown that SCBCS prolongs the link connection lifetime and the cluster lifetime, which can reduce the topology update overheads in highly dynamic aeronautical ad hoc networks.

• Journal of Korea Multimedia Society
• /
• v.5 no.6
• /
• pp.697-703
• /
• 2002

In this paper, we propose the adaptive multi stream transmission technique based on SPIHT video signal for the highest quality service over the current Internet that does not guarantee QoS. In addition to the reliable transmission of the video stream over the asynchronous packet network, the proposed approach provides the transmission using the adaptive frame pattern control and multi steam over the TCP for continuous replay. The adaptive frame pattern control makes the transmission date scalable in accordance with the client's buffer status. Apart from this, the multi stream transmission improves the efficiency of video stream, and is robust to the network jitter problem, and maximally utilizes the bandwidth of the client's. As a result of the experiment, the DR(delay ratio) in the proposed adaptive multi-stream transmission is more close to zero than in the existing signal stream transmission, which enables the best-efforts service to be implemented.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.550-558
• /
• 2004

Previous researches on scalability problem of distributed virtual environment (DVE) have been mainly focused on spatial partitioning of area of interest (AOI). Congestion phenomena by avatar groups in AOI have been neglected relatively However, AOI congestion is highly related to scalability of DVE because it exhausts system resources such as network bandwidth and rendering time, and could be a bar to perform collaboration among participants. In this paper, this will be defined as the problem that must be solved for the realization of the scalable DVE, and a model will be proposed to measure and control congestion situation in AOI. The purposes of the proposed model are to prevent high density of participants in AOI, and to protect stable collaboration in DVE. For evaluation of the performance it is compared with a previous method by defining the resource cost model which is dynamically activated to AOI congestion.

• The Journal of the Korea Contents Association
• /
• v.16 no.11
• /
• pp.83-90
• /
• 2016

In this paper, we performed the analysis of transmission performance for Collision Free Period(CFP) supported by the low-power communication technology, IEEE 802.15.4 MAC (Media Access Control). For the analysis, periodic traffic, original service target of CFP, is considered and, according to the Quality of Service required, packet arrival pattern to MAC layer is categorized as batch and non-batch, and analysis on throughput, delay, and energy is performed for those patterns. On the basis of the obtained analysis, performance comparison with Collision Avoidance Period(CAP) is carried out for the health care applications that generate periodic traffic such as Pedometer, ECG, EMG. The evaluation confirms that CFP is more energy efficient for healthcare applications that generate periodic and time-critical traffic and moreover for the application with high bandwidth requirement CFP achieves up to 46% energy savings compared to CAP.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.4
• /
• pp.195-204
• /
• 2010

Due to improved wireless communication technologies, it is possible to provide multimedia streaming service for mobile device clients like PDAs and cellphones. Wireless networks are serviced on low bandwidth channels and mobile devices work on limited hardware specifications. In these conditions, transcoding technologies are needed to adapt the media for streaming services to given mobile environments. To transcode from the source media to the target media for corresponding grades, transcoding servers perform transcoding jobs as exhausting their resources. Since various transcoding loads occur according to the target transconding grades, an effective transcoding load balancing policy is required among transcoding servers. In addition to transcoding process, servers should maintain QoS streams for mobile clients for total serviced times. It requires real-time requirements to support QoS for various mobile clients. In this paper, a new transcoding load distribution method is proposed. The proposed method can be driven for fair load balance between distributed transcoding servers. Based on estimated transcoding time, movie information and target transcoding bit-rate, it provides fair transcoding load distribution and also performs admission control to support QoS streams for mobile clients.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.2
• /
• pp.59-68
• /
• 2002

In this paper, we compared and analyzed two new models of cyclic packet dropping algorithm, Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) with RIO. The ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. We modelled two cyclic packet drop algorithms and executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying the strict drop precedence policy, we get better performance on priority levels. The results show that two new algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than other algorithms.