• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.469-476
• /
• 2008

In this paper we analyze the packet interference probability and the aggregated throughput of a WPAN in which a number of Bluetooth piconets share the ISM band with WLANS. Using an Adaptive Frequency Hopping algorithm, when the AFH is employed, the number of hops available to the Bluetooth piconets varies depending on the number of independent WLANs within the piconet's radio range. Using a packet collision model in a piconet cluster, we give an analysis of the packet interference probability and the aggregated throughput as a function of the available hops for the AFH algorithm. We also present an analytical model of packet interference with multi-path fading channel in a cluster of piconets. Through analysis, we obtain the packet collision probability and aggregated throughput assuming capture effect. Numerical examples are given to demonstrate the effect of various Parameters such as capture ratio, Rice factor and cluster size on the system performance.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.696-705
• /
• 2002

This paper presents a new copy network for multicast ATM switches. Many studies have been carried out up to date since the proposition of Lee's copy network. However, the overflows and cell conflicts within the switch have still been raised a problem in argument. In order to reduce those problems, we proposed a 3-dimensional multicast switching architecture which has shared buffers in this paper. The proposed architecture can reduce the overflows and cell conflicts through multiple paths and output ports even in the high load environments. Also, we proposed a cell splitting algorithm which handles the cell in the case of large fan-out, and a copy network to increase throughput by expanding the Lee's Broadcast Banyan Network(BBN). Cell copy uses the Boolean interval splitting algorithm and the multicast pattern of the cells according to the self-routing characteristics of the network. In the proposed copy network, we improve the problems such as overflow, cell splitting of large fanout, cell conflicts, etc., which were still existed in the Lee's network. The results of performance evaluation by computer simulation show that the proposed scheme has better throughput, cell loss rate and cell delay than the conventional method.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.23-33
• /
• 2016

The current smart lighting is shaped to offer the lighting environment suitable for current context, after identifying user's action and location through a sensor. The sensor-based context awareness technology just considers a single user, and the studies to interpret many users' various context occurrences and conflicts lack. In existing studies, a fuzzy theory and algorithm including ReBa have been used as the methodology to solve context conflict. The fuzzy theory and algorithm including ReBa just avoid an opportunity of context conflict that may occur by providing services by each area, after the spaces where users are located are classified into many areas. Therefore, they actually cannot be regarded as customized service type that can offer personal preference-based context conflict. This paper proposes a priority-based LED lighting control system interpreting multiple context conflicts, which decides services, based on the granted priority according to context type, when service conflict is faced with, due to simultaneous occurrence of various contexts to many users. This study classifies the residential environment into such five areas as living room, 'bed room, study room, kitchen and bath room, and the contexts that may occur within each area are defined as 20 contexts such as exercising, doing makeup, reading, dining and entering, targeting several users. The proposed system defines various contexts of users using an ontology-based model and gives service of user oriented lighting environment through rule based on standard and context reasoning engine. To solve the issue of various context conflicts among users in the same space and at the same time point, the context in which user concentration is required is set in the highest priority. Also, visual comfort is offered as the best alternative priority in the case of the same priority. In this manner, they are utilized as the criteria for service selection upon conflict occurrence.

• Journal of Broadcast Engineering
• /
• v.21 no.1
• /
• pp.113-116
• /
• 2016

Cognitive radio network technology is that secondary (unlicensed) users use the spectrum of primary (licensed) users without interfering primary communication. In this paper, we propose multiple access scheme for a cognitive radio network, where multiple secondary users access spectrum of one primary user. We consider two types of multiple access scheme, one is p-persistent and one is non-persistent, and apply these two schemes in the secondary network. For each multiple access scheme, total throughput of secondary network is derived and verified by Monte Carlo simulation. Simulation results show that maximum total throughput of the secondary network is achieved when channel access probability or the number of maximum waiting frames is chosen appropriately.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.2
• /
• pp.68-77
• /
• 2003

The Least-Laxity First(or LLF) scheduling algorithm assigns the highest priority to a task with the least laxity, and has been proved to be optimal for a uni-processor and sub-optimal for a multi-processor. However, this algorithm Is Impractical to implement because laxity tie results in the frequent context switches among tasks. In this paper, a Modified Least-Laxity First on Multiprocessor(or MLLF/MP) scheduling algorithm is proposed to solve this problem, i.e., laxity tie results in the excessive scheduling overheads. The MLLF/MP is based on the LLF, but allows the laxity inversion. MLLF/MP continues executing the current running task as far as other tasks do not miss their deadlines. Consequently, it avoids the frequent context switches. We prove that the MLLF/MP is also sub-optimal in multiprocessor systems. By simulation results, we show that the MLLF/MP has less scheduling overheads than LLF.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.111-117
• /
• 2011

In this paper, we propose an QoS aware multi-layer MAC(QAML-MAC) protocol in a wireless sensor networks. Since the proposed protocol is based on the sleep-awake architecture, which save node's energy to prolong the entire network lifetime. For this purpose the QAML-MAC first classifies incoming data according to their transmission urgency and then saves them. The protocol also adapts the cross-layer concept to re-arrange the order of transmission with the same destination. So the delay can be decreased, which can not be obtained with the previous related protocols. And high priority data such as real-time multimedia or critical value in the field monitoring applications can be transmitted quickly, Furthermore the proposed protocol has advantage of decreasing transmitted data collisions using multiple layers of idle listening when there is no high-priority data. So energy consumptions of sensor nodes can be saved and the network lifetime can be prolonged.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.2
• /
• pp.99-113
• /
• 1992

In general, TDMA and FDMA have been used for multiple access communication methods. Recently. However, ALOHA and CSMA protocols came to exist as new schemes for VSAT data networks and LANs, respectively. These schemes are proven to be effective for packet switched communication systems that has bursty traffic but packet collisions. In this paper we analyze capture statistics arising from fading channels in packet radio communication systems in the context of ALOHA protocol. We derive general results of the exact form of capture probabilities and present numerical data for wide range of fading parameters. Since the capture probabilities are found to approach zero when the number of transmitted signals become larger, we are able to determine the achievable channel throughput by a least squares fitting of an exponential-type function to the probabilities.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.741-747
• /
• 2012

In this paper, we propose a fast and robust framework for detecting and tracking multiple targets. The proposed system includes two modules: object detection module and object tracking module. In the detection module, we preprocess the input images frame by frame, such as gray and binarization. Next after extracting the foreground object from the input images, morphology technology is used to reduce noises in foreground images. We also use a block-based histogram analysis method to distinguish human and other objects. In the tracking module, color-based tracking algorithm and Kalman filter are used. After converting the RGB images into HSV images, the color-based tracking algorithm to track the multiple targets is used. Also, Kalman filter is proposed to track the object and to judge the occlusion of different objects. Finally, we show the effectiveness and the applicability of the proposed method through experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1444-1451
• /
• 2009

This paper first proposes diverse C determining models in the Q algorithm which is proposed in the EPCglobal C1 Gen 2 standard and then compares and analyzes its performance. EPCglobal C1 Gen 2 standard proposes the slot-count (Q) selection algorithm for multiple tag identification environment, but there is no such definition for the C value which modifies the Q value depending on collision or no reply. During the tag anti-collision process, the Q algorithm adds C to the Q when there is a collision and reduces the Q by C when there is no reply. The modified Q value updates new slot-counts for tags which determines the tag identification speed, so the C value is an important factor. However, many researches only intend to increase the tag identification speed by proposing a new method or modifying the Q algorithm without any research about the C value. This paper suggests diverse C models which satisfies the EPCglobal C1 Gen 2 and analyzes their performance in the multi tag identification environment. The result of this paper can be used as an index for future researches on EPCglobal C1 Gen 2 C models and multiple tag identification performance.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.2
• /
• pp.53-65
• /
• 2008

This paper proposes the qualitative method for planning the operation of multi-AUVs with environmental disturbances, which is considered to be a very difficult task. In this paper we use an extension collision map as a collision free motion planner. The tool was originally developed for the multiple ground vehicles with no internal/external disturbance. In order to apply the method to a water environment where there are tides and waves, and currents, we analyze the path deviation error of AUVs caused by external disturbances. And we calculate safety margin for the collision avoidance on the extension collision map. Finally, the simulation result proves that the suggested method in this paper make multi-AUVs navigate to the goal point effectively with no collision among them.