• Journal of Digital Contents Society
• /
• v.16 no.2
• /
• pp.189-196
• /
• 2015

The proposed cooperative 3D modelling system enables more efficient modeling works by improving current cooperation systems. Current 3D modeling tasks work on off-line and most of works are cooperation systems which communicate by files. These cooperation system cannot be interactive, occurs time delay while feedback and must have some programs which can read the files. This paper solves these problems using web that has the characteristics of network and proposes new cooperation system form. Using WebGL(Web Graphics Library) which is proposing technology in technical realization of Web 3D modeling, we make 3D objects in web browser and these objects can be manipulated by server-client communication. Therefore, if people use this system, they can use real time interaction and feedback. Also this system lowers a software installation necessity and can access everytime if web browser is installed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.964-974
• /
• 2003

With increasing use of a personal mobile computer. the Mobile IPv6 is one of the main protocols that support mobility and complies with IPv6 specification. Similar to the mobile IPv6, the mobile IPv6 also has limitations on fast moving condition. The Hierarchical Mobile IPv6 is a solution that overcomes these limitations. The Hierarchical Mobile IPv6 is a micro mobility protocol that supports fast mobile IP handover and reduces signaling overhead with Mobility Anchor Point(MAP). But until now no paging method is applied to the Hierarchical Mobile IPv6 to reduce unnecessary signaling overhead and power consumption of mobile nodes. So, the paging mechanism for the Hierarchical Mobile IPv6 is proposed in this paper. the mechanism is implemented by making use of the destination option header and extension function and the last location algorithm. The results show that the Hierarchical Mobile IPv6 with the paging ability reduces the traffic of mobile networks by removing unnecessary binding update packet generated whenever handover takes place. Also, the larger the paging size is. the less the number of BU(Binding Update) massage generated.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.113-115
• /
• 2015

In this paper, we proposed an algorithm based on movement prediction using rate of change of the attribute information of nodes what is called WRC(Weighted Rate Control) in delay tolerant networks(DTNs). Existing DTN routing algorithms based on movement prediction communicate by selecting relay nodes increasing connectivity with destination node. Thus, because the mobile nodes are in flux, the prediction algorithms that do not reflect the newest attribute information of node decrease reliability. In this paper, proposed algorithm approximate speed and direction of attribute information of node and analysis rate of change of attribute information of node. Then, it predict movement path of node using proposed weight. As the result, proposed algorithm show that network overhead and transmission delay time decreased by predicting movement path of node.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.343-350
• /
• 2002

This paper describes the implementation of H.235 protocol for authentication and media stream encryption of multimedia conference systems. H.235 protocol is recommended by ITU-T for H.323 multimedia conference security protocol to prevent from being eavesdropped and modified by an illegal attacker. The implementation in this paper has used password-based with symmetric encryption authentication. Media streams are encrypted using the Diffie-Hellman key exchange algorithm and symmetric encryption algorithms such as RC2, DES and Triple-DES. Also, 128-bit Advanced Encryption Standard and 128-bit Korean standard SEED algorithms are implemented for the future extension. The implemented authentication and media stream encryption has shown that it is possible to identify terminal users without exposing personal information on networks and to preserve security of multimedia conference. Also, encryption delay time and used memory are not increased even though supporting media stream encryption/decryption, thus the performance of multimedia conference system has not deteriorated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.444-454
• /
• 2004

To support diverse transmission requirements of multimedia applications, Quality of Service (QoS) should be provided in the Internet, where only the best-effort service is available. In this paper, we describe our recent effort on the implementation and verification of an extendable and flexible QoS allocation and resource management system based on the bandwidth broker model for realizing the IETF differentiated service (DiffServ). Focusing on the bandwidth issue over single administrative domain, the implemented system provides real-time resource reservation and allocation, delayed call admission control, simple QoS negotiation between sewer and users, and simple resource monitoring. The implemented system is verified by evaluating the performance of a resource-intensive application over the real-world testbed network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.484-493
• /
• 2009

For the flexible frequency utilization, cognitive radio technique has been prominently considered. The most important requirement in cognitive radio networks is to protect the communications of primary users. Spectrum sensing task by secondary users should be seriously considered in cognitive radio networks, since the spectrum sensing process makes their current quality of service worse. In this paper, we propose the channel sensing scheduling method that keeps the requirements for protecting the primary and guarantee the secondary user's quality of service as possible. The quality of service of secondary user is analyzed in terms of packet delay and loss while the protection-requirements in terms of sensing interval and sensing time predefined. In numerical analysis, we can get appropriate parameters which guarantee QoS in various environment. And simulation results show that this method can improve the performance, delay and the number of transmitted packets against consecutive sensing method.

• Journal of the Korea Convergence Society
• /
• v.10 no.12
• /
• pp.43-52
• /
• 2019

360 Virtual Reality(VR) service is getting attention in the domestic streaming market as 5G era is upcoming. However, existing IPTV-based 360 VR video services use upto 4K 360 VR video which is not enough to satisfy customers. It is generally required that over 8K resolution is necessary to meet users' satisfaction level. The bit rate of 8K resolution video exceeds the bandwidth of single QAM channel(38.817mbps), which means that it is impossible to provide 8K resolution video via the IPTV broadcast network environment. Therefore, we suggest and implement the edge streaming system for low-latency streaming to the display devices in the local network. We conducted experiments and confirmed that 360 VR streaming with a viewport switching delay less than 500ms can be achieved while using less than 100mbps of the network bandwidth.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.31-41
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.121-126
• /
• 2009

Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.687-692
• /
• 2004

In this paper, we proposed an efficient cache hoarding method in mobile computing environments using collaborative filtering. This method is used for solving the difficult problem of mobile computing, which is the vacuum of information service depending on low bandwidth, long delay, and frequent network disconnection. Many previous researches have been studied a cache hoarding approach for solving these problems of mobile client. But, the research of history information of mobile client did not support all informative requests for mobile clients. In our research, collaborative filtering model using history information and location data of mobile client is proposed. This proposed model supports an efficient service of necessary items for client's requirement. For the performance evaluation of proposed model, we make an experiment of simulation data using SAS enterprise miner. According to objective evaluation using cache hit ratio, we show that our model has a good result.