• Journal of Korea Multimedia Society
• /
• v.14 no.9
• /
• pp.1165-1174
• /
• 2011

In data broadcasting systems, servers continuously disseminate data items through broadcast channels, and mobile client only needs to wait for the data of interest to present on a broadcast channel. However, because broadcast channels are shared by a large set of data items, the expected delay of receiving a desired data item may increase. This paper explores the issue of designing proper data allocation on multiple broadcast channels to minimize the average expected delay time of all data items, and proposes a new data allocation scheme named two level bin-packing(TLBP). This paper first introduces the theoretical lower-bound of the average expected delay, and determines the bin capacity based on this value. TLBP partitions all data items into a number of groups using bin-packing algorithm and allocates each group of data items on an individual channel. By employing bin-packing algorithm in two step, TLBP can reflect a variation of access probabilities among data items allocated on the same channel to the broadcast schedule, and thus enhance the performance. Simulation is performed to compare the performance of TLBP with three existing approaches. The simulation results show that TLBP outperforms others in terms of the average expected delay time at a reasonable execution overhead.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.36 no.3
• /
• pp.521-528
• /
• 2016

The tollbooths of a main motorway toll plaza are usually operated proactively responding to the variations of traffic demands of two-type vehicles, i.e. cars and the other (heavy) vehicles, respectively. In this vein, it is one of key elements to forecast accurate traffic volumes for the two vehicle types in advanced tollgate operation. Unfortunately, it is not easy for existing univariate short-term prediction techniques to simultaneously generate the two-vehicle-type traffic demands in literature. These practical and academic backgrounds make it one of attractive research topics in Intelligent Transportation System (ITS) forecasting area to forecast the future traffic volumes of the two-type vehicles at an acceptable level of accuracy. In order to address the shortcomings of univariate short-term prediction techniques, a Multiple In-and-Out (MIO) forecasting model to simultaneously generate the two-type traffic volumes is introduced in this article. The MIO model based on a non-parametric approach is devised under the on-line access conditions of large-scale historical data. In a feasible test with actual data, the proposed model outperformed Kalman filtering, one of a widely-used univariate models, in terms of prediction accuracy in spite of multivariate prediction scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1693-1701
• /
• 2010

In this paper, requirements of efficient group key creation in multiple hierarchy structure environment with clear distinction of hierarchical roles within organizations are explained and the method of creating a group key that satisfies such requirements is proposed. The proposed method creates the group key through logical sum operation of hierarchy identifier created using uni-directional hash chain and group identifier randomly created according to the access right. The problem of excessive possession of key information by upper group users in the existing static group key creation technique was resolved. At the same time, lower group users were prevented from deducing key information of upper group users. In addition, as a result of comparative analysis performed with an experiment on existing super group key creation technique and multiple hierarchy group key method, the proposed method was found to be equivalent or superior to existing method in terms of various items including the total number of keys created, the number of keys possessed by users, the number of keys used for encoding and decoding of information, and expandability of keys.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

• The KIPS Transactions:PartB
• /
• v.12B no.6 s.102
• /
• pp.679-684
• /
• 2005

There are a few representative wireless network access technologies used widely. WWAN is celluar based telecommunication networks supporting high mobility, WLAN ensures high data rate within hotspot coverage, and WDMB support both data and broadcasting services correspondingly. However, these technologies include some limitations especially on the mobility, data rate, transmission direction, and so on. In order to overvome these limitations, there are various studies have been proposed in terms of 'Vortical Handoff' that offers seamless connectivity by switching active connection to the appropriate interface which installed in the mobile devices. In this paper, we propose the interface selection algorithm and network architecture to maximize the life time of entire system by minimizing the unnecessary energy consumption of another interfaces such as WLAN, WDMB that are taken in the user equipment. In addition, by using the results of analyzing multiple types of traffic and managing user buffer as a metric for vertical handoff, we show that the energy efficiency of our scheme is $75\%$ and $34\%$ than typical WLAN for WDMB and WLAN preferred schemes, correspondingly.

• Journal of Korea Port Economic Association
• /
• v.24 no.2
• /
• pp.155-174
• /
• 2008

This paper proposed several activation strategies at both the government and company parts for the development of domestic third party logistics(TPL) to pull electronic trade era much earlier. In the government side, it must need to arrange and integrate complex regulation rules on the Logistics for more smooth access and use the TPL market. Also, it has to provide multiple support policies such as tax reduction, technical and financial service providing, and logistics information system to TPL. Finally, it should construct the government levels education system to train and forster a competent man who is well qualified as a electronic and logiscic expert. The TPL company must build up a total logistics information system concerned with an innovative operation system such as SCM, JIT etc. which can provide logistic services on demand to the electronic trade customers to maximize consumer satisfaction. In the shipper company level, it try to join a long-term strategic alliance with TPL to reduce logistic cost and increase logistic service to its electronic trade consumers.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.532-543
• /
• 2004

Mobile Ad hoc NETworks (MANET) consist of mobile nodes which are usually powered by battery Approaches for minimizing power consumption have been proposed for all network layers and devices. IEEE 802.11 DCF (Distributed Coordination Function), a well-known medium access control protocol for MANETS, also defines a power save mode operation. The nodes in power save mode periodically repeat the awake state and the doze state in synchronized fashion. When all nodes are in the awake state, the exchange the announcements for the subsequent message transmission with neighbors. The nodes that send or receive the announcements stay awake for data transmission, and others go into the dole state. The previous works for enhancing the power save mode operation have focused on shortening the duration of the awake state. We observed that the longer sleeping period results in seriously long delivery latency and the consequent unnecessary power consumption as well, because the packets can move forward only one hop for a fixed interval. In this paper, we propose an improved protocol for the power save mode of IEEE 802.11 DCF, which allows the flooding packets to be forwarded several hops in a transmission period. Our approach does not reduce the duration of compulsory awake period, but maximizes its utilization. Each node propagates the announcements for next flooding to nodes of several hops away, thus the packets can travel multiple hops during one interval. Simulation results of comparison between our scheme and the standard show a reduction in flooding delay maximum 80%, and the unicasting latency with accompanying flooding flows near 50%, with slight increase of energy consumption.

• Journal of IKEEE
• /
• v.2 no.2 s.3
• /
• pp.212-224
• /
• 1998

There are two major factors of degrading the performance in the forward link of DS/CDMA systems. One is the multiple access interference (MAI) caused by using the same frequency bands simultaneously and the other is the multipath lading due to multipath propagation. PN codes which have minimum cross correlation properties among spread spectrum codes are necessary to reduce the MAI. In the conventional IS-95A system, the PN sequence has the period of $2^{15}$ and is of the length of 64 chips for spreading each data. In this case, since the length of PN code per bit is very short compared to the period of the PN code, the performance of the conventional system is not satisfied in view of suppressing the multipath interference. However, the correlation property of the PN codes at the demodulation can be improved by increasing the interval of Integration at the demodulation. This paper proposes a demodulation method to reduce the cross correlation among PN codes. The performance of the proposed demodulation method is investigated through computer simulations. We used multipath Ray lading channel and AWGN channel in the simulation. Our simulation results show the improved performance of $0.25{\sim}0.5dB$ SNR in a given BER compared to the conventional demodulation scheme.

• Journal of Digital Convergence
• /
• v.13 no.4
• /
• pp.227-233
• /
• 2015

The recent health care is growing rapidly want to receive offers users a variety of medical services, can be exploited easily exposed to a third party information on the role of the patient's hospital staff (doctors, nurses, pharmacists, etc.) depending on the patient clearly may have to be classified. In this paper, in order to ensure safe use by third parties in the health care environment, classify the attributes of patient information and patient privacy protection technique using hierarchical multi-property rights proposed to classify information according to the role of patient hospital officials The. Hospital patients and to prevent the proposed method is represented by a mathematical model, the information (the data consumer, time, sensor, an object, duty, and the delegation circumstances, and so on) the privacy attribute of a patient from being exploited illegally patient information from a third party the prevention of the leakage of the privacy information of the patient in synchronization with the attribute information between the parties.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.5
• /
• pp.213-217
• /
• 2001

Excessive memory buffer requirement in continuous media playback is a serious impediment of wide spread usage of on-line multimedia service. Skewed access frequency of available video files provides an opportunity of re-using the date blocks which has been loaded by one session for later usage. We present novel algorithm which minimizes the buffer requirement in multiple sessions of multimedia playbacks. In continuous media playback originated from the disk, a certain amount of memory buffer is required to synchronize asynchronous disk. Read operation and synchronous playback operation. As aggregate playback bandwodth increases, larger amount of buffer needs to be allocated for this synchronization purpose. The focus of this work is to study the asymptotic behavior of the synchronization buffer requirement and to develop an algorithm coping with this excessive buffer requirement under bandwidth congestioon. We argue that in a large scale continuous media server, it may not be necessary to read the blocks for each session directly from the disk. The beauty of our work lies in the fact that it dynamically adapts to disk utilization of the server and finds the optimal way of servicinh the individual sessions while minimizing the overall buffer space requirement. Optimality of the proposed algorithm is shown by proof. The effectiveness and performance of the proposed scheme is examined via simulation.