• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.133-144
• /
• 2015

In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.240-257
• /
• 2023

The industrial Internet of Things (IIoT) is characterized by intelligent connection, real-time data processing, collaborative monitoring, and automatic information processing. The heterogeneous IIoT devices require a high data rate, high reliability, high coverage, and low delay, thus posing a significant challenge to information security. High-performance edge and cloud servers are a good backup solution for IIoT devices with limited capabilities. However, privacy leakage and network attack cases may occur in heterogeneous IIoT environments. Cloud-based multi-party computing is a reliable privacy-protecting technology that encourages multiparty participation in joint computing without privacy disclosure. However, the default cloud selection method does not meet the heterogeneous IIoT requirements. The server can be dishonest, significantly increasing the probability of multi-party computation failure or inefficiency. This paper proposes a blockchain and smart contract-based optimized cloud node selection framework. Different participants choose the best server that meets their performance demands, considering the communication delay. Smart contracts provide a progressive request mechanism to increase participation. The simulation results show that our framework improves overall multi-party computing efficiency by up to 44.73%.

• Fire Science and Engineering
• /
• v.30 no.2
• /
• pp.81-86
• /
• 2016

Recently, frequent traffic congestion has occurred in domestic urban roads. As a solution for downtown traffic congestion in domestic urban roads, plans for great depth underground double-deck tunnels have been made. Great depth underground double-deck tunnels that have been planned for passenger cars, has the structure of a network type; the entry of vehicles is carried out in the underground space. In these network great depth underground double-deck tunnels, the cross section and the height of the tunnel are smaller than the general road tunnel, and the smoke of a fire will propagate faster than the evacuation of tunnel passengers by the action of the traffic-ventilation and casualties are expected. Therefore, in the present study, an attempt was made to prevent the delay system for fire smoke diffusion at the time of a fire in a domestic network great depth underground double-deck tunnel according to the area of the tunnel block during the operation of the delay system for fire smoke diffusion to analyze the effects of reducing the inflow velocity. When the area of the tunnel block was not less than 50%, the effect of reducing about 21% of the wind speed acting on the tunnel was significant. If the area is more than 50%, the diffusion rate of fire smoke was reduced by approximately 21%, which will be useful for a safe evacuation.

• 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.

• The Journal of the Korea Contents Association
• /
• v.17 no.3
• /
• pp.589-595
• /
• 2017

We present an estimation model for optimal channel capacity required to data traffic transmission. The optimal channel capacity should be calculated in order to satisfy the permitted transmission delay of each wireless data services. Considering the discrete-time operation of digital communication systems and batch arrival of packet-switched traffic for various wireless services, $Geo^x$/G/1 non-preemptive priority queueing model is analyzed. Based on the heuristic interpretation of the mean waiting time, the mean waiting times of various data packets which have the service priority. Using the mean waiting times of service classes, we propose the procedure of determining the optimal channel capacity to satisfy the quality of service requirement of the mean delay of wireless services. We look forward to applying our results to improvement in wireless data services and economic operation of the network facilities.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.110-122
• /
• 2005

Bluetooth has been reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, bluetooth scatternet is a most essential part for dynamic ad-hoc networks. But past researches on bluetooth scatternet has hardly treated dynamic scatternet environment. In this paper, we proposed a scatternet reformation algorithm for the case that some nodes escape from the scatternet. The proposed algorithm is a general algorithm which can be applied to many types of bluetooth scatternet regardless of the topology. The proposed algorithm has short reformation time delay because the process has only page process (not including inquiry process ). The algorithm is operated based on Recovery Node Vector which is composed of Recovery Master and Recovery Slave. In this paper, we performed the real hardware experiments for evaluating the performance of the proposed algorithm. In that experiments, we measured the reformation time and reformation probability. In comparison with the case including inquiry process, the proposed algorithm had the improvement in reformation time delay and we obtained high success rate over 97%.

• Journal of Navigation and Port Research
• /
• v.34 no.2
• /
• pp.131-136
• /
• 2010

The aim of the paper is to solve the problem of customer reduction due to the difficulty of parts sourcing which impacts production delay and delivery delay in SC networks. Furthermore, this paper is to suggest the new inventory policy of MTS in order to solve the problem of current inventory policy. In order to compare two policies, a LCD maker is selected as a case study and the real data for 2007 years is used for simulation input. The maker uses MTO policy for parts sourcing which has the problem of lead time even if it has some advantage of inventory cost. Based on current process. The simulation program of AS-IS model and TO-BE model using ARENA 10 version is developed for evaluation. In a result, the order number of two policies shows that MTO is 52 and MTS is 53. However the quantity of order shows big difference such that MTO is 168,460 and MTS is 225,106. Particularly, the lead time of new inventory policy shows much shorter that that of MTO such that MTO 100 is days and MTS is 16 days. In spite of short lead time by MTS policy, new policy has to take burden of inventory cost per year. Total inventory cost per year by MTS policy is US$ 11,254 and each part inventory cost is that POL is US$ 1,807, LDI is US$ 2,166 and Panel is US$ 7,281. The implication of the research is that the company has to consider the cost and the service simultaneously in deciding the inventory policy. In the paper, even if the optimal point of deciding is put into tactical area, the ground of decision is suggested in order to improve the problem in SC networks.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.3
• /
• pp.81-89
• /
• 2010

The research on peer-to-peer streaming schemes has largely focused on tree-push and mesh-pull structures. However, the tree-push structure has a defect that the tree restructuring time is long, and the mesh-pull structure has long startup delay and lag time from source servers. In this paper, we propose a new peer-to-peer live streaming scheme based on a push-mesh structure that takes advantages of tree-push and mesh-pull structure simultaneously. This structure basically provides the mesh-pull mechanism for data transmission and utilizes peers with high network upload capacity. It also supports the push mechanism along with paths from a source server, super peers, and selected general peers. By NS-2 simulation experiments, we finally show that our proposed scheme can achieve shorter startup delay than the mesh-pull structure, similar lag time to tree-push structure and best playback continuity among the three schemes.

• Journal of Korea Game Society
• /
• v.16 no.4
• /
• pp.57-68
• /
• 2016

As the size of the data used in the game application increase gradually, the physical resources of game server grow. Accordingly, it is necessary to/it is required to introduce I/O virtualization in game server to improve I/O performance of the server. But it is difficult to ensure high responsiveness in game server where I/O delay change from time to time. To maximize the benefit of I/O virtualization, guaranteeing I/O response time is very important and it is necessary to have I/O scheduling techniques to manage the I/O latency in the order of priority of virtual machines. In this paper, we propose an efficient delay-constrained scheduling algorithm in a virtualization environment to ensure maximum I/O latency. In addition, a reduced amount of loss of the packet was found to increase the fairness of scheduling in the experiments with the proposed scheme.

• Journal of Korea Multimedia Society
• /
• v.23 no.10
• /
• pp.1258-1269
• /
• 2020

The IoT(Internet of Things) service provides users with valuable services by collecting and analyzing data using Internet-connected IoT devices. Currently, IoT service platforms are accomplished by using edge computing to reduce the delay time required to collect data from IoT devices. However, if a user moves to another network with IoT device, the connection will be lost and IoT service will be suspended. To solve this problem, we proposes a service that automatically roaming IoT service when IoT device makes move. IoT roaming service provides a device automatic tracking management technique designed to continue receiving IoT services even if users move to other networks. To check if the proposed roaming service was effective, we implemented IoT roaming service and measured the data transfer time while move between networks along with devices while using IoT service. As a result, the average data transfer time was 124.62ms, and the average service interrupt time was 812.12ms. with this result, we can assume that the user could feel service interruption time very shortly and it will not affect the service experience. with IoT roaming service, we expect that it will present a method that stably providing IoT services even if user moves networks.